中文
相关论文

相关论文: Parry order of Parry numbers

200 篇论文

An ordered set-partition (or preferential arrangement) of n labeled elements represents a single ``hierarchy''; these are enumerated by the ordered Bell numbers. In this note we determine the number of ``hierarchical orderings'' or…

组合数学 · 数学 2014-09-17 N. J. A. Sloane , Thomas Wieder

We show that, for $pn \to \infty$, the largest set in a $p$-random sub-family of the power set of $\{1, \ldots, n\}$ containing no $k$-chain has size $( k - 1 + o(1) ) p \binom{n}{n/2}$ with high probability. This confirms a conjecture of…

组合数学 · 数学 2015-11-13 Maurício Collares Neto , Robert Morris

A classical theorem of Baranyai states that, given integers $2\leq k < n$ such that $k$ divides $n$, one can find a family of ${n-1\choose k-1}$ partitions of $[n]$ into $k$-element subsets such that every subset appears in exactly one…

组合数学 · 数学 2024-10-14 Zoe Xi

A probabilistic characterization of the dominance partial order on the set of partitions is presented. This extends work in "Symmetric polynomials and symmetric mean inequalities". Electron. J. Combin., 20(3): Paper 34, 2013. Let $n$ be a…

组合数学 · 数学 2015-12-15 Clifford Smyth

For a family $\mathcal{F}$ of sets and a disjoint pair $A,B$ we let $\mathcal{F}(A,\overline{B})=\{F\in \mathcal{F}: A\subseteq F, ~B\cap F=\emptyset\}$. The \textbf{$(p,q)$-d\"omd\"od\"om} of a family $\mathcal{F}\subseteq 2^{[n]}$ is…

组合数学 · 数学 2025-01-14 Balázs Patkós

Suppose that $\alpha,\beta\in\mathbb{R}$. Let $\alpha\geqslant1$ and $c$ be a real number in the range $1<c< 12/11$. In this paper, it is proved that there exist infinitely many primes in the generalized Piatetski--Shapiro sequence, which…

数论 · 数学 2022-11-21 Jinjiang Li , Jinyun Qi , Min Zhang

The Renyi distribution ensuring the maximum of a Renyi entropy is investigated for a particular case of a power--law Hamiltonian. Both Lagrange parameters, $\alpha$ and $\beta$ can be excluded. It is found that $\beta$ does not depend on a…

统计力学 · 物理学 2009-11-10 A. G. Bashkirov

Let $P(x) \in \mathbb{Z}[x]$ be a polynomial. We give an easy and new proof of the fact that the set of primes $p$ such that $p \mid P(n)$, for some $n \in \mathbb{Z}$, is infinite. We also get analog of this result for some special…

历史与综述 · 数学 2022-02-03 Devendra Prasad

Let $\alpha$ be a Pisot number. Let $L(\alpha)$ be the largest positive number such that for some $\xi=\xi(\alpha)\in \mathbb R$ the limit points of the sequence of fractional parts $\{\xi \alpha^n\}_{n=1}^{\infty}$ all lie in the interval…

数论 · 数学 2014-11-17 Victoria Zhuravleva

Fix a positive real number $\theta$. The natural numbers $m$ with largest square-free divisor not exceeding $m^\theta$ form a set $\mathscr{A}$, say. It is shown that whenever $\theta>1/2$ then all large natural numbers $n$ are the sum of…

数论 · 数学 2023-06-23 Jörg Brüdern , Olivier Robert

We study some essential arithmetic properties of a new tree-based number representation, {\em hereditarily binary numbers}, defined by applying recursively run-length encoding of bijective base-2 digits. Our representation expresses giant…

数据结构与算法 · 计算机科学 2013-06-06 Paul Tarau

A new family of generalized Pell numbers was recently introduced and studied by Br\'od \cite{Dorota}. These number possess, as Fibonacci numbers, a Binet formula. Using this, partial sums of arbitrary powers of generalized Pell numbers can…

数论 · 数学 2020-10-28 Helmut Prodinger

For an integer $m >1$, we denote by $P(m)$ the largest prime divisor of $m$. We prove that $\limsup_{n \rightarrow +\infty} P(n!+1)/n \geqslant 1+9\log 2>7.238$, which improves a result of Stewart. More generally, for any nonzero polynomial…

数论 · 数学 2021-03-30 Li Lai

Let $La(n,P)$ be the maximum size of a family of subsets of $[n]=\{1,2,...,n\}$ not containing $P$ as a (weak) subposet. The diamond poset, denoted $B_{2}$, is defined on four elements $x,y,z,w$ with the relations $x<y,z$ and $y,z<w$.…

组合数学 · 数学 2017-11-27 Dániel Grósz , Abhishek Methuku , Casey Tompkins

We prove that a non-degenerate simple linear recurrence sequence $ (G_n(x))_{n=0}^{\infty} $ of polynomials satisfying some further conditions cannot contain arbitrary large powers of polynomials if the order of the sequence is at least…

数论 · 数学 2023-04-12 Clemens Fuchs , Sebastian Heintze

From known effective bounds on the prime counting function of the form \[ |\pi(x)-\mathrm{Li}(x)| < a \;x \;(\ln x)^{b} \; \exp\left(-{c}\; \sqrt{\ln x}\right); \qquad (x \geq x_0); \] it is possible to establish exponentially tight…

数论 · 数学 2025-06-17 Matt Visser

Fix $A$, a family of subsets of natural numbers, and let $G_A(n)$ be the maximum cardinality of a subset of $\{1,2,..., n\}$ that does not have any subset in $A$. We consider the general problem of giving upper bounds on $G_A(n)$ and give…

数论 · 数学 2015-06-16 Kevin O'Bryant

A classical theorem of Paley asserts the existence of an infinite family of quadratic characters whose character sums become exceptionally large. In this paper, we establish an analogous result for characters of any fixed even order.…

数论 · 数学 2012-05-18 Leo Goldmakher , Youness Lamzouri

An $integral$ of a group $G$ is a group $H$ whose derived group (commutator subgroup) is isomorphic to $G$. This paper discusses integrals of groups, and in particular questions about which groups have integrals and how big or small those…

群论 · 数学 2018-08-24 João Araújo , Peter J. Cameron , Carlo Casolo , Francesco Matucci

We present a novel conjecture concerning the additive representation of natural numbers using prime powers. Based on extensive computational verification, we conjecture that every integer n > 23 can be expressed as a sum of at most five…

综合数学 · 数学 2025-08-05 Julius Stricker