English
Related papers

Related papers: Semi-cyclic holey group divisible designs with blo…

200 papers

Our aim is to support the choice of two remarkable connections with torsion in a 3-Sasakian manifold, proving that, in contrast to the Levi-Civita connection, the holonomy group in the homogeneous cases reduces to a proper subgroup of the…

Differential Geometry · Mathematics 2019-03-20 Cristina Draper

Cyclic codes have efficient encoding and decoding algorithms over finite fields, so that they have practical applications in communication systems, consumer electronics and data storage systems. The objective of this paper is to give eight…

Information Theory · Computer Science 2022-05-02 Lanqiang Li , Li Liu , Shixin Zhu

Binary self-orthogonal codes and balanced incomplete block designs are two combinatorial configurations that have been much studied because of their wide areas of application. In this paper, we have shown the distribution of (16; 6;…

Combinatorics · Mathematics 2021-03-31 Navid Nasr Esfahani , G. H. John van Rees

Ulrich ideals in numerical semigroup rings of small multiplicity are studied. If the semigroups are three-generated but not symmetric, the semigroup rings are Golod, since the Betti numbers of the residue class fields of the semigroup rings…

Commutative Algebra · Mathematics 2021-11-02 Naoki Endo , Shiro Goto

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…

Information Theory · Computer Science 2021-10-11 Can Xiang , Chunming Tang , Qi Liu

The cyclic code is a subclass of linear codes and has applications in consumer electronics, data storage systems and communication systems due to the efficient encoding and decoding algorithms. In 2013, Ding, et al. presented nine open…

Information Theory · Computer Science 2025-06-12 Dong He , Peipei Zheng , Qunying Liao

We consider when the projective special linear group over a finite field defines a $3$-design with a cyclic starter block. We will show that the equivalences of the existence of such $3$-$(q+1,5,3)$ and $3$-$(q+1,10,18)$ designs for a prime…

Combinatorics · Mathematics 2025-12-16 Akihide Hanaki , Kenji Kobayashi , Akihiro Munemasa

Families of "asymptotically regular" LDPC block code ensembles can be formed by terminating (J,K)-regular protograph-based LDPC convolutional codes. By varying the termination length, we obtain a large selection of LDPC block code ensembles…

Information Theory · Computer Science 2016-11-15 David G. M. Mitchell , Roxana Smarandache , Michael Lentmaier , Daniel J. Costello

In this paper, we propose two families of nonconforming finite elements on $n$-rectangle meshes of any dimension to solve the sixth-order elliptic equations. The unisolvent property and the approximation ability of the new finite element…

Numerical Analysis · Mathematics 2023-03-13 Xianlin Jin , Shuonan Wu

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

Let $S,T$ be two numerical semigroups. We study when $S$ is one half of $T$, with $T$ almost symmetric. If we assume that the type of $T$, $t(T)$, is odd, then for any $S$ there exist infinitely many such $T$ and we prove that $1 \leq t(T)…

Commutative Algebra · Mathematics 2014-04-22 Francesco Strazzanti

This paper examines in a new way some known facts about numerical semigroups especially when the number of minimal generators (that is the embedding dimension) is at most three and at least two minimal generators are coprime. For such…

Number Theory · Mathematics 2023-09-06 Antoine Mhanna

The cyclic code is a subclass of linear codes and has applications in consumer electronics, data storage systems and communication systems as they have efficient encoding and decoding algorithms. In 2013, Ding, et al. presented nine open…

Information Theory · Computer Science 2025-11-04 Peipei Zheng , Dong He , Qunying Liao

In this paper, we examine a class of doubly resolvable combinatorial objects. Let $t, k, \lambda, s$ and $v$ be nonnegative integers, and let $X$ be a set of $v$ symbols. A generalized Howell design, denoted $t$-$GHD_{k}(s,v;\lambda)$, is…

Combinatorics · Mathematics 2015-11-04 R. Julian R. Abel , Robert F. Bailey , Andrea C. Burgess , Peter Danziger , Eric Mendelsohn

The existence question for tiling of the $n$-dimensional Euclidian space by crosses is well known. A few existence and nonexistence results are known in the literature. Of special interest are tilings of the Euclidian space by crosses with…

Combinatorics · Mathematics 2012-10-12 Sarit Buzaglo , Tuvi Etzion

We show that the number of lines in an $m$--homogeneous supersolvable line arrangement is upper bounded by $3m-3$ and we classify the $m$--homogeneous supersolvable line arrangements with two modular points up-to lattice-isotopy. A lower…

Algebraic Geometry · Mathematics 2019-10-09 Takuro Abe , Alexandru Dimca

A. Gasull shared a list of 33 open problems in low dimensional dynamical systems in his work in 2021. The second part of Problem 3 is about whether the limit cycle of a quasi-homogeneous system $ \dot{x}=y,\; \dot{y}=-x^3+\alpha x^2y+y^3 $…

Dynamical Systems · Mathematics 2024-06-05 Ziwei Zhuang , Changjian Liu

In this paper, we propose a sufficient condition for a family of 2-generator self-orthogonal quasi-cyclic codes with respect to Hermitian inner product. Supported in the Hermitian construction, we show algebraic constructions of good…

Information Theory · Computer Science 2025-11-25 Liangdong Lu , Gaochi Zhang , Ganyu Feng , Wenzheng Ma

In this paper we propose a heuristic technique for distributing points on the surface of a unit n-dimensional Euclidean sphere, generated as the orbit of a finite cyclic subgroup of orthogonal matrices, the so called cyclic group codes.…

Information Theory · Computer Science 2015-09-21 João E. Strapasson , Cristiano Torezzan

We investigate the complexity of deciding, given a multiplication table representing a semigroup S, a subset X of S and an element t of S, whether t can be expressed as a product of elements of X. It is well-known that this problem is…

Computational Complexity · Computer Science 2018-04-17 Lukas Fleischer