Related papers: Covering Sequences for $\ell$-Tuples

A construction of new sequences of generalized Bernoulli polynomials of first and second kind is proposed. These sequences share with the classical Bernoulli polynomials many algebraic and number--theoretical properties. A new class of…

Orientable sequences of order n are infinite periodic sequences with symbols drawn from a finite alphabet of size k with the property that any particular subsequence of length n occurs at most once in a period in either direction. They were…

We prove that, for every $\ell\geq 4$, there exists an $\ell$-vertex graph and a first order sentence having a quantifier depth at most $\ell-1$ defining the property of having an induced subgraph isomorphic to the given one. We prove that…

We extend our previous results on the number of integers which are values of some cyclotomic form of degree larger than a given value (see \cite{FW1}), to more general families of binary forms with integer coefficients. Our main ingredient…

We give a bijection between ordered $m$-clusters and (complete) $m$-exceptional sequences, a concept that we introduce for this purpose. This holds for all hereditary artin algebras. This extends the bijection in the $m = 1$ case shown in…

Let $\mathcal{A}(\ell,n) \subset S_n^{\ell}$ denote the set of all $\ell$-tuples $(\pi_1,\dots,\pi_{\ell})$, for $\pi_1,\dots,\pi_{\ell} \in S_n$ satisfying: $\forall i<j$ we have $\pi_i\pi_j=\pi_j\pi_i$. Considering the action of $S_n$ on…

The paper deals with best one--sided (lower or upper) Diophantine approximations of the $\ell$-th kind ($\ell\in\mathbb{N}$). We use the ordinary continued fraction expansions to formulate explicit criteria for a fraction…

We study the tandem duplication distance between binary sequences and their roots. In other words, the quantity of interest is the number of tandem duplication operations of the form $\seq x = \seq a \seq b \seq c \to \seq y = \seq a \seq b…

Let $A^{(n)}_{l;k}\subset S_n$ denote the set of permutations of $[n]$ for which the set of $l$ consecutive numbers $\{k, k+1,\cdots, k+l-1\}$ appears in a set of consecutive positions. Under the uniformly probability measure $P_n$ on…

We introduce the notion of unavoidable (complete) sets of word patterns, which is a refinement for that of words, and study certain numerical characteristics for unavoidable sets of patterns. In some cases we employ the graph of pattern…

A de Bruijn torus is the two dimensional generalization of a de Bruijn sequence. While some methods exist to generate these tori, only a few methods of construction are known. We present a novel method to generate de Bruijn tori with…

For a Hausdorff space $X$ we denote be $2^X$ the family of all closed subsets of $X$. In this paper we continue to research relationships between closure -type properties of hyperspaces over a space $X$ and covering properties of $X$. We…

Let $b_\ell(n)$ be the number of $\ell$-regular partitions of $n$. Recently, Hou et al established several infinite families of congruences for $b_\ell(n)$ modulo $m$, where $(\ell,m)=(3,3),(6,3),(5,5),(10,5)$ and $(7,7)$. In this paper, by…

n-tuple power law widely exists in language, computer program code, DNA and music. After a vast amount of Zipf analyses of n-tuple power law from empirical data, we propose a model to explain the n-tuple power law feature existed in these…

In cluster tomography, we propose measuring the number of clusters $N$ intersected by a line segment of length $\ell$ across a finite sample. As expected, the leading order of $N(\ell)$ scales as $a\ell$, where $a$ depends on microscopic…

The discrepancy of a binary string is the maximum (absolute) difference between the number of ones and the number of zeroes over all possible substrings of the given binary string. In this note we determine the minimal discrepancy that a…

The $(n-\ell)$-deck of an $n$-vertex graph is the multiset of subgraphs obtained from it by deleting $\ell$ vertices. A family of $n$-vertex graphs is $\ell$-recognizable if every graph having the same $(n-\ell)$-deck as a graph in the…

We give the trace representation of a family of binary sequences derived from Euler quotients by determining the corresponding defining polynomials. Trace representation can help us producing the sequences efficiently and analyzing their…

A method for encoding and decoding spectrum shaped binary run-length constrained sequences is described. The binary sequences with predefined range of exponential sums are introduced. On the base of Cover's enumerative scheme, recurrence…

The conformal loop ensemble (CLE) has two phases: for $\kappa \in (8/3, 4]$, the loops are simple and do not touch each other or the boundary; for $\kappa \in (4,8)$, the loops are non-simple and may touch each other and the boundary. For…