Related papers: Boolean quadric polytopes are faces of linear orde…

In this article we investigate a class of linear error correcting codes in relation with the order polytopes. In particular we consider the order polytopes of tree posets and bipartite posets. We calculate the parameters of the associated…

Let ${\cal Q}^-(2n+1,q)$ be an elliptic quadric of ${\rm PG}(2n+1,q)$. A relative $m$-ovoid of ${\cal Q}^-(2n+1,q)$ (with respect to a parablic section ${\cal Q} := {\cal Q}(2n,q) \subset {\cal Q}^-(2n+1,q)$) is a subset $\cal R$ of points…

We study symplectic surfaces in ruled symplectic 4-manifolds which are disjoint from a given symplectic section. As a consequence we see that, in any symplectic 4-manifold, two homologous symplectic surfaces which are sufficiently C^0 close…

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$.…

We show that plane bipolar posets (i.e., plane bipolar orientations with no transitive edge) and transversal structures can be set in correspondence to certain (weighted) models of quadrant walks, via suitable specializations of a bijection…

The complex affine quadric $Q^{m}=\{z\in {\Bbb C}^{m+1}\mid z_{1}^{2}+...+z_{m+1}^{2}=1\}$ deforms by retraction onto $S^{m}$; this allows us to identify $[Q^{k},Q^{n}]$ and $[S^{k},S^{n}]=\pi_{k}(S^{n})$. Thus one will say that an element…

A polytope is called {\em regular-faced} if every one of its facets is a regular polytope. The 4-dimensional regular-faced polytopes were determined by G. Blind and R. Blind \cite{BlBl2,roswitha,roswitha2}. The last class of such polytopes…

We study the difference between the number of facets of the order polytope and the chain polytope of a poset. Hibi and Li classified posets where the gap is exactly zero. We describe the bounds on this gap using the new notion of crossing…

In this article, we devise a concise algorithm for computing BOCP. Our method is simple, easy-to-implement but without loss of efficiency. Given two circular-arc polygons with $m$ and $n$ edges respectively, our method runs in…

Given n >= 4 positive real numbers, we prove in this note that they are the face areas of a convex polyhedron if and only if the largest number is not more than the sum of the others.

Motivated by the work of Panina and her coauthors on cyclopermutohedron we study a poset whose elements correspond to equivalence classes of partitions of the set $\{1,\cdots, n+1\}$ up to cyclic permutations and orientation reversion. This…

Let f be a generic polynomial mapping mapping from the plane to the plane. There are constructed quadratic forms whose signatures determine the number of positive and negative cusps of f.

Abstract polytopes are combinatorial structures with distinctive geometric, algebraic, or topological characteristics, that generalize (the face lattice of) traditional polyhedra, polytopes or tessellations. Most research has focused on…

Let $E$ be a finite-dimensional real vector space and $M\subseteq E$ be a convex polytope with non-empty interior. We turn the group of all $C^\infty$-diffeomorphisms of $M$ into a regular Lie group.

An n-dimensional polytope P^n is called simple if exactly n codimension-one faces meet at each vertex. The lattice of faces of a simple polytope P^n with m codimension-one faces defines an arrangement of even-dimensional planes in R^{2m}.…

Given a real finite hyperplane arrangement A and a point p not on any of the hyperplanes, we define an arrangement vo(A,p), called the *valid order arrangement*, whose regions correspond to the different orders in which a line through p can…

The Somos-4 equation defines the sequences with this name. Looking at these sequences with an additional property we get a quartic polynomial in 4 variables. This polynomial defines a rational, projective surface in $\mathbb{RP}^{3}$. Here…

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.…

Let M be a positive quaternionic Kaehler manifold of dimension 4m. If the isometry group Isom(M) has rank at least m/2 +3, then M is isometric to HP^m or Gr_2(C^{m+2}). The lower bound for the rank is optimal if m is even.

In this paper we determine the group of rational automorphisms of binary cubic and quartic forms with integer coefficients and non-zero discriminant in terms of certain quadratic covariants of cubic and quartic forms. This allows one to…