相关论文: The first Cheeger constant of a simplex

For a $k$-uniform hypergraph $H$, let $\delta_1(H)$ denote the minimum vertex degree of $H$, and $\nu(H)$ denote the size of the largest matching in $H$. In this paper, we show that for any $k\geq 3$ and $\beta>0$, there exists an integer…

In this paper we consider the generalization of the Cheeger problem which comes by considering the ratio between the perimeter and a certain power of the volume. This generalization has been already sometimes treated, but some of the main…

This paper aims to show that there exists a triangulation of the Heisenberg group $\mathbb{H}^n$ into singular simplexes with regularity properties on both the low-dimensional and high-dimensional layers. For low dimensions, we request our…

The graph Cheeger constant and Cheeger inequalities are generalized to the case of hypergraphs whose edges have the same cardinality. In particular, it is shown that the second largest eigenvalue of the generalized normalized Laplacian is…

Cheeger-type inequalities in which the decomposability of a graph and the spectral gap of its Laplacian mutually control each other play an important role in graph theory and network analysis, in particular in the context of expander…

We conjecture that finite graphs with positive Cheeger constant admit a spanning subgraph with positive Cheeger constant and girth proportional to the diameter. We prove this conjecture for regular expander graphs with large expansion. Our…

We establish $C^{1,1}$-regularity and uniqueness of the first eigenfunction of the complex Hessian operator on strongly $m$-pseudoconvex manifolds, along with a variational formula for the first eigenvalue. From these results, we derive a…

Cheeger inequality is a classical result emerging from the isoperimetric problem in the field of geometry. In the graph theory, a discrete version of Cheeger inequality was also studied deeply and the notion was further extended for higher…

We obtain a new upper bound for $\sum_{h\le H}\Delta_k(N,h)$ for $1\le H\le N$, $k\in \N$, $k\ge3$, where $\Delta_k(N,h)$ is the (expected) error term in the asymptotic formula for $\sum_{N < n\le2N}d_k(n)d_k(n+h)$, and $d_k(n)$ is the…

We show that the diameter of a uniformly drawn spanning tree of a simple connected graph on $n$ vertices with minimal degree linear in $n$ is typically of order $\sqrt{n}$. A byproduct of our proof, which is of independent interest, is that…

The analysis of regularities and randomness in the distribution of prime numbers remains at the research frontiers for many generations of mathematicians from different groups and topical fields. In 2019 D. Fridman et al. (Am. Math. Mon.…

A simple graph more often than not contains adjacent vertices with equal degrees. This in particular holds for all pairs of neighbours in regular graphs, while a lot such pairs can be expected e.g. in many random models. Is there a…

This is Part 2 in a series of papers about the growth of regular partitions in hereditary properties $3$-uniform hypergraphs. The focus of this paper is the notion of weak hypergraph regularity, first developed by Chung, Chung-Graham, and…

We investigate simplicial complexes deterministically growing from a single vertex. In the first step, a vertex and an edge connecting it to the primordial vertex are added. The resulting simplicial complex has a 1-dimensional simplex and…

Neither the Euler-Mascheroni constant, $\gamma=0.577215...$, nor the Euler-Gompertz constant, $\delta=0.596347...$, is currently known to be irrational. However, it has been proved that at least one of them is transcendental. The two…

We show that for the regular n-simplex, the 1-codimensional central slice that's parallel to a facet will achieve the minimum area (up to a 1-o(1) factor) among all 1-codimensional central slices, thus improving the previous best known…

It is a well-known result due to Bollobas that the maximal Cheeger constant of large $d$-regular graphs cannot be close to the Cheeger constant of the $d$-regular tree. We prove analogously that the Cheeger constant of closed hyperbolic…

This Thesis aims to highlight some isoperimetric questions involving the, so-called, $N$-clusters. We first briefly recall the theoretical framework we are adopting. This is done in Chapter one. In chapter two we focus on the standard…

Recently, A. I. Aptekarev and his collaborators found a sequence of rational approximations to Euler's constant $\gamma$ defined by a third-order homogeneous linear recurrence. In this paper, we give a new interpretation of Aptekarev's…

In this paper, we introduce the concept of spanning simplicial complexes $\Delta_s(G)$ associated to a simple finite connected graph G. We give the characterization of all spanning trees of the uni-cyclic graph $U_{n,m}$. In particular, we…