arXiv subjects

Chiara Meroni

Publications and source records attributed to Chiara Meroni.

At least 19 recordsLinked to original sources

arXiv2026

From Ham-Sandwich to Centerpoints: Semialgebraic Algorithms for Cutting Polytopal Measures

We design exact algorithms for the ham-sandwich and centerpoint theorems for polytopal measures. Our key observation is that the cap-volume function of such a measure, i.e., the volume cut off by a halfspace, is piecewise rational on a natural decomposition of the space of oriented hyperplanes. This lets us recast prescribed-proportion cutting problems as semialgebraic feasibility problems. For fixed ambient dimension, this yields polynomial-time algorithms to decide the existence of cuts, describe the full solution set, and sample or enumerate solutions. We extend this framework to the center transversal theorem, showing that spaces of deep affine flats are semialgebraic, which holds for centerpoints. We further show that the set of centerpoints of a convex polytope coincides with its floating body at level $1/(d+1)$, a useful semialgebraic description.

cs.CG↗

arXiv2026

Critical moments of slices and slabs of the cube (and other polyhedral norms)

In this article, we present a unified algebraic-combinatorial framework for computing explicit, piecewise rational, and combinatorially indexed parametric formulas for volumes and higher moments of slices and slabs of polyhedral norm balls. Our main method builds on prior work concerning a combinatorial decomposition of the parameter space of all slices of a polytope. We extend this framework to slabs, and find a polynomial-time algorithm in fixed dimension. We also exhibit computational methods to obtain moments of arbitrary order for all slices or slabs of any polyhedral norm ball, and an algebraic framework for analyzing their critical points. In addition, we present an experimental study of the $d$-dimensional unit cube. Our analysis recovers and reinterprets the known volume formulas for slabs and slices of the two- and three-dimensional cubes, first obtained by K\"onig and Koldobsky. Moreover, our method identifies a new complete family of fourteen rational functions giving the volumes of slices and slabs of the four-dimensional cube. We further compute explicit higher moments of slices and slabs in dimensions two and three, and derive explicit formulas for moments of arbitrary order for slices of the two-dimensional cube, describing their critical points. For the four-dimensional cube, we further use these formulas to identify candidate global maxima and minima for slice and slab volumes; the candidates are verified to be critical points by exact symbolic computation and are checked numerically to give the global extrema.

math.CO↗

arXiv2026

Asymptotic number of edge-colored regular graphs

We prove a formula for the asymptotic number of edge-colored regular graphs with a prescribed set of allowed vertex-incidence structures. The formula depends on specific critical points of a polynomial encoding the vertex-incidences. As an application, we compute the expected number of proper $c$-edge-colorings of a large random $k$-regular graph.

math.CO↗

arXiv2025

Combinatorics of slices of cubes

We present a complete computational classification of the combinatorial types of hyperplane sections, or slices, of the regular cube up to dimension six. For each dimension, we determine the exact number of distinct combinatorial types. When restricted to slices through the origin, our computations extend to dimension seven. The classification combines combinatorial, algebraic, and numerical techniques, with all results certified. Beyond enumeration, we analyze the distribution of types by number of vertices, establish new theoretical results about the combinatorics of slices of cubes, and propose conjectures motivated by our computational findings.

math.CO↗

arXiv2025

IMProofBench: Benchmarking AI on Research-Level Mathematical Proof Generation

As the mathematical capabilities of large language models (LLMs) improve, it becomes increasingly important to evaluate their performance on research-level tasks at the frontier of mathematical knowledge. However, existing benchmarks are limited, as they focus solely on final-answer questions or high-school competition problems. To address this gap, we introduce IMProofBench, a private benchmark consisting of 77 peer-reviewed problems developed by expert mathematicians. Each problem requires a detailed proof and is paired with subproblems that have final answers, supporting both an evaluation by human experts and a large-scale quantitative analysis through automated grading. Furthermore, unlike prior benchmarks, the evaluation setup simulates a realistic research environment: models operate in an agentic framework with tools like web search for literature review and mathematical software such as SageMath. Our results show that current LLMs can already solve a significant percentage of research-level questions. IMProofBench will continue to evolve as a dynamic benchmark in collaboration with the mathematical community, ensuring its relevance for evaluating the next generation of LLMs.

cs.CL↗

arXiv2025

Semialgebraic rank-one convex hulls: 2x2 triangular matrices and beyond

We prove that the rank-one convex hull of finitely many $2\times 2$ triangular matrices is a semialgebraic set, defined by linear and quadratic polynomials. We present explicit constructions for five-point configurations and offer evidence suggesting that a similar characterization does not hold in the more general setting of directional convexity.

math.MG↗

arXiv2025

Approximation of starshaped sets using polynomials

We introduce polystar bodies: compact starshaped sets whose gauge or radial functions are expressible by polynomials, enabling tractable computations, such as that of intersection bodies. We prove that polystar bodies are uniformly dense in starshaped sets and obtain asymptotically optimal approximation guarantees. We develop tools for the construction of polystar approximations and illustrate them via several computational examples, including numerical estimations of largest volume slices and widths.

math.OC↗

arXiv2024

Bivariate exponential integrals and edge-bicolored graphs

We show that specific exponential bivariate integrals serve as generating functions of labeled edge-bicolored graphs. Based on this, we prove an asymptotic formula for the number of regular edge-bicolored graphs with arbitrary weights assigned to different vertex structures. The asymptotic behavior is governed by the critical points of a polynomial. As an application, we discuss the Ising model on a random 4-regular graph and show how its phase transitions arise from our formula.

math.CO↗

arXiv2024

Linear causal disentanglement via higher-order cumulants

Linear causal disentanglement is a recent method in causal representation learning to describe a collection of observed variables via latent variables with causal dependencies between them. It can be viewed as a generalization of both independent component analysis and linear structural equation models. We study the identifiability of linear causal disentanglement, assuming access to data under multiple contexts, each given by an intervention on a latent variable. We show that one perfect intervention on each latent variable is sufficient and in the worst case necessary to recover parameters under perfect interventions, generalizing previous work to allow more latent than observed variables. We give a constructive proof that computes parameters via a coupled tensor decomposition. For soft interventions, we find the equivalence class of latent graphs and parameters that are consistent with observed data, via the study of a system of polynomial equations. Our results hold assuming the existence of non-zero higher-order cumulants, which implies non-Gaussianity of variables.

stat.ML↗

arXiv2024

Maximizing Slice-Volumes of Semialgebraic Sets using Sum-of-Squares Programming

This paper presents an algorithm to maximize the volume of an affine slice through a given semialgebraic set. This slice-volume task is formulated as an infinite-dimensional linear program in continuous functions, inspired by prior work in volume computation of semialgebraic sets. A convergent sequence of upper-bounds to the maximal slice volume are computed using the moment-Sum-of-Squares hierarchy of semidefinite programs in increasing size. The computational complexity of this scheme can be reduced by utilizing topological structure (in dimensions 2, 3, 4, 8) and symmetry. This numerical convergence can be accelerated through the introduction of redundant Stokes-based constraints. Demonstrations of slice-volume calculation are performed on example sets.

math.OC↗

arXiv2024

The algebraic degree of the Wasserstein distance

Given two rational univariate polynomials, the Wasserstein distance of their associated measures is an algebraic number. We determine the algebraic degree of the squared Wasserstein distance, serving as a measure of algebraic complexity of the corresponding optimization problem. The computation relies on the structure of a subpolytope of the Birkhoff polytope, invariant under a transformation induced by complex conjugation.

math.AG↗

arXiv2024

Chebyshev Varieties

Chebyshev varieties are algebraic varieties parametrized by Chebyshev polynomials or their multivariate generalizations. We determine the dimension, degree, singular locus and defining equations of these varieties. We explain how they play the role of toric varieties in sparse polynomial root finding, when monomials are replaced by Chebyshev polynomials. We present numerical root finding algorithms that exploit our results.

math.AG↗

arXiv2023

The Best Ways to Slice a Polytope

We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of possible combinatorial types of sections and craft algorithms that compute optimal sections of the polytope according to various combinatorial and metric criteria, including sections that maximize the number of $k$-dimensional faces, maximize the volume, and maximize the integral of a polynomial. Our optimization algorithms run in polynomial time in fixed dimension, but the same problems show hardness otherwise. Our tools can be extended to intersection with halfspaces and projections onto hyperplanes. Finally, we present several experiments illustrating our theorems and algorithms on famous polytopes.

math.CO↗

arXiv2023

Intersection Bodies of Polytopes: Translations and Convexity

We continue the study of intersection bodies of polytopes, focusing on the behavior of $IP$ under translations of $P$. We introduce an affine hyperplane arrangement and show that the polynomials describing the boundary of $I(P+t)$ can be extended to polynomials in variables $t\in \mathbb{R}^d$ within each region of the arrangement. In dimension $2$, we give a full characterization of those polygons such that their intersection body is convex. We give a partial characterization for general dimensions.

math.MG↗

arXiv2023

Convex Hulls of Curves: Volumes and Signatures

Taking the convex hull of a curve is a natural construction in computational geometry. On the other hand, path signatures, central in stochastic analysis, capture geometric properties of curves, although their exact interpretation for levels larger than two is not well understood. In this paper, we study the use of path signatures to compute the volume of the convex hull of a curve. We present sufficient conditions for a curve so that the volume of its convex hull can be computed by such formulae. The canonical example is the classical moment curve, and our class of curves, which we call cyclic, includes other known classes such as $d$-order curves and curves with totally positive torsion. We also conjecture a necessary and sufficient condition on curves for the signature volume formula to hold. Finally, we give a concrete geometric interpretation of the volume formula in terms of lengths and signed areas.

math.MG↗

arXiv2022

Convex hulls of surfaces in fourspace

This is a case study of the algebraic boundary of convex hulls of varieties. We focus on surfaces in fourspace to showcase new geometric phenomena that neither curves nor hypersurfaces do. Our method is a detailed analysis of a general purpose formula by Ranestad and Sturmfels in the case of smooth real algebraic surfaces of low degree (that are rational over the complex numbers). We study both the complex and the real features of the algebraic boundary of Veronese, Del Pezzo and Bordiga surfaces.

math.AG↗

arXiv2022

On smooth functions with two critical values

We prove that every smooth closed manifold admits a smooth real-valued function with only two critical values. We call a function of this type a \emph{Reeb function}. We prove that for a Reeb function we can prescribe the set of minima (or maxima), as soon as this set is a PL subcomplex of the manifold. In analogy with Reeb's Sphere Theorem, we use such functions to study the topology of the underlying manifold. In dimension $3$, we give a characterization of manifolds having a Heegaard splitting of genus $g$ in terms of the existence of certain Reeb functions. Similar results are proved in dimension $n\geq 5$.

math.GT↗

arXiv2021

Quantum Correlations in the Minimal Scenario

In the minimal scenario of quantum correlations, two parties can choose from two observables with two possible outcomes each. Probabilities are specified by four marginals and four correlations. The resulting four-dimensional convex body of correlations, denoted $\mathcal{Q}$, is fundamental for quantum information theory. We review and systematize what is known about $\Qm$, and add many details, visualizations, and complete proofs. In particular, we provide a detailed description of the boundary, which consists of three-dimensional faces isomorphic to elliptopes and sextic algebraic manifolds of exposed extreme points. These patches are separated by cubic surfaces of non-exposed extreme points. We provide a trigonometric parametrization of all extreme points, along with their exposing Tsirelson inequalities and quantum models. All non-classical extreme points (exposed or not) are self-testing, i.e., realized by an essentially unique quantum model. Two principles, which are specific to the minimal scenario, allow a quick and complete overview: The first is the pushout transformation, i.e., the application of the sine function to each coordinate. This transforms the classical correlation polytope exactly into the correlation body $\mathcal{Q}$, also identifying the boundary structures. The second principle, self-duality, is an isomorphism between $\Qm$ and its polar dual, i.e., the set of affine inequalities satisfied by all quantum correlations (``Tsirelson inequalities''). The same isomorphism links the polytope of classical correlations contained in $\Qm$ to the polytope of no-signalling correlations, which contains $\Qm$. We also discuss the sets of correlations achieved with fixed Hilbert space dimension, fixed state or fixed observables, and establish a new non-linear inequality for $\Qm$ involving the determinant of the correlation matrix.

quant-ph↗