English
Related papers

Related papers: No-three-in-line problem on a torus: periodicity

200 papers

Let $1<a<b$ be two relatively prime integers and $\mathbb{Z}_{\ge 0}$ the set of non-negative integers. For any non-negative integer $\ell$, denote by $g_{\ell,a,b}$ the largest integer $n$ such that the equation $$n=ax+by,\quad…

Number Theory · Mathematics 2025-10-03 Yuchen Ding , Takao Komatsu , Honghu Liu

Let $M^{2n}$ be a unitary torus $(2n)$-manifold, i.e., a $(2n)$-dimensional oriented stable complex connected closed $T^n$-manifold having a nonempty fixed set. In this paper we show that $M$ bounds equivariantly if and only if the…

Algebraic Topology · Mathematics 2012-05-31 Zhi Lü , Qiangbo Tan

A Ducci sequence is a sequence of integer $n$-tuples obtained by iterating the map \[ D : (a_1, a_2, \ldots, a_n) \mapsto \big(|a_1-a_2|,|a_2-a_3|,\ldots,|a_n-a_1|\big). \] Such a sequence is eventually periodic and we denote by $P(n)$ the…

Number Theory · Mathematics 2020-07-08 Florian Breuer , Igor E. Shparlinski

Two classes of time-periodic systems of ordinary differential equations with a small nonnegative parameter, those with fast and slow time, are studied. Right-hand sides of these systems are three times continuously differentiable with…

Dynamical Systems · Mathematics 2020-01-17 Vladimir V. Basov , Valery G. Romanovski , Artem S. Zhukov

We identify the torus with the unit interval $[0,1)$ and let $n,\nu\in\mathbb{N}$, $1\leq \nu\leq n-1$ and $N:=n+\nu$. Then we define the (partially equally spaced) knots \[ t_{j}=\{[c]{ll}% \frac{j}{2n}, & \text{for}j=0,...,2\nu,…

Numerical Analysis · Mathematics 2015-03-04 Markus Passenbrunner

We consider the Euler equation for an incompressible fluid on a three dimensional torus, and the construction of its solution as a power series in time. We point out some general facts on this subject, from convergence issues for the power…

Analysis of PDEs · Mathematics 2013-03-20 Carlo Morosi , Mario Pernici , Livio Pizzocchero

The ternary Goldbach conjecture, or three-primes problem, asserts that every odd integer $n$ greater than $5$ is the sum of three primes. The present paper proves this conjecture. Both the ternary Goldbach conjecture and the binary, or…

Number Theory · Mathematics 2014-01-20 H. A. Helfgott

We discuss several two-dimensional generalizations of the familiar Lyndon-Schutzenberger periodicity theorem for words. We consider the notion of primitive array (as one that cannot be expressed as the repetition of smaller arrays). We…

Discrete Mathematics · Computer Science 2016-07-04 Guilhem Gamard , Gwenaël Richomme , Jeffrey Shallit , Taylor J. Smith

Aougab and Gaster [Math. Proc. Cambridge Philos. Soc. 174 (2023), 569-584] proved that any set of simple closed curves on the torus, where any two are non-homotopic and intersect at most k times, has a maximum size of $k+O(\sqrt{k}\log k)$.…

Combinatorics · Mathematics 2026-01-09 Igor Balla , Marek Filakovský , Bartłomiej Kielak , Daniel Kráľ , Niklas Schlomberg

Let a and b be positive integers with a \leq b. An (a,b)-triple is a set {x,ax+d,bx+ 2d}, where x,d \geq 1. Define T(a,b;r) to be the least positive integer n such that any r-coloring of {1,2...,n} contains a monochromatic (a,b)-triple.…

Combinatorics · Mathematics 2012-01-20 Patrick Allen , Bruce M. Landman , Holly Meeks

We develop a new approach to the representation theory of quantum algebras supporting a torus action via methods from the theory of finite-state automata and algebraic combinatorics. We show that for a fixed number $m$, the torus-invariant…

Combinatorics · Mathematics 2009-01-30 J. Bell , S. Launois , J. Lutley

Given positive integers m,n,s,t, let z(m,n,s,t) be the maximum number of ones in a (0,1) matrix of size m-by-n that does not contain an all ones submatrix of size s-by-t. We find a flexible upper bound on z(m,n,s,t) that implies the known…

Combinatorics · Mathematics 2009-04-01 Vladimir Nikiforov

We study the maximum multiplicity $\mathcal{M}(k,n)$ of a simple transposition $s_k=(k \: k+1)$ in a reduced word for the longest permutation $w_0=n \: n-1 \: \cdots \: 2 \: 1$, a problem closely related to much previous work on sorting…

Combinatorics · Mathematics 2024-10-04 Christian Gaetz , Yibo Gao , Pakawut Jiradilok , Gleb Nenashev , Alexander Postnikov

This paper explores special arrangements of clues in $m \times n$ Numbrix puzzles. The maximum number of clues which fails to define an $m \times n$ puzzle is demonstrated for all $m$ and $n$. In addition, a small upper bound on the minimum…

Combinatorics · Mathematics 2017-06-29 Mary Grace Hanson , David A. Nash

The purpose of this note is give some evidence in support of conjectures of Poonen, and Morton and Silverman, on the periods of rational numbers under the iteration of quadratic polynomials. In particular, Poonen conjectured that there are…

Dynamical Systems · Mathematics 2010-04-14 Benjamin Hutz , Patrick Ingram

Let $ex(n, P)$ be the maximum possible number of ones in any 0-1 matrix of dimensions $n \times n$ that avoids $P$. Matrix $P$ is called minimally non-linear if $ex(n, P) = \omega(n)$ but $ex(n, P') = O(n)$ for every strict subpattern $P'$…

Discrete Mathematics · Computer Science 2017-01-04 P. A. CrowdMath

For a finite Abelian group $(\Gamma,+)$, let $n(\Gamma)$ denote the smallest positive integer $n$ such that for each labelling of the arcs of the complete digraph of order $n$ using elements from $\Gamma$, there exists a directed cycle such…

Combinatorics · Mathematics 2024-07-11 Micha Christoph , Charlotte Knierim , Anders Martinsson , Raphael Steiner

In this paper, we study the $2$-binomial complexity $b_{\mathbf{t}_{m},2}(n)$ of the generalized Thue-Morse words $\mathbf{t}_{m}$ for every integer $m\geq 3$. We obtain the exact value of $b_{\mathbf{t}_{m},2}(n)$ for every integer $n\geq…

Combinatorics · Mathematics 2021-12-13 Xiao-Tao Lü , Jin Chen , Zhi-Xiong Wen , Wen Wu

Using T(m,n;k) to denote the number of ways to make a selection of k squares from an (m x n) rectangular grid with no two squares in the selection adjacent, we give a formula for T(2,n;k), prove some identities satisfied by these numbers,…

Combinatorics · Mathematics 2014-09-16 Jacob A. Siehler

A sequence is nonrepetitive if it does not contain two adjacent identical blocks. The remarkable construction of Thue asserts that 3 symbols are enough to build an arbitrarily long nonrepetitive sequence. It is still not settled whether the…

Combinatorics · Mathematics 2014-10-23 Jarosław Grytczuk , Jakub Kozik , Piotr Micek