中文
相关论文

相关论文: On random sections of the cube

200 篇论文

Assuming that a plane partition of the positive integer $n$ is chosen uniformly at random from the set of all such partitions, we propose a general asymptotic scheme for the computation of expectations of various plane partition statistics…

组合数学 · 数学 2017-07-18 Ljuben Mutafchiev

Let $F_n$ be the $n$th Fibonacci number. Let $m, n$ be positive integers. Define a sequence $(G(k,n,m))_{k\geq 1}$ by $G(1,n,m) = F^m_n$, and $G(k+1,n,m) = F_{nG(k,n,m)}$ for all $k\geq 1$. We show that $F_n^{k+m-1}\mid G(k,n,m)$ for all…

数论 · 数学 2014-05-29 Kritkajohn Onphaeng , Prapanpong Pongsriiam

We prove that a suitable asymptotic formula for the average number of representations of integers $n=p_{1}^{3}+p_{2}^{3}+p_{3}^{3}+p_{4}^{3}$, where $p_1,p_2,p_3,p_4$ are prime numbers, holds in intervals shorter than the the ones…

数论 · 数学 2019-09-16 Alessandro Languasco , Alessandro Zaccagnini

We derive the asymptotic formula for $p_n(N,M)$, the number of partitions of integer $n$ with part size at most $N$ and length at most $M$. We consider both $N$ and $M$ are comparable to $\sqrt{n}$. This is an extension of the classical…

组合数学 · 数学 2019-03-14 Tiefeng Jiang , Ke Wang

In this paper we present a new formula for the number of unrestricted partitions of $n$. We do this by introducing a correspondence between the number of unrestrited partitions of $n$ and the number of non-negative solutions of systems of…

组合数学 · 数学 2019-06-27 Hemar Godinho , José Plínio O. Santos

Let $\mathcal{A}=(a_n)_{n\in\mathbb{N}_+}$ be a sequence of positive integers. Let $p_\mathcal{A}(n,k)$ denote the number of multi-color partitions of $n$ into parts in $\{a_1,\ldots,a_k\}$. We examine several arithmetic properties of the…

数论 · 数学 2021-04-12 Krystian Gajdzica

In this paper we present three different results dealing with the number of $(\leq k)$-facets of a set of points: 1. We give structural properties of sets in the plane that achieve the optimal lower bound $3\binom{k+2}{2}$ of $(\leq…

组合数学 · 数学 2020-07-21 Oswin Aichholzer , Jesús García , David Orden , Pedro Ramos

Clemm and Trebat-Leder (2014) proved that the number of quadratic number fields with absolute discriminant bounded by $x$ over which there exist elliptic curves with good reduction everywhere and rational $j$-invariant is $\gg…

数论 · 数学 2023-02-15 Benjamin Matschke , Abhijit S. Mudigonda

We study the probabilistic existence of point configurations satisfying the $(0, m, d)$-net property in base $b$ within a randomly generated point set of size $N$ in the $d$-dimensional unit cube. We first derive an upper bound on the…

组合数学 · 数学 2026-02-19 Kohei Suzuki , Takashi Goda

In this note we study asymptotic isotopy of random real algebraic plane curves. More precisely, we obtain a Kac-Rice type formula that gives the expected number of two-sided components (i.e.\ ovals) of a random real algebraic plane curve…

代数几何 · 数学 2026-04-22 Turgay Bayraktar , Ali Ulaş Özgür Kişisel

For two sets $A$ and $M$ of positive integers and for a positive integer $n$, let $p(n,A,M)$ denote the number of partitions of $n$ with parts in $A$ and multiplicities in $M$, that is, the number of representations of $n$ in the form…

组合数学 · 数学 2012-07-16 Noga Alon

This paper is devoted to studying the numbers $L_{c,m,n} := \mathrm{lcm}\{m^2+c ,(m+1)^2+c , \dots , n^2+c\}$, where $c,m,n$ are positive integers such that $m \leq n$. Precisely, we prove that $L_{c,m,n}$ is a multiple of the rational…

数论 · 数学 2020-01-13 Sid Ali Bousla , Bakir Farhi

We study the generalized Ramsey numbers $f(Q_n, C_{k}, q)$, that is, the minimum number of colors needed to edge-color the hypercube $Q_n$ so that every copy of the cycle $C_{k}$ has at least $q$ colors. Our main result is that for any…

组合数学 · 数学 2026-01-23 Emily Heath , Coy Schwieder , Shira Zerbib

Let p(n, k) denote the number of partitions of n into parts less than or equal to k. We show several properties of this function modulo 2. First, we prove that for fixed positive integers k and m, p(n,k) is periodic modulo m. Using this, we…

组合数学 · 数学 2018-11-21 Kedar Karhadkar

Let N(n, t) be the minimal number of points in a spherical t-design on the unit sphere S^n in R^{n+1}. For each n >= 3, we prove a new asymptotic upper bound N(n, t) <= C(n)t^{a_n}, where C(n) is a constant depending only on n, a_3 <= 4,…

数值分析 · 数学 2008-11-04 Andriy V. Bondarenko , Maryna S. Viazovska

We study two types of probability measures on the set of integer partitions of $n$ with at most $m$ parts. The first one chooses the random partition with a chance related to its largest part only. We then obtain the limiting distributions…

概率论 · 数学 2023-01-03 Tiefeng Jiang , Ke Wang

We give sharp sectional curvature estimates for complete immersed cylindrically bounded $m$-submanifolds $\phi:M\to N\times\mathbb{R}^{\ell}$, $n+\ell\leq 2m-1$ provided that either $\phi$ is proper with the second fundamental form with…

微分几何 · 数学 2011-09-30 Luis J. Alias , G. Pacelli Bessa , J. Fabio Montenegro

In this paper, we obtain asymptotic formulas for $k$-crank of $k$-colored partitions. Let $M_k(a, c; n)$ denote the number of $k$-colored partitions of $n$ with a $k$-crank congruent to $a$ mod $c$. For the cases $k=2,3,4$, Fu and Tang…

组合数学 · 数学 2023-04-14 Helen W. J. Zhang , Ying Zhong

The number of faces of the convex hull of $n$ independent and identically distributed random points chosen on the boundary of a smooth convex body in $\mathbb{R}^d$ is investigated. In dimensions two and three the number of $k$-faces is…

概率论 · 数学 2025-09-25 Matthias Reitzner , Mathias Sonnleitner

Let $b^{k}_{\ell,m}(n)$ denotes the number of $k-$colored partitions of $n$ into parts that are not multiples of $\ell$ or $m$. We establish several congruence relations for $b_{\ell,m}(n)$. For instance, for any nonnegative integer $n$…

组合数学 · 数学 2025-05-20 Yashas N. , C. Shivashankar , S. Chandankumar