Related papers: The isomorphism problem for linear representations…

We investigate the representation theory of the polynomial core of the quantum Teichmuller space of a punctured surface S. This is a purely algebraic object, closely related to the combinatorics of the simplicial complex of ideal cell…

Subgraph isomorphism counting is an important problem on graphs, as many graph-based tasks exploit recurring subgraph patterns. Classical methods usually boil down to a backtracking framework that needs to navigate a huge search space with…

A geometric graph is a simple graph G together with a straight line drawing of G in the plane with the vertices in general position. Two geometric realizations of a simple graph are geo-isomorphic if there is a vertex bijection between them…

Let k be a perfect field and let K/k be a finite extension of fields. An arithmetic noncommutative projective line is a noncommutative space equal to the projectivization of the noncommutative symmetric algebra of a k-central two -sided…

We investigate when a linear functional $L$ defined on a linear subspace $B$ of a unital commutative real algebra $A$ admits an integral representation w.r.t. a positive Radon measure supported on a closed subset $K$ of the character space…

We investigate a special case of the Induced Subgraph Isomorphism problem, where both input graphs are interval graphs. We show the NP-hardness of this problem, and we prove fixed-parameter tractability of the problem with non-standard…

The aim of this paper is twofold. On the one hand, it provides a review of the links between random tensor models, seen as quantum gravity theories, and the PL-manifolds representation by means of edge-colored graphs (crystallization…

Let $G=(V,E)$ and $H$ be two graphs. Packing problem is to find in $G$ the largest number of independent subgraphs each of which is isomorphic to $H$. Let $U\subset{V}$. If the graph $G-U$ has no subgraph isomorphic to $H$, $U$ is a cover…

Parametric models in vector spaces are shown to possess an associated linear map. This linear operator leads directly to reproducing kernel Hilbert spaces and affine- / linear- representations in terms of tensor products. From the…

Let $\mathcal{F}$ be a family of graphs, and let $p,r$ be nonnegative integers. The \textsc{$(p,r,\mathcal{F})$-Covering} problem asks whether for a graph $G$ and an integer $k$, there exists a set $D$ of at most $k$ vertices in $G$ such…

We study the connection between *-representations of algebras associated with graphs, locally-scalar graph representations and the problem about the spectrum of a sum of two Hermitian operators. For algebras associated with Dynkin graphs we…

For a nonautonomous linear system with nonuniform contraction, we construct a topological equivalence between this system and an unbounded nonlinear perturbation. This topological equivalence is constructed as a composition of…

We introduce the concept of alternate-edge-colourings for maps, and study highly symmetric examples of such maps. Edge-biregular maps of type $(k,l)$ occur as smooth normal quotients of a particular index two subgroup of $T_{k,l}$, the full…

Consider the Grassmann graph of $k$-dimensional subspaces of an $n$-dimensional vector space over the $q$-element field, $1<k<n-1$. Every automorphism of this graph is induced by a semilinear automorphism of the corresponding vector space…

Finding a shortest path in a graph is one of the most classic problems in algorithmic and graph theory. While we dispose of quite efficient algorithms for this ordinary problem (like the Dijkstra or Bellman-Ford algorithms), some slight…

In geometric representation theory, it is common to compute equivariant $K$ theory of schemes like $Hilb^n ( \mathbb{A}^2 )$ or $Hilb^n (X)$ for an ALE resolution $X \to \mathbb{A}^2 / \Gamma$. If we abandon the algebraic nature and just…

Let $K$ be a global field of positive characteristic. Let $\infty$ be a fixed place of $K$. This paper gives an explicit isomorphism between the space of automorphic forms (resp. cusp forms) for $GL_{n+1}(K)$ that transform like the special…

Many tasks that rely on representations of nodes in graphs would benefit if those representations were faithful to distances between nodes in the graph. Geometric techniques to extract such representations have poor scaling over large graph…

Interval graphs are intersection graphs of closed intervals of the real-line. The well-known computational problem, called recognition, asks whether an input graph $G$ can be represented by closed intervals, i.e., whether $G$ is an interval…

A segment representation of a graph is an assignment of line segments in 2D to the vertices in such a way that two segments intersect if and only if the corresponding vertices are adjacent. Not all graphs have such segment representations,…