Searcharxiv⌕ Search

arXiv subjects

Federico Castillo

Publications and source records attributed to Federico Castillo.

36 records · Page 2Linked to original sources

Common tangents to convex bodies

It is well-known since the time of the Greeks that two disjoint circles in the plane have four common tangent lines. Cappell et al. proved a generalization of this fact for properly separated strictly convex bodies in higher dimensions. We have shown that the same generalization applies for arbitrary convex bodies. When the number of convex sets involved is equal to the dimension, we obtain an alternative combinatorial proof of Bisztriczky's theorem on the number of common tangents to $d$ separated convex bodies in $\Rr^d$.

math.MG↗

Foundation of one-particle reduced density matrix functional theory for excited states

In [Phys. Rev. Lett. 127, 023001 (2021)] a reduced density matrix functional theory (RDMFT) has been proposed for calculating energies of selected eigenstates of interacting many-fermion systems. Here, we develop a solid foundation for this so-called $\boldsymbol{w}$-RDMFT and present the details of various derivations. First, we explain how a generalization of the Ritz variational principle to ensemble states with fixed weights $\boldsymbol{w}$ in combination with the constrained search would lead to a universal functional of the one-particle reduced density matrix. To turn this into a viable functional theory, however, we also need to implement an exact convex relaxation. This general procedure includes Valone's pioneering work on ground state RDMFT as the special case $\boldsymbol{w}=(1,0,\ldots)$. Then, we work out in a comprehensive manner a methodology for deriving a compact description of the functional's domain. This leads to a hierarchy of generalized exclusion principle constraints which we illustrate in great detail. By anticipating their future pivotal role in functional theories and to keep our work self-contained, several required concepts from convex analysis are introduced and discussed.

quant-ph↗

Minkowski summands of cubes

In pioneering works of Meyer and of McMullen in the early 1970s, the set of Minkowski summands of a polytope was shown to be a polyhedral cone called the type cone. Explicit computations of type cones are in general intractable. Nevertheless, we show that the type cone of the product of simplices is the cone over a simplex. This remarkably simple result derives from insights about rainbow point configurations and the work of McMullen.

math.CO↗

Social-ecological feedbacks drive tipping points in farming system diversification

The emergence and impact of tipping points have garnered significant interest in both the social and natural sciences. Despite widespread recognition of the importance of feedbacks between human and natural systems, it is often assumed that the observed nonlinear dynamics in these coupled systems rests within either underlying human or natural processes, rather than the rates at which they interact. Using adoption of agricultural diversification practices as a case study, we show how two stable management paradigms (one dominated by conventional, homogeneous practices, the other by diversified practices) can emerge purely from temporal feedbacks between human decisions and ecological responses. We explore how this temporal mechanism of tipping points provides insight into designing more effective interventions that promote farmers transitions towards sustainable agriculture. Moreover, our flexible modeling framework could be applied to other cases to provide insight into numerous questions in social-ecological systems research and environmental policy.

physics.soc-ph↗

A pithy look at the Polytope Algebra

This is a hands on introduction to McMullen's Polytope Algebra. More than interesting on its own, this algebra was McMullen's tool to give a combinatorial proof of the g-theorem.

math.CO↗

An effective solution to convex $1$-body $N$-representability

From a geometric point of view, Pauli's exclusion principle defines a hypersimplex. This convex polytope describes the compatibility of $1$-fermion and $N$-fermion density matrices, therefore it coincides with the convex hull of the pure $N$-representable $1$-fermion density matrices. Consequently, the description of ground state physics through $1$-fermion density matrices may not necessitate the intricate pure state generalized Pauli constraints. In this article, we study the generalization of the $1$-body $N$-representability problem to ensemble states with fixed spectrum $\mathbf{w}$, in order to describe finite-temperature states and distinctive mixtures of excited states. By employing ideas from convex analysis and combinatorics, we present a comprehensive solution to the corresponding convex relaxation, thus circumventing the complexity of generalized Pauli constraints. In particular, we adapt and further develop tools such as symmetric polytopes, sweep polytopes, and Gale order. For both fermions and bosons, generalized exclusion principles are discovered, which we determine for any number of particles and dimension of the $1$-particle Hilbert space. These exclusion principles are expressed as linear inequalities satisfying hierarchies determined by the non-zero entries of $\mathbf{w}$. The two families of polytopes resulting from these inequalities are part of the new class of so-called lineup polytopes.

quant-ph↗

Finiteness theorems for matroid complexes with prescribed topology

It is known that there are finitely many simplicial complexes (up to isomorphism) with a given number of vertices. Translating to the language of $h$-vectors, there are finitely many simplicial complexes of bounded dimension with $h_1=k$ for any natural number $k$. In this paper we study the question at the other end of the $h$-vector: Are there only finitely many $(d-1)$-dimensional simplicial complexes with $h_d=k$ for any given $k$? The answer is no if we consider general complexes, but when focus on three cases coming from matroids: (i) independence complexes, (ii) broken circuit complexes, and (iii) order complexes of geometric lattices. We prove the answer is yes in cases (i) and (iii) and conjecture it is also true in case (ii).

math.CO↗

When are multidegrees positive?

Let $k$ be an arbitrary field, $P = P_k^{m_1} \times_k \cdots \times_k P_k^{m_p}$ be a multiprojective space over $k$, and $X \subseteq P$ be a closed subscheme of $P$. We provide necessary and sufficient conditions for the positivity of the multidegrees of $X$. As a consequence of our methods, we show that when $X$ is irreducible, the support of multidegrees forms a discrete algebraic polymatroid. In algebraic terms, we characterize the positivity of the mixed multiplicities of a standard multigraded algebra over an Artinian local ring, and we apply this to the positivity of mixed multiplicities of ideals. Furthermore, we use our results to recover several results in the literature in the context of combinatorial algebraic geometry.

math.AG↗

On the Todd Class of the Permutohedral variety

In the special case of braid fans, we give a combinatorial formula for the Berline-Vergne's construction for an Euler-Maclaurin type formula that computes number of lattice points in polytopes. Our formula is obtained by computing a symmetric expression for the Todd class of the permutohedral variety. By showing that this formula does not always have positive values, we prove that the Todd class of the permutohedral variety $X_d$ is not effective for $d\geq 24$. Additionally, we prove that the linear coefficient in the Ehrhart polynomial of any lattice generalized permutohedron is positive.

math.CO↗

Representable Chow classes of a product of projective spaces

Inside a product of projective spaces, we try to understand which Chow classes come from irreducible subvarieties. The answer is closely related to the theory of integer polymatroids. The support of a representable class can be (partially) characterized as some integer point inside a particular polymatroid. If the class is multiplicity-free, we obtain a complete characterization in terms of representable polymatroids. We also generalize some of the results to the case of products of Grassmannians.

math.AG↗

Deformation Cones of nested Braid fans

Generalized permutohedra are deformations of regular permutohedra, and arise in many different fields of mathematics. One important characterization of generalized permutohedra is the Submodular Theorem, which is related to the deformation cone of the Braid fan. We lay out general techniques for determining deformation cones of a fixed polytope and apply it to the Braid fan to obtain a natural combinatorial proof for the Submodular Theorem. We also consider a refinement of the Braid fan, called the nested Braid fan, and construct usual (respectively, generalized) nested permutohedra which have the nested Braid fan as (respectively, refining) their normal fan. We extend many results on generalized permutohedra to this new family of polytopes, including a one-to-one correspondence between faces of nested permutohedra and chains in ordered partition posets, and a theorem analogous to the Submodular Theorem. Finally, we show that the nested Braid fan is the barycentric subdivision of the Braid fan, which gives another way to construct this new combinatorial object.

math.CO↗

Hopf monoids of ordered simplicial complexes

We study ordered matroids and generalized permutohedra from a Hopf theoretic point of view. Our main object is a Hopf monoid in the vector species of extended generalized permutahedra equipped with an order of the coordinates; this monoid extends the Hopf monoid of generalized permutahedra studied by Aguiar and Ardila. Our formula for the antipode is cancellation-free and multiplicity-free, and is supported only on terms that are compatible with the local geometry of the polyhedron. Our result is part of a larger program to understand orderings on ground sets of simplicial complexes (for instance, on shifted and matroid independence complexes). In this vein, we show that shifted simplicial complexes and broken circuit complexes generate Hopf monoids that are expected to exhibit similar behavior.

math.CO↗

Coxeter submodular functions and deformations of Coxeter permutahedra

We describe the cone of deformations of a Coxeter permutahedron, or equivalently, the nef cone of the toric variety associated to a Coxeter complex. This family of polytopes contains polyhedral models for the Coxeter-theoretic analogs of compositions, graphs, matroids, posets, and associahedra. Our description extends the known correspondence between generalized permutahedra, polymatroids, and submodular functions to any finite reflection group.

math.CO↗

Smooth polytopes with negative Ehrhart coefficients

We present examples of smooth lattice polytopes in dimensions 3 and higher where each coefficient of their Ehrhart polynomials that can potentially be negative is indeed negative. This answers a question by Bruns. We also discuss Berline-Vergne valuations as a useful tool in proving Ehrhart positivity results.

math.CO↗

Berline-Vergne valuation and generalized permutohedra

Generalizing a conjecture by De Loera et al., we conjecture that integral generalized permutohedra all have positive Ehrhart coefficients. Berline and Vergne construct a valuation that assigns values to faces of polytopes, which provides a way to write Ehrhart coefficients of a polytope as positive sums of these values. Based on available results, we pose a stronger conjecture: Berline-Vergne's valuation is always positive on permutohedra, which implies our first conjecture. This article proves that our strong conjecture on Berline-Vergne's valuation is true for dimension up to 6, and is true if we restrict to faces of codimension up to 3. In addition to investigating the positivity conjectures, we study the Berline-Vergne's valuation, and show that it is the unique construction for McMullen's formula used to describe number of lattice points in permutohedra under certain symmetry constraints. We also give an equivalent statement to the strong conjecture in terms of mixed valuations.

math.CO↗

A Nonparametric Method for Producing Isolines of Bivariate Exceedance Probabilities

We present a method for drawing isolines indicating regions of equal joint exceedance probability for bivariate data. The method relies on bivariate regular variation, a dependence framework widely used for extremes. This framework enables drawing isolines corresponding to very low exceedance probabilities and these lines may lie beyond the range of the data. The method we utilize for characterizing dependence in the tail is largely nonparametric. Furthermore, we extend this method to the case of asymptotic independence and propose a procedure which smooths the transition from asymptotic independence in the interior to the first-order behavior on the axes. We propose a diagnostic plot for assessing isoline estimate and choice of smoothing, and a bootstrap procedure to visually assess uncertainty.

stat.ME↗

The topology of the external activity complex of a matroid

We prove that the external activity complex $\textrm{Act}_<(M)$ of a matroid is shellable. In fact, we show that every linear extension of LasVergnas's external/internal order $<_{ext/int}$ on $M$ provides a shelling of $\textrm{Act}_<(M)$. We also show that every linear extension of LasVergnas's internal order $<_{int}$ on $M$ provides a shelling of the independence complex $IN(M)$. As a corollary, $\textrm{Act}_<(M)$ and $M$ have the same $h$-vector. We prove that, after removing its cone points, the external activity complex is contractible if $M$ contains $U_{3,1}$ as a minor, and a sphere otherwise.

math.CO↗

The arithmetic Tutte polynomials of the classical root systems

Many combinatorial and topological invariants of a hyperplane arrangement can be computed in terms of its Tutte polynomial. Similarly, many invariants of a hypertoric arrangement can be computed in terms of its arithmetic Tutte polynomial. We compute the arithmetic Tutte polynomials of the classical root systems of types A,B,C, and D, with respect to their integer, root, and weight lattices. We do it in two ways: by introducing a finite field method for arithmetic Tutte polynomials, and by enumerating signed graphs with respect to six parameters.

math.CO↗