Related papers: Generators, extremals and bases of max cones
Let $G$ be a (compact) special group in the sense of Haglund and Wise. We show that ${\rm Out}(G)$ is finitely generated, and provide a virtual generating set consisting of Dehn twists and ``pseudo-twists''. We exhibit instances where Dehn…
We give a necessary and sufficient condition for extremality of a supermodular function based on its min-representation by means of (vertices of) the corresponding core polytope. The condition leads to solving a certain simple linear…
A geometric method is described to characterize the different kinds of extremals in optimal control theory. This comes from the use of a presymplectic constraint algorithm starting from the necessary conditions given by Pontryagin's Maximum…
We shall present an elementary approach to extremal decompositions of (quantum) covariance matrices determined by densities. We give a new proof on former results and provide a sharp estimate of the ranks of the densities that appear in the…
In most data-scientific approaches, the principle of Maximum Entropy (MaxEnt) is used to a posteriori justify some parametric model which has been already chosen based on experience, prior knowledge or computational simplicity. In a…
In a graph $G$, a subset of vertices is a dissociation set if it induces a subgraph with vertex degree at most 1. A maximum dissociation set is a dissociation set of maximum cardinality. The dissociation number of $G$, denoted by $\psi(G)$,…
We give an explicit set of generators for the semigroup of the Gr\"obner degeneration of a toric ideal. This set of generators is used to study algebraic properties of the semigroup it generates: approximation of semigroups,…
We give a description of prepositive cones -- a notion of ordering on algebras with involution introduced by Astier and Unger -- in the specific context of quaternion algebras with involution. Our main result establishes that, for a broad…
This paper introduces the concept of a generating set for stochastic matrices -- a subset of matrices whose repeated composition generates the entire set. Understanding such generating sets requires specifying the "indivisible elements" and…
We study the minimal homogeneous generating sets of the Eulerian ideal associated with a simple graph and its maximal generating degree. We show that the Eulerian ideal is a lattice ideal and use this to give a characterization of binomials…
We derive novel anti-concentration bounds for the difference between the maximal values of two Gaussian random vectors across various settings. Our bounds are dimension-free, scaling with the dimension of the Gaussian vectors only through…
We show that the set of realizations of a given dimension of a max-plus linear sequence is a finite union of polyhedral sets, which can be computed from any realization of the sequence. This yields an (expensive) algorithm to solve the…
We establish an upper bound on the cardinality of a minimal generating set for the fundamental group of a large family of connected, balanced simplicial complexes and, more generally, simplicial posets.
The purpose of this paper is to shed more light on the transition from the known massless modular action to the wanted massive one in the case of forward light cones and double cones. The infinitesimal generator of the massive modular…
Methods from additive number theory are applied to construct families of finitely generated linear semigroups with intermediate growth.
In this article, we study connections between components of the Cayley graph $\mathrm{Cay}(G,A)$, where $A$ is an arbitrary subset of a group $G$, and cosets of the subgroup of $G$ generated by $A$. In particular, we show how to construct…
We have proven the existence of new higher-genus maxfaces with Enneper end. These maxfaces are not the companions of any existing minimal surfaces, and furthermore, the singularity set is located away from the ends. The nature of the…
We find a set of generators for the automorphism group of a graph product of finitely generated abelian groups entirely from a certain labeled graph. In addition, we find generators for the important subgroup of star-automorphisms defined…
We show that in a sample of size $n$ from a GEM$(0,\theta)$ random discrete distribution, the gaps $G_{i:n}:= X_{n-i+1:n} - X_{n-i:n}$ between order statistics $X_{1:n} \le \cdots \le X_{n:n}$ of the sample, with the convention $G_{n:n} :=…
In this paper, we investigate the structures of an extremal tree which has the minimal number of subtrees in the set of all trees with the given degree sequence of a tree. In particular, the extremal trees must be caterpillar and but in…