Related papers: A General Method to Determine Limiting Optimal Sha…
Let $G$ be an undirected graph. An edge of $G$ dominates itself and all edges adjacent to it. A subset $E'$ of edges of $G$ is an edge dominating set of $G$, if every edge of the graph is dominated by some edge of $E'$. We say that $E'$ is…
For positive integers $s,t,m$ and $n$, the Zarankiewicz number $z(m,n;s,t)$ is the maximum number of edges in a subgraph of $K_{m,n}$ that has no complete bipartite subgraph containing $s$ vertices in the part of size $m$ and $t$ vertices…
Many well-studied problems in extremal combinatorics deal with the maximum possible size of a family of objects in which every pair of objects satisfies a given restriction. One problem of this type was recently raised by Alon, Gujgiczer,…
In this paper we provide a framework for the study of isoperimetric problems in finitely generated group, through a combinatorial study of universal covers of compact simplicial complexes. We show that, when estimating filling functions,…
Existence of solution of the logarithmic Minkowski problem is proved for the case where the discrete measures on the unit sphere satisfy the subspace concentration condition with respect to some special proper subspaces. In order to…
The algebraic approach to the Constraint Satisfaction Problem (CSP) uses high order symmetries of relational structures -- polymorphisms -- to study the complexity of the CSP. In this paper we further develop one of the methods the…
Existence and uniqueness in ${\Bbb R}^{n,1}$ of entire spacelike hypersurfaces contained in the future of the origin $O$ and asymptotic to the light-cone, with scalar curvature prescribed at their generic point $M$ as a negative function of…
We investigate the structure of the Minkowski sum of standard simplices in ${\reals}^r$. In particular, we investigate the one-dimensional structure, the vertices, their degrees and the edges in the Minkowski sum polytope.
In Euclidean space, the generalised Minkowski problem asks, for a given finite Radon measure $\mu$ on the unit sphere $\mathbb{S}^d$, to find a compact convex set $K$ with area measure $\mu$. For convex sets in the Minkowski space invariant…
In this paper we explore questions regarding the Minkowski sum of the boundaries of convex sets. Motivated by a question suggested to us by V.~Milman regarding the volume of $\partial K+ \partial T$ where $K$ and $T$ are convex bodies, we…
We present an analytical-numerical method providing robust upper estimates for the topological entropy or, more generally, uniform volume growth exponents of differentiable mappings. By introducing varying metrics, we simplify the analysis…
We develop a spectral approach to Sidorenko-type inequalities and apply it to establish sharp edge-spectral supersaturation results. Let $H$ be a bipartite graph with $v$ vertices and $e$ edges, where $v\le e$, and write $M(G)=2e(G)$. We…
For any bounded convex domain \Omega in R^N, we assign a positive finite Borel measure associated with the solution to a su-blinear elliptic equation in \Omega. We prove that this measure is weakly continuous in the sense of measure with…
We derive tight expressions for the maximum number of $k$-faces, $0\le k\le d-1$, of the Minkowski sum, $P_1+P_2+P_3$, of three $d$-dimensional convex polytopes $P_1$, $P_2$ and $P_3$, as a function of the number of vertices of the…
We prove a generalized isoperimetric inequality for a domain diffeomorphic to a sphere that replaces filling volume with $k$-dilation. Suppose $U$ is an open set in $\mathbb{R}^n$ diffeomorphic to a Euclidean $n$-ball. We show that in…
This paper studies regularity of perimiter quasiminimizing sets in metric measure spaces with a doubling measure and a Poincare inequality. The main result shows that the measure theoretic boundary of a quasiminimizing set coincides with…
We consider apictorial edge-matching puzzles, in which the goal is to arrange a collection of puzzle pieces with colored edges so that the colors match along the edges of adjacent pieces. We devise an algebraic representation for this…
In this paper, we compute a triangulation of certain faces of the submodular cone. More precisely, graphical zonotopes are generalized permutahedra, and hence their deformation cones are faces of the submodular cone. We give a triangulation…
This paper considers a class of multi-objective optimization problems known as Minkowski sum problems. Minkowski sum problems have a decomposable structure, where the global nondominated (Pareto) set corresponds to the Minkowski sum of…
We use an entropy based method to study two graph maximization problems. We upper bound the number of matchings of fixed size $\ell$ in a $d$-regular graph on $N$ vertices. For $\frac{2\ell}{N}$ bounded away from 0 and 1, the logarithm of…