相关论文: Combinatorial $t$-Designs from Finite Abelian Grou…

Combinatorial $t$-designs have nice applications in coding theory, finite geometries and several engineering areas. The objective of this paper is to study how to obtain $3$-designs with $2$-transitive permutation groups. The incidence…

We extend the concepts of sum-free sets and Sidon-sets of combinatorial number theory with the aim to provide explicit constructions for spherical designs. We call a subset $S$ of the (additive) abelian group $G$ {\it $t$-free} if for all…

We obtain explicit formulas for the number of non-isomorphic elliptic curves with a given group structure (considered as an abstract abelian group). Moreover, we give explicit formulas for the number of distinct group structures of all…

Combinatorial $t$-designs have wide applications in coding theory, cryptography, communications and statistics. It is well known that the supports of all codewords with a fixed weight in a code may give a $t$-design. In this paper, we first…

This paper establishes a classification of the critical numbers for restricted sumsets in finite abelian groups, determining them exactly for even-order groups and bounding them for odd-order groups, while revealing a fundamental structural…

For a finite abelian group $G$ with subsets $A$ and $B$, the sumset $AB$ is $\{ab \mid a\in A, b \in B\}$. A fundamental problem in additive combinatorics is to find a lower bound for the cardinality of $AB$ in terms of the cardinalities of…

We determine a condition on the minimum Hamming weight of some special abelian group codes and, as a consequence of this result, we establish that any such code is, up to permutational equivalence, a subspace of the direct sum of $s$ copies…

The main aim of this article is to compute all the moments of the number of $p^\ell$-torsion elements in some type of nite abelian groups. The averages involved in these moments are those de ned for the Cohen-Lenstra heuristics for class…

Combinatorial $t$-designs have been an important research subject for many years, as they have wide applications in coding theory, cryptography, communications and statistics. The interplay between coding theory and $t$-designs has been…

Unitary t-designs are distributions on the unitary group whose first t moments appear maximally random. Previous work has established several upper bounds on the depths at which certain specific random quantum circuit ensembles approximate…

Unitary $t$-designs are `good' finite subsets of the unitary group $U(d)$ that approximate the whole unitary group $U(d)$ well. Unitary $t$-designs have been applied in randomized benchmarking, tomography, quantum cryptography and many…

We classify group schemes in terms of their Cartier modules. We also prove the equivalence of different definitions of the tangent space and the dimension for these group schemes; in particular, the minimal dimension of a formal group law…

Abelian codes and complementary dual codes form important classes of linear codes that have been extensively studied due to their rich algebraic structures and wide applications. In this paper, a family of abelian codes with complementary…

The structure of the Tate-Shafarevich groups of a class of elliptic curves over global function fields is determined. These are known to be finite abelian groups from the monograph [1] and hence they are direct sums of finite cyclic groups…

Let $\E$ be an ordinary elliptic curve over a finite field $\F_{q}$ of $q$ elements and $x(Q)$ denote the $x$-coordinate of a point $Q = (x(Q),y(Q))$ on $\E$. Given an $\F_q$-rational point $P$ of order $T$, we show that for any subsets…

We prove by using simple number-theoretic arguments formulae concerning the number of elements of a fixed order and the number of cyclic subgroups of a direct product of several finite cyclic groups. We point out that certain multiplicative…

Elliptic curves are planar curves which can be used to define an abelian group. The efficient computation of discrete logarithms over this group is a longstanding problem relevant to cryptography. It may be possible to efficiently compute…

This article continues a prior investigation of the authors with the goal of extending characterization results of convolutional tight frames from the context of cyclic groups to general finite abelian groups. The collections studied are…

We consider Cayley sum graphs over the cyclic group $\mathbb{Z}_n$ and aim to explore several necessary and sufficient conditions for the existence of total perfect codes in these graphs. Specifically, we examine various cases for the…

We develop a new method leading the structure of finite subsets S and T of an abelian group with $|S+T|\le |S|+|T|$. We show also how to recover the known results in this area in a relatively short space.