Related papers: Integer concave cocirculations and honeycombs

This paper uses convex integration to develop a new, general method for proving relative $h$-principles for closed, stable, exterior forms on manifolds. This method is applied to prove the relative $h$-principle for 4 classes of closed…

We prove that a 3--dimensional hyperbolic cusp with convex polyhedral boundary is uniquely determined by its Gauss image. Furthermore, any spherical metric on the torus with cone singularities of negative curvature and all closed…

We formulate the "real integral Hodge conjecture", a version of the integral Hodge conjecture for real varieties, and raise the question of its validity for cycles of dimension 1 on uniruled and Calabi-Yau threefolds and on rationally…

We investigate the relationship between finite groups and incidence geometries through their automorphism structures. Building upon classical results on the realizability of groups as automorphism groups of graphs, we develop a general…

Computing the closed convex envelope or biconjugate is the core operation that bridges the domain of nonconvex with convex analysis. We focus here on computing the conjugate of a bivariate piecewise quadratic function defined over a…

We construct a family of countexamples to a conjecture of Galvin [5], which stated that for any $n$-vertex, $d$-regular graph $G$ and any graph $H$ (possibly with loops), \[\hom(G,H) \leq \max\left\lbrace\hom(K_{d,d}, H)^{\frac{n}{2d}},…

The $W_v$-Path Conjecture due to Klee and Wolfe states that any two vertices of a simple polytope can be joined by a path that does not revisit any facet. This is equivalent to the well-known Hirsch Conjecture. Klee proved that the…

A graph homomorphism is a vertex map which carries edges from a source graph to edges in a target graph. The instances of the Weighted Maximum H-Colourable Subgraph problem (MAX H-COL) are edge-weighted graphs G and the objective is to find…

Let $k$ be a positive integer and let $G$ be a graph with $n$ vertices. A connected $k$-subpartition of $G$ is a collection of $k$ pairwise disjoint sets (a.k.a. classes) of vertices in $G$ such that each set induces a connected subgraph.…

The $g$-component edge connectivity $c\lambda_g(G)$ of a non-complete graph $G$ is the minimum number of edges whose deletion results in a graph with at least $g$ components. In this paper, we determine the component edge connectivity of…

Using a natural representation of a $1/s$-concave function on $\mathbb{R}^d$ as a convex set in $\mathbb{R}^{d+1},$ we derive a simple formula for the integral of its $s$-polar. This leads to convexity properties of the integral of the…

For a graph class $\mathcal G$ and a graph $H$, the four $\mathcal G$-covering numbers of $H$, namely global ${\rm cn}_{g}^{\mathcal{G}}(H)$, union ${\rm cn}_{u}^{\mathcal{G}}(H)$, local ${\rm cn}_{l}^{\mathcal{G}}(H)$, and folded ${\rm…

The volume of the hive polytope (or polytope of honeycombs) associated with a Littlewood- Richardson coefficient of SU(n), or with a given admissible triple of highest weights, is expressed, in the generic case, in terms of the Fourier…

A $d$-dimensional body-and-hinge framework is a structure consisting of rigid bodies connected by hinges in $d$-dimensional space. The generic infinitesimal rigidity of a body-and-hinge framework has been characterized in terms of the…

We show that every edge in a 2-edge-connected planar cubic graph is either contained in a 2-edge-cut or is a chord of some cycle that is contained in a 2-factor of the graph. As a consequence, we show that every edge in a cyclically…

For a convex polytope P with rational vertices, we count the number of integer points in integral dilates of P and its interior. The Ehrhart-Macdonald reciprocity law gives an intimate relation between these two counting functions. A…

For a simple graph $G$, let $J_G$ denote the corresponding binomial edge ideal. This article considers the binomial edge ideal of the corona product of two connected graphs $G$ and $H$. The corona product of $G$ and $H$, denoted by $G\circ…

Motivated by connections to random matrices, Littlewood-Richardson coefficients and tilings, we study random discrete concave functions on an equilateral lattice. We show that such functions having a periodic Hessian of a fixed average…

Let F be a polarized irreducible holomorphic symplectic fourfold, deformation equivalent to the Hilbert scheme parametrizing length-two zero-dimensional subschemes of a K3 surface. The homology group H^2(F,Z) is equipped with an integral…

A graph is cubical if it is a subgraph of a hypercube. For a cubical graph $H$ and a hypercube $Q_n$, $ex(Q_n, H)$ is the largest number of edges in an $H$-free subgraph of $Q_n$. If $ex(Q_n, H)$ is equal to a positive proportion of the…