Related papers: Column convex matrices, $G$-cyclic orders, and flo…
We prove several theorems concerning Tutte polynomials $T(G,x,y)$ for recursive families of graphs. In addition to its interest in mathematics, the Tutte polynomial is equivalent to an important function in statistical physics, the Potts…
This paper revisits the notion of classical orthogonal polynomials from a broader functional-analytic point of view. It is intended neither as a survey of known results nor as a review of the literature, but rather as a conceptual…
Euler diagrams are a tool for the graphical representation of set relations. Due to their simple way of visualizing elements in the sets by geometric containment, they are easily readable by an inexperienced reader. Euler diagrams where the…
Integral representations for continuous polynomial local functionals on convex functions are established in terms of a finite family of polynomials. This result is obtained by approximation from a classification of the dense subspace of…
An asymptotic expansion is established for time averages of translation flows on flat surfaces. This result, which extends earlier work of A.Zorich and G.Forni, yields limit theorems for translation flows. The argument, close in spirit to…
The volume and the number of lattice points of the permutohedron P_n are given by certain multivariate polynomials that have remarkable combinatorial properties. We give several different formulas for these polynomials. We also study a more…
We introduce a new graph invariant \Lambda(G) that we call maxmaxflow, and put it in the context of some other well-known graph invariants, notably maximum degree and its relatives. We prove the equivalence of two "dual" definitions of…
Let $G$ be a graph with adjacency matrix $A(G)$ and degree matrix $D(G)$, and let $L_\mu(G):=A(G)-\mu D(G)$. Two graphs $G_1$ and $G_2$ are called \emph{degree-similar} if there exists an invertible matrix $M$ such that $M^{-1} A(G_1) M…
A famous and wide-open problem, going back to at least the early 1970's, concerns the classification of chromatic polynomials of graphs. Toward this classification problem, one may ask for necessary inequalities among the coefficients of a…
We establish combinatorial versions of various classical systolic inequalities. For a smooth triangulation of a closed smooth manifold, the minimal number of edges in a homotopically non-trivial loop contained in the $1$-skeleton gives an…
In the paper we treat Gale diagrams in a combinatorial way. The interpretation allows to describe simplicial complexes which are Alexander dual to boundaries of simplicial polytopes and, more generally, to nerve-complexes of general…
We present an algorithm that, given finite simplicial sets $X$, $A$, $Y$ with an action of a finite group $G$, computes the set $[X,Y]^A_G$ of homotopy classes of equivariant maps $\ell \colon X \to Y$ extending a given equivariant map $f…
We consider a nonlinear extension of the generalized network flow model, with the flow leaving an arc being an increasing concave function of the flow entering it, as proposed by Truemper and Shigeno. We give a polynomial time combinatorial…
We introduce a class of inverse monoids that can be regarded as non-commutative generalizations of Boolean algebras. These inverse monoids are related to a class of \'etale topological groupoids, under a non-commutative generalization of…
A nowhere-zero $k$-flow on a graph $\Gamma$ is a mapping from the edges of $\Gamma$ to the set $\{\pm1, \pm2, ..., \pm(k-1)\} \subset \bbZ$ such that, in any fixed orientation of $\Gamma$, at each node the sum of the labels over the edges…
Gyroscopic alignment of a fluid occurs when flow structures align with the rotation axis. This often gives rise to highly spatially anisotropic columnar structures that in combination with complex domain boundaries pose challenges for…
The graph isomorphism (GI) problem, which asks whether two graphs are structurally identical, occupies a unique position in computational complexity -- it is neither known to be solvable in polynomial time, nor proven to be NP-complete. We…
The study of spanning trees and related structures is central in graph theory, closely connected to understanding functions between finite sets. This paper generalizes the established relationship between rooted trees and eventually…
Let $\mathbb{P}\Omega^d\mathcal{M}_{0,n}(\kappa)$, where $\kappa=(k_1,\dots,k_n)$, be a stratum of (projectivized) $d$-differentials in genus $0$. We prove a recursive formula which relates the volume of…
For a connected graph, the Hamiltonian cycle (path) is a simple cycle (path) that spans all the vertices in the graph. It is known from \cite{muller,garey} that HAMILTONIAN CYCLE (PATH) are NP-complete in general graphs and chordal…