English
Related papers

Related papers: Periods of a max-type equation

200 papers

We give a complete solution of the following problem: Find, classify and count the (classes of) periodic orbits on an equilateral triangle. We prove that Fagnano's period 3 orbit is the only periodic orbit with odd period. A periodic orbit…

Dynamical Systems · Mathematics 2009-09-29 Andrew M. Baxter , Ron Umble

We prove that the maximum determinant of an $n \times n $ matrix, with entries in $\{0,1\}$ and at most $n+k$ non-zero entries, is at most $2^{k/3}$, which is best possible when $k$ is a multiple of 3. This result solves a conjecture of…

Combinatorics · Mathematics 2020-11-04 Igor Araujo , József Balogh , Yuzhou Wang

We determine the maximum number of edges in a $K_4$-minor-free $n$-vertex graph of girth $g$, when $g = 5$ or $g$ is even. We argue that there are many different $n$-vertex extremal graphs, if $n$ is even and $g$ is odd.

Combinatorics · Mathematics 2021-11-11 János Barát

In max algebra it is well-known that the sequence A^k, with A an irreducible square matrix, becomes periodic at sufficiently large k. This raises a number of questions on the periodic regime of A^k and A^k x, for a given vector x. Also,…

Rings and Algebras · Mathematics 2009-10-06 Sergei Sergeev

Let $q$ be a prime power, and let $r=nk+1$ be a prime such that $r\nmid q$, where $n$ and $k$ are positive integers. Under a simple condition on $q$, $r$ and $k$, a Gauss period of type $(n,k)$ is a normal element of $\Bbb F_{q^n}$ over…

Number Theory · Mathematics 2016-08-05 Xiang-dong Hou

Systems of equations with sets of integers as unknowns are considered. It is shown that the class of sets representable by unique solutions of equations using the operations of union and addition $S+T=\makeset{m+n}{m \in S, \: n \in T}$ and…

Formal Languages and Automata Theory · Computer Science 2013-10-28 Artur Jeż , Alexander Okhotin

The $3x+1$ Problem asks if whether for every natural number $n$, there exists a finite number of iterations of the piecewise function $$f(2n)=n, \quad f(2n-1)=6n-2, $$ with an iterate equal to the number $1$, or in other words, every…

Number Theory · Mathematics 2015-04-14 Jeffrey R. Goodwin

For a family of graphs $\F$, a graph is called $\F$-free if it does not contain any member of $\F$ as a subgraph. The generalized Tur\'an number $\ex(n,K_r,\F)$ is the maximum number of $K_r$ in an $n$-vertex $\F$-free graph and…

Combinatorics · Mathematics 2023-07-25 Xiutao Zhu , Yaojun Chen

A subset of a normed space $X$ is called equilateral if the distance between any two points is the same. Let $m(X)$ be the smallest possible size of an equilateral subset of $X$ maximal with respect to inclusion. We first observe that…

Metric Geometry · Mathematics 2013-09-17 Konrad J. Swanepoel , Rafael Villa

We consider 1D completely resonant nonlinear wave equations of the type v_{tt}-v_{xx}=-v^3+O(v^4) with spatial periodic boundary conditions. We prove the existence of a new type of quasi-periodic small amplitude solutions with two…

Analysis of PDEs · Mathematics 2007-05-23 Pietro Baldi

Let $\varphi$ be the Euler's function and fix an integer $k\ge 0$. We show that, for every initial value $x_1\ge 1$, the sequence of positive integers $(x_n)_{n\ge 1}$ defined by $x_{n+1}=\varphi(x_n)+k$ for all $n\ge 1$ is eventually…

Number Theory · Mathematics 2023-02-06 Paolo Leonetti , Florian Luca

If a function $f:\mathbb{R}\to\mathbb{R}$ can be represented as the sum of $n$ periodic functions as $f=f_1+\dots+f_n$ with $f(x+\alpha_j)=f(x)$ ($j=1,\dots,n$), then it also satisfies a corresponding $n$-order difference equation…

Classical Analysis and ODEs · Mathematics 2013-12-16 Bálint Farkas , Szilárd Révész

Given a finite subset S in F_p^d, let a(S) be the number of distinct r-tuples (x_1,...,x_r) in S such that x_1+...+x_r = 0. We consider the "moments" F(m,n) = sum_|S|=n a(S)^m. Specifically, we present an explicit formula for F(m,n) as a…

Representation Theory · Mathematics 2008-08-22 Erik Carlsson

In the classical probability model, let $f(n)$ be the maximum number of pairwise independent events for the sample space with $n$ sample points. The determination of $f(n)$ is equivalent to the problem of determining the maximum cardinality…

Combinatorics · Mathematics 2024-05-07 Jiang Zhou

We study rational periodic points of polynomial $f_{d,c}(x)=x^d+c$ over the field of rational numbers, where $d$ is an integer greater than 2. For period 2, we classify all possible periodic points for degrees $d=4,6$. We also demonstrate…

Number Theory · Mathematics 2021-10-12 Chatchawan Panraksa

Let $\tau_{m,n}$ denote the maximal number of points on the discrete torus (discrete toric grid) of sizes $m \times n$ with no three collinear points. The value $\tau_{m,n}$ is known for the case where $\gcd(m,n)$ is prime. It is also known…

Discrete Mathematics · Computer Science 2019-08-26 Michael Skotnica

We study four fundamental questions about $1$-periods and give complete answers. 1) We give a necessary and sufficient for a period integral to be transcendental. 2) We give a qualitative description of all $\overline{\mathbf{Q}}$-linear…

Number Theory · Mathematics 2022-04-22 Annette Huber , Gisbert Wüstholz

Suppose $\mathcal{X}$ is an $n$-correct set of nodes in the plane, that is, it admits a unisolvent interpolation with bivariate polynomials of total degree less than or equal to $n.$ Then an algebraic curve $q$ of degree $k\le n$ can pass…

Numerical Analysis · Mathematics 2025-07-16 H. Hakopian , G. Vardanyan , N. Vardanyan

We conjecture that the balanced complete bipartite graph $K_{\lfloor n/2 \rfloor,\lceil n/2 \rceil}$ contains more cycles than any other $n$-vertex triangle-free graph, and we make some progress toward proving this. We give equivalent…

Combinatorics · Mathematics 2014-10-30 Stephane Durocher , David S. Gunderson , Pak Ching Li , Matthew Skala

Erd\H{o}s showed that every set of $n$ positive integers contains a subset of size at least $n/(k+1)$ containing no solutions to $x_1 + \cdots + x_k = y$. We prove that the constant $1/(k+1)$ here is best possible by showing that if $(F_m)$…

Combinatorics · Mathematics 2014-12-17 Sean Eberhard