相关论文: An Erd\H{o}s--Hajnal analogue for permutation clas…

An n-homomorphism between algebras is a linear map $\phi : A \to B$ such that $\phi(a_1 ... a_n) = \phi(a_1)... \phi(a_n)$ for all elements $a_1, >..., a_n \in A.$ Every homomorphism is an n-homomorphism, for all n >= 2, but the converse is…

We define a notion of entropy for an infinite family $\mathcal{C}$ of measurable sets in a probability space. We show that the mean ergodic theorem holds uniformly for $\mathcal{C}$ under every ergodic transformation if and only if…

We improve the lower bound on the number of permutations of {1,2,...,n} in which no 3-term arithmetic progression occurs as a subsequence, and derive lower bounds on the upper and lower densities of subsets of the positive integers that can…

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 a short proof of the fact that every set of natural numbers with positive upper Banach density contains the sum of two infinite sets. The approach simplifies earlier existing proofs.

Construction of a universal finite-type invariant can be reduced, under suitable assumptions, to the solution of certain equations (the hexagon and pentagon equations) in a particular graded associative algebra of chord diagrams. An…

Constant-recursive sequences are those which satisfy a linear recurrence, so that later terms can be obtained as a linear combination of the previous ones. The rank of a constant-recursive sequence is the minimal number of previous terms…

A binary matrix is a matrix with entries from the set $\{0,1\}$. We say that a binary matrix $A$ contains a binary matrix $S$ if $S$ can be obtained from $A$ by removal of some rows, some columns, and changing some $1$-entries to…

We prove that for any integer $n\geq 12$, and for every $r$ in the interval $[3, \ldots, \lfloor (n-1)/2\rfloor]$, the group $A_n$ has a string C-group representation of rank $r$ therefore showing that the only alternating group whose set…

A celebrated theorem of Pimsner states that a covariant representation $T$ of a $C^*$-correspondence $E$ extends to a $C^*$-representation of the Toeplitz algebra of $E$ if and only if $T$ is isometric. This paper is mainly concerned with…

We exhibit a procedure to asymptotically enumerate monotone grid classes of permutations. This is then applied to compute the asymptotic number of permutations in any connected one-corner class. Our strategy consists of enumerating the…

Let $F \subset S_k$ be a finite set of permutations and let $C_n(F)$ denote the number of permutations $\sigma$ in $S_n$ avoiding the set of patterns $F$. The Noonan-Zeilberger conjecture states that the sequence ${C_n(F)}$ is P-recursive.…

Let $H$ be a planar graph. By a classical result of Robertson and Seymour, there is a function $f:\mathbb{N} \to \mathbb{R}$ such that for all $k \in \mathbb{N}$ and all graphs $G$, either $G$ contains $k$ vertex-disjoint subgraphs each…

In this paper, we prove that there exists a universal constant $C$, depending only on positive integers $n\geq 3$ and $p\leq n-1$, such that if $M^n$ is a compact free boundary submanifold of dimension $n$ immersed in the Euclidean unit…

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…

A $k$-modal sequence is a sequence of real numbers that can be partitioned into $k+1$ (possibly empty) monotone sections such that adjacent sections have opposite monotonicities. For every positive integer $k$, we prove that any sequence of…

Let $S_n$ denote the symmetric group. For any $\sigma \in S_n$, we let $\mathrm{des}(\sigma)$ denote the number of descents of $\sigma$, $\mathrm{inv}(\sigma)$ denote the number of inversions of $\sigma$, and $\mathrm{LRmin}(\sigma)$ denote…

Let $H$ be a complex Hilbert space of dimension not less than $3$ and let ${\mathcal C}$ be a conjugacy class of compact self-adjoint operators on $H$. Suppose that the dimension of the kernels of operators from ${\mathcal C}$ not less than…

The circular descent of a permutation $\sigma$ is a set $\{\sigma(i)\mid \sigma(i)>\sigma(i+1)\}$. In this paper, we focus on the enumerations of permutations by the circular descent set. Let $cdes_n(S)$ be the number of permutations of…

A permutation is defined to be cycle-up-down if it is a product of cycles that, when written starting with their smallest element, have an up-down pattern. We prove bijectively and analytically that these permutations are enumerated by the…