相关论文: Elementary Proofs of Some Stirling Bounds

A collection of hyperplanes $\mathcal{H}$ slices all edges of the $n$-dimensional hypercube $Q_n$ with vertex set $\{-1,1\}^n$ if, for every edge $e$ in the hypercube, there exists a hyperplane in $\mathcal{H}$ intersecting $e$ in its…

Assuming Lang's conjectured lower bound on the heights of non-torsion points on an elliptic curve, we show that there exists an absolute constant C such that for any elliptic curve E/Q and non-torsion point P in E(Q), there is at most one…

We prove that a minimal $t$-fold blocking set in a finite projective plane of order $n$ has cardinality at most \[\frac{1}{2} n\sqrt{4tn - (3t + 1)(t - 1)} + \frac{1}{2} (t - 1)n + t.\] This is the first general upper bound on the size of…

Chung and Graham [J. London Math. Soc., 1983] claimed that there exists an $n$-vertex graph $G$ containing all $n$-vertex trees as subgraphs that has at most $\frac{5}{2}n \log_2 n + O(n)$ edges. We identify an error in their proof. This…

We make progress on a number of open problems concerning the area requirement for drawing trees on a grid. We prove that 1. every tree of size $n$ (with arbitrarily large degree) has a straight-line drawing with area $n2^{O(\sqrt{\log\log…

In the paper we present some new inversion formulas and two new formulas for Stirling numbers.

Let $t(N)$ denote the largest number such that $N!$ can be expressed as the product of $N$ integers greater than or equal to $t(N)$. The bound $t(N)/N = 1/e-o(1)$ was apparently established in unpublished work of Erd\H{o}s, Selfridge, and…

We give a simple unified proof for several disparate bounds on Thurston-Bennequin number for Legendrian knots and self-linking number for transverse knots in R^3, and provide a template for possible future bounds. As an application, we give…

We prove that every set of $n$ points in $\mathbb{R}^3$ spans $O(n^{295/197+\epsilon})$ unit distances. This is an improvement over the previous bound of $O(n^{3/2})$. A key ingredient in the proof is a new result for cutting circles in…

In this short note we prove two elegant generalized continued fraction formulae $$e= 2+\cfrac{1}{1+\cfrac{1}{2+\cfrac{2}{3+\cfrac{3}{4+\ddots}}}}$$ and $$e= 3+\cfrac{-1}{4+\cfrac{-2}{5+\cfrac{-3}{6+\cfrac{-4}{7+\ddots}}}}$$ using elementary…

Let $k$ be a positive integer. We compute depth and Stanley depth of the quotient ring of the edge ideal associated to the $k^{th}$ power of a path on $n$ vertices. We show that both depth and Stanley depth have the same values and can be…

Let $U\subset \mathbb{R}^n$ ($n\geq 3$) be an exterior Euclidean domain with smooth boundary $\partial U$. We consider the Steklov eigenvalue problem on $U$. First we derive a sharp lower bound for the first eigenvalue in terms of the…

Transcription into modern notations of the derivation by Stirling and De Moivre of an asymptotic series for $\log(n!)$, usually called Stirling's series. The previous discovery by Wallis of an infinite product for $\pi$, and later results…

We improve the lower bound on worst case trace reconstruction from $\Omega\left(\frac{n^{5/4}}{\sqrt{\log n}}\right)$ to $\Omega\left(\frac{n^{3/2}}{\log^{7} n}\right)$. As a consequence, we improve the lower bound on average case trace…

We prove six theorems concerning exponentially accurate semiclassical quantum mechanics. Two of these theorems are known results, but have new proofs. Under appropriate hypotheses, they conclude that the exact and approximate dynamics of an…

We obtain some new upper bounds on the maximum number $f(n)$ of edges in $n$-vertex graphs without containing cycles of length four. This leads to an asymptotically optimal bound on $f(n)$ for a broad range of integers $n$ as well as a…

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…

An approximate Steiner tree is a Steiner tree on a given set of terminals in Euclidean space such that the angles at the Steiner points are within a specified error e from 120 degrees.This notion arises in numerical approximations of…

Let $k$ and $n$ be positive integers, $n>k$. Define $r(n,k)$ to be the minimum positive value of $$ |\sqrt{a_1} + ... + \sqrt{a_k} - \sqrt{b_1} - >... -\sqrt{b_k} | $$ where $ a_1, a_2, ..., a_k, b_1, b_2, ..., b_k $ are positive integers…

Recent breakthroughs in quantum query complexity have shown that any formula of size n can be evaluated with O(sqrt(n)log(n)/log log(n)) many quantum queries in the bounded-error setting [FGG08, ACRSZ07, RS08b, Rei09]. In particular, this…