English
Related papers

Related papers: Power-free Complementary Binary Morphisms

200 papers

This paper proves a conjecture generated by the artificial intelligence conjecturing program called \emph{TxGraffiti}. More specifically, we show that if $G$ is a connected, cubic, and claw-free graph, then $Z(G) \le \gamma(G) + 2$, where…

Combinatorics · Mathematics 2024-11-20 Randy R. Davila

Commutative complex numbers of the form u=x+\alpha y+\beta z+\gamma t in 4 dimensions are studied, the variables x, y, z and t being real numbers. Four distinct types of multiplication rules for the complex bases \alpha, \beta and \gamma…

Complex Variables · Mathematics 2007-05-23 Silviu Olariu

We prove that the algorithm for desingularization of algebraic varieties in characteristic zero of the first two authors is functorial with respect to regular morphisms. For this purpose, we show that, in characteristic zero, a regular…

Algebraic Geometry · Mathematics 2009-05-25 Edward Bierstone , Pierre D. Milman , Michael Temkin

We investigate several questions related to the notion of recognizable morphism. The main result is a new proof of Moss\'e's theorem and actually of a generalization to non primitive morphisms due to Berth\'e et al. We actually prove the…

Dynamical Systems · Mathematics 2022-10-18 Marie-Pierre Béal , Dominique Perrin , Antonio Restivo

Using a new approach based on automatic sequences, logic, and a decision procedure, we reprove some old theorems about circularly squarefree words and unbordered conjugates in a new and simpler way. Furthermore, we prove three new results…

Formal Languages and Automata Theory · Computer Science 2019-04-18 Trevor Clokie , Daniel Gabric , Jeffrey Shallit

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 $Top_c$ be the category of compact spaces and continuous maps and $Top_f\subset Top_c$ be the full subcategory of finite spaces. Consider the covariant functor $Mor:Top_f^{op}\times Top_c\to Top_c$ that associates any pair $(X,Y)$ with…

Operator Algebras · Mathematics 2010-06-11 Maysam Maysami Sadr

It is known due to Baker and Montgomery that almost all Fekete polynomials under certain ordering have at least one zero on the interval (0, 1). In terms of the positive-definiteness, Fekete polynomial has no zero on the interval (0, 1) if…

Number Theory · Mathematics 2012-01-04 Junehyuk Jung

Given a finite word $w$ over a finite alphabet $V$, consider the graph with vertex set $V$ and with an edge between two elements of $V$ if and only if the two elements alternate in the word $w$. Such a graph is said to be word-representable…

Combinatorics · Mathematics 2021-01-15 Marisa Gaetz , Caleb Ji

The (bitwise) complement $\overline{x}$ of a binary word $x$ is obtained by changing each $0$ in $x$ to $1$ and vice versa. An $\textit{antisquare}$ is a nonempty word of the form $x\, \overline{x}$. In this paper, we study infinite binary…

Combinatorics · Mathematics 2024-02-14 Aseem Baranwal , James Currie , Lucas Mol , Pascal Ochem , Narad Rampersad , Jeffrey Shallit

Let $T(G;X,Y)$ be the Tutte polynomial for graphs. We study the sequence $t_{a,b}(n) = T(K_n;a,b)$ where $a,b$ are non-negative integers, and show that for every $\mu \in \N$ the sequence $t_{a,b}(n)$ is ultimately periodic modulo $\mu$…

Combinatorics · Mathematics 2023-06-22 Tomer Kotek , Johann A. Makowsky

We prove that every rational extension of the quantum harmonic oscillator that is exactly solvable by polynomials is monodromy free, and therefore can be obtained by applying a finite number of state-deleting Darboux transformations on the…

Mathematical Physics · Physics 2014-03-17 David Gomez-Ullate , Yves Grandati , Robert Milson

We generalize the construction of Doppler-tolerant Golay complementary waveforms by Pezeshki-Calderbank-Moran-Howard to complementary code sets having more than two codes. This is accomplished by exploiting number-theoretic results…

Information Theory · Computer Science 2014-10-14 Hieu D. Nguyen , Greg E. Coxson

A pair of orthonormal bases is called mutually unbiased if all mutual overlaps between any element of one basis with an arbitrary element of the other basis coincide. In case the dimension, $d$, of the considered Hilbert space is a power of…

Quantum Physics · Physics 2013-11-27 Christoph Spengler , Barbara Kraus

We use axioms of abstract ternary relations to define the notion of a free amalgamation theory. These form a subclass of first-order theories, without the strict order property, encompassing many prominent examples of countable structures…

Logic · Mathematics 2023-11-03 Gabriel Conant

In this paper, we investigate the combinatorial and density properties of infinite words generated by Fibonacci-type morphisms, focusing on their subword structure, palindrome density, and extremal statistical behaviors. Using the morphism…

Combinatorics · Mathematics 2026-01-21 Duaa Abdullah , Jasem Hamoud

Let $f$ bea noncommutativepolynomial of degree $m\ge 1$ over an algebraically closed field $F$ of characteristic $0$. If $n\ge m-1$ and $\alpha_1,\alpha_2,\alpha_3$ are nonzero elements from $F$ such that $\alpha_1+\alpha_2+\alpha_3=0$,…

Rings and Algebras · Mathematics 2023-02-13 Matej Brešar , Peter Šemrl

Let $f_W(n)$ be the number of different factors of length $n$ appearing in $W$. A classical result of Morse and Hedlund, stated in 1938, asserts that an infinite word $W$ is ultimately periodic if and only if $f_W(n)\leq n$ for some $n\in…

Rings and Algebras · Mathematics 2026-05-04 M. A. Khrystik

A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. We show that on the algebra of complete binary trees whose leaves are labeled by letters of an…

Combinatorics · Mathematics 2020-06-09 A. Arnold , P. Cegielski , S. Grigorieff , I. Guessarian

Given a finite alphabet $A$ and a binary relation $\tau\subseteq A^*\times A^*$, a set $X$ is $\tau$-{\it independent} if $ \tau(X)\cap X=\emptyset$. Given a quasi-metric $d$ over $A^*$ (in the meaning of \cite{W31}) and $k\ge 1$, we…

Information Theory · Computer Science 2022-10-07 Jean Néraud
‹ Prev 1 8 9 10 Next ›