Related papers: A Continuous Analogue for Young Diagrams
Cut-diagrams are diagrammatic objects, defined in dimensions 1 and 2, that generalize links in 3-space and surface-links in 4-space; in dimension 1, this coincides with the theory of welded links. Using cut-diagrams, we introduce an…
In practice symmetries of combinatorial structures are computed by transforming the structure into an annotated graph whose automorphisms correspond exactly to the desired symmetries. An automorphism solver is then employed to compute the…
We show that diagrammatic sets, a topologically sound alternative to polygraphs and strict $\omega$-categories, admit an internal notion of equivalence in the sense of coinductive weak invertibility. We prove that equivalences have the…
Lascoux and Sch\"utzenberger introduced a notion of key associated to any Young tableau. More recently Lascoux defined the key of an alternating sign matrix by recursively removing all -1's in such matrices. But alternating sign matrices…
Combinatorial generation of expander families and Lindenmayer-style development models are both parallel in nature. Both can be handled within proposed parallel graph grammar formalism. Their first-order properties can then be checked by…
We introduce balanced shifted tableaux, as an analogue of balanced tableaux of Edelman and Greene, from the perspective of root systems of type B and C. We show that they are equinumerous to standard Young tableaux of the corresponding…
A Young diagram $Y$ is called wide if every sub-diagram $Z$ formed by a subset of the rows of $Y$ dominates $Z'$, the conjugate of $Z$. A Young diagram $Y$ is called Latin if its squares can be assigned numbers so that for each $i$, the…
We study the classification of ultrametric spaces based on their small scale geometry (uniform homeomorphism), large scale geometry (coarse equivalence) and both (all scale uniform equivalences). We prove that these equivalences can be…
We give a series of combinatorial results that can be obtained from any two collections (both indexed by $\Z\times \N$) of left and right pointing arrows that satisfy some natural relationship. When applied to certain self-interacting…
A "flip-and-reversal" involution arising in the study of quasisymmetric Schur functions provides a passage between what we term "Young" and "reverse" variants of bases of polynomials or quasisymmetric functions. Building on this…
Following a line of research initiated in \cite{BBNN}, I describe a general framework for turning reduction concepts of relative computability into diagrams forming an analogy with the Cicho\'n diagram for cardinal characteristics of the…
A continuous cohomology theory for topological quandles is introduced, and compared to the algebraic theories. Extensions of topological quandles are studied with respect to continuous 2-cocycles, and used to show the differences in second…
Link prediction is an important learning task for graph-structured data. In this paper, we propose a novel topological approach to characterize interactions between two nodes. Our topological feature, based on the extended persistent…
Consider two planar graphs which are subject to edge insertions and deletions. We show that whether the two graphs are isomorphic can be maintained with first-order logic formulas and auxiliary data of polynomial size. This places the…
Metric approximate categories, or metagories, for short, are metrically enriched graphs. Their structure assigns to every directed triangle in the graph a value which may be interpreted as the area of the triangle; alternatively, as the…
Aguiar and Mahajan provided several coalgebra axioms and algebra axioms for a family of left-regular bands to construct a commutative diagram of algebras and coalgebras. In this paper, we will add compatibility axioms to make it a diagram…
Kerov polynomials describe normalized irreducible characters of the symmetric groups in terms of the free cumulants associated with Young diagrams. We suggest well-suited counterparts of the Kerov polynomials in spin (or projective)…
Young diagrams are fundamental combinatorial objects in representation theory and algebraic geometry. Many constructions that rely on these objects depend on variations of a straightening process that expresses a filling of a Young diagram…
A new $q$-analog of Genocchi numbers is introduced through a q-analog of Seidel's triangle associated to Genocchi numbers. It is then shown that these $q$-Genocchi numbers have interesting combinatorial interpretations in the classical…
A pseudoline is a homeomorphic image of the real line in the plane so that its complement is disconnected. An arrangement of pseudolines is a set of pseudolines in which every two cross exactly once. A drawing of a graph is pseudolinear if…