Related papers: On super-strong Wilf equivalence classes of permut…

In this work we present additional results related to the property of strong equivalence of logic programs. This property asserts that two programs share the same set of stable models, even under the addition of new rules. As shown in a…

A hyperbinary expansion of a positive integer n is a partition of n into powers of 2 in which each part appears at most twice. In this paper, we consider a generalization of this concept and a certain statistic on the corresponding set of…

In combinatorics on words, a classical topic of study is the number of specific patterns appearing in infinite sequences. For instance, many works have been dedicated to studying the so-called factor complexity of infinite sequences, which…

We study a new class of so-called quasi-infinitely divisible laws, which is a wide natural extension of the well known class of infinitely divisible laws through the L\'evy--Khinchine type representations. We are interested in criteria of…

We prove a version of the Weak Gravity Conjecture for 6d F-theory or heterotic string compactifications with 8 supercharges. This sharpens our previous analysis by including massless scalar fields. The latter are known to modify the Weak…

A universal word (u-word) for $d$-dimensional permutations of length $n$ is a 2-dimensional word with $d-1$ rows, any size $n$ window of which is order-isomorphic to exactly one permutation of length $n$, and all permutations of length $n$…

We consider permutation classes having two basis elements of size three and one further basis element. We completely classify the possible enumeration sequences of such classes and demonstrate that there are far fewer of them than might be…

For a fixed positive integer n, let S_n denote the symmetric group of n! permutations on n symbols, and let maj(sigma) denote the major index of a permutation sigma. For positive integers k<m not greater than n and non-negative integers i…

In this article, we study the modular representations of the special linear group of degree two over a finite field in defining characteristic. In particular, we study the automorphisms of derived category of representations. We have been…

We have made a systematic numerical study of the 16 Wilf classes of length-5 classical pattern-avoiding permutations from their generating function coefficients. We have extended the number of known coefficients in fourteen of the sixteen…

In this paper, we define finite type invariants for cyclic equivalence classes of nanophrases and construct the universal ones. Also, we identify the universal finite type invariant of degree 1 essentially with the linking matrix. It is…

The complexity of an infinite word can be measured in several ways, the two most common measures being the subword complexity and the abelian complexity. In 2015, Rigo and Salimov introduced a family of intermediate complexities indexed by…

We study a family of equivalence relations on $S_n$, the group of permutations on $n$ letters, created in a manner similar to that of the Knuth relation and the forgotten relation. For our purposes, two permutations are in the same…

We give an explicit upper bound for the number of equivalence classes of binary forms with rational integral coefficients of given degree and given discriminant, and with given splitting field. Further, we give an explicit upper bound for…

We consider a family of two-valued "fully evaluated left-sequential logics" (FELs), of which Free FEL (defined by Staudt in 2012) is most distinguishing (weakest) and immune to atomic side effects. Next is Memorising FEL, in which…

We consider avoidance of permutation patterns with designated gap sizes between pairs of consecutive letters. We call the patterns having such constraints distant patterns (DPs) and we show their relation to other pattern notions…

Two finite words $u$ and $v$ are $k$-binomially equivalent if, for each word $x$ of length at most $k$, $x$ appears the same number of times as a subsequence (i.e., as a scattered subword) of both $u$ and $v$. This notion generalizes…

We extend the notion of shape-Wilf-equivalence to vincular patterns (also known as "generalized patterns" or "dashed patterns"). First we introduce a stronger equivalence on patterns which we call filling-shape-Wilf-equivalence. When…

In this paper we define and investigate the binary word operation of strong-$\phi$-bi-catenation (denoted by $\leftrightarrows_\phi$) where $\phi$ is either a morphic or an antimorphic involution. In particular, we concentrate on the…

We investigate the structural relationship between prefix-free codes over the binary alphabet and a class of unlabeled rooted trees, which we call \emph{symmetric} trees. We establish a canonical correspondence between prefix-free codes and…