English
Related papers

Related papers: There are k-uniform cubefree binary morphisms for …

200 papers

We show that every cubic form with coefficients in an imaginary quadratic number field $K/\mathbb{Q}$ in at least $14$ variables represents zero non-trivially. This builds on the corresponding seminal result by Heath-Brown for rational…

Number Theory · Mathematics 2023-07-21 Christian Bernert , Leonhard Hochfilzer

A word is said to be \emph{bordered} if it contains a non-empty proper prefix that is also a suffix. We can naturally extend this definition to pairs of non-empty words. A pair of words $(u,v)$ is said to be \emph{mutually bordered} if…

Discrete Mathematics · Computer Science 2022-06-30 Daniel Gabric

The main result is Theorem: Let A be an R-algebra, mu, lambda be cardinals such that |A|<=mu=mu^{aleph_0}<lambda<=2^mu. If A is aleph_0-cotorsion-free or A is countably free, respectively, then there exists an aleph_0-cotorsion-free or a…

Rings and Algebras · Mathematics 2007-05-23 Rüdiger Göbel , Saharon Shelah

A structure is called homogeneous if every isomorphism between finite substructures of the structure extends to an automorphism of the structure. Recently, P. J. Cameron and J. Ne\v{s}et\v{r}il introduced a relaxed version of homogeneity:…

Combinatorics · Mathematics 2010-01-06 Dragan Mašulović , Rajko Nenadov , Nemanja Škorić

A group is said to be cube-free if its order is not divisible by the cube of any prime. Let $f_{cf,sol}(n)$ denote the isomorphism classes of solvable cube-free groups of order $n$. We find asymptotic bounds for $f_{cf,sol}(n)$ in this…

Group Theory · Mathematics 2025-07-08 Prashun Kumar , Geetha Venkataraman

Every integer greater than two can be expressed as the sum of a prime and a square-free number. Expanding on recent work, we provide explicit and asymptotic results when divisibility conditions are imposed on the square-free number. For…

Number Theory · Mathematics 2023-11-27 Shehzad Hathi , Daniel R. Johnston

We obtain three results: 1) Every compact simplex bundle with exactly one point in the fiber over 0 is the KMS bundle of a periodic flow on the Jiang-Su algebra. 2) Let A be a separable unital C*-algebra with a unique trace state. Suppose…

Operator Algebras · Mathematics 2022-06-15 George A. Elliott , Yasuhiko Sato , Klaus Thomsen

K\"unzi and Ferrario have shown that a $T_0$ space is sober if and only if it is bicomplete in the well-monotone quasi-uniformity. We prove a pointfree version of this result: a strictly zero-dimensional biframe is a congruence biframe if…

General Topology · Mathematics 2021-12-28 Graham Manuell

Motivated by classical facts concerning closed manifolds, we introduce a strong finiteness property in K-homology. We say that a C*-algebra has uniformly summable K-homology if all its K-homology classes can be represented by Fredholm…

Operator Algebras · Mathematics 2015-12-16 Heath Emerson , Bogdan Nica

We prove that every concatenation of $10$ or more binary squares contains an overlap. The bound $10$ is best possible. In contrast, over a ternary alphabet, there are infinitely long overlap-free words that consist of a concatenation of…

Combinatorics · Mathematics 2026-05-28 Jeffrey Shallit

We investigate different notions of recognizability for a free monoid morphism $\sigma: \mathcal{A}^* \to \mathcal{B}^*$. Full recognizability occurs when each (aperiodic) point in $\mathcal{B}^\mathbb{Z}$ admits at most one tiling with…

Dynamical Systems · Mathematics 2020-05-25 Valérie Berthé , Wolfgang Steiner , Jörg Thuswaldner , Reem Yassawi

We study the notion of irreducibility of semigroup morphisms. Given an alphabet $\Sigma$, a morphism $\varphi:\Sigma^+\rightarrow\Sigma^+$ is irreducible if any factorisation $\varphi=\psi_2\circ\psi_1$ can only be satisfied if $\psi_1$ or…

Formal Languages and Automata Theory · Computer Science 2026-03-17 Paul C. Bell , Eva Foster , Daniel Reidenbach

A tangram is a word in which every letter occurs an even number of times. Thus it can be cut into parts that can be arranged into two identical words. The \emph{cut number} of a tangram is the minimum number of required cuts in this…

Combinatorics · Mathematics 2025-07-16 Pascal Ochem , Théo Pierron

Let $\bf{G}$ be the connected reductive group of type $E_{7,3}$ over $\mathbb{Q}$ and $\mathfrak{T}$ be the corresponding symmetric domain in $\mathbb{C}^{27}$. Let $\Gamma=\bf{G}(\mathbb{Z})$ be the arithmetic subgroup defined by Baily. In…

Number Theory · Mathematics 2019-02-20 Henry H. Kim , Takuya Yamauchi

A complete set of N+1 mutually unbiased bases (MUBs) exists in Hilbert spaces of dimension N = p^k, where p is a prime number. They mesh naturally with finite affine planes of order N, that exist when N = p^k. The existence of MUBs for…

Quantum Physics · Physics 2009-11-10 Ingemar Bengtsson

For every algebraically closed field $\boldsymbol k$ of characteristic different from $2$, we prove the following: (1) Generic finite dimensional (not necessarily associative) $\boldsymbol k$-algebras of a fixed dimension, considered up to…

Algebraic Geometry · Mathematics 2015-01-20 Vladimir L. Popov

We prove that if $f$ is a non zero cusp form of weight $k$ on $\Gamma_0(N)$ with character $\chi$ such that $N/(\text{conductor }\chi)$ square-free, then there exists a square-free $n\ll_{\epsilon} k^{3+\epsilon}N^{7/2+\epsilon}$ such that…

Number Theory · Mathematics 2020-02-03 Pramath Anamby , Soumya Das

A finite or infinite word is called a $G$-word for a labelled graph $G$ on the vertex set $A_n = \{0,1,..., n-1\}$ if $w = i_1i_2...i_k \in A_n^*$, where each factor $i_ji_{j+1}$ is an edge of $E$, i.e, $w$ represents a walk in $G$. We show…

Combinatorics · Mathematics 2011-06-27 Tero Harju

We construct a unital pre-C*-algebra $A_0$ which is stably finite, in the sense that every left invertible square matrix over $A_0$ is right invertible, while the C*-completion of $A_0$ contains a non-unitary isometry, and so it is…

Operator Algebras · Mathematics 2017-09-01 Niels Jakob Laustsen , Jared T. White

Simon's congruence, denoted \sim_n, relates words having the same subwords of length up to n. We show that, over a k-letter alphabet, the number of words modulo \sim_n is in 2^{\Theta(n^{k-1} log n)}.

Formal Languages and Automata Theory · Computer Science 2016-07-07 Prateek Karandikar , Manfred Kufleitner , Philippe Schnoebelen