中文
相关论文

相关论文: On random sections of the cube

200 篇论文

For integers $g,m \geq 0$ and $n>0$, let $S_{g}(n,m)$ denote the graph taken uniformly at random from the set of all graphs on $\{1,2, \ldots, n\}$ with exactly $m=m(n)$ edges and with genus at most $g$. We use counting arguments to…

组合数学 · 数学 2017-12-18 Chris Dowden , Mihyun Kang , Philipp Sprüssel

Drmota and Stufler proved recently that the expected number of pattern occurrences of a given map is asymptotically linear when the number of edges goes to infinity. In this paper we improve their result by means of a different method. Our…

组合数学 · 数学 2020-05-15 Guan-Ru Yu

Let $C_{n,g}$ be the number of rooted cubic maps with $2n$ vertices on the orientable surface of genus $g$. We show that the sequence $(C_{n,g}:g\ge 0)$ is asymptotically normal with mean and variance asymptotic to $(1/2)(n-\ln n)$ and…

组合数学 · 数学 2023-07-11 Zhicheng Gao

Several asymptotic expansions and formulas for cubic exponential sums are derived. The expansions are most useful when the cubic coefficient is in a restricted range. This generalizes previous results in the quadratic case and helps to…

数论 · 数学 2017-07-13 Ghaith A. Hiary

In this note, using entirely algebraic or elementary methods, we determine a new asymptotic lower bound for the number of odd values of one of the most important modular functions in number theory, the Klein $j$-function. Namely, we show…

数论 · 数学 2015-02-12 Fabrizio Zanello

Let $k \ge 3$ be a fixed integer. We exactly determine the asymptotic distribution of $\ln Z_k(G(n,m))$, where $Z_k(G(n,m))$ is the number of $k$-colourings of the random graph $G(n,m)$. A crucial observation to this aim is that the…

组合数学 · 数学 2016-09-15 Felicia Rassmann

We estimate from below the expected Betti numbers of real hypersurfaces taken at random in a smooth real projective n-dimensional manifold. These random hypersurfaces are chosen in the linear system of a large d-th power of a real ample…

辛几何 · 数学 2017-05-17 Damien Gayet , Jean-Yves Welschinger

We study the asymptotic behaviour of the trace (the sum of the diagonal parts) of a plane partition of the positive integer n, assuming that this parfition is chosen uniformly at random from the set of all such partitions.

组合数学 · 数学 2011-11-10 Ljuben Mutafchiev , Emil Kamenov

The main goal of this paper is to determine the asymptotic behavior of the number $X_n$ of cut-vertices in random planar maps with $n$ edges. It is shown that $X_n/n \to c$ in probability (for some explicit $c>0$). For so-called subcritical…

概率论 · 数学 2021-04-30 Michael Drmota , Marc Noy , Benedikt Stufler

Let $n, r, k$ be positive integers such that $3\leq k < n$ and $2\leq r \leq k-1$. Let $m(n, r, k)$ denote the maximum number of edges an $r$-uniform hypergraph on $n$ vertices can have under the condition that any collection of $i$ edges,…

离散数学 · 计算机科学 2012-10-05 Niranjan Balachandran , Srimanta Bhattacharya

Let $L_n(k)$ denote the least common multiple of $k$ independent random integers uniformly chosen in $\{1,2,\ldots ,n\}$. In this note, using a purely probabilistic approach, we derive a criterion for the convergence in distribution as…

概率论 · 数学 2019-11-11 Alin Bostan , Alexander Marynych , Kilian Raschel

Let $f$ be a normalized Hecke eigenform with rational integer Fourier coefficients. It is an interesting question to know how often an integer $n$ has a factor common with the $n$-th Fourier coefficient of $f$. The second author…

数论 · 数学 2014-03-20 Sanoli Gun , V. Kumar Murty

Let $\text{ac}(n,k)$ denote the smallest positive integer with the property that there exists an $n$-colouring $f$ of $\{1,\dots,\text{ac}(n,k)\}$ such that for every $k$-subset $R \subseteq \{1, \dots, n\}$ there exists an (arithmetic)…

组合数学 · 数学 2018-02-12 Leonardo Alese , Stefan Lendl , Paul Tabatabai

For any irreducible quadratic polynomial f(x) in Z[x] we obtain the estimate log l.c.m.(f(1),...,f(n))= n log n + Bn + o(n) where B is a constant depending on f.

数论 · 数学 2019-02-20 Javier Cilleruelo

We obtain an explicit formula for the variance of the number of $k$-peaks in a uniformly random permutation. This is then used to obtain an asymptotic formula for the variance of the length of longest $k$-alternating subsequence in random…

概率论 · 数学 2026-04-15 Recep Altar Çiçeksiz , Yunus Emre Demirci , Ümit Işlak

We use the convolution method for arithmetic functions of several variables to deduce an asymptotic formula for the number of $k$-tuples of positive integers with components which are pairwise non-coprime and $\le x$. More generally, we…

数论 · 数学 2024-12-09 László Tóth

Let $N$ be a fixed positive integer, and let $f\in S_k(N)$ be a primitive cusp form given by the Fourier expansion $f(z)=\sum_{n=1}^{\infty} \lambda_f(n)n^{\frac{k-1}{2}}e(nz)$. We consider the partial sum $S(x,f)=\sum_{n\leq…

The paper presents a discussion on the asymptotic formula for the number of plane partitions of a large positive integer.

组合数学 · 数学 2007-05-23 Ljuben Mutafchiev , Emil Kamenov

We estimate the deviation of the number of solutions of the congruence $$ m^2-n^2 \equiv c \pmod q, \qquad 1 \le m \le M, \ 1\le n \le N, $$ from its expected value on average over $c=1, ..., q$. This estimate is motivated by the recently…

数论 · 数学 2010-04-07 Igor Shparlinski

For all $n > k \ge 1$, we give formulas for the nullity $N(n,k)$ of the $n \times n$ skew-symmetric Toeplitz band matrix whose first $k$ superdiagonals have all entries $1$ and whose remaining superdiagonals have all entries $0$. This is…

组合数学 · 数学 2020-02-10 Ron Evans , John Greene , Mark Van Veen