Related papers: Additive structures on $f$-vector sets of polytope…

In this paper we study the ring $\mathcal{P}$ of combinatorial convex polytopes. We introduce the algebra of operators $\mathcal{D}$ generated by the operators $d_k$ that send an $n$-dimensional polytope $P^n$ to the sum of all its…

The polytope subalgebra of deformations of a zonotope can be endowed with the structure of a module over the Tits algebra of the corresponding hyperplane arrangement. We explore this construction and find relations between statistics on…

We consider unimodality and related properties of f-vectors of polytopes in various dimensions. By a result of Kalai (1988), f-vectors of 5-polytopes are unimodal. In higher dimensions much less can be said; we give an overview on current…

We prove that if a pure simplicial complex of dimension d with n facets has the least possible number of (d-1)-dimensional faces among all complexes with n faces of dimension d, then it is vertex decomposable. This answers a question of J.…

A theorem of Gr\"unbaum, which states that every $m$-polytope is a refinement of an $m$-simplex, implies the following generalization of Tverberg's theorem: if $f$ is a linear function from an $m$-dimensional polytope $P$ to $\mathbb{R}^d$…

Kupavskii, Volostnov, and Yarovikov have recently shown that any set of $n$ points in general position in the plane has at least as many (partial) triangulations as the convex $n$-gon. We generalize this in two directions: we show that…

This paper studies the structure of finite hyperfields $H$, and finds a subtle pattern in their addition operation. Consider the class $\mathcal{H}$ of all hyperfields with a given multiplicative group on $H^\times = H - \{0\}$ and given…

An $\mathcal{A}$-semigroup is a numerical semigroup without consecutive small elements. This work generalizes this concept to finite-complement submonoids of an affine cone $\mathcal{C}$. We develop algorithmic procedures to compute all…

For a polytope P a simplex S with vertex set V(S) is called a special simplex if every facet of P contains all but exactly one vertex of S. For such polytopes P with face complex F(P) containing a special simplex the subcomplex F(P) / V(S)…

In the classical setting, a convex polytope is said to be semiregular if its facets are regular and its symmetry group is transitive on vertices. This paper studies semiregular abstract polytopes, which have abstract regular facets, still…

Let \pi : V \rightarrow M be a (real or holomorphic) vector bundle whose base has an almost Frobenius structure (\circ_{M},e_{M}, g_{M}) and typical fiber has the structure of a Frobenius algebra (\circ_{V},e_{V},g_{V}). Using a connection…

A graph G is weakly 4-connected if it is 3-connected, has at least five vertices, and for every pair of sets (A,B) with union V(G) and intersection of size three such that no edge has one end in A-B and the other in B-A, one of the induced…

A Heffter array over an additive group $G$ is any partially filled array $A$ satisfying that: (1) each one of its rows and columns sum to zero in $G$, and (2) if $i\in G\setminus\{0\}$, then either $i$ or $-i$ appears exactly once in $A$.…

We construct sets $A, B$ in a vector space over $\mathbb{F}_2$ with the property that $A$ is "statistically" almost closed under addition by $B$ in the sense that $a + b$ almost always lies in $A$ when $a \in A, b \in B$, but which is…

Given a non-negative integer k, we construct a lattice 3-simplex P with the following property: The affine semigroup Q_P associated to P is not normal, and every element $q \in \sat{Q}_P \setminus Q_P$ has lattice distance at least k above…

Associated to a simple root of a finite-dimensional complex semisimple Lie algebra, there are several endofunctors (defined by Arkhipov, Enright, Frenkel, Irving, Jantzen, Joseph, Mathieu, Vogan and Zuckerman) on the BGG category…

We study $f$-vectors, which are the maximal degree vectors of $F$-polynomials in cluster algebra theory. For a cluster algebra is of finite type, we find that positive $f$-vectors correspond with $d$-vectors, which are exponent vectors of…

Let $G$ be a graph and $f: G\rightarrow G$ be a continuous map. We establish a structure theorem which describes the structures of the set $R(f)-\overline{P(f)}$, where $R(f)$ and $P(f)$ are the recurrent point set and the periodic point…

Blind and Mani, and later Kalai, showed that the face lattice of a simple polytope is determined by its graph, namely its $1$-skeleton. Call a vertex of a $d$-polytope \emph{nonsimple} if the number of edges incident to it is more than $d$.…

In this paper, we generalize the principle of the Long-Moody construction for representations of braid groups to other groups, such as mapping class groups of surfaces. Namely, we introduce endofunctors over a functor category that encodes…