English
Related papers

Related papers: Towards a solution of Archdeacon's conjecture on i…

200 papers

The Hecke algebras $\mathcal{H}_{n,k}$ of the group pairs $(S_{kn}, S_k\wr S_n)$ can be endowed with a filtration with respect to the orbit structures of the elements of $S_{kn}$ relative to the action of $S_{kn}$ on the set of…

Representation Theory · Mathematics 2019-12-24 Şafak Özden

A famous theorem of Kirkman says that there exists a Steiner triple system of order $n$ if and only if $n\equiv 1,3\mod{6}$. In 1973, Erd\H{o}s conjectured that one can find so-called `sparse' Steiner triple systems. Roughly speaking, the…

Combinatorics · Mathematics 2020-03-02 Stefan Glock , Daniela Kühn , Allan Lo , Deryk Osthus

In this paper, we first prove that given a nonnegative integer $m$ and an odd number $t$ not divisible by $3$, there exists a unique Collatz's Sequence \[ S_{c}(m,t)=\{n_{0}(m,t),n_{1}(m,t),n_{2}(m,t),\ldots,n_{m}(m,t),n_{m+1}(m,t)\} \]…

General Mathematics · Mathematics 2026-01-13 Shan-Guang Tan

In 1964 L. Auslander conjectured that every crystallographic subgroup of an the affine group is virtually solvable, i.e. contains a solvable subgroup of finite index. D. Fried and W. Goldman proved Auslander's conjecture for n = 3 using…

Group Theory · Mathematics 2020-11-26 H. Abels , G. A. Margulis , G. A. Soifer

This paper demonstrates that from the Cramer's, Hardy-Littlewood's and Bateman-Horn's conjectures (suggest that the probability of a large positive integer being $x$ a prime - $\frac {1} {\ln(x)}$) it follows that the events consisting in a…

Number Theory · Mathematics 2014-07-23 Victor Volfson

We prove the following theorem: For a partially ordered set Q such that every countable subset has a strict upper bound, there is a forcing notion satisfying ccc such that, in the forcing model, there is a basis of the meager ideal of the…

Logic · Mathematics 2007-05-23 Tomek Bartoszynski , Masaru Kada

An old question of Erdos asks if there exists, for each number N, a finite set S of integers greater than N and residue classes r(n) mod n for n in S whose union is all the integers. We prove that if $\sum_{n\in S} 1/n$ is bounded for such…

Number Theory · Mathematics 2007-05-23 Michael Filaseta , Kevin Ford , Sergei Konyagin , Carl Pomerance , Gang Yu

Let $K$ be a field and $n\geq 3$. Let $E_n(K)\leq H\leq GL_n(K)$ be an intermediate group and $C$ a noncentral $H$-class. Define $m(C)$ as the minimal positive integer $m$ such that $\exists i_1,\dots,i_m\in\{\pm 1\}$ such that the product…

K-Theory and Homology · Mathematics 2020-10-20 Raimund Preusser

A conjecture of Erd\H{o}s states that for any infinite set $A \subseteq \mathbb R$, there exists $E \subseteq \mathbb R$ of positive Lebesgue measure that does not contain any nontrivial affine copy of $A$. The conjecture remains open for…

Classical Analysis and ODEs · Mathematics 2022-04-28 Angel Cruz , Chun-Kit Lai , Malabika Pramanik

A problem in zero-sum theory is to determine all pairs $(k,n)$ for which every minimal zero-sum sequence of length $k$ modulo $n$ has index $1$. While all other cases have been solved more than a decade ago, the case when $k$ equals $4$ and…

Combinatorics · Mathematics 2020-11-20 Fan Ge

For any symmetric collection of natural numbers h^{p,q} with p+q=k, we construct a smooth complex projective variety whose weight k Hodge structure has these Hodge numbers; if k=2m is even, then we have to impose that h^{m,m} is bigger than…

Algebraic Geometry · Mathematics 2015-05-27 Stefan Schreieder

Let $\overline{B}_{s,t}(n)$ denote the number of overpartitions of $n$ where no part is divisible by $s$ or $t$, with $s$ and $t$ being coprime. By establishing the exact generating functions of a family of arithmetic progressions in…

Number Theory · Mathematics 2025-03-26 Dazhao Tang

In this note we announce the proof of the inverse conjecture for the Gowers U^{s+1}[N]-norm for all s => 3; this is new for s => 4, the cases s = 1,2,3 having been previously established. More precisely we outline a proof (details of which…

Number Theory · Mathematics 2011-05-31 Ben Green , Terence Tao , Tamar Ziegler

We show that an $n\times n$ circulant Hadamard matrix must satisfy a family of congruence equations that have solutions only when $n \leq 4$, proving Ryser's 1963 conjecture that no such matrices exist for $n>4$.

Combinatorics · Mathematics 2023-02-17 Joshua Morris

Let $\mathbf{A}\in \mathbb{R}^{n\times n}$ be a matrix with diagonal $\text{diag}(\mathbf{A})$ and let $\bar{\mathbf{A}}$ be $\mathbf{A}$ with its diagonal set to all zeros. We show that Hutchinson's estimator run for $m$ iterations returns…

Data Structures and Algorithms · Computer Science 2022-11-08 Prathamesh Dharangutte , Christopher Musco

In 1930s Paul Erdos conjectured that for any positive integer C in any infinite +1 -1 sequence (x_n) there exists a subsequence x_d, x_{2d}, ... , x_{kd} for some positive integers k and d, such that |x_d + x_{2d} + ... + x_{kd}|> C. The…

Discrete Mathematics · Computer Science 2014-02-18 Boris Konev , Alexei Lisitsa

Hasanalizade [1] studied Deaconescu's conjecture for positive composite integer $n$. A positive composite integer $n\geq4$ is said to be a Deaconescu number if $S_2(n)\mid \phi(n)-1$. In this paper, we improve Hasanalizade's result by…

General Mathematics · Mathematics 2025-07-08 Sagar Mandal

The generalized Erd\H{o}s-Straus conjecture, proposed by Wac\l{}aw Sierpi\'{n}ski in 1956, asks whether the Diophantine equation \[ \frac{5}{a} = \frac{1}{b} + \frac{1}{c} + \frac{1}{d} \] admits positive integer solutions $b,c,d \in…

Number Theory · Mathematics 2025-08-12 Bilal Ghermoul

Mason's Conjecture asserts that for an $m$--element rank $r$ matroid $\M$ the sequence $(I_k/\binom{m}{k}: 0\leq k\leq r)$ is logarithmically concave, in which $I_k$ is the number of independent $k$--sets of $\M$. A related conjecture in…

Combinatorics · Mathematics 2007-05-23 David G. Wagner

For odd n>=3, we consider a general hypothetical identity for the differences S_{n,0}(x) of multiples of n with even and odd digit sums in the base n-1 in interval [0,x), which we prove in the cases n=3 and n=5 and empirically confirm for…

Number Theory · Mathematics 2012-10-23 Vladimir Shevelev , Peter J. C. Moses
‹ Prev 1 8 9 10 Next ›