Related papers: The merging operation and $(d-i)$-simplicial $i$-s…

For a polynomial $f(X)=AX^d+C \in \mathbb{F}_p[X]$ with $A\neq 0$ and $d\geq 2$, we prove that if $d\;|\;p-1$ and $f^i(0)\neq f^j(0)$ for $0\leq i<j\leq N$, then $\#f^N(\mathbb{F}_p) \sim \frac{2p}{(d-1)N},$ where $f^N$ is the $N$-th…

Consider two families of closed oriented curves in a d-manifold. At each point of intersecction of a curve of one family with a curve of the other family, form a new closed curve by going around the first curve and then going around the…

Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…

A (convex) polytope $P$ is said to be $2$-level if for every direction of hyperplanes which is facet-defining for $P$, the vertices of $P$ can be covered with two hyperplanes of that direction. The study of these polytopes is motivated by…

In this paper, we introduce a new generating function called $d$-polynomial for the dimensions of $\tau$-tilting modules over a given finite dimensional algebra. Firstly, we study basic properties of $d$-polynomials and show that it can be…

Let $q$ be an integer. A $D(q)$-$m$-tuple is a set of $m$ distinct positive integers ${a_1, a_2, . . . , a_m}$ such that $a_ia_j + q$ is a perfect square for all $1 \leq i < j \leq m$. By counting integer solutions $x \in [1, b]$ of…

It is known that a distance-regular graph with valency $k$ at least three admits at most two Q-polynomial structures. % In this note we show that all distance-regular graphs with diameter four and valency at least three admitting two…

In this paper we use the technique of Hopf algebras and quasi-symmetric functions to study the combinatorial polytopes. Consider the free abelian group $\mathcal{P}$ generated by all combinatorial polytopes. There are two natural bilinear…

We investigate the maximum number of intersections between two polygons with p and q vertices, respectively, in the plane. The cases where p or q is even or the polygons do not have to be simple are quite easy and already known, but when p…

A split of a polytope $P$ is a (regular) subdivision with exactly two maximal cells. It turns out that each weight function on the vertices of $P$ admits a unique decomposition as a linear combination of weight functions corresponding to…

For a simplicial complex K on m vertices and simplicial complexes K1,...,Km a composed simplicial complex K(K1,...,Km) is introduced. This construction generalizes an iterated simplicial wedge construction studied by A. Bahri, M. Bendersky,…

In 2012 Gubeladze (Adv.\ Math.\ 2012) introduced the notion of k-convex-normal polytopes to show that integral polytopes all of whose edges are longer than 4d(d+1) have the integer decomposition property. In the first part of this paper we…

We prove a combinatorial theorem on families of disjoint sub-boxes of a discrete cube, which implies that there are at most $2^{d+1}-2$ nearly neighbourly simplices in $\mathbb R^d$.

We show that the family of standard simplices and the family of Stasheff polytopes are dual to each other in the following sense. The chain modules of the standard simplices, resp. the Stasheff polytopes, assemble to give an operad. We show…

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…

In a d-simplex every facet is a (d-1)-simplex. We consider as generalized simplices other combinatorial classes of polytopes, all of whose facets are in the class. Cubes and multiplexes are two such classes of generalized simplices. In this…

In this note we give the definition of the "doubling operation" for simple polytopes, find the formula for the h-polynomial of new polytope.As an application of this operation we establish the relationship between moment-angle manifolds and…

Polytope numbers for a polytope are a sequence of nonnegative integers that are defined by the facial information of a polytope. Every polygon is triangulable and a higher dimensional analogue of this fact states that every polytope is…

We present explicit constructions of centrally symmetric 2-neighborly d-dimensional polytopes with about 3^{d/2} = (1.73)^d vertices and of centrally symmetric k-neighborly d-polytopes with about 2^{c_k d} vertices where c_k=3/20 k^2 2^k.…

The Lasserre's reconstruction algorithm is extended to the D-polytopes with the construction of their shape space. Thus, the areas of d-skeletons $(1\leq d\leq D)$ can be expressed as functions of the areas and normal bi-vectors of the…