8 citations · 17 across the 12 of their papers we have counts for
12 papers
The Entropic Sum-Product Phenomenon
Rupert Li
Let be independent and identically distributed discrete real-valued random variables of finite Shannon entropy, and write for the Shannon entropy of . We prove tha…
Diameter Bounds for Friends-and-Strangers Graphs
Amogh Akella, Rupert Li
Consider two -vertex graphs and , where we interpret as a social network with edges representing friendships and as a movement graph with edges representing adjac…
Entropic additive energy and entropy inequalities for sums and products
Rupert Li, Lampros Gavalakis, Ioannis Kontoyiannis
Following a growing number of studies that, over the past 15 years, have established entropy inequalities via ideas and tools from additive combinatorics, in this work we obtain a…
Vertex Connectivity of Friends-and-strangers Graphs
Neil Krishnan, Rupert Li
Friends-and-strangers graphs, coined by Defant and Kravitz, are denoted by where and are both graphs on vertices. The graph represents positions…
Tilings of Benzels via the Abacus Bijection
Colin Defant, Rupert Li, James Propp +1
Propp recently introduced regions in the hexagonal grid called benzels and stated several enumerative conjectures about the tilings of benzels using two types of prototiles called…
Dual Linear Programming Bounds for Sphere Packing via Discrete Reductions
Rupert Li
The Cohn-Elkies linear program for sphere packing, which was used to solve the 8 and 24 dimensional cases, is conjectured to not be sharp in any other dimension . By mapping f…
Unique Optima of the Delsarte Linear Program
Rupert Li
The Delsarte linear program is used to bound the size of codes given their block length and minimal distance by taking a linear relaxation from codes to quasicodes. We stud…
Length-Four Pattern Avoidance in Inversion Sequences
Letong Hong, Rupert Li
Inversion sequences of length are integer sequences with for all , which are in bijection with the permutations of length . In this paper,…
Vincular Pattern Avoidance on Cyclic Permutations
Rupert Li
Pattern avoidance for permutations has been extensively studied, and has been generalized to vincular patterns, where certain elements can be required to be adjacent. In addition,…
The Spum and Sum-diameter of Graphs: Labelings of Sum Graphs
Rupert Li
A sum graph is a finite simple graph whose vertex set is labeled with distinct positive integers such that two vertices are adjacent if and only if the sum of their labels is itsel…
A Greedy Chip-firing Game
Rupert Li, James Propp
We introduce a deterministic analogue of Markov chains that we call the hunger game. Like rotor-routing, the hunger game deterministically mimics the behavior of both recurrent Mar…
Compatible Recurrent Identities of the Sandpile Group and Maximal Stable Configurations
Yibo Gao, Rupert Li
In the abelian sandpile model, recurrent chip configurations are of interest as they are a natural choice of coset representatives under the quotient of the reduced Laplacian. We i…