Related papers: The isomorphism problem for linear representations…
Learning transformation invariant representations of visual data is an important problem in computer vision. Deep convolutional networks have demonstrated remarkable results for image and video classification tasks. However, they have…
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching for integers d>2 is the problem of finding a matching of size…
Square matrices represent linear self-maps of vector spaces, and their eigenpoints are the fixed points of the induced map on projective space. Likewise, polynomial self-maps of a projective space are represented by tensors. We study the…
In the two parts of this paper we solve a problem of De Rham, proving that Reidemeister torsion invariants determine topological equivalence of linear G-representations, for G a finite cyclic group. Methods in controlled K-theory and…
Scheinerman and Wilf (1994) assert that `an important open problem in the study of graph embeddings is to determine the rectilinear crossing number of the complete graph K_n.' A rectilinear drawing of K_n is an arrangement of n vertices in…
A topological group G is profinite if it is compact and totally disconnected. Equivalently, G is the inverse limit of a surjective system of finite groups carrying the discrete topology. We discuss how to represent a countably based…
In a reconfiguration problem, we are given two feasible solutions of a combinatorial problem and our goal is to determine whether it is possible to reconfigure one into the other, with the steps dictated by specific reconfiguration rules.…
This paper deals with the problem of finding, for a given graph and a given natural number k, a subgraph of k nodes with a maximum number of edges. This problem is known as the k-cluster problem and it is NP-hard on general graphs as well…
A graph homomorphism is a vertex map which carries edges from a source graph to edges in a target graph. The instances of the Weighted Maximum H-Colourable Subgraph problem (MAX H-COL) are edge-weighted graphs G and the objective is to find…
A kernelization for a parameterized decision problem $\mathcal{Q}$ is a polynomial-time preprocessing algorithm that reduces any parameterized instance $(x,k)$ into an instance $(x',k')$ whose size is bounded by a function of $k$ alone and…
In this paper, we study multiplicative structures on the K-theory of the core $A:=C^*(E)^{U(1)}$ of the C*-algebra $C^*(E)$ of a directed graph $E$. In the first part of the paper, we study embeddings $E\to E\times E$ that induce a…
The computational complexity of the graph isomorphism problem is considered to be a major open problem in theoretical computer science. It is known that testing isomorphism of chordal graphs is polynomial-time equivalent to the general…
It is a classical problem in algebraic topology asked by Steenrod which graded rings occur as the cohomology ring of a space. In this paper, we define an algebraic version of the graph colouring, span colouring, and observe the relation…
Orthogonal projections in ${\mathbb C}^n \otimes {\mathbb C}^n$ of rank one and rank two that give rise to unitary tensor space representations of the Temperley-Lieb algebra $TL_N(Q)$ are considered. In the rank one case, a complete…
In this article, we introduce the $k$-th collineation variety of a third order tensor. This is the closure of the image of the rational map of size $k$ minors of a matrix of linear forms associated to the tensor. We classify such varieties…
Hilbert--Lie groups are Lie groups whose Lie algebra is a real Hilbert space whose scalar product is invariant under the adjoint action. These infinite-dimensional Lie groups are the closest relatives to compact Lie groups. Here we study…
Geometric embedding of graphs in a point set in the plane is a well known problem. In this paper, the complexity of a variant of this problem, where the point set is bounded by a simple polygon, is considered. Given a point set in the plane…
In this note we prove a representation theorem for the symmetric cone automorphisms in the spin algebra\, $\Ln$.
In the Graph Isomorphism problem two N-vertex graphs G and G' are given and the task is to determine whether there exists a permutation of the vertices of G that preserves adjacency and transforms G into G'. If yes, then G and G' are said…
The aim of this paper is to use the framework of incidence geometry to develop a theory that permits to model both the inner and outer automorphisms of a group G simultaneously. More precisely, to any group G, we attempt to associate an…