Related papers: Complete branching rules for Specht modules
In this expository paper, we present a construction of tree modules and combine it with (infinite dimensional) tilting theory and relative Mittag-Leffler conditions in order to explore limits of the approximation theory of modules. We also…
We consider drawings of trees in which all edges incident to leaves can be extended to infinite rays without crossing, partitioning the plane into infinite convex polygons. Among all such drawings we seek the one maximizing the angular…
Over fields of characteristic zero, there are well known construction of the irreducible representations and of irreducible modules, called Specht modules for the symmetric groups $S_{n}$ which are based on elegant combinatorial concepts…
We study branching multiplicity spaces of complex classical groups in terms of GL(2) representations. In particular, we show how combinatorics of GL(2) representations are intertwined to make branching rules under the restriction of GL(n)…
Many modern numerical methods in computational science and engineering rely on derivatives of mathematical models for the phenomena under investigation. The computation of these derivatives often represents the bottleneck in terms of…
We consider two types of random networks grown in blocks. Hooking networks are grown from a set of graphs as blocks, each with a labelled vertex called a hook. At each step in the growth of the network, a vertex called a latch is chosen…
We present a formalism for the scattering of an arbitrary linear or acyclic branched structure build by joining mutually non-interacting arbitrary functional sub-units. The formalism consists of three equations expressing the structural…
We consider distributed networks, such as peer-to-peer networks, whose structure can be manipulated by adjusting the rules by which vertices enter and leave the network. We focus in particular on degree distributions and show that, with…
We study the complexity of cutting planes and branching schemes from a theoretical point of view. We give some rigorous underpinnings to the empirically observed phenomenon that combining cutting planes and branching into a branch-and-cut…
We propose a simple geometric recipe for constructing phase diagrams for a general class of vertex models obeying the ice rule. The disordered phase maps onto the intersecting loop model which is interesting in its own right and is related…
Combinatorial optimization problems are typically tackled by the branch-and-bound paradigm. We propose a new graph convolutional neural network model for learning branch-and-bound variable selection policies, which leverages the natural…
In this paper we reformulate in a simpler way the combinatoric core of constructive quantum field theory We define universal rational combinatoric weights for pairs made of a graph and one of its spanning trees. These weights are nothing…
We prove the modular branching rule of the cyclotomic Hecke algebras, which has remained open.
We solve a problem of Krivelevich, Kwan and Sudakov [SIAM Journal on Discrete Mathematics 31 (2017), 155-171] concerning the threshold for the containment of all bounded degree spanning trees in the model of randomly perturbed dense graphs.…
The recent proof of the Boij-Soederberg conjectures reveals new structure about Betti diagrams of modules, giving a complete description of the cone of Betti diagrams. We begin to expand on this new structure by investigating the semigroup…
This continues the investigation of a combinatorial model for the variation of dynamics in the family of rational maps of degree two, by concentrating on those varieties in which one critical point is periodic. We prove some general results…
For a few pairs $G\subset \hat G$ of reductive groups, we study the decomposition of irreducible $\hait G$-modules into $G$-modules. In particular, we observe the saturation property for all of these pairs.
We conjecture an exact expression for the large deviation function of the stationary state current in the partially asymmetric exclusion process with periodic boundary conditions. This expression is checked for small systems using…
This paper contains the details and complete proofs of our earlier announcement in math.AG/9907004 . We construct a general semiregularity map for algebraic cycles as asked for by S. Bloch in 1972. The existence of such a semiregularity map…
Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing problem we are given two trees T1 and T2 on n vertices and…