中文
相关论文

相关论文: Division by three

200 篇论文

In this short note we answer to a question of group theory from arXiv:0910.5080. In that paper the author describes the set of realizable Steinitz classes for so-called $A'$-groups of odd order, obtained iterating some direct and semidirect…

群论 · 数学 2016-02-26 Alessandro Cobbe , Maurizio Monge

In 1969 J. Verhoeff provided the first examples of a decimal error detecting code using a single check digit to provide protection against all single, transposition, and adjacent twin errors. The three codes he presented are length 3-digit…

信息论 · 计算机科学 2024-04-01 Larry A. Dunning

Douglass B. Morris announced in 1970 that it is consistent with ZF that "For every $\alpha$, there exists a set $A_\alpha$ which is the countable union of countable sets, and $\mathcal P(A_\alpha)$ can be partitioned into $\aleph_\alpha$…

逻辑 · 数学 2020-10-05 Asaf Karagila

The following is a concise exposition of the conjecture and three of its proofs for the case of positive entropy by D. Rudolph [22] , B. Host [14] and W. Parry [21]. A simpler theorem of R. Lyons [19] - preceding them - is also presented…

动力系统 · 数学 2026-02-04 Matan Tal

We show that if the difference of two elements of a set $A \subseteq [N]$ is never one less than a prime number, then $|A| = O (N \exp (-c (\log N)^{1/3}))$ for some absolute constant $c>0$.

经典分析与常微分方程 · 数学 2020-03-05 Ruoyi Wang

We give a proof of a conjecture of A. Lacasse in his doctoral thesis which has applications in machine learning algorithms. The proof relies on some interesting binomial sums identities introduced by Abel (1839), and on their generalization…

组合数学 · 数学 2012-09-06 Malik Younsi

The chromatic polynomial and its generalization, the chromatic symmetric function, are two important graph invariants. Celebrated theorems of Birkhoff, Whitney, and Stanley show how both objects can be expressed in three different ways: as…

组合数学 · 数学 2020-07-28 Bruce E. Sagan , Vincent Vatter

We give a new equivalent restatement and a new proof in terms of trios to the classical Kneser's theorem. In the finite case, our restatement takes the following, particularly symmetric shape: if $A$, $B$, and $C$ are subsets of a finite…

数论 · 数学 2016-02-09 David J. Grynkiewicz , Vsevolod F. Lev

For a given real number $\alpha$, let us place the fractional parts of the points $0, \alpha, 2 \alpha,$ $ \cdots, (N-1) \alpha$ on the unit circle. These points partition the unit circle into intervals having at most three lengths, one…

数论 · 数学 2018-06-08 Valérie Berthé , Dong Han Kim

We show that for every graph without isolated edge, the edges can be assigned weights from {1,2,3} so that no two neighbors receive the same sum of incident edge weights. This solves a conjecture of Karo\'{n}ski, Luczak, and Thomason from…

组合数学 · 数学 2024-01-30 Ralph Keusch

It is conjectured that for any fixed relatively prime positive integers $a,b$ and $c$ all greater than 1 there is at most one solution to the equation $a^x+b^y=c^z$ in positive integers $x,y$ and $z$, except for specific cases. We develop…

数论 · 数学 2025-04-15 Takafumi Miyazaki , István Pink

A universal schema for diagonalization was popularized by N. S. Yanofsky (2003) in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function. It was shown that many…

逻辑 · 数学 2019-07-02 Ahmad Karimi , Saeed Salehi

We prove that if an alternating 3-braid knot has unknotting number one, then there must exist an unknotting crossing in any alternating diagram of it, and we enumerate such knots. The argument combines the obstruction to unknotting number…

几何拓扑 · 数学 2009-02-11 Joshua Greene

If two closed Jordan curves in the plane have precisely one point in common, then it is called a {\em touching point}. All other intersection points are called {\em crossing points}. The main result of this paper is a Crossing Lemma for…

组合数学 · 数学 2015-07-08 János Pach , Natan Rubin , Gábor Tardos

During his brief life, the Polish mathematician and logician Adolf Lindenbaum (1904--1941) contributed to mathematical logic, among other things, by several significant achievements. Some results of Lindenbaum's, which bear his name, were…

逻辑 · 数学 2019-01-17 Alex Citkin , Alexei Muravitsky

A bijective proof is given for the following theorem: the number of compositions of n into odd parts equals the number of compositions of n + 1 into parts greater than one. Some commentary about the history of partitions and compositions is…

组合数学 · 数学 2013-12-04 Andrew V. Sills

A simple classical probabilistic system (a simple card game) classically exemplifies Aharonov and Vaidman's "Three-Box 'paradox'" [J. Phys. A 24, 2315 (1991)], implying that the Three-Box example is neither quantal nor a paradox and leaving…

量子物理 · 物理学 2009-11-07 K. A. Kirkpatrick

We give a short and elementary proof of a $(q, \mu, \nu)$-deformed Binomial distribution identity arising in the study of the $(q, \mu, \nu)$-Boson process and the $(q, \mu, \nu)$-TASEP. This identity found by Corwin in [4] was a key…

概率论 · 数学 2015-02-09 Guillaume Barraquand

In 1927, Artin conjectured that any integer other than -1 or a perfect square generates the multiplicative group $\mathbb{Z}/p\mathbb{Z}^\times$ for infinitely many $p$. In \cite{MoSt}, Moree and Stevenhagen considered a two-variable…

数论 · 数学 2017-11-20 M. Ram Murty , François Séguin , Cameron L. Stewart

The Plurality problem - introduced by Aigner \cite{A2004} - has many variants. In this article we deal with the following version: suppose we are given $n$ balls, each of them colored by one of three colors. A \textit{plurality ball} is one…

组合数学 · 数学 2017-08-22 Dániel Gerbner , Dániel Lenger , Máté Vizer