Related papers: Automorphisms of Codes in the Grassmann Scheme

In this paper we propose and study a new complexity model for approximation algorithms. The main motivation are practical problems over large data sets that need to be solved many times for different scenarios, e.g., many multicast trees…

The fundamental role of on-shell diagrams in quantum field theory has been recently recognized. On-shell diagrams, or equivalently bipartite graphs, provide a natural bridge connecting gauge theory to powerful mathematical structures such…

Coding theory and combinatorial $t$-designs have close connections and interesting interplay. One of the major approaches to the construction of combinatorial t-designs is the employment of error-correcting codes. As we all known, some…

Various spaces of symmetries of a structure are naturally endowed with both an algebraic and a topological structure. For example, the automorphism group of a structure is, on top of being a group, a topological group when equipped with the…

Twin-width is a graph parameter introduced in the context of first-order model checking, and has since become a central parameter in algorithmic graph theory. While many algorithmic problems become easier on arbitrary classes of bounded…

Let $G$ be a connected graph on $n$ vertices and $1 \le k \le n-1$ an integer. The $k$-token graph of $G$ is the graph $F_k(G)$ whose vertices are all the $k$-subsets of vertices of $G$, two of which are adjacent whenever their symmetric…

In this paper, we investigate the problem of generating the spanning trees of a graph $G$ up to the automorphisms or "symmetries" of $G$. After introducing and surveying this problem for general input graphs, we present algorithms that…

Let $\mathbb{Z}_{p^s}$ be the residue class ring of integers modulo $p^s$, where $p$ is a prime number and $s$ is a positive integer. Using matrix representation and the inner rank of a matrix, we study the intersection, join, dimension…

In classical coding theory, Gray isometries are usually defined as mappings between finite Frobenius rings, which include the ring $Z_m$ of integers modulo $m$, and the finite fields. In this paper, we derive an isometric mapping from $Z_8$…

We introduce the concepts of complex Grassmannian codes and designs. Let G(m,n) denote the set of m-dimensional subspaces of C^n: then a code is a finite subset of G(m,n) in which few distances occur, while a design is a finite subset of…

The goal of this paper is to construct and describe certain arithmetic subgroups of the automorphism group of a partially commutative group. More precisely, given an arbitrary finite graph $\Gamma$ we construct an arithmetic subgroup…

Let $\Gamma_k(V)$ be the Grassmann graph whose vertex set ${\mathcal G}_{k}(V)$ is formed by all $k$-dimensional subspaces of an $n$-dimensional vector space $V$ over the finite field $F_q$ consisting of $q$ elements. We discuss its…

The paper presents a method to generate some families of linear codes over finite fields of characteristics greater than two in the widest class due to the size of Grassmann manifold, i.e. when the dimension is equal to codimension. Our…

In the past decades for more and more graph classes the Graph Isomorphism Problem was shown to be solvable in polynomial time. An interesting family of graph classes arises from intersection graphs of geometric objects. In this work we show…

Let K be a cyclic Galois extension of degree f over k and T a generator of the Galois group. For any v=(v_1,... , v_m)\in K^m such that v is linearly independent over k, and any 0< d < m the Gabidulin-like code C(v, T , d) is a maximum rank…

In recent years many algorithms have been developed for finding patterns in graphs and networks. A disadvantage of these algorithms is that they use subgraph isomorphism to determine the support of a graph pattern; subgraph isomorphism is a…

We determine the permutation groups that arise as the automorphism groups of cyclic combinatorial objects. As special cases we classify the automorphism groups of cyclic codes. We also give the permutations by which two cyclic combinatorial…

We present a structure associated to the class of linear codes. The properties of that structure are similar to some structures in the linear algebra techniques into the framework of the Gr\"obner bases tools. It allows to get some insight…

Let $F$ be a field of characteristic different from two, and let $E$ be the Grassmann algebra of an infinite-dimensional $F$-vector space $L$. In this paper, we survey recent results concerning automorphisms of order two of $E$ and the…

In recent years, we have seen several approaches to the graph isomorphism problem based on "generic" mathematical programming or algebraic (Gr\"obner basis) techniques. For most of these, lower bounds have been established. In fact, it has…