Related papers: Signs in the cd-index of Eulerian partially ordere…
A relationship between signed Eulerian polynomials and the classical Eulerian polynomials on $\mathfrak{S}_n$ was given by D\'{e}sarm\'{e}nien and Foata in 1992, and a refined version, called signed Euler-Mahonian identity, together with a…
Due to Veblen's Theorem, if a connected multigraph $X$ has even degrees at each vertex, then it is Eulerian and its edge set has a partition into cycles. In this paper, we show that an Eulerian multigraph has a unique partition into cycles…
In this note we show that any embedded graph has a checkerboard colourable twisted dual and any Eulerian embedded graph has a checkerboard colourable partial Petrial, answering questions posed by Ellis-Monaghan and Moffatt. The proofs are…
It is shown that the toric ideal of the centrally symmetric configuration of the order polytope of a finite partially ordered set possesses a squarefree quadratic initial ideal. It then follows that the convex polytope arising from the…
We define the concepts of topological particles and topological radiation. These are nothing more than connected components of defects of a vector field. To each topological particle we assign an index which is an integer which is conserved…
For every positive integer $n\in \mathbb{Z}_+$ we define an `Euler polynomial' $\mathscr{E}_n(t)\in \mathbb{Z}[t]$, and observe that for a fixed $n$ all Chern numbers (as well as other numerical invariants) of all smooth hypersurfaces in…
In this paper we consider the characteristic polynomial of not necessarily ranked posets. We do so by allowing the rank to be an arbitrary function from the poset to the nonnegative integers. We will prove two results showing that the…
Let $\Bigl\langle\matrix{n\cr k}\Bigr\rangle$, $\Bigl\langle\matrix{B_n\cr k}\Bigr\rangle$, and $\Bigl\langle\matrix{D_n\cr k}\Bigr\rangle$ be the Eulerian numbers in the types A, B, and D, respectively -- that is, the number of…
In this paper, we find a criterium for universal equivalence of partially commutative Lie algebras whose defining graphs are trees. Besides, we obtain bases for partially commutative metabelian Lie algebras.
We define a variety of doubly indexed flags, this is a smooth, projective variety, and we describe it as an iterated over Grassmannian varieties. On the other hand, we consider the variety of partial flags which are stabilized by a given…
The Poincare series of a multi-index filtration on the ring of germs of functions can be written as a certain integral with respect to the Euler characteristic over the projectivization of the ring. Here this integral is considered with…
Indices of singular points of a vector field or of a 1-form on a smooth manifold are closely related with the Euler characteristic through the classical Poincar\'e--Hopf theorem. Generalized Euler characteristics (additive topological…
While faces of a polytope form a well structured lattice, in which faces of each possible dimension are present, this is not true for general compact convex sets. We address the question of what dimensional patterns are possible for the…
A perfect cuboid is formed when an Euler brick whose edges and face diagonals are all integers also has an integer internal diagonal. It is known that if a perfect cuboid exists the internal diagonal is odd. No perfect cuboid has been…
It is well known that the Euler characteristic of an odd dimensional compact manifold is zero. An Euler complex is a combinatorial analogue of a compact manifold. We present here an elementary proof of the corresponding result for Euler…
By extending a construction due to Gross and McMullen [2], we show that for any odd integer n and for any even integer d>n+2 there are infinitely many Salem numbers $\alpha$ of degree d such that $\alpha^n-1$ is a unit. A similar result is…
A classification of discrete integrable systems on quad-graphs, i.e. on surface cell decompositions with quadrilateral faces, is given. The notion of integrability laid in the basis of the classification is the three-dimensional…
A graded-division algebra is an algebra graded by a group such that all nonzero homogeneous elements are invertible. This includes division algebras equipped with an arbitrary group grading (including the trivial grading). We show that a…
We show that planar graphs have bounded queue-number, thus proving a conjecture of Heath, Leighton and Rosenberg from 1992. The key to the proof is a new structural tool called layered partitions, and the result that every planar graph has…
A pair of sequences of natural numbers is called planar if there exists a simple, bipartite, planar graph for which the given sequences are the degree sequences of its parts. For a pair to be planar, the sums of the sequences have to be…