Related papers: The Edge-Isoperimetric Problem in $(\mathbb{N}^2,\…
We revisit the interplay between the mass, the center of mass and the large scale behavior of certain isoperimetric quotients in the setting of asymptotically flat $3$-manifolds (both without and with a non-compact boundary). In the…
The edge isoperimetric inequality in the discrete cube specifies, for each pair of integers $m$ and $n$, the minimum size $g_n(m)$ of the edge boundary of an $m$-element subset of $\{0,1\}^{n}$; the extremal families (up to automorphisms of…
Let X be a Hadamard manifold and $\Gamma$ a discrete group of isometries of X which contains an axial isometry without invariant flat half plane. We study the behavior of conformal densities on the geometric limit set of $\Gamma$ in order…
While the shape equations describing the equilibrium of an unstretchable thin sheet that is free to bend are known, the boundary conditions that supplement these equations on free edges have remained elusive. Intuitively, unstretchability…
Intrinsic nonlinear elasticity deals with the deformations of elastic bodies as isometric immersions of Riemannian manifolds into the Euclidean spaces (see Ciarlet [9,10]). In this paper, we study the rigidity and continuity properties of…
The number of embeddings of minimally rigid graphs in $\mathbb{R}^D$ is (by definition) finite, modulo rigid transformations, for every generic choice of edge lengths. Even though various approaches have been proposed to compute it, the gap…
An independent vertex set of a graph is a set of vertices of the graph in which no two vertices are adjacent, and a maximal independent set is one that is not a proper subset of any other independent set. In this paper we count the number…
Asymptotic properties of random regular graphs are object of extensive study in mathematics. In this note we argue, based on theory of spin glasses, that in random regular graphs the maximum cut size asymptotically equals the number of…
We examine diagonal combs, a recently identified class of infinite metric graphs whose properties depend on one parameter. These graphs exhibit a fascinating regime where they possess infinite volume while maintaining purely discrete…
This paper discusses the graph covering problem in which a set of edges in an edge- and node-weighted graph is chosen to satisfy some covering constraints while minimizing the sum of the weights. In this problem, because of the large…
We characterize some asymptotic properties of edge exchangeable random graphs in terms of the measure used to generate them. In particular, we give a necessary and sufficient condition for eventual forever connectedness, a sufficient…
Kahn and Kim (J. Comput. Sci., 1995) have shown that for a finite poset $P$, the entropy of the incomparability graph of $P$ (normalized by multiplying by the order of $P$) and the base-$2$ logarithm of the number of linear extensions of…
We present a ${\Gamma}$-convergence approximation for the total anisotropic length of a partition. This theoretical result gives rise to a numerical method which allows the study of minimal partitions with respect to different anisotropies.…
This is a preliminary study of the equation of motion of Euclidean classical gravity on a graph, based on the Lin-Lu-Yau Ricci curvature on graphs. We observe that the constant edge weights configuration gives the unique solution on an…
The discrete isoperimetric inequality states that among all n -gons with a fixed area, the regular n -gon has the least perimeter. We prove analogues of the discrete isoperimetric inequality (involving circumradius or inradius) for cyclic…
We show that a non-empty subset of an abelian group with a small edge boundary must be large; in particular, if $A$ and $S$ are finite, non-empty subsets of an abelian group such that $S$ is independent, and the edge boundary of $A$ with…
We introduce the graph theoretical parameter of edge treewidth. This parameter occurs in a natural way as the tree-like analogue of cutwidth or, alternatively, as an edge-analogue of treewidth. We study the combinatorial properties of…
We study small perturbations of the Dirichlet problems for second order elliptic equations that degenerate on the boundary. The limit of the solution, as the perturbation tends to zero, is calculated. The result is based on a certain…
We present a simple nonadaptive randomized algorithm that estimates the number of edges in a simple, unweighted, undirected graph, possibly containing isolated vertices, using only degree and random edge queries. For an $n$-vertex graph,…
We solve a class of isoperimetric problems on $\mathbb{R}^2_+ :=\left\{ (x,y)\in \mathbb{R} ^2 : y>0 \right\}$ with respect to monomial weights. Let $\alpha $ and $\beta $ be real numbers such that $0\le \alpha <\beta+1$, $\beta\le 2…