English
Related papers

Related papers: The critical exponent of the Arshon words

200 papers

For k <= n, let E(2n,k) be the sum of all multiple zeta values with even arguments whose weight is 2n and whose depth is k. Of course E(2n,1) is the value of the Riemann zeta function at 2n, and it is well known that E(2n,2) = (3/4)E(2n,1).…

Number Theory · Mathematics 2017-02-14 Michael E. Hoffman

In this paper we provide the classification of positive solutions to the critical $p-$Laplace equation on $\mathbb{R}^n$, for $1<p<n$, possibly having infinite energy. If $n=2$, or if $n=3$ and $\frac 32<p<2$ we prove rigidity without any…

Analysis of PDEs · Mathematics 2022-05-04 Giovanni Catino , Dario Daniele Monticelli , Alberto Roncoroni

We study the top Lyapunov exponent of a product of random $2 \times 2$ matrices appearing in the analysis of several statistical mechanical models with disorder, extending a previous treatment of the critical case (Giacomin and Greenblatt,…

Probability · Mathematics 2025-05-30 Orphée Collin , Giambattista Giacomin , Rafael L. Greenblatt , Yueyun Hu

We show that if $A$ is a subset of a group of prime order $p$ such that $|2A|<2.7652|A|$ and $|A|<1.25\cdot10^{-6}p$, then $A$ is contained in an arithmetic progression with at most $|2A|-|A|+1$ terms, and $2A$ contains an arithmetic…

Number Theory · Mathematics 2023-02-17 Vsevolod F. Lev , Oriol Serra

For any integer $k>2$, the infinite $k$-bonacci word $W^{(k)}$, on the infinite alphabet is defined as the fixed point of the morphism $\varphi_k:\mathbb{N}\rightarrow \mathbb{N}^2 \cup \mathbb{N}$, where \begin{equation*} \varphi_k(ki+j) =…

Combinatorics · Mathematics 2019-12-12 Narges Ghareghani , Pouyeh Sharifani

A \emph{power} is a word of the form $\underbrace{uu...u}_{k \; \text{times}}$, where $u$ is a word and $k$ is a positive integer; the power is also called a {\em $k$-power} and $k$ is its {\em exponent}. We prove that for any $k \ge 2$,…

Combinatorics · Mathematics 2022-05-23 Shuo Li , Jakub Pachocki , Jakub Radoszewski

Any finite word $w$ of length $n$ contains at most $n+1$ distinct palindromic factors. If the bound $n+1$ is reached, the word $w$ is called rich. The number of rich words of length $n$ over an alphabet of cardinality $q$ is denoted…

Combinatorics · Mathematics 2019-03-26 Josef Rukavicka

We investigate in this paper the Cauchy problem of the one-dimensional wave equation with space-dependent damping of the form $\mu_0(1+x^2)^{-1/2}$, where $\mu_0>0$, and time derivative nonlinearity. We establish global existence of mild…

Analysis of PDEs · Mathematics 2025-07-22 Ahmad Z. Fino , Mohamed Ali Hamza

We obtain global well-posedness, scattering, and global $L^{\frac{2(n+2)}{n-2}}_{t,x}$ spacetime bounds for energy-space solutions to the energy-critical nonlinear Schr\"odinger equation in $\R_t\times \R^n_x$, $n\geq 5$.

Analysis of PDEs · Mathematics 2007-05-23 Monica Visan

The phase diagram of a system with two order parameters, with ${\it n_1}$ and $n_2$ components, respectively, contains two phases, in which these order parameters are non-zero. Experimentally and numerically, these phases are often…

Statistical Mechanics · Physics 2023-05-23 A. Kudlis , A. Aharony , O. Entin-Wohlman

A subset A of {0,1,...,n} is said to be a 2-additive basis for {1,2,...,n} if each j in {1,2,...,n} can be written as j=x+y, x,y in A, x<=y. If we pick each integer in {0,1,...,n} independently with probability p=p_n tending to 0, thus…

Combinatorics · Mathematics 2012-04-11 Anant Godbole , Chang Mou Lim , Vince Lyzinski , Nicholas Triantafillou

We show that for any two distinct words $ s_1, s_2 $ over an arbitrary alphabets, there exists a deterministic finite automaton with $ O(\log^2 n) $ states that accepts $ s_1 $ and rejects $ s_2 $. This improves the previous upper bound of…

Formal Languages and Automata Theory · Computer Science 2025-04-03 Bogdan C. Dumitru

Critical exponents for the 3D O(n)-symmetric model with n > 3 are estimated on the base of six-loop renormalization-group (RG) expansions. A simple Pade-Borel technique is used for the resummation of the RG series and the Pade approximants…

High Energy Physics - Theory · Physics 2009-10-31 S. A. Antonenko , A. I. Sokolov

Let $ES_{\ell}(n)$ be the minimum $N$ such that every $N$-element point set in the plane contains either $\ell$ collinear members or $n$ points in convex position. We prove that there is a constant $C>0$ such that, for each $\ell, n \ge 3$,…

Combinatorics · Mathematics 2024-05-07 David Conlon , Jacob Fox , Xiaoyu He , Dhruv Mubayi , Andrew Suk , Jacques Verstraete

We study infinite ternary words that contain few distinct palindromes. In particular, we classify such words according to their critical exponent.

Combinatorics · Mathematics 2026-04-01 Ľubomíra Dvořáková , Lucas Mol , Pascal Ochem

The robustness of the universality class concept of the chaotic transition was investigated by analytically obtaining its critical exponent for a wide class of maps. In particular, we extended the existing one-dimensional chaotic maps,…

Chaotic Dynamics · Physics 2022-06-14 Ken-ichi Okubo , Ken Umeno

We consider the initial value problem for the L^2-critical defocusing Hartree equation in R^n, n \ge 3. We show that the problem is globally well posed in H^s(R^n) when 1>s> \frac{2(n-2)}{3n-4}$. We use the "I-method" combined with a local…

Analysis of PDEs · Mathematics 2009-08-06 Myeongju Chae , Soonsik Kwon

According to Suk's breakthrough result on the Erdos-Szekeres problem, any point set in general position in the plane, which has no $n$ elements that form the vertex set of a convex $n$-gon, has at most $2^{n+O\left({n^{2/3}\log n}\right)}$…

Combinatorics · Mathematics 2020-08-04 Andreas F. Holmsen , Hossein Nassajian Mojarrad , János Pach , Gábor Tardos

In this note, we obtain a classification result for positive solutions to the critical p-Laplace equation in $\mathbb{R}^n$ with $n\ge4$ and $p>p_n$ for some number $p_n\in\left(\frac{n}{3},\frac{n+1}{3}\right)$ such that…

Analysis of PDEs · Mathematics 2024-02-23 Jérôme Vétois

We show that the largest prime factor of $n^2+1$ is infinitely often greater than $n^{1.279}$. This improves the result of de la Bret\`eche and Drappeau (2019) who obtained this with $1.2182$ in place of $1.279.$ The main new ingredients in…

Number Theory · Mathematics 2020-11-03 Jori Merikoski