Related papers: Complete branching rules for Specht modules
We investigate decompositions of Betti diagrams over a polynomial ring within the framework of Boij-S\"oderberg theory. That is, given a Betti diagram, we determine if it is possible to decompose it into the Betti diagrams of complete…
This paper focuses on the branching process for solving any constraint satisfaction problem (CSP). A parametrised schema is proposed that (with suitable instantiations of the parameters) can solve CSP's on both finite and infinite domains.…
The construction of all irreducible modules of the symmetric groups over an arbitrary field which reduce to Specht modules in the case of fields of characteristic zero is given by G.D.James. Hal{\i}c{\i}o\u{g}lu and Morris describe a…
Strict inequalities in mixed-integer linear optimization can cause difficulties in guaranteeing convergence and exactness. Utilizing that optimal vertex solutions follow a lattice structure we propose a rounding rule for strict inequalities…
Construction of phylogenetic trees and networks for extant species from their characters represents one of the key problems in phylogenomics. While solution to this problem is not always uniquely defined and there exist multiple methods for…
Modular structure is ubiquitous among complex networks. We note that most such systems are subject to multiple structural and functional constraints, e.g., minimizing the average path length and the total number of links, while maximizing…
In this paper, we provide a diagrammatic approach to study the branching rules for cell modules on a sequence of walled Brauer algebras. This also allows us to calculate the structure constants of multiplication over the Grothendieck ring…
Rothe diagrams are diagrams which track inversions of a permutation. We define six main properties that Rothe diagrams fulfill: the southwest, dot, popping, numbering, step-out avoiding, and empty cell gap rules. We prove that -- given an…
In response to a well-known open question ``Does every complete geometric graph on $2n\/$ vertices have a partition of its edge set into $n\/$ plane spanning trees?" we provide an affirmative answer when the complete geometry graph is in…
We give uniform formulas for the branching rules of level 1 modules over orthogonal affine Lie algebras for all conformal pairs associated to symmetric spaces. We also provide a combinatorial intepretation of these formulas in terms of…
We suggest a new perspective of research towards understanding the relations between structure and dynamics of a complex network: Can we design a network, e.g. by modifying the features of units or interactions, such that it exhibits a…
In this note we make some specific observations on the distribution of the degree of a given vertex in certain model of randomly growing networks. The rule for network growth is the following. Starting with an initial graph of minimum…
We continue our study of orderings on Bratteli diagrams started in previous work, joint with Jan Kwiatkowski, where Bratteli diagrams of finite rank were considered. We extend the notions of languages, permutations (called correspondences…
Branch-and-bound is a typical way to solve combinatorial optimization problems. This paper proposes a graph pointer network model for learning the variable selection policy in the branch-and-bound. We extract the graph features, global…
We present an abstract framework for the axiomatic study of diagram algebras. Algebras that fit this framework possess analogues of both the Murphy and seminormal bases of the Hecke algebras of the symmetric groups. We show that the…
Dipper, James and Murphy generalized the classical Specht module theory to Hecke algebras of type $B_n$. On the other hand, for any choice of a monomial order on the parameters in type $B_n$, we obtain corresponding Kazhdan--Lusztig cell…
We present a pumping lemma for each level of the collapsible pushdown graph hierarchy in analogy to the second author's pumping lemma for higher-order pushdown graphs (without collapse). Using this lemma, we give the first known examples…
We begin a systematic study of the enumerative combinatorics of mixed succession rules, which are succession rules such that, in the associated generating tree, the nodes are allowed to produce their sons at several different levels…
Finding the set of leaves for an unbounded tree is a nontrivial process in both the Weihrauch and reverse mathematics settings. Despite this, many combinatorial principles for trees are equivalent to their restrictions to trees with leaf…
We propose efficient algorithms for enumerating the notorious combinatorial structures of maximal planar graphs, called canonical orderings and Schnyder woods, and the related classical graph drawings by de Fraysseix, Pach, and Pollack…