English
Related papers

Related papers: For each $\alpha$ > 2 there is an infinite binary …

200 papers

We calculate the critical exponent $\nu$ in the 1/N expansion of the two-particle-irreducible (2PI) effective action for the O(N) symmetric $\phi ^4$ model in three spatial dimensions. The exponent $\nu$ controls the behavior of a two-point…

High Energy Physics - Phenomenology · Physics 2013-05-30 Yohei Saito , Hirotsugu Fujii , Kazunori Itakura , Osamu Morimatsu

For an infinite cardinal $\kappa$, let $ded\kappa$ denote the supremum of the number of Dedekind cuts in linear orders of size $\kappa$. It is known that $\kappa<ded\kappa\leq 2^{\kappa}$ for all $\kappa$ and that $ded\kappa<2^{\kappa}$ is…

Logic · Mathematics 2019-02-20 Artem Chernikov , Saharon Shelah

A closed word (a.k.a. periodic-like word or complete first return) is a word whose longest border does not have internal occurrences, or, equivalently, whose longest repeated prefix is not right special. We investigate the structure of…

Formal Languages and Automata Theory · Computer Science 2014-12-02 Golnaz Badkobeh , Gabriele Fici , Zsuzsanna Lipták

We construct the base $2$ expansion of an absolutely normal real number $x$ so that, for every integer $b$ greater than or equal to $2$, the discrepancy modulo $1$ of the sequence $(b^0 x, b^1 x, b^2 x , \ldots)$ is essentially the same as…

Number Theory · Mathematics 2017-07-12 Verónica Becher , Adrian-Maria Scheerer , Theodore Slaman

A \emph{square} is a finite non-empty word consisting of two identical adjacent blocks. A word is \emph{square-free} if it does not contain a square as a factor. In any finite word one may delete the repeated block of a square, obtaining…

Combinatorics · Mathematics 2020-11-26 Jarosław Grytczuk , Szymon Stankiewicz

We study two modifications of the Post Correspondence Problem (PCP), namely 1) the bi-infinite version, where it is asked whether there exists a bi-infinite word such that two given morphisms agree on it, and 2) the conjugate version, where…

Discrete Mathematics · Computer Science 2022-09-16 Olivier Finkel , Vesa Halava , Tero Harju , Esa Sahla

Let $b \ge 2$ be an integer. We prove that the $b$-adic expansion of every irrational algebraic number cannot have low complexity. Furthermore, we establish that irrational morphic numbers are transcendental, for a wide class of morphisms.…

Number Theory · Mathematics 2012-05-07 Boris Adamczewski , Yann Bugeaud

Let $A$ and $B$ be sets of words of length $n$ over some finite alphabet. Suppose that no suffix of a word in $A$ coincides with a prefix of a word in $B$. Then we show that the product of densities of $A$ and $B$ is upper bounded by…

Combinatorics · Mathematics 2026-03-04 Dmitrii Zakharov

The Binary Two-Up Sequence is the lexicographically earliest sequence of distinct nonnegative integers with the property that the binary expansion of the n-th term has no 1-bits in common with any of the previous floor(n/2) terms. We show…

Combinatorics · Mathematics 2022-09-12 Michael De Vlieger , Thomas Scheuerle , Rémy Sigrist , N. J. A. Sloane , Walter Trump

Let $\mathbf{A}$ be a finite nilpotent algebra in a congruence modular variety with finitely many fundamental operations. If $\mathbf{A}$ is of prime power order, then it is known that there is a polynomial $p$ such that for every $n \in…

Rings and Algebras · Mathematics 2020-11-30 Erhard Aichinger

Lambda words are sequences obtained by encoding the differences between ordered elements of the form i+j\theta, where i and j are non-negative integers and 1 < \theta <2. Lambda words are right-infinite words defined over an infinite…

Combinatorics · Mathematics 2013-03-12 Norman Carey

In combinatorics on words, a word $w$ over an alphabet $\Sigma$ is said to avoid a pattern $p$ over an alphabet $\Delta$ if there is no factor $f$ of $w$ such that $f=h(p)$ where $h:\Delta^*\to\Sigma^*$ is a non-erasing morphism. A pattern…

Discrete Mathematics · Computer Science 2015-10-08 Pascal Ochem

We consider two decision problems for linear recurrence sequences (LRS) over the integers, namely the Positivity Problem (are all terms of a given LRS positive?) and the Ultimate Positivity Problem} (are all but finitely many terms of a…

Discrete Mathematics · Computer Science 2013-10-11 Joel Ouaknine , James Worrell

We produce an infinite family of transcendental numbers which, when raised to their own power, become rational. We extend the method, to investigate positive rational solutions to the equation $x^x = \alpha$, where $\alpha$ is a fixed…

Number Theory · Mathematics 2014-09-15 Sam Chow , Bin Wei

A critical value of a function is the value of this function at one of its critical points. Each critical point of a differentiable multivariate function is described by the equations which consist in equating to zero all of its partial…

Commutative Algebra · Mathematics 2015-08-04 Ruslan Sharipov

For every uncountable cardinal $\kappa$ there are $2^\kappa$ nonisomorphic simple AF algebras of density character $\kappa$ and $2^\kappa$ nonisomorphic hyperfinite II$_1$ factors of density character $\kappa$. These estimates are maximal…

Operator Algebras · Mathematics 2013-01-28 Ilijas Farah , Takeshi Katsura

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

The critical dynamics of superconductors is studied using renormalization group and duality arguments. We show that in extreme type II superconductors the dynamic critical exponent is given exactly by $z=3/2$. This result does not rely on…

Superconductivity · Physics 2007-05-23 Flavio S. Nogueira , Dirk Manske

This paper deals with multiplicity and bifurcation results for nonlinear problems driven by the fractional Laplace operator $(-\Delta)^s$ and involving a critical Sobolev term. In particular, we consider $$\begin{cases}…

Analysis of PDEs · Mathematics 2016-07-18 Alessio Fiscella , Giovanni Molica Bisci , Raffaella Servadei

We construct an infinite word $w$ over the $5$-letter alphabet such that for every factor $f$ of $w$ of length at least two, there exists a cyclic permutation of $f$ that is not a factor of $w$. In other words, $w$ does not contain a…

Combinatorics · Mathematics 2018-11-21 Golnaz Badkobeh , Pascal Ochem
‹ Prev 1 8 9 10 Next ›