Related papers: Complete branching rules for Specht modules
We study graphs whose vertex degree tends and which are, therefore, called rapidly branching. We prove spectral estimates, discreteness of spectrum, first order eigenvalue and Weyl asymptotics solely in terms of the vertex degree growth.…
Our goal is to visualize an additional data dimension of a tree with multifaceted data through superimposition on vertical strips, which we call columns. Specifically, we extend upward drawings of unordered rooted trees where vertices have…
In this paper we prove a combinatorial theorem for finite labellings of trees, and show that it is equivalent to a theorem for finite covers of metric trees and a fixed point theorem on metric trees. We trace how these connections mimic the…
We give branching formulas from $so(7,\mathbb{C})$ to $\mathfrak{g}_2$ for generalized Verma modules attached to $\mathfrak{g}_2$-compatible parabolic subalgebras of $so(7,\mathbb{C})$, and branching formulas from $\mathfrak{g}_2$ to…
A split graph is a graph whose vertices can be partitioned into a clique and a stable set. We investigate the combinatorial species of split graphs, providing species-theoretic generalizations of enumerative results due to B\'ina and…
This paper gives two results on the simple modules for the Brauer algebra over the complex field. First we describe the module structure of the restriction of all simple modules. Second we give a new geometrical interpretation of Ram and…
Even though modularity has been studied extensively in conventional logic programming, there are few approaches on how to incorporate modularity into Answer Set Programming, a prominent rule-based declarative programming paradigm. A major…
In this note, we formulate and prove branching rules of simple polynomial modules for the Lie superalgebra $\mathfrak{gl}(m|n)$. Our branching rules depend on the conjugacy class of the Borel subalgebra. A Gelfand-Tsetlin basis of a…
On an infinite, radial metric tree graph we consider the corresponding Laplacian equipped with self-adjoint vertex conditions from a large class including $\delta$- and weighted $\delta'$-couplings. Assuming the numbers of different edge…
A (Euclidean) greedy drawing of a graph is a drawing in which, for any two vertices $s,t$ ($s \neq t$), there is a neighbor vertex of $s$ that is closer to $t$ than to $s$ in the Euclidean distance. Greedy drawings are important in the…
We introduce polytopal cell complexes associated with partial acyclic orientations of a simple graph, which generalize acyclic orientations. Using the theory of cellular resolutions, two of these polytopal cell complexes are observed to…
A strengthened version of Harborth's well-known conjecture -- known as Kleber's conjecture -- states that every planar graph admits a planar straight-line drawing where every edge has integer length and each vertex is restricted to the…
After recalling the definition of codes as modules over skew polynomial rings, whose multiplication is defined by using an automorphism and a derivation, and some basic facts about them, in the first part of this paper we study some of…
We investigate the gap between theory and practice for exact branching algorithms. In theory, branch-and-reduce algorithms currently have the best time complexity for numerous important problems. On the other hand, in practice,…
We consider the notion of mixed multiplicities for multigraded modules by using Hilbert series, and this is later applied to study the projective degrees of rational maps. We use a general framework to determine the projective degrees of a…
We present a determinantal formula for the number of spanning trees of a complete multipartite graph containing a given spanning forest $F$. Our approach relies on the Generalized Matrix Determinant Lemma and Jacobi's formula for the…
A cohomological criterion for the complete reducibility of modules of finite length satisfying a composability condition for a meromorphic open-string vertex algebra $V$ has been given by Qi and the author. In order to apply this criterion,…
Graph packing and partitioning problems have been studied in many contexts, including from the algorithmic complexity perspective. Consider the packing problem of determining whether a graph contains a spanning tree and a cycle that do not…
It is known that every planar graph has a planar embedding where edges are represented by non-crossing straight-line segments. We study the planar slope number, i.e., the minimum number of distinct edge-slopes in such a drawing of a planar…
We survey the logical structure of constructive set theories and point towards directions for future research. Moreover, we analyse the consequences of being extensible for the logical structure of a given constructive set theory. We…