English
Related papers

Related papers: Three results on twisted $G-$codes and skew twiste…

200 papers

Let $RG$ be the group ring of a finite group $G$ over a commutative ring $R$ with $1$. An element $x$ in $RG$ is said to be skew-symmetric with respect to an involution $\sigma$ of $RG$ if $\sigma(x)=-x.$ A structure theorem for the…

Rings and Algebras · Mathematics 2020-03-24 Dishari Chaudhuri

It is well known that the problem of determining the weight distributions of families of cyclic codes is, in general, notoriously difficult. An even harder problem is to find characterizations of families of cyclic codes in terms of their…

Information Theory · Computer Science 2015-08-21 Gerardo Vega

We prove that for every graph $G$, given fixed locations for the vertices of $G$ in $\mathbb{Z}^3$, there is a three-dimensional grid-drawing of $G$ with one bend per edge. The best previous bound was three bends per edge.

Computational Geometry · Computer Science 2016-06-30 David R. Wood

Let $X$ be a finite-dimensional, noetherian scheme. Antieau, Gepner and Heller conjectured that its derived category of perfect complexes has a bounded t-structure if and only if $X$ is regular. We prove a generalization, and to do so we…

Algebraic Geometry · Mathematics 2024-12-23 Amnon Neeman

We have generalized the well-known statement that the Clifford group is a unitary 3-design into symmetric cases by extending the notion of unitary design. Concretely, we have proven that a symmetric Clifford group is a symmetric unitary…

Quantum Physics · Physics 2024-05-27 Yosuke Mitsuhashi , Nobuyuki Yoshioka

In graph theory, a tree is one of the more popular families of graphs with a wide range of applications in computer science as well as many other related fields. While there are several distance measures over the set of all trees, we…

Information Theory · Computer Science 2021-02-04 Lev Yohananov , Eitan yaakobi

In this paper, we show that the volumes for a family of A-adequate closed braids can be bounded above and below in terms of the twist number, the number of braid strings, and a quantity that can be read from the combinatorics of a given…

Geometric Topology · Mathematics 2018-06-28 Adam Giambrone

For a countable abelian group $G$ we investigate generic properties of the space of all invariant metrics on $G$. We prove that for every such an unbounded group $G$, i.e. group which has elements of arbitrarily high order, there is a dense…

General Topology · Mathematics 2019-02-28 Michal Doucha

It is shown that a topological group G is topologically isomorphic to the isometry group of a (complete) metric space iff G coincides with its G-delta-closure in the Rajkov completion of G (resp. if G is Rajkov-complete). It is also shown…

Group Theory · Mathematics 2013-09-25 Piotr Niemiec

A subset $C$ of the vertex set of a graph $\Gamma$ is called a perfect code in $\Gamma$ if every vertex of $\Gamma$ is at distance no more than 1 to exactly one vertex of $C$. A subgroup $H$ of a group $G$ is called a subgroup perfect code…

Combinatorics · Mathematics 2025-07-22 Huye chen , Binbin Li , Jingjian Li , Hao Yu

Clique-width is a well-studied graph parameter. For graphs of bounded clique-width, many problems that are NP-hard in general can be polynomial-time solvable. The fact motivates several studies to investigate whether the clique-width of…

Data Structures and Algorithms · Computer Science 2022-02-01 Yu Nakahata

A triangulation of a punctured or pinched surface is irreducible if no edge can be shrunk without producing multiple edges or changing the topological type of the surface. The finiteness of the set of (non-isomorphic) irreducible…

Combinatorics · Mathematics 2013-06-04 M. J. Chávez , S. Lawrencenko , A. Quintero , M. T. Villar

Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case in which such graphs are Cayley graphs of Abelian groups. These groups can be constructed by…

Combinatorics · Mathematics 2020-05-20 C. Dalfó , M. A. Fiol , N. López

In this paper, we study convolutional codes with a specific cyclic structure. By definition, these codes are left ideals in a certain skew polynomial ring. Using that the skew polynomial ring is isomorphic to a matrix ring we can describe…

Information Theory · Computer Science 2007-08-13 Heide Gluesing-Luerssen , Fai-Lung Tsang

Let $G_{(m,3,r)}=\langle x,y\mid x^m=1, y^3=1,yx=x^ry\rangle$ be a metacyclic group of order $3m$, where ${\rm gcd}(m,r)=1$, $1<r<m$ and $r^3\equiv 1$ (mod $m$). Then left ideals of the group algebra $\mathbb{F}_q[G_{(m,3,r)}]$ are called…

Information Theory · Computer Science 2016-06-17 Cao Yonglin , Cao Yuan , Fu Fang-Wei , Gao Jian

For every connected graph $G$ and surface $S$, we consider the well-known string of inequalities $\delta_S(G) \leq \mu_S(G) \leq \nu_S(G)$, where $\mu$ and $\nu$ denote skewness and crossing number and $\delta$ is the Euler-formula lower…

Combinatorics · Mathematics 2025-01-07 Paul C. Kainen

It is shown that square free set theoretic involutive non-degenerate solutions of the Yang-Baxter equation whose associated permutation group (referred to as an involutive Yang-Baxter group) is abelian are retractable in the sense of…

Group Theory · Mathematics 2009-03-23 Ferran Cedo , Eric Jespers , Jan Okninski

A subset $C$ of the vertex set of a graph $\Gamma$ is called a perfect code of $\Gamma$ if every vertex of $\Gamma$ is at distance no more than one to exactly one vertex in $C$. In this paper, we classify all connected quintic Cayley graphs…

Combinatorics · Mathematics 2024-06-04 Yuefeng Yang , Xuanlong Ma , Qing Zeng

We prove that any reduced twisted group C*-algebra of a selfless group with the rapid decay property is selfless. As an application, we show that twisted group C*-algebras of acylindrically hyperbolic groups (possibly with nontrivial finite…

Operator Algebras · Mathematics 2026-04-28 Sven Raum , Hannes Thiel , Eduard Vilalta

For a set $X\subseteq \mathbb{N}$, we define the $X$-torsion of a group $G$ to be all elements $g\in G$ with $g^{n}=e$ for some $n\in X$. With $X$ recursively enumerable, we give two independent proofs (group-theoretic, and model-theoretic)…

Group Theory · Mathematics 2016-10-04 Maurice Chiodo , Zachiri McKenzie
‹ Prev 1 8 9 10 Next ›