中文
相关论文

相关论文: Interval pattern avoidance for arbitrary root syst…

200 篇论文

This paper proposes a new notion of typical sequences on a wide class of abstract alphabets (so-called standard Borel spaces), which is based on approximations of memoryless sources by empirical distributions uniformly over a class of…

信息论 · 计算机科学 2016-11-17 Maxim Raginsky

Following Anders and Archer, we say that an unordered rooted labeled forest avoids the pattern $\sigma\in\mathcal{S}_k$ if in each tree, each sequence of labels along the shortest path from the root to a vertex does not contain a…

组合数学 · 数学 2022-11-01 Swapnil Garg , Alan Peng

We give a lower bound for the value at q=1 of a Kazhdan-Lustig polynomial in a Weyl group W in terms of "patterns''. This is expressed by a "pattern map" from W to W' for any parabloic subgroup W'. This notion generalizes the concept of…

表示论 · 数学 2007-05-23 Sara Billey , Tom Braden

For every pattern $p$ over the alphabet $\{x,y,x^R,y^R\}$, we specify the least $k$ such that $p$ is $k$-avoidable.

组合数学 · 数学 2015-08-24 James D. Currie , Philip Lafrance

Using techniques from Poisson approximation, we prove explicit error bounds on the number of permutations that avoid any pattern. Most generally, we bound the total variation distance between the joint distribution of pattern occurrences…

组合数学 · 数学 2023-06-22 Harry Crane , Stephen DeSalvo

We complete the construction of the modular generalized Springer correspondence for an arbitrary connected reductive group, with a uniform proof of the disjointness of induction series that avoids the case-by-case arguments for classical…

表示论 · 数学 2017-09-12 Pramod N. Achar , Anthony Henderson , Daniel Juteau , Simon Riche

Universality of eigenvalue spacings is one of the basic characteristics of random matrices. We give the precise meaning of universality and discuss the standard universality classes (sine, Airy, Bessel) and their appearance in unitary,…

数学物理 · 物理学 2015-01-20 A. B. J. Kuijlaars

In combinatorics on words, a word w over an alphabet Sigma is said to avoid a pattern p over an alphabet Delta if there is no factor x of w and no non-erasing morphism h from Delta^* to Sigma^* such that h(p) = x. Bell and Goh have recently…

组合数学 · 数学 2009-07-28 Narad Rampersad

We review the various pattern avoidance criteria that have been developed for smoothness and rational smoothness of symmetric subvarieties of flag varieties in the classical cases, including some proofs and giving references for other…

代数几何 · 数学 2022-10-20 William M. McGovern

We prove a conjecture by Kreiman and Lakshmibai on a combinatorial description of multiplicities of points on Schubert varieties in Graszmannians in terms of certain sets of reflections in the corresponding Weyl group. The proof is…

代数几何 · 数学 2007-05-23 Christian Krattenthaler

In this paper, the problem of pattern avoidance in generalized non-crossing trees is studied. The generating functions for generalized non-crossing trees avoiding patterns of length one and two are obtained. Lagrange inversion formula is…

组合数学 · 数学 2008-05-12 Yidong Sun , Zhiping Wang

The classical Hilbert specialization property is a field-theoretic tool ensuring that polynomial irreducibility over a field is preserved under specialization of some of the variables. We develop an integral counterpart by introducing the…

数论 · 数学 2026-04-09 Angelot Behajaina , Pierre Dèbes , Joachim König

We study some aspects of noncommutative differential geometry on a finite Weyl group in the sense of S. Woronowicz, K. Bresser {\it et al.}, and S. Majid. For any finite Weyl group $W$ we consider the subalgebra generated by flat…

量子代数 · 数学 2007-05-23 Anatol N. Kirillov , Toshiaki Maeno

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…

组合数学 · 数学 2007-05-23 T. Mansour , S. Kitaev

Pattern avoiding machines were recently introduced by Claesson, Ferrari and the current author to gain a better understanding of the classical $2$-stacksort problem. In this paper we generalize these devices by allowing permutations with…

组合数学 · 数学 2020-04-22 Giulio Cerbai

In this paper, we investigate pattern avoidance of parity restricted (even or odd) Grassmannian permutations for patterns of sizes 3 and 4. We use a combination of direct counting and bijective techniques to provide recurrence relations,…

组合数学 · 数学 2023-10-24 Juan B. Gil , Jessica A. Tomasko

In this paper, we study pattern avoidance for stabilized-interval-free (SIF) permutations. These permutations are contained in the set of indecomposable permutations and in the set of derangements. We enumerate pattern-avoiding SIF…

组合数学 · 数学 2025-01-13 Daniel Birmajer , Juan B. Gil , Jordan O. Tirrell , Michael D. Weiner

A permutation is called covexillary if it avoids the pattern $3412$. We construct an open embedding of a covexillary matrix Schubert variety into a Grassmannian Schubert variety. As applications of this embedding, we show that the…

代数几何 · 数学 2022-03-29 Rahul Singh

We prove trace inequalities for a self-adjoint operator on an abstract Hilbert space. These inequalities lead to universal bounds on spectral gaps and on moments of eigenvalues lambda_k that are analogous to those known for Schroedinger…

谱理论 · 数学 2008-08-11 Evans M. Harrell , Joachim Stubbe

A new approach to the semantics of identity types in intensional Martin-L\"of type theory is proposed, assuming only a category with finite limits and an interval. The specification of \emph{extensional} identity types in the original…

范畴论 · 数学 2026-01-13 Steve Awodey , Joseph Hua