English
Related papers

Related papers: Abelian-square factors and binary words

200 papers

We formulate a conjecture which generalizes Darmon's "refined class number formula". We discuss relations between our conjecture and the equivariant leading term conjecture of Burns. As an application, we give another proof of the "except…

Number Theory · Mathematics 2014-06-19 Takamichi Sano

We finish the proof of the conjecture of F. Bogomolov and F. Pop: Let $F_{1}$ and $F_{2}$ be fields finitely-generated and of transcendence degree $\geq 2$ over $k_{1}$ and $k_{2}$, respectively, where $k_{1}$ is either $\bar{\mathbb{Q}}$…

Algebraic Geometry · Mathematics 2013-01-29 Aaron Michael Silberstein

We study word reconstruction problems. Improving a previous result by P. Fleischmann, M. Lejeune, F. Manea, D. Nowotka and M. Rigo, we prove that, for any unknown word $w$ of length $n$ over an alphabet of cardinality $k$, $w$ can be…

Discrete Mathematics · Computer Science 2023-01-05 Gwenaël Richomme , Matthieu Rosenfeld

Return words constitute a powerful tool for studying symbolic dynamical systems. They may be regarded as a discrete analogue of the first return map in dynamical systems. In this paper we investigate two abelian variants of the notion of…

Combinatorics · Mathematics 2012-04-27 Svetlana Puzynina , Luca Q. Zamboni

We introduce new avoidability problems for words by considering equivalence relations, k-abelian equivalences, which lie properly in between equality and commutative equality, i.e. abelian equality. For two k-abelian equivalent words the…

Combinatorics · Mathematics 2015-03-19 Mari Huova , Juhani Karhumäki

We give an analog of Frobenius' theorem about the factorization of the group determinant on the group algebra of finite abelian groups and we extend it into dihedral groups and generalized quaternion groups. Furthermore, we describe the…

Representation Theory · Mathematics 2014-05-09 N. Yamaguchi

For bilinear Fourier multipliers that contain some oscillatory factors, boundedness of the operators between Lebesgue spaces is given including endpoint cases. Sharpness of the result is also considered.

Classical Analysis and ODEs · Mathematics 2024-04-17 Tomoya Kato , Akihiko Miyachi , Naoto Shida , Naohito Tomita

We prove a positivity result for interpolation polynomials that was conjectured by Knop and Sahi. These polynomials were first introduced by Sahi in the context of the Capelli eigenvalue problem for Jordan algebras, and were later shown to…

Combinatorics · Mathematics 2021-04-20 Yusra Naqvi , Siddhartha Sahi , Emily Sergel

A recent paper of A. Sofo proves some results about sums of products of quadratic alternating harmonic numbers and reciprocal binomial coefficients. In this paper, we extend his result to cubic alternating harmonic number sums and develop…

Number Theory · Mathematics 2017-02-14 Ce Xu

Spinors are used in physics quite extensively. The goal of this study is also the spinor structure lying in the basis of the quaternion algebra. In this paper, first, we have introduced spinors mathematically. Then, we have defined…

General Mathematics · Mathematics 2025-04-08 Gamaliel Cerda-Morales

In this paper we discuss a conjecture on intermediate subfactors which is a generalization of Wall's conjecture from the theory of finite groups. We explore special cases of this conjecture and present supporting evidence. In particular we…

Operator Algebras · Mathematics 2010-07-01 Robert Guralnick , Feng Xu

We consider a class of generalized binomials emerging in fractional calculus. After establishing some general properties, we focus on a particular yet relevant case, for which we provide several ready-for-use combinatorial identities,…

Combinatorics · Mathematics 2020-10-13 Mirko D'Ovidio , Anna Chiara Lai , Paola Loreti

In this paper we generalize the formula of Frobenius-Stickelberger and the formula of Kiepert type to the genus-two case.

Number Theory · Mathematics 2007-05-23 Yoshihiro Ônishi

We study infinite binary words that contain few distinct palindromes. In particular, we classify such words according to their critical exponents. This extends results by Fici and Zamboni [TCS 2013]. Interestingly, the words with 18 and 20…

Combinatorics · Mathematics 2024-03-27 L'ubomíra Dvořáková , Pascal Ochem , Daniela Opočenská

Recently, a new characterization of Lyndon words that are also perfectly clustering was proposed by Lapointe and Reutenauer (2024). A word over a ternary alphabet {a,b,c} is called perfectly clustering Lyndon if and only if it is the…

Combinatorics · Mathematics 2024-06-25 Mélodie Lapointe , Nathan Plourde-Hébert

A square is the concatenation of a nonempty word with itself. A word has period p if its letters at distance p match. The exponent of a nonempty word is the quotient of its length over its smallest period. In this article we give a proof of…

Discrete Mathematics · Computer Science 2012-07-25 Golnaz Badkobeh , Maxime Crochemore

We present the proofs of the conjectures mentioned in the paper published in the proceedings of the 2024 AAAI conference [1], and discovered by the decomposition methods presented in the same paper.

Artificial Intelligence · Computer Science 2023-12-15 Jovial Cheukam-Ngouonou , Ramiz Gindullin , Nicolas Beldiceanu , Rémi Douence , Claude-Guy Quimper

In [A. Frid, S. Puzynina, L.Q. Zamboni, \textit{On palindromic factorization of words}, Adv. in Appl. Math. 50 (2013), 737-748], it was conjectured that any infinite word whose palindromic lengths of factors are bounded is ultimately…

Formal Languages and Automata Theory · Computer Science 2016-06-21 Michelangelo Bucci , Gwenaël Richomme

The number of Frattini chief factors or of chief factors which are complemented by a maximal subalgebra of a finite-dimensional Lie algebra $L$ is the same in every chief series for $L$, by \cite[Theorem 2.3]{[11]}. However, this is not the…

Rings and Algebras · Mathematics 2015-09-25 David A. Towers , Zekiye Ciloglu

In this article, we study word equations in free semigroups and the conjecture that the existence of infinitely many solutions entails the existence of solutions with arbitrarily large exponent of periodicity. We examine this question in…

Formal Languages and Automata Theory · Computer Science 2026-02-26 Volker Diekert , Silas Natterer , Alexander Thumm