English
Related papers

Related papers: Algebraic Resolutions of Seven Open Problems on Cy…

200 papers

The paper presents a comprehensive study of group codes from non-abelian split metacyclic group algebras. We derive an explicit Wedderburn-like decomposition of finite split metacyclic group algebras over fields with characteristic coprime…

Information Theory · Computer Science 2025-04-17 Kirill Vedenev

As a generalization of cyclic codes, quasi-cyclic (QC) codes contain many good linear codes. But quasi-cyclic codes studied so far are mainly limited to one generator (1-generator) QC codes. In this correspondence, 2-generator and…

Information Theory · Computer Science 2007-07-16 Eric Zhi Chen

The $P_1$--nonconforming quadrilateral finite element space with periodic boundary condition is investigated. The dimension and basis for the space are characterized with the concept of minimally essential discrete boundary conditions. We…

Numerical Analysis · Mathematics 2022-01-27 Jaeryun Yim , Dongwoo Sheen

Let $\mathcal{C}$ be a quasi-cyclic code of index $l(l\geq2)$. Let $G$ be the subgroup of the automorphism group of $\mathcal{C}$ generated by $\rho^l$ and the scalar multiplications of $\mathcal{C}$, where $\rho$ denotes the standard…

Information Theory · Computer Science 2023-11-08 Xiaoxiao Li , Minjia Shi , San Ling

The isomorphism problem means to decide if two given finite-dimensional simple algebras over the same centre are isomorphic and, if so, to construct an isomorphism between them. A solution to this problem has applications in computational…

Rings and Algebras · Mathematics 2007-05-23 Timo Hanke

Let $R$ be a finite commutative chain ring with unique maximal ideal $\langle \gamma\rangle$, and let $n$ be a positive integer coprime with the characteristic of $R/\langle \gamma\rangle$. In this paper, the algebraic structure of cyclic…

Information Theory · Computer Science 2014-05-13 Bocong Chen , San Ling , Guanghui Zhang

A matching is a set of edges in a graph with no common endpoint. A matching M is called acyclic if the induced subgraph on the endpoints of the edges in M is acyclic. Given a graph G and an integer k, Acyclic Matching Problem seeks for an…

Computational Complexity · Computer Science 2022-10-05 Sahab Hajebi , Ramin Javadi

We introduce the following submodular generalization of the Shortest Cycle problem. For a nonnegative monotone submodular cost function $f$ defined on the edges (or the vertices) of an undirected graph $G$, we seek for a cycle $C$ in $G$ of…

Data Structures and Algorithms · Computer Science 2022-11-10 Fedor V. Fomin , Petr A. Golovach , Tuukka Korhonen , Daniel Lokshtanov , Giannos Stamoulis

In \cite{M18}, the first author gave a construction of strongly regular Cayley graphs on the additive group of finite fields by using three-valued Gauss periods. In particular, together with the result in \cite{BLMX}, it was shown that…

Combinatorics · Mathematics 2021-12-21 Koji Momihara , Qing Xiang

In this work we attempt to generalize our result in [6] [7] for real rings (not just von Neumann regular real rings). In other words we attempt to characterize and construct real closure * of commutative unitary rings that are real. We also…

Rings and Algebras · Mathematics 2009-12-07 Jose Capco

Roughgarden, Vassilvitskii, and Wang (JACM 18) recently introduced a novel framework for proving lower bounds for Massively Parallel Computation using techniques from boolean function complexity. We extend their framework in two different…

Data Structures and Algorithms · Computer Science 2020-01-07 Moses Charikar , Weiyun Ma , Li-Yang Tan

In this paper, we study a nonlocal logistic system with nonlinear advection terms \begin{equation*} \left\{ \begin{array}{lcl} -\Delta u+\vec{\alpha}(x)\cdot \nabla (|u|^{p-1}u)&=&\left(a-\int_{\Omega}K_1(x,y)f(u,v)dy \right)u+bv\mbox{ in…

Analysis of PDEs · Mathematics 2025-04-29 Willian Cintra , Romildo Lima , Mayra Soares

We study the problem of finding homomorphisms into odd cycles from planar graphs with high odd-girth. The Jaeger-Zhang conjecture states that every planar graph of odd-girth at least $4k+1$ admits a homomorphism to the odd cycle $C_{2k+1}$.…

Combinatorics · Mathematics 2024-02-06 Daniel W. Cranston , Jiaao Li , Zhouningxin Wang , Chunyan Wei

We focus on two aspects of cyclic orbit codes: invariants under equivalence and quasi-optimality. Regarding the first aspect, we establish a connection between the codewords of a cyclic orbit code and a certain linear set on the projective…

Information Theory · Computer Science 2025-01-08 Chiara Castello , Heide Gluesing-Luerssen , Olga Polverino , Ferdinando Zullo

We introduce six independent trivariate bicycle (ITB) codes, which extend the bivariate bicycle framework of Bravyi et al.\ to three cyclic dimensions. Using asymmetric polynomial pairs on three-dimensional tori, we construct four codes…

Quantum Physics · Physics 2026-03-19 Aygul Azatovna Galimova

Let J be the Jacobian of a smooth curve C of genus g, and let A(J) be the ring of algebraic cycles modulo algebraic equivalence on J, tensored with Q. We study in this paper the smallest Q-vector subspace R of A(J) which contains C and is…

Algebraic Geometry · Mathematics 2007-05-23 Arnaud Beauville

We study the periodic and the Neumann boundary value problems associated with the second order nonlinear differential equation \begin{equation*} u'' + c u' + \lambda a(t) g(u) = 0, \end{equation*} where $g \colon…

Classical Analysis and ODEs · Mathematics 2015-03-19 Alberto Boscaggin , Guglielmo Feltrin , Fabio Zanolin

The aim of this paper is to give conditions for the equivalency between skew constacyclic codes, skew cyclic codes and skew negacyclic codes defined over semi-local rings. Also, we provide construction and an enumeration of Euclidean and…

Information Theory · Computer Science 2019-02-25 Ranya D. Boulanouar , Aicha Batoul

A 2024 paper of Sun, Ding and Wang introduced a second class of constacyclic codes over finite fields, denoted $C(q,m,r,\ell)$, with length $(q^m-1)/r$, where $r\mid(q-1)$ and the defining monomials have total $q$-ary degree congruent to…

Information Theory · Computer Science 2026-05-29 Yaoran Yang , Yutong Zhang

Let $\mathbb Z_n$ be the cyclic group of order $n \ge 3$ additively written. S. Savchev \& F. Chen (2007) proved that for each zero-sum free sequence $S = a_1 \bullet \dots \bullet a_t$ over $\mathbb Z_n$ of length $t > n/2$, there is an…

Number Theory · Mathematics 2018-11-12 Sávio Ribas
‹ Prev 1 8 9 10 Next ›