Related papers: Tower tableaux and Schubert polynomials
It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…
We introduce two families of symmetric functions with an extra parameter t that specialize to Schubert representatives for cohomology and homology of the affine Grassmannian when t = 1. The families are defined by a statistic on…
We generalize chain enumeration in graded partially ordered sets by relaxing the graded, poset and Eulerian requirements. The resulting balanced digraphs, which include the classical Eulerian posets having an $R$-labeling, imply the…
Subword complexes were defined by A.Knutson and E.Miller in 2004 for describing Gr\"obner degenerations of matrix Schubert varieties. The facets of such a complex are indexed by pipe dreams, or, equivalently, by the monomials in the…
We give a signed puzzle rule to compute Schubert coefficients. The rule is based on a careful analysis of Knutson's recurrence arXiv:math/0306304. We use the rule to prove polynomiality of the sums of Schubert coefficients with bounded…
We investigate border ranks of twisted powers of polynomials and smoothability of symmetric powers of algebras. We prove that the latter are smoothable. For the former, we obtain upper bounds for the border rank in general and prove that…
Clustering is a commonplace problem in many areas of data science, with applications in biology and bioinformatics, understanding chemical structure, image segmentation, building recommender systems, and many more fields. While there are…
State-of-the-art algorithms in lattice gauge theory typically rely heavily on detailed balance, which is an instrumental tool to prove the correct convergence of the Markov Chain Monte Carlo Algorithm. In this work, we investigate an…
The characteristic function of row contractions and liftings of row contractions are complete invariants up to unitary equivalence for row contractions and liftings of row contractions, respectively. We provide alternate proofs for these…
We define a number of related combinatorial objects, each of which possesses a surprising symmetry. We include several applications such as a combinatorial explanation for certain fixed points of the involution $\omega$ on the ring of…
Smale's alpha-theory certifies that Newton iterations will converge quadratically to a solution of a square system of analytic functions based on the Newton residual and all higher order derivatives at the given point. Shub and Smale…
It is proved that harmonic functions are characterized by harmonicity of their spherical means, for which purpose the iterated spherical means are used. The similar characterization of solutions to the modified Helmholtz equation…
The differential systems satisfied by orthogonal polynomials with arbitrary semiclassical measures supported on contours in the complex plane are derived, as well as the compatible systems of deformation equations obtained from varying such…
We connect generalized permutahedra with Schubert calculus. Thereby, we give sufficient vanishing criteria for Schubert intersection numbers of the flag variety. Our argument utilizes recent developments in the study of Schubitopes, which…
Probabilistic algorithms are applied to prove theorems about the finite general linear and unitary groups which are typically proved by techniques such as character theory and Moebius inversion. Among the theorems studied are Steinberg's…
We introduce and study the lattice of generalized partitions, called weighted partitions. This lattice possesses similar properties of the lattice of partitions. By use of the pictorial representation of a weighted partition, the total…
We provide a proof of the Alpern multi-tower theorem for Z^d actions. We reformulate the theorem as a problem of measurably tiling orbits of a Z^d action by a collection of rectangles whose corresponding sides have no non-trivial common…
In 2010, A. Shpilka and I. Volkovich established a prominent result on the equivalence of polynomial factorization and identity testing. It follows from their result that a multilinear polynomial over the finite field of order 2 can be…
This summarizes our latest understanding and results about the algorithms for enumerating Tanner Graphs that have a regular structure called Balanced Tanner Graphs. Enumeration algorithms for Balanced Tanner Graphs based upon Cyclic…
Structural balance theory assumes triads in networks to gravitate towards stable configurations. The theory has been verified for undirected graphs. Since real-world networks are often directed, we introduce a novel method for considering…