Zobrazeno 1 - 10
of 68
pro vyhledávání: '"Ravichandran, Mohan"'
We give a method for computing asymptotic formulas and approximations for the volumes of spectrahedra, based on the maximum-entropy principle from statistical physics. The method gives an approximate volume formula based on a single convex optimizati
Externí odkaz:
http://arxiv.org/abs/2211.12541
We introduce a class of polytopes that we call chainlink polytopes and which allow us to construct infinite families of pairs of non isomorphic rational polytopes with the same Ehrhart quasi-polynomial. Our construction is based on circular fence pos
Externí odkaz:
http://arxiv.org/abs/2211.08382
We demonstrate a quasipolynomial-time deterministic approximation algorithm for the partition function of a Gibbs point process interacting via a finite-range stable potential. This result holds for all activities $\lambda$ for which the partition fu
Externí odkaz:
http://arxiv.org/abs/2209.10453
We prove a conjecture of Morier-Genoud and Ovsienko that says that rank polynomials of the distributive lattices of lower ideals of fence posets are unimodal. We do this by introducing a related class of circular fence posets and proving a stronger v
Externí odkaz:
http://arxiv.org/abs/2112.00518
Approximating the partition function of the ferromagnetic Ising model with general external fields is known to be #BIS-hard in the worst case, even for bounded-degree graphs, and it is widely believed that no polynomial-time approximation scheme exis
Externí odkaz:
http://arxiv.org/abs/2108.11889
We characterize all signed Minkowski sums that define generalized permutahedra, extending results of Ardila-Benedetti-Doker (2010). We use this characterization to give a complete classification of all positive, translation-invariant, symmetric Minko
Externí odkaz:
http://arxiv.org/abs/1909.08448
Publikováno v:
In Discrete Mathematics February 2023 346(2)
Anderson's paving conjecture, now known to hold due to the resolution of the Kadison-Singer problem asserts that every zero diagonal Hermitian matrix admits non-trivial pavings with dimension independent bounds. In this paper, we develop a technique
Externí odkaz:
http://arxiv.org/abs/1706.03737
Autor:
Ravichandran, Mohan
A polynomial $p \in \mathbb{R}[z_1, \cdots, z_n]$ is called real stable if it is non-vanishing whenever all the variables take values in the upper half plane. A well known result of Elliott Lieb and Alan Sokal states that if $p$ and $q$ are $n$ varia
Externí odkaz:
http://arxiv.org/abs/1704.06195
Publikováno v:
Annals of Combinatorics; Dec2024, Vol. 28 Issue 4, p1141-1166, 26p