Related papers: Complete branching rules for Specht modules
We give lower bounds on the size and total size of clique partitions of a graph in terms of its spectral radius and minimum degree, and derive a spectral upper bound for the maximum number of edge-disjoint $t$-cliques. The extremal graphs…
This doctoral thesis covers several topics related to the construction and study of maximal determinant matrices with complex entries. The first three chapters are devoted to number-theoretic tools to prove the non-solvability of Gram…
A rectangular partition is the partition of an (axis-aligned) rectangle into interior-disjoint rectangles. We ask whether a rectangular partition permits a "nice" drawing of its dual, that is, a straight-line embedding of it such that each…
Simple drawings are drawings of graphs in which any two edges intersect at most once (either at a common endpoint or a proper crossing), and no edge intersects itself. We analyze several characteristics of simple drawings of complete…
The statistical mechanics of spin models, such as the Ising or Potts models, on generic random graphs can be formulated economically by considering the N --> 1 limit of Hermitian matrix models. In this paper we consider the N --> 1 limit in…
Consider a graph with a rotation system, namely, for every vertex, a circular ordering of the incident edges. Given such a graph, an angle cover maps every vertex to a pair of consecutive edges in the ordering -- an angle -- such that each…
In this paper we introduce abstract string modules and give an explicit bijection between the submodule lattice of an abstract string module and the perfect matching lattice of the corresponding abstract snake graph. In particular, we make…
Random-cluster measures on infinite regular trees are studied in conjunction with a general type of `boundary condition', namely an equivalence relation on the set of infinite paths of the tree. The uniqueness and non-uniqueness of…
A perfect code in a graph $\Gamma = (V, E)$ is a subset $C$ of $V$ that is an independent set such that every vertex in $V \setminus C$ is adjacent to exactly one vertex in $C$. A total perfect code in $\Gamma$ is a subset $C$ of $V$ such…
We present a detailed analysis of the class of regression decision tree algorithms which employ a regulized piecewise-linear node-splitting criterion and have regularized linear models at the leaves. From a theoretic standpoint, based on…
In a recent work [1] we consider the topological expansion for the non-mixed observables (including the free energy) for the formal Cauchy matrix model. The only restriction in [1] was the fact that all the branch points have to be simple.…
Series-parallel (SP) graphs are binary edge-labeled graphs with a designated source and target vertex, built using serial and parallel composition. A set of graphs is recognizable if membership depends only on its image under a homomorphism…
One of the important features of an interconnection network is its ability to efficiently simulate programs or parallel algorithms written for other architectures. Such a simulation problem can be mathematically formulated as a graph…
The main result of the paper is motivated by the following two, apparently unrelated graph optimization problems: (A) as an extension of Edmonds' disjoint branchings theorem, characterize digraphs comprising $k$ disjoint branchings $B_i$…
We characterize the ``best'' model geometries for the class of virtually free groups, and we show that there is a countable infinity of distinct ``best'' model geometries in an appropriate sense--these are the maximally symmetric trees. The…
We introduce a new, probability-level approach to calculations in scalar field particle scattering. The approach involves the implicit summation over final states, which makes causality manifest since retarded propagators emerge naturally.…
We develop a formalism to describe the equilibrium distributions for segments of confined branched networks consisting of stiff filaments. This is applicable to certain situations of cytoskeleton in cells, such as for example actin…
Combinatorial Game Theory typically studies sequential rulesets with perfect information where two players alternate moves. There are rulesets with {\em entailing moves} that break the alternating play axiom and/or restrict the other…
We introduce a new type of diagrams and prove the existence of a particular one, the "central tuned diagram", with some optimal features, for finitely generated modules of certain categories. This is achieved by getting to the idea of "the…
Over fields of characteristic zero, there are well known constructions of the irreducible representations, due to A Young, and of irreducible modules, called Specht modules, due to W Specht, for the symmetric groups $S_{n}$ which are based…