中文
相关论文

相关论文: Creative proofs in combinations

200 篇论文

A number of sharp inequalities are proved for the space ${\mathcal P}\left(^2D\left(\frac{\pi}{4}\right)\right)$ of 2-homogeneous polynomials on ${\mathbb R}^2$ endowed with the supremum norm on the sector…

Many classical identities arise from nothing more mysterious than looking at the same object in two different ways. A number, a function, or a combinatorial object may admit several natural decompositions, and by disassembling it in one way…

综合数学 · 数学 2026-04-14 Nikita Kalinin , Takao Komatsu

This paper presents a proof of the following conjecture, stated by Nishizawa in [Appl. Math. Comput. 269, (2015), 146--154.]: for $\displaystyle 0<x<\pi/2$ the inequality $ \displaystyle \frac{\sin{x}}{x} \!>\! \left(\frac{2}{\pi} +…

经典分析与常微分方程 · 数学 2019-10-15 Branko Malesevic , Tatjana Lutovac , Bojan Banjac

We consider representing of natural numbers by arithmetical expressions using ones, addition, multiplication and parentheses. The (integer) complexity of n -- denoted by ||n|| -- is defined as the number of ones in the shortest expressions…

We use techniques of Bannai and Sloane to give a new proof that there is a unique (22,891,1/4) spherical code; this result is implicit in a recent paper by Cuypers. We also correct a minor error in the uniqueness proof given by Bannai and…

度量几何 · 数学 2007-06-14 Henry Cohn , Abhinav Kumar

In this paper we present the Creative Invention Benchmark (CrIB), a 2000-problem benchmark for evaluating a particular facet of computational creativity. Specifically, we address combinational p-creativity, the creativity at play when…

人工智能 · 计算机科学 2018-05-11 Matthew Guzdial , Nicholas Liao , Vishwa Shah , Mark O. Riedl

Under what circumstances might every extension of a combinatorial structure contain more copies of another one than the original did? This property, which we call prolificity, holds universally in some cases (e.g., finite linear orders) and…

离散数学 · 计算机科学 2023-06-22 Murray Tannock , Michael Albert

In this work, we obtain an iterative formula that can be used for computing digits of $\pi$ and nested radicals of kind $c_n/\sqrt{2 - c_{n - 1}}$, where $c_0 = 0$ and $c_n = \sqrt{2 + c_{n - 1}}$. We also show how with the help of this…

Let ${\mathcal{P}_{n}}$ denote the set of positive integers which are prime to $n$. Let $B_{n}$ be the $n$-th Bernoulli number. For any prime $p \ge 11$ and integer $r\ge 2$, we prove that $$ \sum\limits_{\begin{smallmatrix}…

数论 · 数学 2016-01-28 Liuquan Wang

The long-standing Gaussian product inequality (GPI) conjecture states that $E [\prod_{j=1}^{n}X_j^{2m_j}]\geq\prod_{j=1}^{n}E[X_j^{2m_j}]$ for any centered Gaussian random vector $(X_1,\dots,X_n)$ and $m_1,\dots,m_n\in\mathbb{N}$. In this…

概率论 · 数学 2022-10-17 Oliver Russell , Wei Sun

A recent heuristic argument based on basic concepts in spectral analysis showed that the twin prime conjecture and a few other related primes counting problems are valid. A rigorous version of the spectral method, and a proof for the…

综合数学 · 数学 2017-10-24 N. A. Carella

We consider representing of natural numbers by expressions using 1's, addition, multiplication and parentheses. $\left\| n \right\|$ denotes the minimum number of 1's in the expressions representing $n$. The logarithmic complexity $\left\|…

We show that whenever $s>k(k+1)$, then for any complex sequence $(\mathfrak a_n)_{n\in \mathbb Z}$, one has $$\int_{[0,1)^k}\left| \sum_{|n|\le N}\mathfrak a_ne(\alpha_1n+\ldots +\alpha_kn^k) \right|^{2s}\,{\rm d}{\mathbf \alpha}\ll…

经典分析与常微分方程 · 数学 2024-07-01 Trevor D. Wooley

Variational problems under uniform quasiconvex constraints on the gradient are studied. In particular, existence of solutions to such problems is proved as well as existence of lagrange multipliers associated to the uniform constraint. They…

最优化与控制 · 数学 2014-05-30 Felipe Alvarez , Salvador Flores

We exploit some properties of the Hurwitz zeta function $\zeta (n,x)$ in order to study sums of the form $\frac{1}{\pi ^{n}}\sum_{j=-\infty}^{\infty}1/(jk+l)^{n}$ and $\frac{1}{\pi ^{n}}\sum_{j=-\infty}^{\infty}(-1)^{j}/(jk+l)^{n}$ for $%…

数论 · 数学 2014-12-09 Paweł J. Szabłowski

In this paper we study a family of polynomials $$S_n^{(m)}(x):=\sum_{i,j=0}^n\binom ni^m\binom nj^m\binom{i+j}ix^{i+j}\ \ (m,n=0,1,2,\ldots).$$ For example, we show that $$\sum_{k=0}^{p-1}S_k^{(0)}(x)\equiv\frac…

数论 · 数学 2026-02-11 Zhi-Wei Sun

In this paper, we pose lots of challenging conjectures on congruences for the sums involving binomial coefficients and Ap\'ery-like numbers modulo $p^3$, where $p$ is an odd prime.

数论 · 数学 2021-12-07 Zhi-Hong Sun

Using techniques from calculus, we combine classical identities for $\pi$, $\operatorname{ln}2$, and harmonic numbers, to arrive at a nice infinite series formula for $\pi/3$ that does not appear to be well known. In addition, we give…

历史与综述 · 数学 2022-03-18 Robert Schneider

We study pairs of consecutive odd numbers through a straightforward indexing. We focus in particular on twin primes and their distribution. With a counting argument, we calculate the limit of an alternating sum that is equal to 1 which…

综合数学 · 数学 2021-06-08 Marc Wolf , FranÇOis Wolf , FranÇOis-Xavier Villemin

Let $s_1, s_2, \ldots$ be the sequence of positive integers, arranged in increasing order, that are representable by any binary quadratic form of fixed discriminant $D$. We show that \[ \limsup_{n \rightarrow \infty} \frac{s_{n+1}-s_n}{\log…

数论 · 数学 2022-05-02 Rainer Dietmann , Christian Elsholtz