English
Related papers

Related papers: String Cadences

200 papers

This paper investigates synchronization phenomena in networks of coupled oscillators governed by three-time-scale dynamical systems exhibiting canard dynamics. A mathematical framework has been developed to analyze the synchronization of…

Dynamical Systems · Mathematics 2025-05-28 Navojit Dhali Pallab

The dependence of the frequency distributions due to multiple meanings of words in a text is investigated by deleting letters. By coding the words with fewer letters the number of meanings per coded word increases. This increase is measured…

Computation and Language · Computer Science 2017-10-04 Xiaoyong Yan , Petter Minnhagen

In this paper, we obtain new observability inequalities for the vibrating string. This work was motivated by a recent paper by A. Szij\'art\'o and J. Heged\H{u}s in which the authors ask the question of determining the initial data by only…

Optimization and Control · Mathematics 2013-05-29 Ambroise Vest

Under what circumstances might every extension of a combinatorial structure contain more copies of another one than the original did? This property, which we call prolificity, holds universally in some cases (e.g., finite linear orders) and…

Discrete Mathematics · Computer Science 2023-06-22 Murray Tannock , Michael Albert

We introduce features for massive data streams. These stream features can be thought of as "ordered moments" and generalize stream sketches from "moments of order one" to "ordered moments of arbitrary order". In analogy to classic moments,…

Machine Learning · Statistics 2017-09-01 Terry Lyons , Harald Oberhauser

We investigate the order of the variance of the optimal alignments score of two independent iid binary random words having the same length. The letters are equiprobable, but the scoring function is such that one letter has a larger score…

Probability · Mathematics 2016-06-17 Christian Houdré , Heinrich Matzinger

Let $\widetilde{\alpha}$ be a length-$L$ cyclic sequence of characters from a size-$K$ alphabet $\mathcal{A}$ such that the number of occurrences of any length-$m$ string on $\mathcal{A}$ as a substring of $\widetilde{\alpha}$ is $\lfloor L…

Combinatorics · Mathematics 2022-06-24 Abhinav Nellore , Rachel Ward

In this paper, we extend the notion of gapped strings to elastic-degenerate strings. An elastic-degenerate string can been seen as an ordered collection of k > 1 seeds (substrings/subpatterns) interleaved by elastic-degenerate symbols such…

Data Structures and Algorithms · Computer Science 2016-10-27 Costas Iliopoulos , Ritu Kundu , Solon Pissis

The ``comma sequence'' starts with 1 and is defined by the property that if k and k' are consecutive terms, the two-digit number formed from the last digit of k and the first digit of k' is equal to the difference k'-k. If there is more…

Number Theory · Mathematics 2024-05-28 Eric Angelini , Michael S. Branicky , Giovanni Resta , N. J. A. Sloane , David W. Wilson

Even though chord roots constitute a fundamental concept in music theory, existing models do not explain and determine them to full satisfaction. We present a new method which takes sequential context into account to resolve ambiguities and…

Sound · Computer Science 2016-01-12 Samuel Rupprechter

In this paper we study the fundamental problem of maintaining a dynamic collection of strings under the following operations: concat - concatenates two strings, split - splits a string into two at a given position, compare - finds the…

Data Structures and Algorithms · Computer Science 2016-04-11 Paweł Gawrychowski , Adam Karczmarz , Tomasz Kociumaka , Jakub Łącki , Piotr Sankowski

The score of a vertex $x$ in an oriented graph is defined to be its outdegree, \emph{i.e.}, the number of arcs with initial vertex $x$. The score sequence of an oriented graph is the sequence of all scores arranged in nondecreasing order.…

Combinatorics · Mathematics 2024-12-17 Severino V. Gervacio

The examples of rhythmical signals with variable period are considered. The definition of periodic function with the variable period is given as a model of such signals. The examples of such functions are given and their variable periods…

General Mathematics · Mathematics 2010-06-15 M. V Pryjmak

We develop a rigorous connection between statistical properties of an interference pattern and the coherence properties of the underlying quantum state. With explicit examples, we demonstrate that even for inaccurate reconstructions of…

Quantum Physics · Physics 2015-11-25 Kai von Prillwitz , Łukasz Rudnicki , Florian Mintert

The distribution of frequency counts of distinct words by length in a language's vocabulary will be analyzed using two methods. The first, will look at the empirical distributions of several languages and derive a distribution that…

Computation and Language · Computer Science 2012-07-17 Reginald D. Smith

In this article, we introduce the notion of almost consecutive partitions. A partition is almost consecutive if every term is consecutive, with the possible exception of the smallest one. We find formulas relating to the smallest parts of…

Combinatorics · Mathematics 2024-03-26 Rajat Gupta , Noah Lebowitz-Lockard

We consider log-convex sequences that satisfy an additional constraint imposed on their rate of growth. We call such sequences log-balanced. It is shown that all such sequences satisfy a pair of double inequalities. Sufficient conditions…

Combinatorics · Mathematics 2007-05-23 Tomislav Došlić

We find the two-variables generating function for the statistic which counts the number of variations in a word bounded by $1$. Thus, we refine and extend previous results concerning staircase words, which are words in which the variation…

Combinatorics · Mathematics 2025-01-22 Sela Fried

Many languages' inflectional morphological systems are replete with irregulars, i.e., words that do not seem to follow standard inflectional rules. In this work, we quantitatively investigate the conditions under which irregulars can…

Computation and Language · Computer Science 2018-04-24 Ryan Cotterell , Christo Kirov , Mans Hulden , Jason Eisner

An automaton is monotonic if its states can be arranged in a linear order that is preserved by the action of every letter. We prove that the problem of deciding whether a given automaton is monotonic is NP-complete. The same result is…

Formal Languages and Automata Theory · Computer Science 2015-08-11 Marek Szykuła
‹ Prev 1 8 9 10 Next ›