中文
相关论文

相关论文: Creative proofs in combinations

200 篇论文

We extend the notion of combinatorial discrepancy to \emph{non-additive} functions. Our main result is an upper bound of $O(\sqrt{n \log(nk)})$ on the non-additive $k$-color discrepancy when $k$ is a prime power. We demonstrate two…

计算机科学与博弈论 · 计算机科学 2025-09-23 Max Dupre la Tour , Kaito Fujii

We study Fibonacci compositions, which are compositions of natural numbers that only use Fibonacci numbers, in two different contexts. We first prove inequalities comparing the number of Fibonacci compositions to regular compositions where…

数论 · 数学 2022-11-29 Joshua M. Siktar

We identify a surprising inequality satisfied by elementary symmetric polynomials under the action of the fixed point measure of a random permutation. Concretely, for any collection of $n$ non-negative real numbers $a_1, \dots, a_n \in…

组合数学 · 数学 2025-05-20 Ayush Khaitan , Ishan Mata , Bhargav Narayanan

A positive integer $n$ is called a $\theta$-congruent number if there is a triangle with sides $a,b$ and $c$ for which the angle between $a$ and $b$ is equal to $\theta$ and its area is $n\sqrt{r^2 - s^2}$, where $0 < \theta < \pi$, $\cos…

数论 · 数学 2023-08-29 Jerome T. Dimabayao , Soma Purkait

The document tries to put focus on sequences with certain properties and periods leading to the first value smaller than the starting value in the Collatz problem. With the idea that, if all starting numbers lead ultimately to a smaller…

综合数学 · 数学 2025-02-14 J. Stöckl

We prove some results concerning the distribution of primes on the Riemann hypothesis. First, we prove the explicit result that there exists a prime in the interval $(x-\frac{4}{\pi} \sqrt{x} \log x,x]$ for all $x \geq 2$; this improves a…

数论 · 数学 2014-05-22 Adrian Dudek

We prove an asymptotic for the number of additive triples of bijections $\{1,\dots,n\}\to\mathbb{Z}/n\mathbb{Z}$, that is, the number of pairs of bijections $\pi_1,\pi_2\colon \{1,\dots,n\}\to\mathbb{Z}/n\mathbb{Z}$ such that the pointwise…

组合数学 · 数学 2023-04-19 Sean Eberhard , Freddie Manners , Rudi Mrazović

We explain how the identity $$\sum_{i+j=n}\binom{2i}{i}\binom{2j}{j}\;=\;\displaystyle4^n$$ is an easy consequence of the inclusion-exclusion principle.

组合数学 · 数学 2013-07-26 Rui Duarte , António Guedes de Oliveira

We establish supercongruences for two kinds of Ap\'ery-like numbers, which involve Bernoulli numbers and Bernoulli polynomials. Conjectural supercongruences of the same type for another four kinds of Ap\'ery-like numbers are also proposed.

数论 · 数学 2024-05-16 Ji-Cai Liu

In this letter, we prove an inequality involving alternating binomial logarithmic sums by exploiting the variance of the logarithm of the maximum of independent and identically distributed exponential random variables. This inequality was…

概率论 · 数学 2026-03-13 Aristides V. Doumas

Let $A\subseteq [N]$ be such that for any pair of distinct subsets $B,C\subset A$, the products $\prod_{b\in B}b$ and $\prod_{c\in C}c$ are distinct. We prove that $|A|\leq \pi(N)+\pi(N^{1/2})+o(\pi(N^{1/2}))$, where $\pi$ is the prime…

组合数学 · 数学 2026-03-02 Rushil Raghavan

Many proofs in discrete mathematics and theoretical computer science are based on the probabilistic method. To prove the existence of a good object, we pick a random object and show that it is bad with low probability. This method is…

信息论 · 计算机科学 2017-08-01 Pat Morin , Wolfgang Mulzer , Tommy Reddad

We give an upper bound for the exponential $\sum_{m=1}^M \exp( 2i\pi f (m))$ in terms of $M$ and $\lambda$, where $\lambda$ is a small positive number which denotes the size of the fourth derivative of the real valued function $f$. The…

数论 · 数学 2023-07-10 O Robert , P Sargos

Symmetry is an important problem in many combinatorial problems. One way of dealing with symmetry is to add constraints that eliminate symmetric solutions. We survey recent results in this area, focusing especially on two common and useful…

人工智能 · 计算机科学 2012-04-18 Toby Walsh

Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…

逻辑 · 数学 2017-05-22 Pavel Pudlak

Prime numbers are one of the most intriguing figures in mathematics. Despite centuries of research, many questions remain still unsolved. In recent years, computer simulations are playing a fundamental role in the study of an immense…

历史与综述 · 数学 2020-02-04 Alberto Fraile , Roberto Martinez , Daniel Fernandez

Let $\bar{a}_s(n)$ denote the number of partitions of $n$, wherein each odd part is multicolored (atmost $s\ge 1$ colors) and the first appearance of parts may be overlined. In this paper, we establish new families of congruences modulo…

数论 · 数学 2026-05-21 M. P. Thejitha , S. N. Fathima

Using the log-convexity of the Gamma function and Euler's reflection formula, we give a new proof of a classical weighted sine product inequality. Two different parameter choices yield two competing upper bounds for the same product. We…

综合数学 · 数学 2026-04-16 Augustine L. Mahu , Benoît F. Sehba , Cecilia D. Williams

In this work, we prove the irrationality of $\pi$ based on the nested radicals with roots of $2$ of kind $c_k = \sqrt{2 + c_{k - 1}}$ and $c_0 = 0$. Sample computations showing how the rational approximation tends to $\pi$ with increasing…

Let $N_k(n,r,\boldsymbol{a})$ denote the number of incongruent solutions of the quadratic congruence $a_1x_1^2+\ldots+a_kx_k^2\equiv n$ (mod $r$), where $\boldsymbol{a}=(a_1,\ldots,a_k)\in {\Bbb Z}^k$, $n\in {\Bbb Z}$, $r\in {\Bbb N}$. We…

数论 · 数学 2014-11-21 László Tóth