中文
相关论文

相关论文: Elementary Proofs of Some Stirling Bounds

200 篇论文

In this paper we present an explicit counterexample of degree $n=7$, which shows that the conjecture proposed by Li et al. \cite{Li2013} regarding the first derivative bounds for rational B\'ezier curves is generally false. We further…

数值分析 · 数学 2026-03-03 Mao Shi

In 1975, P. Erd\"{o}s proposed the problem of determining the maximum number $f(n)$ of edges in a graph of $n$ vertices in which any two cycles are of different lengths. In this paper, it is proved that $$f(n)\geq n+32t-1$$ for…

组合数学 · 数学 2007-05-23 Chunhui Lai

Let $q$ be an odd power of a prime $p$, and $S \subset \mathbb{F}_q^*$ such that $S=-S$ and $S/S \neq \mathbb{F}_q^*$. We show that the clique number of the Cayley graph $\operatorname{Cay}(\mathbb{F}_q^+,S)$ is at most…

组合数学 · 数学 2025-11-26 Chi Hoi Yip

Dirac's theorem determines the sharp minimum degree threshold for graphs to contain perfect matchings and Hamiltonian cycles. There have been various attempts to generalize this theorem to hypergraphs with larger uniformity by considering…

组合数学 · 数学 2025-03-27 Hyunwoo Lee

Let $E$ be an elliptic surface over the curve $C$, defined over a number field $k$, let $P$ be a section of $E$, and let $\ell$ be a rational prime. For any non-singular fibre $E_t$, we bound the number of points $Q$ on $E_t$ of (algebraic)…

数论 · 数学 2008-12-10 Patrick Ingram

We prove that the number of unit distances among $n$ planar points is at most $1.94\cdot n^{4/3}$, improving on the previous best bound of $8n^{4/3}$. We also give better upper and lower bounds for several small values of $n$. We also prove…

组合数学 · 数学 2021-12-16 Péter Ágoston , Dömötör Pálvölgyi

In Combinatorics Stirling numbers may be defined in several ways. One such definition is given in [1], where an extensive consideration of Stirling numbers is presented. In this paper an alternative definition of Stirling numbers of both…

组合数学 · 数学 2008-06-17 Milan Janjic

In this paper, we prove Erd\H{o}s distance conjecture in $\mathbb{R}^d$, namely, a set of $n$ points in $\mathbb{R}^2$ determines $\Omega(\frac{n}{\sqrt{\log n}})$ distances, and for $d\ge 3$, a set of $n$ points in $\mathbb{R}^d$…

组合数学 · 数学 2020-02-13 Esen Aksoy Yazici

Two topics of the number theory are discussed in this paper. First, we prove that given each natural number $x\geq10^{3}$, we have \[ |{\rm Li}(x)-\pi(x)|\leq c\sqrt{x}\log x\texttt{ and } \pi(x)={\rm Li}(x)+O(\sqrt{x}\log x) \] where $c$…

综合数学 · 数学 2025-04-02 Shan-Guang Tan

We investigate a variant of Wirsing's problem on approximation to a real number by real algebraic numbers of degree exactly $n$. This has been studied by Bugeaud and Teulie. We improve their bounds for degrees up to $n=7$. Moreover, we…

数论 · 数学 2024-09-11 Johannes Schleischitz

Let $p_n$ be the $n$th prime, and consider the sequence $s_n = (2\cdot3\cdots p_n)^{1/n} = (p_n\#)^{1/n}$, the geometric mean of the first $n$ primes. We give a short proof that $p_n/s_n \to e$, a result conjectured by Vrba (2010) and…

数论 · 数学 2016-03-03 Alexei Kourbatov

In this paper, we use our previous study of the higher order Bernoulli numbers $B_n^{(l)}$ to investigate the $p$-adic properties of the Stirling numbers of the second kind $S(n,k)$. For example, we give a new, greatly simplified proof of…

数论 · 数学 2018-05-04 Arnold Adelberg

We find explicit formulae for the circular spectral measures of $E_7,E_8$. This leads to a number of general observations regarding the ADE circular measures: these are linear combinations of measures supported by the roots of unity, with…

量子代数 · 数学 2009-03-29 Teodor Banica

In this paper we rederive an old upper bound on the number of halving edges present in the halving graph of an arbitrary set of $n$ points in 2-dimensions which are placed in general position. We provide a different analysis of an identity…

计算几何 · 计算机科学 2018-02-13 Pintu Chauhan , Manjish Pal , Napendra Solanki

We derive and implement a new way to find lower bounds on the smallest limiting trace-to-degree ratio of totally positive algebraic integers and improve the previously best known bound to 1.80203. Our method adds new constraints to Smyth's…

We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.

组合数学 · 数学 2022-10-11 Lewis Stanton , Jeffrey Thompson

For a real constant $\alpha$, let $\pi_3^\alpha(G)$ be the minimum of twice the number of $K_2$'s plus $\alpha$ times the number of $K_3$'s over all edge decompositions of $G$ into copies of $K_2$ and $K_3$, where $K_r$ denotes the complete…

Given an elliptic curve $E$ over a finite field $\mathbb{F}_q$ we study the finite extensions $\mathbb{F}_{q^n}$ of $\mathbb{F}_q$ such that the number of $\mathbb{F}_{q^n}$-rational points on $E$ attains the Hasse upper bound. We obtain an…

数论 · 数学 2017-09-06 Ane Anema

A formula on Stirling numbers of the second kind $S(n, k)$ is proved. As a corollary, for odd $n$ and even $k$, it is shown that $k!S(n, k)$ is a positive multiple of the greatest common divisor of $j!S(n, j)$ for $k+1\leq j\leq n$. Also,…

组合数学 · 数学 2019-06-21 Osamu Nishimura

For two collections of nonnegative and suitably normalised weights $\W=(\W_j)$ and $\V=(\V_{n,k})$, a probability distribution on the set of partitions of the set $\{1,...,n\}$ is defined by assigning to a generic partition $\{A_j, j\leq…

概率论 · 数学 2007-05-23 Alexander Gnedin , Jim Pitman