Related papers: Semi-infinite combinatorics in representation theo…
Graph representation learning is a ubiquitous task in machine learning where the goal is to embed each vertex into a low-dimensional vector space. We consider the bipartite graph and formalize its representation learning problem as a…
We survey recent generalizations and improvements of the linear programming method that involve semidefinite programming. A general framework using group representations and tools from graph theory is provided.
We study some percolation problems on the complete graph over $\mathbf N$. In particular, we give sharp sufficient conditions for the existence of (finite or infinite) cliques and paths in a random subgraph. No specific assumption on the…
We present a few combinatorial identities which were encountered in our work on the spectral theory of quantum graphs. They establish a new connection between the theory of random matrix ensembles and combinatorics.
Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagram semigroups in a general framework and extend our…
We study a graph partitioning problem motivated by the simulation of the physical movement of multi-body systems on an atomistic level, where the forces are calculated from a quantum mechanical description of the electrons. Several advanced…
We start with definitions of the general notions of the theory of $\Bbb Z_{2}$-graded algebras. Then we consider theory of inductive families of $\Bbb Z_{2}$-graded semisimple finite-dimensional algebras and its representations in the…
We offer streamlined proofs of fundamental theorems regarding the index theory for partial self-maps of an infinite set that are bijective between cofinite subsets.
We propose a definition of graph subshifts of finite type that can be seen as extending both the notions of subshifts of finite type from classical symbolic dynamics and finitely presented groups from combinatorial group theory. These are…
We describe a general setting for the definition of semi-infinite cohomology of finite dimensional algebras, and provide its categorical interpretation. We apply this interpretation to compute semi-infinite cohomology of some modules over…
This is a survey article for "Handbook of Linear Algebra", 2nd ed., Chapman & Hall/CRC, 2014. An informal introduction to representations of quivers and finite dimensional algebras from a linear algebraist's point of view is given. The…
A graph theoretic perspective is taken for a range of phenomena in continuum physics in order to develop representations for analysis of large scale, high-fidelity solutions to these problems. Of interest are phenomena described by partial…
This paper is a sequel to [Ga1]. We study the semi-infinite category on the Ran version of the affine Grassmannian, and study a particular object in it that we call the semi-infinite intersection cohomology sheaf. Unlike the situation of…
In this paper we define the notion of monic representation for the $C^*$-algebras of finite higher-rank graphs with no sources, and undertake a comprehensive study of them. Monic representations are the representations that, when restricted…
We explore a general method based on trees of elementary submodels in order to present highly simplified proofs to numerous results in infinite combinatorics. While countable elementary submodels have been employed in such settings already,…
A partial complement of the graph $G$ is a graph obtained from $G$ by complementing all the edges in one of its induced subgraphs. We study the following algorithmic question: for a given graph $G$ and graph class $\mathcal{G}$, is there a…
A generalization of recent group-theoretic matrix multiplication algorithms to an analogue of the theory of partial matrix multiplication is presented. We demonstrate that the added flexibility of this approach can in some cases improve…
We discuss the semiclassical approximation to transport problems in quantum chaotic systems. The figures of merit are moments of the transmission matrix and of the time delay matrix. After reviewing a few results obtained by treating these…
We introduce a Sinkhorn-type algorithm for producing quantum permutation matrices encoding symmetries of graphs. Our algorithm generates square matrices whose entries are orthogonal projections onto one-dimensional subspaces satisfying a…
Motivated by appearance of multisemigroups in the study of additive $2$-categories, we define and investigate the notion of a multisemigroup with multiplicities. This notion seems to be better suitable for applications in higher…