Related papers: The $d$-Majorization Polytope
The centralizer of an endomorphism of a finite dimensional vector space is known when the endomorphism is nonderogatory or when its minimal polynomial splits over the field. It is also known for the real Jordan canonical form. In this paper…
The general $d$-position number ${\rm gp}_d(G)$ of a graph $G$ is the cardinality of a largest set $S$ for which no three distinct vertices from $S$ lie on a common geodesic of length at most $d$. This new graph parameter generalizes the…
A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose vertices are among the vertices of the polytope. Triangulations are dissections that have the additional property that the set of all its simplices…
We extend finding geometrically-significant preserved quantities by solving specific PDEs to the affine transformations and subgroups. This can be viewed not only as a purely geometrical problem but also as a subcase of finding physical…
In the paper we provide a new method of proving the existence of a hypersurface of degree $d$ in $\mathbb{P}^n$, with a general point of multiplicity $m$ and vanishing at a given set of points $Z$, by looking at weak combinatorics of a set…
This paper studies generic and perturbation properties inside the linear space of $m\times (m+n)$ polynomial matrices whose rows have degrees bounded by a given list $d_1, \ldots, d_m$ of natural numbers, which in the particular case $d_1 =…
We study higher-derivative gravity theories in arbitrary space-time dimension d with a cosmological constant at their maximally critical points where the masses of all linearized perturbations vanish. These theories have been conjectured to…
Preorder polytopes, defined from preorders on finite sets, are introduced and studied from a lattice point enumeration point of view. They naturally generalize arbor polytopes, recently introduced and studied by the second named author.…
One tuple of probability vectors is more informative than another tuple when there exists a single stochastic matrix transforming the probability vectors of the first tuple into the probability vectors of the other. This is called matrix…
Motivated by the analysis of the performance of the simplex method we study the behavior of families of pivot rules of linear programs. We introduce normalized-weight pivot rules which are fundamental for the following reasons: First, they…
We provide a complete description of the ideal that serves as the resultant ideal for n univariate polynomials of degree d. We in particular describe a set of generators of this resultant ideal arising as maximal minors of a set of…
The study of the graph diameter of polytopes is a classical open problem in polyhedral geometry and the theory of linear optimization. In this paper we continue the investigation initiated in [4] by introducing a vast hierarchy of…
Ignoring ten-dimensional heterotic gauge fields, heterotic supergravity reduced on a $d$-dimensional torus gives rise to a half-maximal supergravity coupled to $d$ vector multiplets. The reduced theory has a continuous $O(d,d;\mathbb…
It is possible to write the indicator function of any matroid polytope as an integer combination of indicator functions of Schubert matroid polytopes. In this way, every matroid on $n$ elements of rank $r$ can be thought of as a lattice…
The theory of $D$-norms is an offspring of multivariate extreme value theory. We present recent results on $D$-norms, which are completely determined by a certain random vector called generator. In the first part it is shown that the space…
We generalize the Gr\"obner basis method for free D-modules to the case of several term orderings induced by a partition of the set of basic variables. Using this generalized Gr\"obner basis technique we prove the existence and give a…
This article examines noncrossing partitions of the unit circle in the complex plane; we call these continuous noncrossing partitions. More precisely, we focus on the degree-$d$ continuous noncrossing partitions where unit complex numbers…
Many results in mass partitions are proved by lifting $\mathbb{R}^d$ to a higher-dimensional space and dividing the higher-dimensional space into pieces. We extend such methods to use lifting arguments to polyhedral surfaces. Among other…
Consider the problem of constructing an experimental design, optimal for estimating parameters of a given statistical model with respect to a chosen criterion. To address this problem, the literature usually provides a single solution.…
In this paper we describe the multiplier ideals and jumping numbers associated with an irreducible germ of quasi-ordinary hypersurface $(D, 0) \subset (\mathbb{C}^{d+1}, 0)$ by using a toroidal embedded resolution. The approach is motivated…