Related papers: Strongly dominant weight polytopes are cubes
We consider $q$-matroids and their associated classical matroids derived from Gabidulin rank-metric codes. We express the generalized rank weights of a Gabidulin rank-metric code in terms of Betti numbers of the dual classical matroid…
A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is \textit{$k$-linked} if,…
An observation by J-P. Serre implies that cubic polynomials are unique among generic monic polynomials of degree 2 or higher in that they have a root that is a power series in the discriminant of the polynomial. We provide formulas for this…
We show that the coefficients of the power series expansion of the principal period of a Laurent polynomial satisfy strong congruence properties. These congruences play a key role in the explicit p-adic analytic continuation of the unit…
This paper is based on the observation that dimension of weight spaces of multi-variable Weyl modules depends polynomially on the highest weight (Conjecture 1). We support this conjecture by various explicit answers for up to three variable…
Many (if not most) of convex polytopes, important for combinatorial and algebraic geometry, are closely related to secondary polytopes of point configurations, or base polytopes of submodular functions, or their numerous variations and…
The distinguished weights form a subset of the weight lattice and are closely tied to the notion of $p$-cells. These weights are defined via iterations of the Lusztig-Vogan bijection. We prove that all distinguished weights exhibit an…
Let $G$ be a simple graph of order $n$. The domination polynomial of $G$ is the polynomial $D(G,\lambda)=\sum_{i=0}^{n} d(G,i) \lambda^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$. We consider the lexicographic…
Let $G$ be a connected reductive complex algebraic group with a maximal torus $T$. We denote by $\Lambda$ the cocharacter lattice of $(T,G)$. Let $\Lambda^+ \subset \Lambda$ be the submonoid of dominant coweights. For $\lambda \in…
We present recursive formulas giving the maximal number of leaves in tree-like polyforms living in two-dimensional regular lattices and in tree-like polycubes in the three-dimensional cubic lattice. We call these tree-like polyforms and…
We consider the approximation of Poisson type problems where the source is given by a singular measure and the domain is a convex polygonal or polyhedral domain. First, we prove the well-posedness of the Poisson problem when the source…
Clique-node and closed neighborhood matrices of circular interval graphs are circular matrices. The stable set polytope and the dominating set polytope on these graphs are therefore closely related to the set packing polytope and the set…
We use Arkhipov's twisting functors to show that the universal enveloping algebra of a semi-simple complex finite-dimensional Lie algebra surjects onto the space of ad-finite endomorphisms of the simple highest weight module $L(\lambda)$,…
The weight enumerators (quant-ph/9610040) of a quantum code are quite powerful tools for exploring its structure. As the weight enumerators are quadratic invariants of the code, this suggests the consideration of higher-degree polynomial…
We investigate weighted floating bodies of polytopes. We show that the weighted volume depends on the complete flags of the polytope. This connection is obtained by introducing flag simplices, which translate between the metric and…
Rado's theorem about permutahedra and dominance order on partitions reveals that each Schur polynomial is M-convex, or equivalently, it has a saturated Newton polytope and this polytope is a generalized permutahedron as well. In this paper…
We study holomorphic functions attaining weighted norms and its connections with the classical theory of norm attaining holomorphic functions. We prove that there are polynomials on $\ell_p$ which attain their weighted but not their…
We show that several families of classical orthogonal polynomials on the real line are also orthogonal on the interior of an ellipse in the complex plane, subject to a weighted planar Lebesgue measure. In particular these include Gegenbauer…
For a family of polynomials in two continuous variables, orthogonal with respect to a weight function, we prove, under suitable conditions, the equivalence of the following properties: the matrix Pearson equation of the weight, the second…
Highest weight categories are described in terms of standard objects and recollements of abelian categories, working over an arbitrary commutative base ring. Then the highest weight structure for categories of strict polynomial functors is…