Related papers: Weakly Consecutive Sequences
We define a new family of self-avoiding walks (SAW) on the square lattice, called weakly directed walks. These walks have a simple characterization in terms of the irreducible bridges that compose them. We determine their generating…
The set of permutations on a finite set can be given the lattice structure known as the weak Bruhat order. This lattice structure is generalized to the set of words on a fixed alphabet $\Sigma$ = {x,y,z,...}, where each letter has a fixed…
A PSCA$(v, t, \lambda)$ is a multiset of permutations of the $v$-element alphabet $\{0, \dots, v-1\}$ such that every sequence of $t$ distinct elements of the alphabet appears in the specified order in exactly $\lambda$ of the permutations.…
This paper is devoted to advancing the theoretical understanding of the iterated immediate snapshot (IIS) complexity of the Weak Symmetry Breaking task (WSB). Our rather unexpected main theorem states that there exist infinitely many values…
The notion of weak cyclic monotonicity of set-valued maps generalizing the cyclic monotonicity is introduced. The existence of solutions of differential inclusions with compact, upper semi-continuous, not necessarily convex right-hand sides…
In this paper, we study pattern avoidance in weak ascent sequences, giving some results for patterns of length 3. This is an analogous study to one given by Duncan and Steingr\'imsson (2011) for ascent sequences. More precisely, we provide…
The convergence of stochastic integrals driven by a sequence of Wiener processes $W_n\to W$ (with convergence in $C_t$) is crucial in the analysis of stochastic partial differential equations (SPDEs). The convergence we focus on in this…
The repetition threshold for words on $n$ letters, denoted $\mbox{RT}(n)$, is the infimum of the set of all $r$ such that there are arbitrarily long $r$-free words over $n$ letters. A repetition threshold for circular words on $n$ letters…
In the field of pattern mining, a negative sequential pattern is specified by means of a sequence consisting of events to occur and of other events, called negative events, to be absent. For instance, containment of the pattern $\langle a\…
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…
The main object of this paper is to study the concept of weak $I^K$-convergence, a generalization of weak $I^*$-convergence of sequences in a normed space, introducing the idea of weak* $I^K$-convergence of sequences of functionals where…
The Red-Sequence Cluster Survey (RCS) is a 100 square degree galaxy cluster survey designed to provide a large sample of optically selected clusters of galaxies with redshifts 0.1<z<1.4. The survey data are also useful for a variety of…
An $(n,k)$ sequence covering array is a set of permutations of $[n]$ such that each sequence of $k$ distinct elements of $[n]$ is a subsequence of at least one of the permutations. An $(n,k)$ sequence covering array is perfect if there is a…
Fixed point iterations are a fundamental tool in numerical analysis and scientific computing for the approximation of solutions to nonlinear problems. Their convergence is often established via the Banach fixed point theorem, provided that…
This note provides very simple, efficient algorithms for computing the number of distinct longest common subsequences of two input strings and for computing the number of LCS embeddings.
A {\em subsequence} of a word $w$ is a word $u$ that can be obtained by deleting some letters from $w$ while maintaining the relative order of the remaining letters, e.g., $\mathtt{lala}$ is a subsequence of $\mathtt{alfalfa}$. A word, over…
A weak asynchronous system is a trace monoid with a partial action on a set. A polygonal morphism between weak asynchronous systems commutes with the actions and preserves the independence of events. We prove that the category of weak…
This article deals with the weak errors for averaging principle for a stochastic wave equation in a bounded interval $[0,L]$, perturbed by a oscillating term arising as the solution of a stochastic reaction-diffusion equation evolving with…
We introduce an ordinal index which measures the complexity of a weakly null sequence, and show that a construction due to J. Schreier can be iterated to produce for each alpha < omega_1, a weakly null sequence (x^{alpha}_n)_n in…
In this paper, we find weak generating sets for a classical W-algebra $\mathcal{W}^k(\mathfrak{g},f)$ when $\mathfrak{g}=\mathfrak{sl}_N$ or $\mathfrak{sl}_{N_1|N_2}$. Furthermore, observing the relation between quantum and classical…