Related papers: Young Diagram Decompositions for Almost Symmetric …
Quasi-Yamanouchi tableaux are a subset of semistandard Young tableaux and refine standard Young tableaux. They are closely tied to the descent set of standard Young tableaux and were introduced by Assaf and Searles to tighten Gessel's…
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations of these tools focusing on solutions of the real analogue:…
The present work aims to exploit the interplay between the algebraic properties of rings and the graph-theoretic structures of their associated graphs. We introduce commutatively closed graphs and investigate properties of commutatively…
We investigate pairs $(G,Y)$, where $G$ is a reductive algebraic group and $Y$ a purely-odd $G$-superscheme, asking when a pair corresponds to a quasi-reductive algebraic supergroup $\mathbb{G}$, that is, $\mathbb{G}_{\text{ev}}$ is…
In this note we develop a systematic combinatorial definition for constructed earlier supersymmetric polynomial families. These polynomial families generalize canonical Schur, Jack and Macdonald families so that the new polynomials depend…
We propose a new algebraic deformation of ${\cal N}=4$ SYM via decomposition of spinor and scalar fields in vector supermultiplet. This decomposition generates degrees of freedom of usual quarks and leptons and the deformation model is a…
Essential properties of semiclassical approximation for quantum mechanics are viewed as axioms of an abstract semiclassical mechanics. Its symmetry properties are discussed. Semiclassical systems being invariant under Lie groups are…
We show that for algebraic groups over local fields of characteristic zero, the following are equivalent: Every homomorphism has a closed image, every unitary representation decomposes into a direct sum of finite-dimensional and mixing…
Researchers are actively trying to gain better insights into the representational properties of convolutional neural networks for guiding better network designs and for interpreting a network's computational nature. Gaining such insights…
The graph of zigzag diagrams is a close relative of Young's lattice. The boundary problem for this graph amounts to describing coherent random permutations with descent-set statistic, and is also related to certain positive characters on…
This work is devoted to the study of the symmetries of (quasi)periodic architectured materials. For this purpose, the weaker symmetry criterion of indistinguishability is used. It relies on a statistical description of the mesostructure and…
The article presents the results of experiments in computation of statistical values related to Young diagrams, including the estimates on maximum and average (by Plancherel distribution) dimension of irreducible representation of symmetric…
We develop the representation theory of a finite semigroup over an arbitrary commutative semiring with unit, in particular classifying the irreducible and minimal representations. The results for an arbitrary semiring are as good as the…
We consider numerical semigroups associated with normal weighted homogeneous surface singularities with rational homology sphere links. We say that a semigroup is representable if it can be realized in this way. In this article, we study…
In this paper, we study commutative zero-divisor semigroups determined by graphs. We prove a uniqueness theorem for a class of graphs. We show two classes of graphs that have no corresponding semigroups. In particular, any complete graph…
The structure of transformation semigroups on a finite set is analyzed by introducing a hierarchy of functions mapping subsets to subsets. The resulting hierarchy of semigroups has a corresponding hierarchy of minimal ideals, or kernels.…
It is proved that the numerical semigroups associated to the combinatorial configurations satisfy a family of non-linear symmetric patterns. Also, these numerical semigroups are studied for two particular classes of combinatorial…
Understanding the structure of a graph along with the structure of its subgraphs is important for several problems in graph theory. Two examples are the Reconstruction Conjecture and isomorph-free generation. This paper raises the question…
Binomial Cayley graphs are obtained by considering the binomial coefficient of the weight function of a given Cayley graph and a natural number. We introduce these objects and study two families: one associated with symmetric groups and the…
We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…