XML documents annotated by different NLP tools accommodate multidimensional markup in a single hierarchy. To query such documents one has to account for different possible nesting structures of the annotations and the original markup of a document. We propose an expressive pattern language with extended semantics of the sequence pattern, supporting negation, permutation and regular patterns tha...

We show that the p-adic valuation of the sequence of Fibonacci numbers is a p-regular sequence for every prime p. For p 6= 2, 5, we determine that the rank of this sequence is α(p) + 1, where α(m) is the restricted period length of the Fibonacci sequence modulo m.

Current polymer terminology only describes very simple copolymer structures such as block, graft, alternating periodic, or statistical copolymers. This restricted vocabulary implies that copolymers exhibit either segregated (i.e., block and graft), regular (i.e., alternating and periodic), or uncontrolled (i.e., statistical or random) comonomer sequence distributions. This standard classificati...

We prove an asymptotic formula for the number of k-uniform hypergraphs with a given degree sequence, wide range parameters. In particular, we find that is asymptotically equal to d-regular on n vertices provided dn ≤ c(n/k) constant c > 0, and 3 k < n^c any C 1/9. Our results relate sequence random hypergraph simple model nearly independent binomial variables, thus extending recent graphs...

Abstract We find an asymptotic enumeration formula for the number of simple $r$ -uniform hypergraphs with a given degree sequence, when edges is sufficiently large. The in terms solution system equations. give sufficient conditions on sequence which guarantee existence to this system. Furthermore, we solve and explicit close regular. This allows us establish several properties random hypergraph...

We give a complete solution to the Borel–Ritt problem in non-uniform spaces $${\mathscr {A}}^-_{(M)}(S)$$ of ultraholomorphic functions Beurling type, where S is an unbounded sector Riemann surface logarithm and M strongly regular weight sequence. Namely, we characterize surjectivity existence continuous linear right inverse asymptotic Borel map on terms aperture sequence M. Our work improves p...

We show the pointwise convergence of averages \[ \mathcal A _N f(x) = \frac {1}{\# {\bf B} _N} \sum _{n \in f(x + n) \] for $f \ell ^1(\mathbb Z )$ where ${\bf \cap [1, N]$, and $ is a $1$-regular sequence i

The notion of b -regular sequences was extended to linear recurring bases by Allouche, Scheicher and Tichy in 2000, abstract numeration systems Maes Rigo 2002. Their definitions are based on a S -kernel that extends -kernel. However, these do not allow us generalize all the many characterizations sequences. In this paper, we present an alternative definition -kernel, hence sequences, which enab...

We show that the local limit of uniform spanning tree on any finite, simple, connected, regular graph sequence with degree tending to $$\infty $$ is Poisson(1) branching process conditioned survive forever. An extension “almost” graphs and a quenched version are also given.

We present a system of programs designed to facilitate sequence analysis projects involving large amounts of data. SEALS (System for Easy Analysis of Lots of Sequences) is a logically organized set of flexible, easily modifiable research tools, designed to run on open systems. Functionality is divided into approximately 50 commands which follow consistent syntax and semantics; wrappers are also...