arXiv subjects

Dmitrii Pavlov

Publications and source records attributed to Dmitrii Pavlov.

16 recordsLinked to original sources

arXiv2026

Log Canonical Models and Positive Geometries

Constructing log canonical compactifications of open varieties is a central problem in birational geometry. Finding a natural coordinate system and obtaining the equations of these models is difficult in general. We show that for a large class of varieties explicit coordinates for the log canonical model are provided by canonical forms of positive geometries, and use this to compute the equations of these models. Our theory applies, for instance, to complements of hyperplane arrangements, cubic surfaces with lines removed, and the moduli space of marked cubic del Pezzo surfaces.

math.AG↗

arXiv2026

Constraining Conformal Correlators

We study the space of conformally covariant $n$-point functions of spinning operators using methods from invariant theory, commutative algebra, and combinatorics. We show that the rational part of any such function can be expressed in terms of the basic building blocks introduced by Costa, Penedones, Poland, Rychkov, thereby providing a rigorous proof of a result that is widely used in the physics literature. We reformulate the problem of enumeration of $n$-point structures in terms of counting lattice points in fractional matching polytopes, and compute these counts using vector partition functions, Hilbert functions, and Kostka numbers. We show that all algebraic relations between the building blocks follow from Gram constraints and compute the number of algebraically independent building blocks. For three-point functions, we derive closed counting formulas for arbitrary integer spins, both with and without Bose symmetry, and discuss a necessary and sufficient condition for the partial conservation operator to lift to a differential operator written in terms of the building blocks. We provide code that generates a basis of three-point structures satisfying these constraints for given values of spins and scaling dimensions.

math.CO↗

arXiv2026

Positive Genus Pairs from Amplituhedra

A main conjecture in the field of Positive Geometry states that amplituhedra, which are certain semi-algebraic sets in the Grassmannian, are positive geometries. It is motivated by examples showing that the canonical forms of certain amplituhedra compute scattering amplitudes in particle physics. Beyond a small number of special cases, this conjecture is still open. In recent work, Brown and Dupont introduced a new framework, based on mixed Hodge theory, connecting canonical forms and de Rham cohomology via genus zero pairs. We give short proofs that the amplituhedron gives rise to a genus zero pair in the cases when it is known to be a positive geometry. However, in the general case we show that amplituhedra inside the Grassmannian give rise to pairs of strictly positive genus. We provide an explicit example of a genus one pair arising from a positive geometry in projective space, showing that having genus zero is not a necessary condition to be a positive geometry. Finally, we show that this positive geometry still gives rise to a genus zero pair in a different ambient variety.

math.AG↗

arXiv2025

Parke-Taylor varieties

Parke-Taylor functions are certain rational functions on the Grassmannian of lines encoding MHV amplitudes in particle physics. For $n$ particles there are $n!$ Parke-Taylor functions, corresponding to all orderings of the particles. Linear relations between these functions have been extensively studied in the last years. We here describe all non-linear polynomial relations between these functions in a simple combinatorial way and study the variety parametrized by them, called the Parke-Taylor variety. We show that the Parke-Taylor variety is linearly isomorphic to the log canonical embedding of the moduli space $\overline{\mathcal{M}}_{0,n}$ due to Keel and Tevelev, and that the intersection with the algebraic torus recovers the open part, $\mathcal{M}_{0,n}$. We give an explicit description of this isomorphism. Unlike the log canonical embedding, this Parke-Taylor embedding respects the symmetry of the $n$ marked points and is constructed in a single-step procedure, avoiding the intermediate embedding into a product of projective spaces.

math.AG↗

arXiv2025

Adjoints of Polytopes: Determinantal Representations and Smoothness

In this article we study determinantal representations of adjoint hypersurfaces of polytopes. We prove that adjoint polynomials of all polygons can be represented as determinants of tridiagonal symmetric matrices of linear forms with the matrix size being equal to the degree of the adjoint. We prove a sufficient combinatorial condition for a surface in the projective three-space to have a determinantal representation and use it to show that adjoints of all three-dimensional polytopes with at most eight facets and a simple facet hyperplane arrangement admit a determinantal representation. This includes all such polytopes with a smooth adjoint. We demonstrate that, starting from four dimensions, adjoint hypersurfaces may not admit linear determinantal representations. Along the way we prove that, starting from three dimensions, adjoint hypersurfaces are typically singular, in contrast to the two-dimensional case. We also consider a special case of interest to physics, the ABHY associahedron. We construct a determinantal representation of its universal adjoint in three dimensions and show that in higher dimensions a similarly structured representation does not exist.

math.AG↗

arXiv2025

Positive Polytopes with Few Facets in the Grassmannian

In this article we study adjoint hypersurfaces of geometric objects obtained by intersecting simple polytopes with few facets in $\mathbb{P}^5$ with the Grassmannian $\mathrm{Gr}(2,4)$. These generalize the positive Grassmannian, which is the intersection of $\mathrm{Gr}(2,4)$ with the simplex. We show that if the resulting object has five facets, it is a positive geometry and the adjoint hypersurface is unique. For the case of six facets we show that the adjoint hypersurface is not necessarily unique and give an upper bound on the dimension of the family of adjoints. We illustrate our results with a range of examples. In particular, we show that even if the adjoint is not unique, a positive hexahedron can still be a positive geometry.

math.AG↗

arXiv2024

From Feynman diagrams to the amplituhedron: a gentle review

In this article we review, for a mathematical audience, the computation of (tree-level) scattering amplitudes in Yang-Mills theory in detail, in order to bridge the gap in understanding of the subject between mathematicians and physicists. In particular we demonstrate explicitly how the same formulas for six-particle NMHV helicity amplitudes are obtained from summing Feynman diagrams and from computing the canonical form of the $n=6, k=1, m=4$ amplituhedron.

hep-th↗

arXiv2024

Hyperplane Arrangements in the Grassmannian

The Euler characteristic of a very affine variety encodes the algebraic complexity of solving likelihood (or scattering) equations on this variety. We study this quantity for the Grassmannian with $d$ hyperplane sections removed. We provide a combinatorial formula, and explain how to compute this Euler characteristic in practice, both symbolically and numerically. Our particular focus is on generic hyperplane sections and on Schubert divisors. We also consider special Schubert arrangements relevant for physics. We study both the complex and the real case.

math.AG↗

arXiv2024

Santal\'o Geometry of Convex Polytopes

The Santal\'o point of a convex polytope is the interior point which leads to a polar dual of minimal volume. This minimization problem is relevant in interior point methods for convex optimization, where the logarithm of the dual volume is known as the universal barrier function. When translating the facet hyperplanes, the Santal\'o point traces out a semi-algebraic set. We describe and compute this geometry using algebraic and numerical techniques. We exploit connections with statistics, optimization and physics.

math.AG↗

arXiv2023

Algebraic Geometry of Quantum Graphical Models

Algebro-geometric methods have proven to be very successful in the study of graphical models in statistics. In this paper we introduce the foundations to carry out a similar study of their quantum counterparts. These quantum graphical models are families of quantum states satisfying certain locality or correlation conditions encoded by a graph. We lay out several ways to associate an algebraic variety to a quantum graphical model. The classical graphical models can be recovered from most of these varieties by restricting to quantum states represented by diagonal matrices. We study fundamental properties of these varieties and provide algorithms to compute their defining equations. Moreover, we study quantum information projections to quantum exponential families defined by graphs and prove a quantum analogue of Birch's Theorem.

math.AG↗

arXiv2023

Combinatorics of $m=1$ Grasstopes

A Grasstope is the image of the totally nonnegative Grassmannian $\text{Gr}_{\geq 0}(k,n)$ under a linear map $\text{Gr}(k,n)\dashrightarrow \text{Gr}(k,k+m)$. This is a generalization of the amplituhedron, a geometric object of great importance to calculating scattering amplitudes in physics. The amplituhedron is a Grasstope arising from a totally positive linear map. While amplituhedra are relatively well-studied, much less is known about general Grasstopes. We study Grasstopes in the $m=1$ case and show that they can be characterized as unions of cells of a hyperplane arrangement satisfying a certain sign variation condition, extending work of Karp and Williams. Inspired by this characterization, we also suggest a notion of a Grasstope arising from an arbitrary oriented matroid.

math.CO↗

arXiv2023

On real and observable rational realizations of input-output equations

Given a single (differential-algebraic) input-output equation, we present a method for finding different representations of the associated system in the form of rational realizations; these are dynamical systems with rational right-hand sides. It has been shown that in the case where the input-output equation is of order one, rational realizations can be computed, if they exist. In this work, we focus first on the existence and actual computation of the so-called observable rational realizations, and secondly on rational realizations with real coefficients. The study of observable realizations allows to find every rational realization of a given first order input-output equation, and the necessary field extensions in this process. We show that for first order input-output equations the existence of a rational realization is equivalent to the existence of an observable rational realization. Moreover, we give a criterion to decide the existence of real rational realizations. The computation of observable and real realizations of first order input-output equations is fully algorithmic. We also present partial results for the case of higher order input-output equations.

cs.SC↗

arXiv2023

Logarithmically Sparse Symmetric Matrices

A positive definite matrix is called logarithmically sparse if its matrix logarithm has many zero entries. Such matrices play a significant role in high-dimensional statistics and semidefinite optimization. In this paper, logarithmically sparse matrices are studied from the point of view of computational algebraic geometry: we present a formula for the dimension of the Zariski closure of a set of matrices with a given logarithmic sparsity pattern, give a degree bound for this variety and develop implicitization algorithms that allow to find its defining equations. We illustrate our approach with numerous examples.

math.AG↗

arXiv2022

Gibbs Manifolds

Gibbs manifolds are images of affine spaces of symmetric matrices under the exponential map. They arise in applications such as optimization, statistics and quantum~physics, where they extend the ubiquitous role of toric geometry. The Gibbs variety is the zero locus of all polynomials that vanish on the Gibbs manifold. We compute these polynomials and show that the Gibbs variety is low-dimensional. Our theory is applied to a wide range of scenarios, including matrix pencils and quantum optimal transport.

math.OC↗

arXiv2022

On realizing differential-algebraic equations by rational dynamical systems

Real-world phenomena can often be conveniently described by dynamical systems (that is, ODE systems in the state-space form). However, if one observes the state of the system only partially, the observed quantities (outputs) and the inputs of the system can typically be related by more complicated differential-algebraic equations (DAEs). Therefore, a natural question (referred to as the realizability problem) is: given a differential-algebraic equation (say, fitted from data), does it come from a partially observed dynamical system? A special case in which the functions involved in the dynamical system are rational is of particular interest. For a single differential-algebraic equation in a single output variable, Forsman has shown that it is realizable by a rational dynamical system if and only if the corresponding hypersurface is unirational, and he turned this into an algorithm in the first-order case. In this paper, we study a more general case of single-input-single-output equations. We show that if a realization by a rational dynamical system exists, the system can be taken to have the dimension equal to the order of the DAE. We provide a complete algorithm for first-order DAEs. We also show that the same approach can be used for higher-order DAEs using several examples from the literature.

cs.SC↗

arXiv2021

From algebra to analysis: new proofs of theorems by Ritt and Seidenberg

Ritt's theorem of zeroes and Seidenberg's embedding theorem are classical results in differential algebra allowing to connect algebraic and model-theoretic results on nonlinear PDEs to the realm of analysis. However, the existing proofs of these results use sophisticated tools from constructive algebra (characteristic set theory) and analysis (Riquier's existence theorem). In this paper, we give new short proofs for both theorems relying only on basic facts from differential algebra and the classical Cauchy-Kovalevskaya theorem for PDEs.

math.AC↗