Related papers: Schr\"oder partitions, Schr\"oder tableaux and wea…
The symmetric Grothendieck polynomials generalize Schur polynomials and are Schur-positive by degree. Combinatorially this is manifested as the generalization of semistandard Young tableaux by set-valued tableaux. We define a (weak)…
We introduce a lifting of West's stack-sorting map $s$ to partition diagrams, which are combinatorial objects indexing bases of partition algebras. Our lifting $\mathscr{S}$ of $s$ is such that $\mathscr{S}$ behaves in the same way as $s$…
When short-range attractions are combined with long-range repulsions in colloidal particle systems, complex microphases can emerge. Here, we study a system of isotropic particles which can form lamellar structures or a disordered fluid…
We introduce a method for creating a special type of tree, called a tree position, from a weighted graph. Leaves of the tree correspond to vertices of the original graph, and the tree edges contain information which can be used to partition…
The aim of the paper is twofold. We establish refined Strichartz estimates for the Schr\"odinger equation on tori within the framework of partial regularity. As a result, we reveal that the solution of the free Schr\"odinger equation has…
In this paper, we prove a theorem about embedding of some partially ordered topological spaces in topological hyperspaces equipped with Fell topology. Then we give some examples to show that the map defining the embedding may not be…
This paper aims to establish the theoretical foundation for shift inclusion in mathematical morphology. In this paper, we prove that the morphological opening and closing concerning structuring elements of shift inclusion property would…
Much of modern Schubert calculus is centered on Schubert varieties in the complete flag variety and on their classes in its integral cohomology ring. Under the Borel isomorphism, these classes are represented by distinguished polynomials…
We create a framework for studying symmetric chain decompositions of families of finite posets based on the geometry of polytopes. Our framework unifies almost all known results regarding symmetric chain decompositions of the Young posets…
Many algorithms for inserting elements into tableaux are known, starting with the Robinson-Schensted algorithm. Much of those processes can be incorporated into the general framework of Fomin's "growth diagrams". Even for single types of…
We study a linear map on symmetric functions that ``divides'' a partition by a positive integer $k$, sending a Schur function indexed by a partition of $kn$ to a symmetric function indexed by partitions of $n$. We determine its Schur…
We give a combinatorial description of shape theory using finite topological $T_0$-spaces (finite partially ordered sets). This description may lead to a sort of computational shape theory. Then we introduce the notion of core for inverse…
We study the homotopy theory of locally ordered spaces, that is manifolds with boundary whose charts are partially ordered in a compatible way. Their category is not particularly well-behaved with respect to colimits. However, this category…
Motivated by the Saxl conjecture and the tensor square conjecture, which states that the tensor squares of certain irreducible representations of the symmetric group contain all irreducible representations, we study the tensor squares of…
We introduce SCORES, a recursive neural network for shape composition. Our network takes as input sets of parts from two or more source 3D shapes and a rough initial placement of the parts. It outputs an optimized part structure for the…
In this thesis we will study matrix models with discrete gauge group $S_N$. We will put these matrix models into a generalized Schur-Weyl duality framework where dual algebras, known as partition algebras, emerge. These form generalizations…
We study the problem of partitioning a given simple polygon $P$ into a minimum number of connected polygonal pieces, each of bounded size. We describe a general technique for constructing such partitions that works for several notions of…
We derive combinatorial identities, involving the Bernoulli and Euler numbers, for the numbers of standard Young tableaux of certain skew shapes. This generalizes the classical formulas of D. Andre on the number of up-down permutations. The…
We consider the problem of establishing dense correspondences within a set of related shapes of strongly varying geometry. For such input, traditional shape matching approaches often produce unsatisfactory results. We propose an ensemble…
In the paper we investigate two partial orders on standard Young tableaux and show their applications in the theory of invariant subspaces of nilpotent linear operators.