English
Related papers

Related papers: Direct definition of a ternary infinite square-fre…

200 papers

Transitive closure logic is a known extension of first-order logic obtained by introducing a transitive closure operator. While other extensions of first-order logic with inductive definitions are a priori parametrized by a set of inductive…

Logic in Computer Science · Computer Science 2018-06-29 Liron Cohen , Reuben N. S. Rowe

A supersequence over a finite set is a sequence that contains as subsequence all permutations of the set. This paper defines an infinite array of methods to create supersequences of decreasing lengths. This yields the shortest known…

Combinatorics · Mathematics 2025-01-07 Oliver Tan

The concept of a sequence of exact zero-divisors on a noetherian local ring is defined and studied. Some properties of sequences of exact zero-divisors are compared with regular sequences.

Commutative Algebra · Mathematics 2012-04-24 Mohammad T. Dibaei , Mohsen Gheibi

We give the definition of uniform symmetric continuity for functions defined on a nonempty subset of the real line. Then we investigate the properties of uniformly symmetrically continuous functions and compare them with those of…

Classical Analysis and ODEs · Mathematics 2016-02-10 Tammatada Khemaratchatakumthorn , Prapanpong Pongsriiam

We define a triangular array closely related to Stern's diatomic array and show that for a fixed integer $r\geq 1$, the sum $u_r(n)$ of the $r$th powers of the entries in row $n$ satisfy a linear recurrence with constant coefficients. The…

Combinatorics · Mathematics 2019-01-16 Richard P. Stanley

Dynamical Systems theory generally deals with fixed point iterations of continuous functions. Computation by Turing machine although is a fixed point iteration but is not continuous. This specific category of fixed point iterations can only…

Other Computer Science · Computer Science 2014-10-31 Nabarun Mondal , Partha P. Ghosh

The predictability of a sequence is defined as the asymptotic performance of the best performing predictor in a given class. The value of the predictability of a sequence will in general depend on the choice of this predictor class. The…

Statistics Theory · Mathematics 2009-04-15 Finn Macleod , Alexei Pokrovskii , Dima Rachinskii

Error: Peer-review process exposed an error in Theorem 1 that, unfourtunately, is not repairable. Idempotent semigroups are always finite. See Green and Rees [1952], Siekmann and Szab\'o [1981] for details Anti-unification is a fundamental…

Logic in Computer Science · Computer Science 2025-03-04 David M. Cerna

In the present paper we prove that for any fixed $1<c<7/6$ there exist infinitely many consecutive square-free numbers of the form $[n^c], [n^c]+1$ and we also establish an asymptotic formula in given interval.

Number Theory · Mathematics 2018-05-28 S. I. Dimitrov

Finite-dimensional square-free algebras have been completely characterized by Anderson and D'Ambrosia as certain twisted semigroup algebras over a square-free semigroup S with coefficients in a field K. D'Ambrosia extended the definition of…

Rings and Algebras · Mathematics 2008-09-30 Martin W. Montgomery

For any integer $q\geq 2$ we provide a formula to express indefinite sums of a sequence $(f(n))_{n\geq 0}$ weighted by $q$-periodic sequences in terms of indefinite sums of sequences $(f(qn+p))_{n\geq 0}$, where $p\in\{0,\ldots,q-1\}$. When…

Combinatorics · Mathematics 2019-05-10 Jean-Luc Marichal

We prove that a sequence is primitive substitutive if and only if the set of its derived sequences is finite; we defined these sequences here.

Combinatorics · Mathematics 2008-07-22 Fabien Durand

A complete deterministic finite automaton in which every non-empty subset of the state set occurs as the image of the whole state set under the action of a suitable input word is called completely reachable. We characterize completely…

Formal Languages and Automata Theory · Computer Science 2018-05-09 Eugenija Bondar , Mikhail Volkov

We construct infinite cubefree binary words containing exponentially many distinct squares of length n. We also show that for every positive integer n, there is a cubefree binary square of length 2n.

Combinatorics · Mathematics 2009-04-14 James Currie , Narad Rampersad

Finite trigonometric Fourier series on a set of discrete equidistant points are considered. A finite system of orthogonal functions that have interpolation and certain differential properties on the period is introduced. Finite Fourier…

Numerical Analysis · Mathematics 2025-02-28 Volodymyr Denysiuk , Lydmila Rybachuk

The article addresses the problem whether indefinite double sums involving a generic sequence can be simplified in terms of indefinite single sums. Depending on the structure of the double sum, the proposed summation machinery may provide…

Symbolic Computation · Computer Science 2018-09-19 Peter Paule , Carsten Schneider

We consider a symbolic coding of linear trajectories in the regular octagon with opposite sides identified (and more generally in regular 2n-gons). Each infinite trajectory gives a cutting sequence corresponding to the sequence of sides…

Dynamical Systems · Mathematics 2009-05-07 John Smillie , Corinna Ulcigrai

Infinite time Turing machines extend the operation of ordinary Turing machines into transfinite ordinal time. By doing so, they provide a natural model of infinitary computability, a theoretical setting for the analysis of the power and…

Logic · Mathematics 2007-05-23 Joel David Hamkins

In this paper we define "a continued fraction expansion of the exponential integral $E_{1}(x)$ at infinity", which is analogous to the regular continued fraction expansion of real numbers, and prove that this expansion gives the same…

Number Theory · Mathematics 2022-06-03 Naoki Murabayashi , Hayato Yoshida

The set of continuous or Baire class 1 functions defined on a metric space $X$ is endowed with the natural pointwise partial order. We investigate how the possible lengths of well-ordered monotone sequences (with respect to this order)…

Logic · Mathematics 2011-09-27 Márton Elekes , Kenneth Kunen