Related papers: Cumulant expansion for counting Eulerian orientati…
Using a new colored analogue of P-partitions, we prove the existence of a colored Eulerian descent algebra which is a subalgebra of the Mantaci-Reutenauer algebra. This algebra has a basis consisting of formal sums of colored permutations…
A unicellular map is the embedding of a connected graph in a surface in such a way that the complement of the graph is a topological disk. In this paper we present a bijective link between unicellular maps on a non-orientable surface and…
A well known theorem due to Kasteleyn states that the partition function of an Ising model on an arbitrary planar graph can be represented as the Pfaffian of a skew-symmetric matrix associated to the graph. This results both embodies the…
Alon and Yuster proved that the number of orientations of any $n$-vertex graph in which every $K_3$ is transitively oriented is at most $2^{\lfloor n^2/4\rfloor}$ for $n \geq 10^4$ and conjectured that the precise lower bound on $n$ should…
Euler calculus is based on integrating simple functions with respect to the Euler characteristic. This paper makes the case for extending Euler calculus to continuous integrands by integrating with respect to (Gaussian) curvature. This…
We obtain several sharp spectral bounds, approximations, and exact values for the isoperimetric number and related edge-expansion parameters of graphs. Our results focus on graph powers and on families of graphs with rich algebraic or…
Consider the random graph~\(G(n,p)\) obtained by allowing each edge in the complete graph on~\(n\) vertices to be present with probability~\(p\) independent of the other edges. In this paper, we study the minimum number of edge edit…
We study topological properties of random closed curves on an orientable surface $S$ of negative Euler characteristic. Letting $\gamma_{n}$ denote the conjugacy class of the $n^{th}$ step of a simple random walk on the Cayley graph driven…
The Erd\H{o}s, Gr\"unwald, and Weiszfeld theorem is a characterization of those infinite graphs which are Eulerian. That is, infinite graphs that admit infinite Eulerian paths. In this article we prove an effective version of the Erd\H{o}s,…
In this note we study numerically the combinatorics of curves and geodesics on the torus with one boundary component. A potential computational difficulty is avoided by counting inside specific orbits of the mapping class group up to a…
We define a generalization of the Eulerian polynomials and the Eulerian numbers by considering a descent statistic on segmented permutations coming from the study of 2-species exclusion processes and a change of basis in a Hopf algebra. We…
We show that counting Euler tours in undirected bounded tree-width graphs is tractable even in parallel - by proving a $\#SAC^1$ upper bound. This is in stark contrast to #P-completeness of the same problem in general graphs. Our main…
We enumerate the connected graphs that contain a linear number of edges with respect to the number of vertices. So far, only the first term of the asymptotics was known. Using analytic combinatorics, i.e. generating function manipulations,…
Topological transforms have been very useful in statistical analysis of shapes or surfaces without restrictions that the shapes are diffeomorphic and requiring the estimation of correspondence maps. In this paper we introduce two…
We determine the maximum possible number of edges of a graph with $n$ vertices, matching number at most $s$ and clique number at most $k$ for all admissible values of the parameters.
The Eulerian polynomials enumerate permutations according to their number of descents. We initiate the study of descent polynomials over Cayley permutations, which we call Caylerian polynomials. Some classical results are generalized by…
The moduli space of rank $n$ graphs, the outer automorphism group of the free group of rank $n$ and Kontsevich's Lie graph complex have the same rational cohomology. We show that the associated Euler characteristic grows like…
It is shown that Euler's theorem for graphs can be generalized for 2-complexes. Two notions that generalize cycle and Eulerian tour are introduced (``circlet'' and ``Eulerian cover''), and we show that for a strongly-connected, pure…
A graph is called (generically) rigid in $\mathbb{R}^d$ if, for any choice of sufficiently generic edge lengths, it can be embedded in $\mathbb{R}^d$ in a finite number of distinct ways, modulo rigid transformations. Here we deal with the…
The scaling of acceleration statistics in turbulence is examined by combining data from the literature with new data from well-resolved direct numerical simulations of isotropic turbulence, significantly extending the Reynolds number range.…