Related papers: Fertility Numbers of Consecutive $S_3$ Pattern-Avo…
The genus number of a number field is a fundamental invariant which measures the contribution of ramification to its ideal class group. In this paper, we establish the statistics for the genus number for $S_3\times C_q$-fields for $q\neq 3$…
We verify that the descent maps provided by Langlands's Conjugacy Conjecture do satisfy the continuity condition necessary for them to be effective. Thus Langlands's conjecture does imply the existence of canonical models. This replaces an…
Extending the notion of pattern avoidance in permutations, we study matchings and set partitions whose arc diagram representation avoids a given configuration of three arcs. These configurations, which generalize 3-crossings and 3-nestings,…
Let $\F$ be the finite field of odd prime power order $q$, We find explicit expressions for the number of triples $\{\al-1,\al,\al+1 \}$ of consecutive non-zero squares in $\F$ and similarly for the number of triples of consecutive…
A numeral system is an infinite sequence of different closed normal $\lambda$-terms intended to code the integers in $\lambda$-calculus. H. Barendregt has shown that if we can represent, for a numeral system, the functions : Successor,…
Given a lower-triangular matrix of real numbers, one can ask the following four total-positivity questions: total positivity of the triangle itself; total positivity of its row-reversal; Toeplitz-total positivity of its row sequences…
Let $v_3$ denote the usual $3$-adic valuation, and let $s(n, k)$ be the unsigned Stirling number of the first kind. In this paper, for $a\in\{1,2\}$, we determine the values of $v_3(s(a3^n, k))$ for all $1\le k\le a3^n$. More precisely, for…
In this paper we calculate the cardinality of the set S_n(T,tau) of all permutations in S_n that avoid one pattern from S_4 and a nonempty set of patterns from S_3.
A permutation $\pi$ contains a pattern $\sigma$ if and only if there is a subsequence in $\pi$ with its letters are in the same relative order as those in $\sigma$. Partially ordered patterns (POPs) provide a convenient way to denote…
The problem of classifying tuples of nilpotent matrices over a field under simultaneous conjugation is considered "hopeless". However, for any given matrix order over a finite field, the number of concerned orbits is always finite. This…
A real matrix is said to be positive if its every entry is positive, and a real square matrix A is algebraically positive if there exists a real polynomial f such that f(A) is a positive matrix. A sign pattern matrix A is said to require a…
Let $\mathbf{S}$ be the set of all finite or infinite increasing sequences of positive integers. For a sequence $S=\{s(n)\}, n\geq1,$ from $\mathbf{S},$ let us call a positive number $N$ an exponentially $S$-number $(N\in E(S)),$ if all…
A poset is (3+1)-free if it does not contain the disjoint union of chains of length 3 and 1 as an induced subposet. These posets are the subject of the (3+1)-free conjecture of Stanley and Stembridge. Recently, Lewis and Zhang have…
We shall characterize the structure of invertible substitutions on three-letter alphabet. We show that any invertible substitution, after some cyclic operation, can be written as a finite product of permutations and Fibonacci's…
For graphs F and G an F-matching in G is a subgraph of G consisting of pairwise vertex disjoint copies of F. The number of F-matchings in G is denoted by s(F,G). We show that for every fixed positive integer m and every fixed tree F, the…
We show that the set of prime numbers has exponential alternating complexity, proving a conjecture by Fijalkow. We further show that the set of squarefree integers has essentially maximal possible alternating complexity.
The first problem addressed by this article is the enumeration of some families of pattern-avoiding inversion sequences. We solve some enumerative conjectures left open by the foundational work on the topics by Corteel et al., some of these…
We describe recurring patterns of numbers that survive each wave of the Sieve of Eratosthenes, including symmetries, uniform subdivisions, and quantifiable, predictive cycles that characterize their distribution across the number line. We…
We consider the problem of finding the number of matrices over a finite field with a certain rank and with support that avoids a subset of the entries. These matrices are a q-analogue of permutations with restricted positions (i.e., rook…
We show that any sequence of integers satisfying necessary Dold's congruences is realized as the sequence of fixed point indices of the iterates of an orientation-reversing homeomorphism of $\mathbb{R}^{m}$ for $m\geq 3$. As an element of…