English
Related papers

Related papers: On Brlek-Reutenauer conjecture

200 papers

In correspondence with Goldbach, Euler began investigating series of the form $\sum_{k \geq 1} k^{-m}\left(1 + 2^{-n} + \cdots + k^{-n}\right)$, which are known today as Euler sums. For the case where $n=1$ and $m \geq 2$, Euler was able to…

Number Theory · Mathematics 2025-07-29 Wilson J. Chen , Vincent Nguyen

In a recent work, Andrews gave analytic proofs of two conjectures concerning some variations of two combinatorial identities between partitions of a positive integer into odd parts and partitions into distinct parts discovered by Beck.…

Combinatorics · Mathematics 2018-10-09 Jane Y. X. Yang

Two conjectures of Su and Wang (2008) concerning binomial coefficients are proved. For $n\geq k\geq 0$ and $b>a>0$, we show that the finite sequence $C_j=\binom{n+ja}{k+jb}$ is a P\'{o}lya frequency sequence. For $n\geq k\geq 0$ and…

Combinatorics · Mathematics 2009-09-17 Yaming Yu

A recent conjecture by C. Carlet on the sum-freedom of the binary multiplicative inverse function can be stated as follows: For each pair of positive integers $(n,k)$ with $3\le k\le n-3$, there is a $k$-dimensional $\Bbb F_2$-subspace $E$…

Number Theory · Mathematics 2025-05-01 Xiang-dong Hou , Shujun Zhao

In this paper we attack the Erdos-Straus conjecture by means of the structure of its solutions, extending and improving the results of a previous paper. Using previous results and supported by the works of Elsholtz and Tao and Monks and…

Number Theory · Mathematics 2024-04-17 Miguel Angel Lopez

In this article, we introduce congruential Euler numbers, which are a further generalization of generalized Euler numbers. We prove the $p$-adic congruences of congruential Euler numbers, which include answers to a conjecture related to…

Number Theory · Mathematics 2026-05-12 Yuta Nishibuchi

Given a nonempty finite word $v$, let $PL(v)$ be the palindromic length of $v$; it means the minimal number of palindromes whose concatenation is equal to $v$. Let $v^R$ denote the reversal of $v$. Given a finite or infinite word $y$, let…

Combinatorics · Mathematics 2022-07-19 Josef Rukavicka

Properties of Term Rewriting Systems are called modular iff they are preserved under (and reflected by) disjoint union, i.e. when combining two Term Rewriting Systems with disjoint signatures. Convergence is the property of Infinitary Term…

Logic in Computer Science · Computer Science 2015-07-01 Stefan Michael Kahrs

If $N={q^k}{n^2}$ is an odd perfect number given in Eulerian form, then the Descartes-Frenicle-Sorli conjecture predicts that $k=\nu_{q}(N)=1$. In this article, we give a short proof for this conjecture.

Number Theory · Mathematics 2022-02-10 Jose Arnaldo B. Dris

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

Let $n>1$ be an odd integer. For any primitive $n$-th root $\zeta$ of unity in the complex field. Via the Engenvector-eigenvalue Identity, we show that $$\sum_{\tau\in…

Combinatorics · Mathematics 2022-07-01 Han Wang , Zhi-Wei Sun

A double occurrence word $w$ over a finite alphabet $\Sigma$ is a word in which each alphabet letter appears exactly twice. Such words arise naturally in the study of topology, graph theory, and combinatorics. Recently, double occurrence…

Combinatorics · Mathematics 2012-05-01 Jonathan Burns , Tilahun Muche

The Hardy-Littlewood majorant problem has a positive answer only for expo- nents p which are even integers, while there are counterexamples for all p =2 2N. Montgomery conjectured that even among the idempotent polynomials there must exist…

Analysis of PDEs · Mathematics 2016-11-26 Sándor Krenedits

Zaremba's conjecture (1971) states that every positive integer number $d$ can be represented as a denominator (continuant) of a finite continued fraction $\frac{b}{d}=[d_1,d_2,...,d_{k}],$ with all partial quotients $d_1,d_2,...,d_{k}$…

Number Theory · Mathematics 2012-07-24 Dmitriy Frolenkov , Igor D. Kan

We investigate the least number of palindromic factors in an infinite word. We first consider general alphabets, and give answers to this problem for periodic and non-periodic words, closed or not under reversal of factors. We then…

Discrete Mathematics · Computer Science 2014-07-15 Gabriele Fici , Luca Q. Zamboni

Given a countable set X (usually taken to be the natural numbers or integers), an infinite permutation, \pi, of X is a linear ordering of X. This paper investigates the combinatorial complexity of infinite permutations on the natural…

Discrete Mathematics · Computer Science 2011-08-19 Steven Widmer

In this paper, we construct a uniformely recurrent infinite word of low complexity without uniform frequencies of letters. This shows the optimality of a bound of Boshernitzan, which gives a sufficient condition for a uniformly recurrent…

Dynamical Systems · Mathematics 2022-10-06 Julien Cassaigne , Idrissa Kaboré

A purity conjecture due to Grothendieck and Auslander--Goldman predicts that the Brauer group of a regular scheme does not change after removing a closed subscheme of codimension $\ge 2$. The combination of several works of Gabber settles…

Algebraic Geometry · Mathematics 2019-05-29 Kestutis Cesnavicius

We prove a Riemannian positive mass theorem for manifolds with a single asymptotically flat end, but otherwise arbitrary other ends, which can be incomplete and contain negative scalar curvature. The incompleteness and negativity is…

Differential Geometry · Mathematics 2021-03-05 Martin Lesourd , Ryan Unger , Shing-Tung Yau

We consider input-deterministic finite state transducers with infinite inputs and infinite outputs, and we consider the property of Borel normality on infinite words. When these transducers are given by a strongly connected set of states,…

Formal Languages and Automata Theory · Computer Science 2019-04-22 Olivier Carton , Elisa Orduna
‹ Prev 1 8 9 10 Next ›