Related papers: Semi-infinite combinatorics in representation theo…
Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.
In the last years many results in the area of semidefinite programming were obtained for invariant (finite dimensional, or infinite dimensional) semidefinite programs - SDPs which have symmetry. This was done for a variety of problems and…
We define a version of spectral invariant in the vortex Floer theory for a $G$-Hamiltonian manifold $M$. This defines potentially new (partial) symplectic quasi-morphism and quasi-states when $M//G$ is not semi-positive. We also establish a…
We define antidomain operations for algebras of multiplace partial functions. For all signatures containing composition, the antidomain operations and any subset of intersection, preferential union and fixset, we give finite equational or…
A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is a…
We examine the cohomology and representation theory of a family of finite supergroup schemes of the form $(\mathbb G_a^-\times \mathbb G_a^-)\rtimes (\mathbb G_{a(r)}\times (\mathbb Z/p)^s)$. In particular, we show that a certain relation…
We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a…
Function graphs are graphs representable by intersections of continuous real-valued functions on the interval [0,1] and are known to be exactly the complements of comparability graphs. As such they are recognizable in polynomial time.…
We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…
We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global…
We introduce a new graph invariant that measures fractional covering of a graph by cuts. Besides being interesting in its own right, it is useful for study of homomorphisms and tension-continuous mappings. We study the relations with…
We establish representation types (finite, tame or wild) of finite dimensional Munn algebras with semisimple bases. As an application, we establish representation types of finite 0-simple semigroups and their mutually annihilating unions.
We construct a sequence of subset partition graphs satisfying the dimension reduction, adjacency, strong adjacency, and endpoint count properties whose diameter has a superlinear asymptotic lower bound. These abstractions of polytope graphs…
This is the first of a series of papers on foundations of Floer theory. We give an axiomatic treatment of the geometric notion of a semi-infinite cycle. Using this notion, we introduce a bordism version of Floer theory for the cotangent…
The main result provide a common generalization for Ramsey-type theorems concerning finite colorings of edge sets of complete graphs with vertices in infinite semigroups. We capture the essence of theorems proved in different fields: for…
We study and classify representations of a torsion group $G$ over an idempotent semifield with special attention on the case over the Boolean semifield $\mathbb{B}$. In subsequent work we extend this theory to studying representations of…
In this paper we study the representation theory for certain ``half lattice vertex algebras.'' In particular we construct a large class of irreducible modules for these vertex algebras. We also discuss how the representation theory of these…
We consider partial matchings, which are finite graphs consisting of edges and vertices of degree zero or one. We consider transformations between two states of partial matchings. We introduce a method of presenting a transformation between…
Solitons in two-dimensional quantum field theory exhibit patterns of degeneracies and associated selection rules on scattering amplitudes. We develop a representation theory that captures these intriguing features of solitons. This…
Statistical models on infinite graphs may exhibit inhomogeneous thermodynamic behaviour at macroscopic scales. This phenomenon is of geometrical origin and may be properly described in terms of spectral partitions into subgraphs with well…