Related papers: Cumulant expansion for counting Eulerian orientati…

A question at the intersection of Barnette's Hamiltonicity and Neumann-Lara's dicoloring conjecture is: Can every Eulerian oriented planar graph be vertex-partitioned into two acyclic sets? A CAI-partition of an undirected/oriented graph is…

We study the numerical topology of the clique complex $K_n=\mathrm{Cl}(G_n)$, where $G_n$ is the partition graph on the set of integer partitions of $n$. Building on the previously established homotopy equivalence $K_n \simeq \vee^{\,b_n}…

We consider several generalizations of the classical $\gamma$-positivity of Eulerian polynomials (and their derangement analogues) using generating functions and combinatorial theory of continued fractions. For the symmetric group, we prove…

We show that arising out of noncmmutatve geometry is a natural family of {\em edge Laplacians} on the edges of a graph. The family includes a canonical edge Laplacian associated to the graph, extending the usual graph Laplacian on vertices,…

A topological graph is $k$-quasi-planar if it does not contain $k$ pairwise crossing edges. A 20-year-old conjecture asserts that for every fixed $k$, the maximum number of edges in a $k$-quasi-planar graph on $n$ vertices is $O(n)$. Fox…

Families of conformal field theories are naturally endowed with a Riemannian geometry which is locally encoded by correlation functions of exactly marginal operators. We show that the curvature of such conformal manifolds can be computed…

Eulerian polynomials record the distribution of descents over permutations. Caylerian polynomials likewise record the distribution of descents over Cayley permutations, where a Cayley permutation is a word of positive integers such that if…

Modular operads are a special type of operad: in fact, they bear the same relationship to operads that graphs do to trees (i.e. simply connected graphs). One of the basic examples of a modular operad is the collection of…

The numbers of even and odd permutations with a given ascent number are investigated using an operator that was previously introduced by the author. Their difference is called a signed Eulerian number. By means of the operator the…

We propose a new Eulerian numerical approach for constructing the forward flow maps in continuous dynamical systems. The new algorithm improves the original formulation developed in [23, 24] so that the associated partial differential…

Acyclic and cyclic orientations of an undirected graph have been widely studied for their importance: an orientation is acyclic if it assigns a direction to each edge so as to obtain a directed acyclic graph (DAG) with the same vertex set;…

We compute the weighted Euler characteristic, equivariant with respect to the action of the symplectic group of degree six over the field of two elements, of the moduli space of principally polarized abelian threefolds together with a level…

We give a new proof that the empirical measures of the roots of Eulerian polynomials converge to a certain log-Cauchy distribution. To do so, we show that each moment of the roots of a related family of polynomials not only converge, but in…

An oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label of $+1$ or $-1$. We define the adjacency, incidence and Laplacian matrices of an oriented hypergraph and study each of them. We extend several matrix…

A variety of descent and major-index statistics have been defined for symmetric groups, hyperoctahedral groups, and their generalizations. Typically associated to pairs of such statistics is an Euler--Mahonian distribution, a bivariate…

An orientation of $G$ is a digraph obtained from $G$ by replacing each edge by exactly one of two possible arcs with the same endpoints. We call an orientation \emph{proper} if neighbouring vertices have different in-degrees. The proper…

Graph orientation is a well-studied area of graph theory. A proper orientation of a graph $G = (V,E)$ is an orientation $D$ of $E(G)$ such that for every two adjacent vertices $ v $ and $ u $, $ d^{-}_{D}(v) \neq d^{-}_{D}(u)$ where…

It is well known that a plane graph is Eulerian if and only if its geometric dual is bipartite. We extend this result to partial duals of plane graphs. We then characterize all bipartite partial duals of a plane graph in terms of oriented…

We generalize Llarull's scalar curvature comparison to Riemannian manifolds admitting metric connections with parallel and alternating torsion and having a nonnegative curvature operator on 2-vectors. As a byproduct, we show that Euler…

We count the number of isomorphism classes of degree $d$-twists of some polarized abelian varieties over finite fields of odd prime dimension. This can be seen as a higher dimensional analogue of the counting problem for elliptic curves…