Related papers: The log concavity of two graphical sequences

We develop a theory of motives with compact support for logarithmic schemes over a field. Starting from the notion of finite logarithmic correspondences with compact support, we define the logarithmic motive with compact support analogous…

We provide extensions of geometric inequalities about sections and projections of convex bodies to the setting of integrable log-concave functions. Namely, we consider suitable generalizations of the affine and dual affine quermassintegrals…

Motivated by Stanley's generalization of the chromatic polynomial of a graph to the chromatic symmetric function, we introduce the characteristic polynomial of a representation of the symmetric group, or more generally, of a symmetric…

One of the earliest and best-known application of the probabilistic method is the proof of existence of a 2 log n$-Ramsey graph, i.e., a graph with n nodes that contains no clique or independent set of size 2 log n. The explicit…

Maps from links in thickened surfaces to flat-virtual links help to construct invariants of links using invariants of flat-virtual links. This work is dedicated to investigation of equivalence and invariants of flat-virtual diagrams…

Previously, Biggs has conjectured that the resistance between any two points on a distance-regular graph of valency greater than 2 is bounded by twice the resistance between adjacent points. We prove this conjecture, give the sharp constant…

Let $m$ and $k \geq 2$ be positive integers. We show that polynomial $P = (1+x)^m(1+x^k)$ is strongly unimodal (frequently known as {\it log concave\/}) if and only if $m \geq k^2 -3$; this is also the criterion for $P$ to be merely…

In a 1977 paper, Steffens identified an elegant criterion for determining when a countable graph has a perfect matching. In this paper, we will investigate the proof-theoretic strength of this result and related theorems. We show that a…

Let $(M,\omega)$ be a closed $2n$-dimensional symplectic manifold equipped with a Hamiltonian $T^{n-1}$-action. Then Atiyah-Guillemin-Sternberg convexity theorem implies that the image of the moment map is an $(n-1)$-dimensional convex…

In this paper we develop a new geometric method to answer the log-concavity questions related to a nice class of combinatorial sequences arising from the Pascal triangle.

We show that any graph polynomial from a wide class of graph polynomials yields a recurrence relation on an infinite class of families of graphs. The recurrence relations we obtain have coefficients which themselves satisfy linear…

Karonski, Luczak, and Thomason (2004) conjectured that, for any connected graph G on at least three vertices, there exists an edge weighting from {1,2,3} such that adjacent vertices receive different sums of incident edge weights.…

Monsky proved that a square cannot be dissected into an odd number of triangles of equal area. Stein conjectured that the same holds for any polygon whose edges can be paired into parallel and equal-length segments. We prove Stein's…

The multivariable Conway function is generalized to oriented framed trivalent graphs equipped with additional structure (coloring). This is done via refinements of Reshetikhin-Turaev functors based on irreducible representations of…

We prove that every finite arc-transitive graph of valency twice a prime admits a nontrivial semiregular automorphism, that is, a non-identity automorphism whose cycles all have the same length. This is a special case of the Polycirculant…

Complex optical networks containing one or more gain sections are investigated and the evidence of lasing action is reported; the emission spectrum reflects the topological disorder induced by the connections. A theoretical description well…

We study the algebraic connectivity (or second Laplacian eigenvalue) of token graphs, also called symmetric powers of graphs. The $k$-token graph $F_k(G)$ of a graph $G$ is the graph whose vertices are the $k$-subsets of vertices from $G$,…

It has long been known that there exist finite connected tetravalent arc-transitive graphs with arbitrarily large vertex-stabilisers. However, beside a well known family of exceptional graphs, related to the lexicographic product of a cycle…

We extend the $L^p$ theory of sparse graph limits, which was introduced in a companion paper, by analyzing different notions of convergence. Under suitable restrictions on node weights, we prove the equivalence of metric convergence,…

Let $G$ denote a $Q$-polynomial distance-regular graph with diameter $D$ at least 4. Assume that the intersection numbers of $G$ satisfy $a_i=0$ for $0 \leq i \leq D-1$ and $a_D\neq 0$. We show that $G$ is a polygon, a folded cube, or an…