Related papers: Polytopes and simplexes in p-adic fields
We study a new class of polyominoes, called $p$-Fibonacci polyominoes, defined using $p$-Fibonacci words. We enumerate these polyominoes by applying generating functions to capture geometric parameters such as area, semi-perimeter, and the…
Ordinary polytopes are known as a non-simplicial generalization of the cyclic polytopes. The face vectors of ordinary polytopes are shown to be log-concave.
A basic combinatorial invariant of a convex polytope $P$ is its $f$-vector $f(P)=(f_0,f_1,\dots,f_{\dim P-1})$, where $f_i$ is the number of $i$-dimensional faces of $P$. Steinitz characterized all possible $f$-vectors of $3$-polytopes and…
We consider the construction of a polygon $P$ with $n$ vertices whose turning angles at the vertices are given by a sequence $A=(\alpha_0,\ldots, \alpha_{n-1})$, $\alpha_i\in (-\pi,\pi)$, for $i\in\{0,\ldots, n-1\}$. The problem of…
Marginal polytopes are important geometric objects that arise in statistics as the polytopes underlying hierarchical log-linear models. These polytopes can be used to answer geometric questions about these models, such as determining the…
We define the notion of a painted tropical $A$-complex and describe a poset structure on the set of all such complexes. This poset is equivalent to the face lattice of a secondary polytope $\Sigma (\bar{A}_\alpha )$ where $\bar{A}_\alpha$…
We introduce the notion of an ordered face structure. The ordered face structures to many-to-one computads are like positive face structures to positive-to-one computads. This allow us to give an explicit combinatorial description of…
We show that there are simplex pivoting rules for which it is PSPACE-complete to tell if a particular basis will appear on the algorithm's path. Such rules cannot be the basis of a strongly polynomial algorithm, unless P = PSPACE. We…
We give a criterion of the semisimplicity of a p-adic unitary representation of a topological monoid by the reduction of the associated operator algebra.
Geometric embedding of graphs in a point set in the plane is a well known problem. In this paper, the complexity of a variant of this problem, where the point set is bounded by a simple polygon, is considered. Given a point set in the plane…
We give an explicit combinatorial description of the two-dimensional faces of both the order polytope $\mathcal{O}(P)$ and the chain polytope $\mathcal{C}(P)$ of a partially ordered set $P$. Using these descriptions, we show that for any…
Maniplexes are coloured graphs that generalise maps on surfaces and abstract polytopes. Each maniplex uniquely defines a partially ordered set that encodes information about its structure. When this poset is an abstract polytope, we say…
We give an intrinsic definition of toric symplectic stacks, and show that they are classified by simple convex polytopes equipped with some additional combinatorial data. This generalizes Delzant's classification of toric symplectic…
A congruence of the weak order is simple if its quotientope is a simple polytope. We provide an alternative elementary proof of the characterization of the simple congruences in terms of forbidden up and down arcs. For this, we provide a…
The number of linear independent algebraic relations among elementary symmetric polynomial functions over finite fields is computed. An algorithm able to find all such relations is described. It is proved that the basis of the ideal of…
Combinatorial Hopf algebras of trees exemplify the connections between operads and bialgebras. Painted trees were introduced recently as examples of how graded Hopf operads can bequeath Hopf structures upon compositions of coalgebras. We…
One can think of power series or polynomials in one variable, such as $P(x)=2x^3+x+5$, as functors from the category $\mathsf{Set}$ of sets to itself; these are known as polynomial functors. Denote by $\mathsf{Poly}_{\mathsf{Set}}$ the…
Let p > 2 be a prime. Let Q(zeta) be the p-cyclotomic field. Let pi be the prime ideal of Q(zeta) lying over p. This article aims to describe some pi-adic congruences characterizing the structure of the p-class group and of the unit group…
The symmetry of polygons can be characterized by the number of symmetry axes they have. For $n$-polygons with $p$ or $p^2$ vertices $p\geq3$ there exist few symmetry categories, depending from the number of symmetry-axes the have. Further…
Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…