Related papers: Parikh Word Representability of Bipartite Permutat…
In a recent work on the bipartite Erd\H{o}s-R\'{e}nyi graph, Do et al. (2023) established upper bounds on the number of connected labeled bipartite graphs with a fixed surplus. We use some recent encodings of bipartite random graphs in…
We present a general framework for comparing multiple groups of documents. A bipartite graph model is proposed where document groups are represented as one node set and the comparison criteria are represented as the other node set. Using…
It is known that the canonical double cover of any connected nonbipartite graph have an automorphism group of the form $H \rtimes \mathbb{Z}_2$, where $H$ is the set of automorphism which preserve bipartite parts. We construct connected…
The notion of a $k$-11-representable graph was introduced by Jeff Remmel in 2017 and studied by Cheon et al.\ in 2019 as a natural extension of the extensively studied notion of word-representable graphs, which are precisely…
Comparability graphs are graphs which have transitive orientations. The dimension of a poset is the least number of linear orders whose intersection gives this poset. The dimension ${\rm dim}(X)$ of a comparability graph $X$ is the…
The point of view of these notes on the topic is to bring out the flavour that Representation Theory is an extension of the first course on Group Theory. We also emphasize the importance of the base field. These notes cover completely the…
We introduce a new class of algebras arising from graphs, called binomial edge rings. Given a graph $G$ on $d$ vertices with $n$ edges, the binomial edge ring of $G$ is defined to be the subalgebra of the polynomial ring with $2d$ variables…
We say that a bipartite graph $G(A, B)$ with fixed parts $A$, $B$ is proximinal if there is a semimetric space $(X, d)$ such that $A$ and $B$ are disjoint proximinal subsets of $X$ and all edges $\{a, b\}$ satisfy the equality $d(a, b) =…
Previous work on symmetric group equivariant neural networks generally only considered the case where the group acts by permuting the elements of a single vector. In this paper we derive formulae for general permutation equivariant layers,…
In this thesis, we develop the theory of bifibrations of polycategories. We start by studying how to express certain categorical structures as universal properties by generalising the shape of morphism. We call this phenomenon…
This paper describes several new problems and ideas concerning algebraic geometry and complexity theory. It first uses the idea of coloring graphs with elements of finite fields. This procedure then shows that graph coloring problems can be…
Graph grammars extend the theory of formal languages in order to model distributed parallelism in theoretical computer science. We show here that to certain classes of context-free and context-sensitive graph grammars one can associate a…
In this paper we show that, for a class of countable graphs, every representation of the associated graph algebra in a separable Hilbert space is unitarily equivalent to a representation obtained via branching systems.
This paper is a contribution to the study of hereditary classes of finite graphs. We classify these classes according to the number of prime structures they contain. We consider such classes that are \emph{minimal prime}: classes that…
We study C*-algebras generated by two partitions of unity subject to orthogonality relations governed by a bipartite graph which we also call "bipartite graph C*-algebras". These algebras generalize at the same time the C*-algebra…
In this paper, we completely characterize the niche graphs of bipartite tournaments and find their interesting properties.
The binomial notation (w u) represents the number of occurrences of the word u as a (scattered) subword in w. We first introduce and study possible uses of a geometrical interpretation of (w ab) and (w ba) when a and b are distinct letters.…
In this article we give two different ways of representations of circular words. Representations with tuples are intended as a compact notation, while representations with trees give a way to easily process all conjugates of a word. The…
We formulate the notion of an isomorphism of GKM graphs. We then show that two GKM graphs have isomorphic graph equivariant cohomology algebras if and only if the graphs are isomorphic.
This paper studies unitary representations with Dirac cohomology for complex groups, in particular relations to unipotent representations