中文
相关论文

相关论文: On random sections of the cube

200 篇论文

We determine the asymptotic proportion of minimal automata, within n-state accessible deterministic complete automata over a k-letter alphabet, with the uniform distribution over the possible transition structures, and a binomial…

形式语言与自动机理论 · 计算机科学 2011-09-27 Frederique Bassino , Julien David , Andrea Sportiello

We obtain several asymptotic estimates for the sums of the restricted divisor function $$ \tau_{M,N}(k) = #\{1 \le m \le M, \ 1\le n \le N: mn = k\} $$ over short arithmetic progressions, which improve some results of J. Truelsen. Such…

数论 · 数学 2010-08-05 Igor E. Shparlinski

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

Given a finite set of points $S\subset\mathbb{R}^d$, a $k$-set of $S$ is a subset $A \subset S$ of size $k$ which can be strictly separated from $S \setminus A $ by a hyperplane. Similarly, a $k$-facet of a point set $S$ in general position…

度量几何 · 数学 2022-03-23 Brett Leroux , Luis Rademacher

We revisit a formula for the number of plane partitions due to Almkvist. Using the circle method, we provide modifications to his formula along with estimates of the errors. We show that the improved formula continues to be an asymptotic…

数论 · 数学 2014-07-30 Suresh Govindarajan , Naveen S. Prabhakar

Inspired by the works of Dewar, Murty and Kot\v{e}\v{s}ovec, we establish some useful theorems for asymptotic formulas. As an application, we obtain asymptotic formulas for the numbers of skew plane partitions and cylindric partitions. We…

组合数学 · 数学 2018-01-24 Guo-Niu Han , Huan Xiong

A well-known conjecture asserts that, for any given positive real number $\lambda$ and nonnegative integer $m$, the proportion of positive integers $n \le x$ for which the interval $(n,n + \lambda\log n]$ contains exactly $m$ primes is…

数论 · 数学 2015-08-04 Tristan Freiberg

Let s,t,m,n be positive integers such that sm=tn. Let M(m,s;n,t) be the number of m x n matrices over {0,1,2,...} with each row summing to s and each column summing to t. Equivalently, M(m,s;n,t) counts 2-way contingency tables of order m x…

组合数学 · 数学 2009-06-12 E. Rodney Canfield , Brendan D. McKay

Let K be a d-dimensional convex body, and let $K^{(n)}$ be the intersection of n halfspaces containing $K$ whose bounding hyperplanes are independent and identically distributed. Under suitable distributional assumptions, we prove an…

度量几何 · 数学 2014-10-15 Károly J. Böröczky , Ferenc Fodor , Daniel Hug

Geometric properties of $N$ random points distributed independently and uniformly on the unit sphere $\mathbb{S}^{d}\subset\mathbb{R}^{d+1}$ with respect to surface area measure are obtained and several related conjectures are posed. In…

We have for positive integers $n$, $k$ and finite field $\mathbb{F}_q$, $c(n,k,q)$, as the number of simultaneous similarity classes of $k$-tuples of commuting $n\times n$ matrices over the $\mathbb{F}_q$. In this paper, it has been shown…

组合数学 · 数学 2021-09-29 Uday Bhaskar Sharma

Given a random k-dimensional cross-section of a hypercube, what is its expected number of vertices? We show that, for a suitable distribution of random slices, the answer is $2^k$, independent of the dimension of the hypercube.

概率论 · 数学 2018-08-30 Hunter Swan

We give a short proof of the formula $n^p=\sum_{\ell=0}^{p-1} (-1)^{\ell} c_{p,\ell} F^{p-\ell}_n$, where $F^{p-\ell}_n$ is the figurate number and $c_{p,\ell}$ is the number of $(p-\ell)$-dimensional facets of $p$-dimensional simplices…

数论 · 数学 2020-04-10 Frantisek Marko

Let A be a nonempty finite set of relatively prime positive integers, and let p_A(n) denote the number of partitions of n with parts in A. An elementary arithmetic argument is used to obtain an asymptotic formula for p_A(n).

数论 · 数学 2016-12-30 Melvyn B. Nathanson

Let $\Z_m$ be the group of residue classes modulo $m$. Let $s(m,n)$ and $c(m,n)$ denote the total number of subgroups of the group $\Z_m \times \Z_n$ and the number of its cyclic subgroups, respectively, where $m$ and $n$ are arbitrary…

数论 · 数学 2014-02-26 Werner Georg Nowak , László Tóth

For each positive integer n greater than or equal to 2, a new approach to expressing real numbers as sequences of nonnegative integers is given. The n=2 case is equivalent to the standard continued fraction algorithm. For n=3, it reduces to…

数论 · 数学 2007-05-23 Thomas Garrity

Zaremba's conjecture concerns a formation of continued fraction expansions for rational numbers with partial quotient bounded by an absolute constant. We present asymptotic estimates for the size of $\epsilon$-thickening of certain fractal…

数论 · 数学 2026-04-24 Jungwon Lee

For a prime $p$ and an absolutely irreducible modulo $p$ polynomial $f(U,V) \in \Z[U,V]$ we obtain an asymptotic formulas for the number of solutions to the congruence $f(x,y) \equiv a \pmod p$ in positive integers $x \le X$, $y \le Y$,…

数论 · 数学 2007-05-23 I. E. Shparlinski , J. F. Voloch

We show that for every cubic graph G with sufficiently large girth there exists a probability distribution on edge-cuts of G such that each edge is in a randomly chosen cut with probability at least 0.88672. This implies that G contains an…

组合数学 · 数学 2013-04-03 Frantisek Kardos , Daniel Kral , Jan Volec

Let $k$ be a positive integer and $m$ be an integer. Garvan's $k$-rank $N_k(m,n)$ is the number of partitions of $n$ into at least $(k-1)$ successive Durfee squares with $k$-rank equal to $m$. In this paper give some asymptotics for…

数论 · 数学 2019-10-03 Nian Hong Zhou