A. Ottolini

activity

20162026

most citedOn point interactions realised as Ter-Martirosyan-Skornyakov Hamiltonians

29 citations · 56 across the 16 of their papers we have counts for

collaborators

16 papers

math.PR2026

Optimal support and condensation in random allocations

Andrea Ottolini

How many distinct symbols should a password use? If its length is fixed at $n$ and an observer learns only which symbols appear, the number of compatible passwords is maximized asy…

math.CO2026

Pal's permanent conjecture: proof for block uniform matrices

Andrea Ottolini, Shannon Starr

Consider a symmetric function $C (x, y)$ on $[0, 1] \times [0, 1]$ which is twice continuously differentiable up to the boundary, and which satisfies $ \mathcal{C}(x,y)=\mathca…

math.CO2023

On the image of graph distance matrices

William Dudarov, Noah Feinberg, Raymond Guo +5

Let $G = (V, E)$ be a finite, simple, connected, combinatorial graph on $n$ vertices and let $D \in R^{n \times n}$ be its graph distance matrix $D_{ij} = d (v_{i}, v_{j})$ . Stein…

math.CA2023★ 2 cited

Greedy Matching in Optimal Transport with concave cost

Andrea Ottolini, Stefan Steinerberger

We consider the optimal transport problem between a set of $n$ red points and a set of $n$ blue points subject to a concave cost function such as $c (x, y) = ∥ x - y ∥^{p}$ for $0< p <…

math.PR2023

Concentration of Hitting Times in Erdös-Rényi graphs

Andrea Ottolini, Stefan Steinerberger

We consider Erdős-Rényi graphs $G (n, p)$ for $0 < p < 1$ fixed and $n \to \infty$ and study the expected number of steps, $H_{w v}$ , that a random walk started in $w$ needs t…

math.PR2023★ 2 cited

Central limit theorem in complete feedback games

Andrea Ottolini, Raghavendra Tripathi

Consider a well-shuffled deck of cards of $n$ different types where each type occurs $m$ times. In a complete feedback game, a player is asked to guess the top card from the deck.…