Marius Tiba

activity

20102024

most citedAn algorithm to prescribe the configuration of a finite graph

2 citations · 2 across the 5 of their papers we have counts for

collaborators

5 papers

math.CO2024

Intersections of iterated shadows

Hou Tin Chau, David Ellis, Marius Tiba

We show that if $A \subset (n /2 [ n ])$ with measure bounded away from zero and from one, then the $Ω (n)$ -iterated upper shadows of $A$ and $\mathc…

math.AP2024

Sharp stability of the Brunn-Minkowski inequality via optimal mass transportation

Alessio Figalli, Peter van Hintum, Marius Tiba

The Brunn-Minkowski inequality, applicable to bounded measurable sets $A$ and $B$ in $R^{d}$ , states that $∣ A + B ∣^{1/ d} \geq ∣ A ∣^{1/ d} + ∣ B ∣^{1/ d}$ . Equality is achieved if and…

math.AP2023

Sharp quantitative stability of the Brunn-Minkowski inequality

Alessio Figalli, Peter van Hintum, Marius Tiba

The Brunn-Minkowski inequality states that for bounded measurable sets $A$ and $B$ in $R^{n}$ , we have $∣ A + B ∣^{1/ n} \geq ∣ A ∣^{1/ n} + ∣ B ∣^{1/ n}$ . Also, equality holds if and on…

math.FA2023

Random Translates in Minkowski Sums

Paul Balister, Bela Bollobas, Imre Leader +1

Suppose that $A$ and $B$ are sets in $R^{d}$ , and we form the sumset of $A$ with $n$ random points of $B$ . Given the volumes of $A$ and $B$ , how should we choose them to min…

math.CO2010★ 2 cited

An algorithm to prescribe the configuration of a finite graph

Paul Baird, Marius Tiba

We provide algorithms involving edge slides, for a connected simple graph to evolve in a finite number of steps to another connected simple graph in a prescribed configuration, and…