Related papers: Cartesian Products Avoiding Patterns
Random Fourier features provide a way to tackle large-scale machine learning problems with kernel methods. Their slow Monte Carlo convergence rate has motivated the research of deterministic Fourier features whose approximation error can…
For permutations avoiding consecutive patterns from a given set, we present a combinatorial formula for the multiplicative inverse of the corresponding exponential generating function. The formula comes from homological algebra…
A first-order expansion of the $\mathbb{R}$-vector space structure on $\mathbb{R}$ does not define every compact subset of every $\mathbb{R}^n$ if and only if topological and Hausdorff dimension coincide on all closed definable sets.…
Iterative Krylov projection methods have become widely used for solving large-scale linear inverse problems. However, methods based on orthogonality include the computation of inner-products, which become costly when the number of…
Multidimensional permutations, or $d$-permutations, are represented by their diagrams on $[n]^d$ such that there exists exactly one point per hyperplane $x_i$ that satisfies $x_i= j$ for $i \in [d]$ and $j \in [n]$. Bonichon and Morel…
The purpose of this paper is to study the fractal phenomena in large data sets and the associated questions of dimension reduction. We examine situations where the classical Principal Component Analysis is not effective in identifying the…
Contention resolution schemes have proven to be an incredibly powerful concept which allows to tackle a broad class of problems. The framework has been initially designed to handle submodular optimization under various types of constraints,…
We study relationships between permutation statistics and pattern-functions, counting the number of times particular patterns occur in a permutation. This allows us to write several familiar statistics as linear combinations of pattern…
The notion of containment and avoidance provides a natural partial ordering on set partitions. Work of Sagan and of Goyt has led to enumerative results in avoidance classes of set partitions, which were refined by Dahlberg et al. through…
We propose a higher-order dimensionality reduction framework based on the Trace Ratio (TR) optimization problem. We establish conditions for existence and uniqueness of solutions and clarify the theoretical connection between the Trace…
A permutation is called Grassmannian if it has at most one descent. In this paper, we investigate pattern avoidance and parity restrictions for such permutations. As our main result, we derive formulas for the enumeration of Grassmannian…
A classical result in combinatorial number theory states that the largest subset of $[n]$ avoiding a solution to the equation $x+y=z$ is of size $\lceil n/2 \rceil$. For all integers $k>m$, we prove multicolored extensions of this result…
Recent studies on frequent itemset mining algorithms resulted in significant performance improvements. However, if the minimal support threshold is set too low, or the data is highly correlated, the number of frequent itemsets itself can be…
The study of pattern containment and avoidance for linear permutations is a well-established area of enumerative combinatorics. A cyclic permutation is the set of all rotations of a linear permutation. Callan initiated the study of…
In this paper we propose a notion of pattern avoidance in binary trees that generalizes the avoidance of contiguous tree patterns studied by Rowland and non-contiguous tree patterns studied by Dairyko, Pudwell, Tyner, and Wynn.…
Inspired by Yakoubov's 2015 investigation of pattern avoiding linear extensions of the posets called combs, we study pattern avoiding linear extensions of rectangular posets. These linear extensions are closely related to standard tableaux.…
We show that matchings avoiding certain partial patterns are counted by the 3-Catalan numbers. We give a characterization of 12312-avoiding matchings in terms of restrictions on the corresponding oscillating tableaux. We also find a…
Products and sums of random matrices have seen a rapid development in the past decade due to various analytical techniques available. Two of these are the harmonic analysis approach and the concept of polynomial ensembles. Very recently, it…
In [Kit1] Kitaev discussed simultaneous avoidance of two 3-patterns with no internal dashes, that is, where the patterns correspond to contiguous subwords in a permutation. In three essentially different cases, the numbers of such…
A bifurcation that occurs in a multiparameter family is a Cartesian product if it splits into two factors in the sense that one bifurcation takes place in one part of the phase portrait, another one -- in another part, and they are in a…