English
Related papers

Related papers: Factors of generalised polynomials and automatic s…

200 papers

In this paper, we study Grothendieck polynomials from a combinatorial viewpoint. We introduce the factorial Grothendieck polynomials, analogues of the factorial Schur functions and present some of their properties, and use them to produce a…

Combinatorics · Mathematics 2010-12-14 Peter J. McNamara

Many generalizations of continued fractions, where the reciprocal function has been replaced by a more general function, have been studied, and it is often asked whether such generalized expansions can have nice properties. For instance, we…

Number Theory · Mathematics 2007-05-23 Greg Martin

The author in [7] was proved the generalized remainder and quotient theorems of polynomial in one indeterminate where the divisor is complete factorization to linear factors. In this paper we give the formula for the generalized remainder…

Numerical Analysis · Mathematics 2015-06-23 Wiwat Wanicharpichat

We study automatic sequences and automatic systems generated by general constant length (nonprimitive) substitutions. While an automatic system is typically uncountable, the set of automatic sequences is countable, implying that most…

Combinatorics · Mathematics 2024-12-04 Elżbieta Krawczyk

Let $A$ be a sufficiently dense subset of a finite field $\mathbb F_q$ or a finite, cyclic ring $\mathbb Z/ N\mathbb Z$. Assuming that $q$ and $N$ have no small prime divisors, we show that generalised Fermat equations have the expected…

Number Theory · Mathematics 2026-01-05 Sam Chow , Zi Li Lim , Akshat Mudgal

It is well known that Sturmian sequences are the aperiodic sequences that are balanced over a 2-letter alphabet. They are also characterized by their complexity: they have exactly $(n+1)$ factors of length $n$. One possible generalization…

Combinatorics · Mathematics 2007-05-23 G. Paquin , L. Vuillon

Dynamical systems at the edge of chaos, which have been considered as models of self-organization phenomena, are marked by their ability to perform nontrivial computations. To distinguish them from systems with limited computing power, we…

chao-dyn · Physics 2008-02-03 Petr Kurka

In this paper some classes of local polynomial functions on abelian groups are characterized by the properties of their variety. For this characterization we introduce a numerical quantity depending on the variety of the local polynomial…

Functional Analysis · Mathematics 2014-04-02 J. M. Almira , L. Székelyhidi

We give Ramsey expansions of classes of generalised metric spaces where distances come from a linearly ordered commutative monoid. This complements results of Conant about the extension property for partial automorphisms and extends an…

Combinatorics · Mathematics 2021-07-06 Jan Hubička , Matěj Konečný , Jaroslav Nešetřil

Motivated by a question of van der Poorten about the existence of infinite chain of prime numbers (with respect to some base), in this paper we advance the study of sequences of consecutive polynomials whose coefficients are chosen…

Number Theory · Mathematics 2018-05-24 Domingo Gómez-Pérez , Alina Ostafe , Min Sha

In this article, $q$-regular sequences in the sense of Allouche and Shallit are analysed asymptotically. It is shown that the summatory function of a regular sequence can asymptotically be decomposed as a finite sum of periodic fluctuations…

Combinatorics · Mathematics 2025-12-02 Clemens Heuberger , Daniel Krenn

We define new generalized factorials in several variables over an arbitrary subset $\underline{S} \subseteq R^n,$ where $R$ is a Dedekind domain and $n$ is a positive integer. We then study the properties of the fixed divisor…

Rings and Algebras · Mathematics 2018-12-24 Devendra Prasad , Krishnan Rajkumar , A. Satyanarayana Reddy

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…

Computational Complexity · Computer Science 2019-02-20 Manuel Arora , Gábor Ivanyos , Marek Karpinski , Nitin Saxena

The $n$th term of an automatic sequence is the output of a deterministic finite automaton fed with the representation of $n$ in a suitable numeration system. In this paper, instead of considering automatic sequences built on a numeration…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Michel Rigo , Manon Stipulanti

Factorial moments and cumulants are usually defined with respect to the unconditioned Poisson process. Conditioning a sample by selecting events of a given overall multiplicity $N$ necessarily introduces correlations. By means of Edgeworth…

High Energy Physics - Phenomenology · Physics 2009-10-28 P. Lipa , H. C. Eggers , B. Buschbeck

We prove that if a uniformly recurrent infinite word contains as a factor any finite permutation of words from an infinite family, then either this word is periodic, or its complexity (that is, the number of factors) grows faster than…

Combinatorics · Mathematics 2015-10-29 Anna E. Frid

Let $f$ be a measurable, real function defined in a neighbourhood of infinity. The function $f$ is said to be of generalised regular variation if there exist functions $h \not\equiv 0$ and $g > 0$ such that $f(xt) - f(t) = h(x) g(t) +…

Classical Analysis and ODEs · Mathematics 2009-01-13 Edward Omey , Johan Segers

We study ratio limits of the consecutive terms of weighted $n$-generalized Fibonacci sequences generated from arbitrary complex initial conditions by linear recurrences with arbitrary complex weights. We prove that if the characteristic…

Number Theory · Mathematics 2016-04-11 Igor Szczyrba

Generalized polynomials are mappings obtained from the conventional polynomials by the use of operations of addition, multiplication and taking the integer part. Extending the classical theorem of H. Weyl on equidistribution of polynomials,…

Dynamical Systems · Mathematics 2019-11-15 Vitaly Bergelson , Inger J. Håland Knutson , Younghwan Son

It is shown that there exists a sequence of 3-regular graphs $\{G_n\}_{n=1}^\infty$ and a Hadamard space $X$ such that $\{G_n\}_{n=1}^\infty$ forms an expander sequence with respect to $X$, yet random regular graphs are not expanders with…

Metric Geometry · Mathematics 2015-11-03 Manor Mendel , Assaf Naor