English
Related papers

Related papers: Characterizing Follower and Extender Set Sequences

200 papers

Let $(X,d)$ be a finite metric space with $|X|=n$. For a positive integer $k$ we define $A_k(X)$ to be the quotient set of all $k$-subsets of $X$ by isometry, and we denote $|A_k(X)|$ by $a_k$. The sequence $(a_1,a_2,\ldots,a_{n})$ is…

Combinatorics · Mathematics 2018-02-22 Mitsugu Hirasaka , Masashi Shinohara

We present necessary conditions for monotonicity, in one form or another, of fixed point iterations of mappings that violate the usual nonexpansive property. We show that most reasonable notions of linear-type monotonicity of fixed point…

Optimization and Control · Mathematics 2020-03-26 D. Russell Luke , Marc Teboulle , Nguyen H. Thao

The shapelet transform is a form of feature extraction for time series, in which a time series is described by its similarity to each of a collection of `shapelets'. However it has previously suffered from a number of limitations, such as…

Machine Learning · Computer Science 2020-06-01 Patrick Kidger , James Morrill , Terry Lyons

In this paper, we explore the construction and dynamical properties of $\mathcal{S}$-limited shifts. An $S$-limited shift is a subshift defined on a finite alphabet $\mathcal{A} = \{1, \ldots,p\}$ by a set $\mathcal{S} = \{S_1, \ldots,…

Dynamical Systems · Mathematics 2017-08-30 Benjamin Matson , Elizabeth Sattler

A graph $G=(V,E)$ is called an expander if every vertex subset $U$ of size up to $|V|/2$ has an external neighborhood whose size is comparable to $|U|$. Expanders have been a subject of intensive research for more than three decades and…

Combinatorics · Mathematics 2019-01-29 Michael Krivelevich

In a paper by the author, Hemmer, Hopkins, and Keith the concept of a fixed point in a sequence was applied to the sequence of first column hook lengths of a partition. In this paper we generalize this notion to fixed hook lengths in an…

Combinatorics · Mathematics 2024-06-14 Philip Cuthbertson

The paper studies different variants of almost periodicity notion. We introduce the class of eventually strongly almost periodic sequences where some suffix is strongly almost periodic (=uniformly recurrent). The class of almost periodic…

Discrete Mathematics · Computer Science 2007-05-23 Yuri Pritykin

We study word series and extended word series, classes of formal series for the analysis of some dynamical systems and their discretizations. These series are similar to but more compact than B-series. They may be composed among themselves…

Numerical Analysis · Mathematics 2015-12-01 Ander Murua , J. M. Sanz-Serna

We discuss sufficiently fast-growing sequences of Turing degrees. The key result is that, assuming sufficient determinacy, if $\phi$ is a formula with one free variable, and S and T are sufficiently fast-growing sequences of Turing degrees…

Logic · Mathematics 2016-12-15 Dmytro Taranovsky

Let $f(x)$ be a square free quartic polynomial defined over a quadratic field $K$ such that its leading coefficient is a square. If the continued fraction expansion of $\displaystyle \sqrt{f(x)}$ is periodic, then its period $n$ lies in the…

Number Theory · Mathematics 2016-07-01 Mohammad Sadek

Let A be a set of integers dense in a finite interval. We establish upper and lower bounds for the longest regularly-spaced and convex subsets of A and of A-A.

Combinatorics · Mathematics 2020-09-03 Brandon Hanson

Over the past few decades, there has been extensive research on scattered subspaces, partly because of their link to MRD codes. These subspaces can be characterized using linearized polynomials over finite fields. Within this context,…

Combinatorics · Mathematics 2024-02-26 D. Bartoli , A. Giannoni , G. Marino

We introduce the first cut-free nested sequent systems for first-order modal logics that admit increasing, decreasing, constant, and empty domains along with so-called general path conditions and seriality. We obtain such systems by means…

Logic in Computer Science · Computer Science 2023-11-09 Tim S. Lyon

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

A set X of partial words over a finite alphabet A is called unavoidable if every two-sided infinite word over A has a factor compatible with an element of X. Unlike the case of a set of words without holes, the problem of deciding whether…

Formal Languages and Automata Theory · Computer Science 2017-08-23 Joey Becker , F. Blanchet-Sadri , Laure Flapan , Stephen Watkins

A sequence is difference algebraic (or D-algebraic) if finitely many shifts of its general term satisfy a polynomial relationship; that is, they are the coordinates of a generic point on an affine hypersurface. The corresponding equations…

Algebraic Geometry · Mathematics 2025-10-13 Bertrand Teguia Tabuguia

Let $\mathfrak{P}$ be a topological property. We study the relation between the order structure of the set of all $\mathfrak{P}$-extensions of a completely regular space $X$ with compact remainder (partially ordered by the standard partial…

General Topology · Mathematics 2015-02-17 M. R. Koushesh

In this note we classify sequences according to whether they are morphic, pure morphic, uniform morphic, pure uniform morphic, primitive morphic, or pure primitive morphic, and for each possibility we either give an example or prove that no…

Formal Languages and Automata Theory · Computer Science 2017-11-30 Jean-Paul Allouche , Julien Cassaigne , Jeffrey Shallit , Luca Q. Zamboni

We consider sequences of operators $U_n:L^1(X)\to M(X)$, where $X$ is a space of homogeneous type. Under certain conditions on the operators $U_n$ we give a complete characterization of convergence (divergence) sets of functional sequences…

Classical Analysis and ODEs · Mathematics 2025-12-09 Grigori A. Karagulyan

We detail the continued fraction expansion of the square root of a monic polynomials of even degree. We note that each step of the expansion corresponds to addition of the divisor at infinity, and interpret the data yielded by the general…

Number Theory · Mathematics 2007-05-23 Alfred J. van der Poorten