Related papers: Automorphisms of Codes in the Grassmann Scheme
An outer automorphism of a free group is geometric if it can be represented by a homeomorphism of a compact surface. Bestvina and Handel gave an algorithmic characterization of geometric irreducible outer automorphisms using relative train…
In graph modification problems, one is given a graph G and the goal is to apply a minimum number of modification operations (such as edge deletions) to G such that the resulting graph fulfills a certain property. For example, the Cluster…
Let $\varphi:V\times V\to W$ be a bilinear map of finite vector spaces $V$ and $W$ over a finite field $\mathbb{F}_q$. We present asymptotic bounds on the number of isomorphism classes of bilinear maps under the natural action of…
Coding theory and $t$-designs have close connections and interesting interplay. In this paper, we first introduce a class of ternary linear codes and study their parameters. We then focus on their three-weight subcodes with a special weight…
It is well known that the graph isomorphism problem is polynomial-time reducible to the graph automorphism problem (in fact these two problems are polynomial-time equivalent). We show that, analogously, the group isomorphism problem is…
We revisit the classical aspects of $\mathcal{N}=(2,2)$ supersymmetric sigma models with Hermitian symmetric target spaces, using the so-called Gross-Neveu (first-order GLSM) formalism. We reformulate these models for complex Grassmannians…
Spine spaces can be considered as fragments of a projective Grassmann space. We prove that the structure of lines together with binary coplanarity relation, as well as with binary relation of being in one pencil of lines, is a sufficient…
In the field of algebraic geometric codes (AG codes), the characterization of dual codes has long been a challenging problem which relies on differentials. In this paper, we provide some descriptions for certain differentials utilizing…
Path graphs are intersection graphs of paths in a tree. We start from the characterization of path graphs by Monma and Wei [C.L.~Monma,~and~V.K.~Wei, Intersection Graphs of Paths in a Tree, J. Combin. Theory Ser. B, 41:2 (1986) 141--181]…
Let $F$ be a field of characteristic zero and let $E$ be the Grassmann algebra of an infinite dimensional $F$-vector space $L$. In this paper we study the superalgebra structures (that is the $\mathbb{Z}_{2}$-gradings) that the algebra $E$…
A class of differential calculi is explored which is determined by a set of automorphisms of the underlying associative algebra. Several examples are presented. In particular, differential calculi on the quantum plane, the $h$-deformed…
The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstein [SODA 95, J'GAA 99] gives the first linear time algorithm for…
A Frobenius difference field is an algebraically closed field of characteristic $p>0$, enriched with a symbol for $x \mapsto x^{p^m}$. We study a sentence or formula in the language of fields with a distinguished automorphism, interpreted…
Metrics in Grassmannians, or distances between subspaces of same dimension, have many uses, and extending them to the Total Grassmannian of subspaces of different dimensions is an important problem, as usual extensions lack good properties…
We study orbit codes in the field extension ${\mathbb F}_{q^n}$. First we show that the automorphism group of a cyclic orbit code is contained in the normalizer of the Singer subgroup if the orbit is generated by a subspace that is not…
It is known that, for the algebra of functions on a Kleinian singularity, the parameter space of deformations and the parameter space of quantizations coincide. We prove that, for a Kleinian singularity of type $\mathbf{A}$ or $\mathbf{D}$,…
Automorphic loops are loops in which all inner mappings are automorphisms. A large class of automorphic loops is obtained as follows: Let $m$ be a positive even integer, $G$ an abelian group, and $\alpha$ an automorphism of $G$ that…
The {\em topological symmetry group} of an embedding $\Gamma$ of an abstract graph $\gamma$ in $S^3$ is the group of automorphisms of $\gamma$ which can be realized by homeomorphisms of the pair $(S^3, \Gamma)$. These groups are motivated…
Structural graph parameters play an important role in parameterized complexity, including in kernelization. Notably, vertex cover, neighborhood diversity, twin-cover, and modular-width have been studied extensively in the last few years.…
Vladimir Shpilrain and Jie-Tai Yu have asked for an effective algorithm to decide if two elements of C[x,y] are related by an automorphism of C[x,y]. We describe here an efficient algorithm that decides this question and finds the…