Related papers: Identifying Young diagrams among residue multisets

Capsule networks are a type of neural network that identify image parts and form the instantiation parameters of a whole hierarchically. The goal behind the network is to perform an inverse computer graphics task, and the network parameters…

A level graph is the data of a pair $(G,\pi)$ consisting of a finite graph $G$ and an ordered partition $\pi$ on the set of vertices of $G$. To each level graph on $n$ vertices we associate a polytope in $\mathbb R^n$ called its residue…

We associate to any endomorphism of the punctured affine space over some field an element in the Witt group of the base field that we call degree. We use this degree to give a counter-example to a question on unimodular rows

We introduce a new model of indeterminacy in graphs: instead of specifying all the edges of the graph, the input contains all triples of vertices that form a connected subgraph. In general, different (labelled) graphs may have the same set…

We survey several non-absolutely convergent integrals, including the Henstock-Kurzweil and Pfeffer integrals, and use ideas from these theories to investigate the problem of multidimensional Young integration. We further present results on…

Multiple reggeon exchange supplies subleading logs that may be used to restore unitarity to the Low-Nussinov Pomeron, provided it can be proven that the sum of Feynman diagrams to all orders gives rise to such multiple regge exchanges. This…

This paper studies planar algebras of Jones' style associated with the Young graph. We first see that, given a positive real valued function on the Young graph, we may obtain a planar algebra whose structure is defined in terms of a state…

A simple field theory approach is developed to model the properties of charged, dielectric bodies and their associated counterions. This predictive theory is able to accurately describe the properties of systems (as compared to computer…

Let G be a finite group acting linearly on the polynomial ring with invariant ring R. If the action is small, then a classical result of Auslander gives in dimension two a correspondence between linear representations of G and maximal…

First and second fundamental theorems are given for polynomial invariants of a class of pseudo-reflection groups (including the Weyl groups of type $B_n$), under the assumption that the order of the group is invertible in the base field.…

Multi-layer graphs consist of several graphs (layers) over the same vertex set. They are motivated by real-world problems where entities (vertices) are associated via multiple types of relationships (edges in different layers). We chart the…

Compound graphs are networks in which vertices can be grouped into larger subsets, with these subsets capable of further grouping, resulting in a nesting that can be many levels deep. In several applications, including biological workflows,…

This paper presents a framework based on matrices of monoids for the study of coupled cell networks. We formally prove within the proposed framework, that the set of results about invariant synchrony patterns for unweighted networks also…

We present the theory of multifunctions applied to graphs. Its interesting feature is that walks are recognized as iterations. We consider the graphs with arbitrary number of vertices which are determined by multifunctions. The mutually…

There is a familiar conjugate for integer partitions: transpose the Ferrers diagram, and a conjugate for integer compositions: transpose a Ferrers-like diagram. Here we propose a conjugate for set partitions and show that it interchanges #…

We analyze the weight diagram associated with foliations on the complex projective plane through the Hilbert-Mumford criterion in Geometric Invariant Theory, focusing in particular on invariants such as the algebraic multiplicity and the…

The homset invariant of a knot or link L with respect to an algebraic knot coloring structure X can be identified with a set of colorings of a diagram of L by elements of X via an identification of diagrammatic generators with algebraic…

We define an inversion statistic on standard Young tableaux. We prove that this statistic has the same distribution over SYT(\lambda) as the major index statistic by exhibiting a bijection on SYT(\lambda) in the spirit of the Foata map on…

We study covering numbers and local covering numbers with respect to difference graphs and complete bipartite graphs. In particular we show that in every cover of a Young diagram with $\binom{2k}{k}$ steps with generalized rectangles there…

We provide a coherent overview of a number of recent results obtained by the authors in the theory of schemes defined over the field with one element. Essentially, this theory encompasses the study of a functor which maps certain geometries…