相关论文: On random sections of the cube

Let $({\mathcal{X}},g)$ be a closed Riemmanian manifold of dimension $n>0$. Let $\Delta$ be the Laplacian on ${\mathcal{X}}$, and let $(e\_k)\_k$ be an $L^2$-orthonormal and dense family of Laplace eigenfunctions with respective eigenvalues…

Let P_{n,m} denote the graph taken uniformly at random from the set of all planar graphs on {1,2,..., n} with exactly m(n) edges. We use counting arguments to investigate the probability that P_{n,m} will contain given components and…

We show that the size-Ramsey number of any cubic graph with $n$ vertices is $O(n^{8/5})$, improving a bound of $n^{5/3 + o(1)}$ due to Kohayakawa, R\"{o}dl, Schacht, and Szemer\'{e}di. The heart of the argument is to show that there is a…

A random 2-cell embedding of a given graph $G$ is obtained by choosing a random local rotation around every vertex. We analyze the expected number of faces of such an embedding, which is equivalent to studying its average genus. In 1991,…

Quadratic irrationals posses a periodic continued fraction expansion. Much less is known about cubic irrationals. We do not even know if the partial quotients are bounded, even though extensive computations suggest they might follow…

We present here a method which allows to derive a nontrivial lower bounds for the least common multiple of some finite sequences of integers. We obtain efficient lower bounds (which in a way are optimal) for the arithmetic progressions and…

An explicit upper bound is established for the least non-trivial integer zero of an arbitrary cubic form $C \in \mathbb{Z}[X_1,...,X_n],$ provided that $n \geq 14.$

Denote by $p(k)$ the limit, as $n \rightarrow \infty$, of the probability that a random permutation on a set of size $n$ has an invariant set of size $k$. We give an asymptotic formula for $p(k)$, showing that it is asymptotically…

We consider cubic forms $\phi_{a,b}(x,y,z) = ax^3 + by^3 - z^3$ with coefficients $a,b \in \mathbb{Z}$. We give an asymptotic formula for how many of these forms are locally soluble everywhere, i.e. we give an asymptotic formula for the…

We find the asymptotic number of connected graphs with $k$ vertices and $k-1+l$ edges when $k,l$ approach infinity, reproving a result of Bender, Canfield and McKay. We use the {\em probabilistic method}, analyzing breadth-first search on…

We solve the problem of counting elliptic curves with fixed j-invariant in projective space with tangency conditions. This is equivalent to couting rational nodal curves with condition on the node of the image. The solution is given in the…

In this paper we prove a new asymptotic lower bound for the minimal number of simplices in simplicial dissections of $n$-dimensional cubes. In particular we show that the number of simplices in dissections of $n$-cubes without additional…

This paper develops asymptotic methods to count faces of random high-dimensional polytopes. Beyond its intrinsic interest, our conclusions have surprising implications - in statistics, probability, information theory, and signal processing…

We prove a formula for the asymptotic number of edge-colored regular graphs with a prescribed set of allowed vertex-incidence structures. The formula depends on specific critical points of a polynomial encoding the vertex-incidences. As an…

Let $\mathcal{L}$ be a positive line bundle over a Riemann surface $\Sigma$ defined over $\mathbb{R}$. We prove that sections $s$ of $\mathcal{L}^d$, $d\gg 0$, whose number of real zeros $\#Z_s$ deviates from the expected one are rare. We…

The convex hull of N independent random points chosen on the boundary of a simple polytope in R^n is investigated. Asymptotic formulas for the expected number of vertices and facets, and for the expectation of the volume difference are…

We study the distribution of interior faces in uniformly random reduced $\mathfrak s \mathfrak l_3$ webs. Using Tymoczko's bijection between $3\times n$ standard Young tableaux and reduced webs, this problem can be reformulated in terms of…

For a real c \geq 1 and an integer n, let f(n,c) denote the maximum integer f so that every graph on n vertices contains an induced subgraph on at least f vertices in which the maximum degree is at most c times the minimum degree. Thus, in…

Let K be a compact convex body in Rd, let Kn be the convex hull of n points chosen uniformly and independently in K, and let fi(Kn) denote the number of i-dimensional faces of Kn. We show that for planar convex sets, E(f0(Kn)) is increasing…

A Fourier restriction estimate is obtained for a broad class of conic surfaces by adding a weight to the usual underlying measure. The new restriction estimate exhibits a certain affine-invariance and implies the sharp $L^p-L^q$ restriction…