Related papers: Enumerative Coding for Grassmannian Space
A combinatorial Gray code for a set of combinatorial objects is a sequence of all combinatorial objects in the set so that each object is derived from the preceding object by changing a small part. In this paper we design a Gray code for…
Graphcodes were recently introduced as a technique to employ two-parameter persistence modules in machine learning tasks (Kerber and Russold, NeurIPS 2024). We show in this work that a compressed version of graphcodes yields a description…
The number of spanning trees of a graph $G$ is called the {\em complexity} of $G$ and is denoted $c(G)$. Let C(n) denote the {\em (binary) hypercube} of dimension $n$. A classical result in enumerative combinatorics (based on explicit…
Range minimum queries (RMQs) are fundamental operations with widespread applications in database management, text indexing and computational biology. While many space-efficient data structures have been designed for RMQs on arrays with…
Developing non-perturbative methods to reveal exotic properties of strongly correlated fermionic systems remains one of the most essential tasks of theoretical physics. Tensor network methods with Grassmann algebra offer powerful numerical…
For a smooth affine algebraic group $G$ over an algebraically closed field, we consider several two-variables generalizations of the affine Grassmannian $G(\!(t)\!)/G[\![t]\!]$, given by quotients of the double loop group…
Automated theorem proving in first-order logic is an active research area which is successfully supported by machine learning. While there have been various proposals for encoding logical formulas into numerical vectors -- from simple…
Let $G_{n,k}$ denote the real Grassmann manifold of $k$-dimensional vector subspaces of $\mathbb R^n$. Using the Hodgkin spectral sequence, we compute the complex $K$-ring of $G_{n,k}$, up to a small indeterminacy, for all values of $n,k$…
There is a class of entropy-coding methods which do not substitute symbols by code words (such as Huffman coding), but operate on intervals or ranges. This class includes three prominent members: conventional arithmetic coding, range…
Logical query answering over Knowledge Graphs (KGs) is a fundamental yet complex task. A promising approach to achieve this is to embed queries and entities jointly into the same embedding space. Research along this line suggests that using…
Assume that an $N$-bit sequence $S$ of $k$ numbers encoded as Elias gamma codes is given as input. We present space-efficient algorithms for sorting, dense ranking and competitive ranking on $S$ in the word RAM model with word size…
Attention is focused on antisymmetrized versions of quantum spaces that are of particular importance in physics, i.e. two-dimensional quantum plane, q-deformed Euclidean space in three or four dimensions as well as q-deformed Minkowski…
We devise an algorithm that approximately computes the number of paths of length $k$ in a given directed graph with $n$ vertices up to a multiplicative error of $1 \pm \varepsilon$. Our algorithm runs in time $\varepsilon^{-2} 4^k(n+m)…
Subgraph matching is vital in knowledge graph (KG) question answering, molecule design, scene graph, code and circuit search, etc. Neural methods have shown promising results for subgraph matching. Our study of recent systems suggests…
We extend the notion of locality from the Hamming metric to the rank and subspace metrics. Our main contribution is to construct a class of array codes with locality constraints in the rank metric. Our motivation for constructing such codes…
In this paper, we propose a novel subspace learning framework for one-class classification. The proposed framework presents the problem in the form of graph embedding. It includes the previously proposed subspace one-class techniques as its…
Tensor networks provide compact and scalable representations of high-dimensional data, enabling efficient computation in fields such as quantum physics, numerical partial differential equations (PDEs), and machine learning. This paper…
In this paper we investigate the chromatic number of the Grassmann graphs and of their powers, denoted $J_q(n,m,t)$. In this graph, the vertices correspond to the $m$-dimensional subspaces in $\mathbb{F}_q^n$ and two vertices are adjacent…
We present a unique decoding algorithm of algebraic geometry codes on plane curves, Hermitian codes in particular, from an interpolation point of view. The algorithm successfully corrects errors of weight up to half of the order bound on…
Unary coding is useful but it is redundant in its standard form. Unary coding can also be seen as spatial coding where the value of the number is determined by its place in an array. Motivated by biological finding that several neurons in…