Related papers: Some Wilf-equivalences for vincular patterns
Given a permutation $\pi$, let $\text{Av}_n(\pi)$ be the number of permutations of length $n$ that avoid $\pi$ as a subpermutation. The celebrated resolution of the Stanley-Wilf conjecture by Marcus and Tardos confirmed that the limit…
In this paper, we obtain a number of new infinite families of Hadamard matrices. Our constructions are based on four new constructions of difference families with four or eight blocks. By applying the Wallis-Whiteman array or the Kharaghani…
We define a new statistic on any Weyl group which we call the odd length and which reduces, for Weyl groups of types $A$, $B$, and $D$, the the statistics by the same name that have already been defined and studied in [10], [13], [14], and…
We present four constructions of inversion sequences, and use them to compute the enumeration sequences of 24 classes of pattern-avoiding inversion sequences. This completes the enumeration of inversion sequences avoiding one or two…
In this paper, we not only give the extensions of the results given in [7] by Gill et al. for log-convex functions, but also obtain some new Hadamard type inequalities for log-convex, m-convex and (alpha,m)-convex functions.
Two factorizations of a permutation into products of cycles are equivalent if one can be obtained from the other by repeatedly interchanging adjacent disjoint factors. This paper studies the enumeration of equivalence classes under this…
We study generating functions for the number of involutions in $S_n$ avoiding (or containing once) 132, and avoiding (or containing once) an arbitrary permutation $\tau$ on $k$ letters. In several interesting cases the generating function…
New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…
We produce infinite families of knots $\{K^i\}_{i\geq 1}$ for which the set of cables $\{K^i_{p,1}\}_{i,p\geq 1}$ is linearly independent in the knot concordance group. We arrange that these examples lie arbitrarily deep in the solvable and…
We find and study a five-parameter family of four-dimensional coupled Painlev\'e V systems with affine Weyl group symmetry of type $D_5^{(1)}$. We then give an explicit description of a confluence from those systems to a four-parameter…
We extend all cohomological invariants of similarity classes of quadratic forms to anti-hermitian forms over a quaternion algebra. This uses the fact that such invariants can be lifted to Witt invariants, which can be described as…
Tests of independence are an important tool in applications, specifically in connection with the detection of a relationship between variables; they also have initiated many developments in statistical theory. In the present paper we build…
In this paper we study functions on the interval that have the same persistent homology. By introducing an equivalence relation modeled after topological conjugacy, which we call graph-equivalence, a precise enumeration of functions with…
We compute the total Stiefel-Whitney Classes (SWCs) for orthogonal representations of special linear groups $\text{SL}(n,q)$ when $n$ and $q$ are odd. These classes are expressed in terms of character values at diagonal elements of order…
The normal sequences NS(n) and near-normal sequences NN(n) play an important role in the construction of orthogonal designs and Hadamard matrices. They can be identified with certain base sequences (A;B;C;D), where A and B have length n+1…
Let $n_k(s)$ be the maximal length $n$ such that a quaternary additive $[n,k,n-s]_4$-code exists. We solve a natural asymptotic problem by determining the lim sup $\lambda_k$ of $n_k(s)/s,$ and the smallest value of $s$ such that…
Partially ordered patterns (POPs) generalize the classical notion of permutation patterns within the framework of pattern avoidance. Building on recent work by Burstein, Han, Kitaev, and Zhang, which introduced the concept of…
The Weisfeiler-Leman (WL) algorithms form a family of incomplete approaches to the graph isomorphism problem. They recently found various applications in algorithmic group theory and machine learning. In fact, the algorithms form a…
We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…
We prove a weak-type (1,1) inequality for square functions of non-commutative martingales that are simultaneously bounded in $L^2$ and $L^1$. More precisely, the following non-commutative analogue of a classical result of Burkholder holds:…