Related papers: Finite matrices are complete for (dagger-)hypergra…
We prove the finiteness of the genus of finite-dimensional division algebras over many infinitely generated fields. More precisely, let $K$ be a finite field extension of a field which is a purely transcendental extension of infinite…
We consider certain categorical structures that are implicit in subfactor theory. Making the connection between subfactor theory (at finite index) and category theory explicit sheds light on both subjects. Furthermore, it allows various…
The stable category of modules over the algebra of a finite group with coefficients in a field is a compactly generated tensor triangulated category, that has been studied extensively in representation theory. In this paper, we provide a…
Perfect colorings (equitable partitions) of graphs are extensively studied, while the same concept for hypergraphs attracts much less attention. The aim of this paper is to develop basic notions and properties of perfect colorings for…
We say that an indecomposable Cartan matrix A with entries in the ground field of characteristic 0 is almost affine if the Lie sub(super)algebra determined by it is not finite dimensional or affine but the Lie (super)algebra determined by…
We show that the cyclic and epicyclic categories which play a key role in the encoding of cyclic homology and the lambda operations, are obtained from projective geometry in characteristic one over the infinite semifield F of "max-plus…
We introduce a new family of superalgebras which should be considered as a super version of the Khovanov-Lauda-Rouquier algebras. Let $I$ be the set of vertices of a Dynkin diagram with parity. To this data, we associate a family of graded…
Motivated by the theory of graph limits, we introduce and study the convergence and limits of linear representations of finite groups over finite fields. The limit objects are infinite dimensional representations of free groups in…
A finite hypergraph $H$ consists of a finite set of vertices $V(H)$ and a collection of subsets $E(H) \subseteq 2^{V(H)}$ which we consider as partition of unity relations between projection operators. These partition of unity relations…
This paper considers the problem of completing a rating matrix based on sub-sampled matrix entries as well as observed social graphs and hypergraphs. We show that there exists a \emph{sharp threshold} on the sample probability for the task…
The main aim of the present paper is to introduce new methods for the study of combinatorial designs related to bent functions. They are based on interpretations of convolution on finite abelian groups as multiplication by a…
We show that the category of graphs has the structure of a 2-category with homotopy as the 2-cells. We then develop an explicit description of homotopies for finite graphs, in terms of what we call `spider moves'. We then create a category…
We show that every essentially small finitely semisimple k-linear additive spherical category in which k=End(1) is a field, is equivalent to its dual over the long canonical forgetful functor. This includes the special case of modular…
Let G < SL(V) be a finite group, V is finite dimensional over a field F, p=char F and S(V) is the symmetric algebra of V. We determine when the subring of G-invariants S(V)^G is a polynomial ring. As a consequence, we classify, if F is…
We show that finitely generated cohomology is invariant under separable equivalences for all algebras. As a result, we obtain a proof of the finite generation of cohomology for finite symmetric tensor categories in characteristic zero, as…
For a small category K enriched over a suitable monoidal category V, the free completion of K under colimits is the presheaf category [K*,V]. If K is large, its free completion under colimits is the V-category PK of small presheaves on K,…
We discuss what it means for a symmetric monoidal category to be a module over a commutative semiring category. Each of the categories of (1) cartesian monoidal categories, (2) semiadditive categories, and (3) connective spectra can be…
A hypergraph is a $T_0$-hypergraph if for every two different vertices of the hypergraph there exists an edge containing one of the vertices and not containing the other. A general method for the enumeration of certain classes of…
A graph $\Gamma$ is $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. If $V(\Gamma)$ admits a nontrivial $G$-invariant partition ${\cal B}$ such…
In this paper we investigate the functoriality properties of map-graded Hochschild complexes. We show that the category MAP of map-graded categories is naturally a stack over the category of small categories endowed with a certain…