相关论文: $\delta$-sequences and Evaluation Codes defined by…
A linear code is said to be $\Delta$-divisible if the Hamming weights of all its codewords are divisible by $\Delta$. The $p$-adic valuation of a code is defined as the greatest integer $t$ such that the code is $p^t$-divisible. In this…
Quadratic residue codes have been one of the most important classes of algebraic codes. They have been generalized into duadic codes and quadratic double circulant codes. In this paper we introduce a new subclass of double circulant codes,…
Positive semidefinite rank (PSD-rank) is a relatively new quantity with applications to combinatorial optimization and communication complexity. We first study several basic properties of PSD-rank, and then develop new techniques for…
A finite semifield is a finite nonassociative ring with identity such that the set of its nonzero elements is closed under the product. From any finite semifield a projective plane can be constructed. In this paper we obtain new semifield…
Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagram semigroups in a general framework and extend our…
Let $S$ be a unital ring, $S[t;\sigma,\delta]$ a skew polynomial ring where $\sigma$ is an injective endomorphism and $\delta$ a left $\sigma$-derivation, and suppose $f\in S[t;\sigma,\delta]$ has degree $m$ and an invertible leading…
For any finite abelian group $G$ and commutative unitary ring $R$, by $R[G]$ we denote the group algebra over $R$. Let $T=(g_1,\ldots,g_{\ell})$ be a sequence over the group $G$. We say $T$ is algebraically zero-sum free over R if…
We present an improved algorithm for tabulating class groups of imaginary quadratic fields of bounded discriminant. Our method uses classical class number formulas involving theta-series to compute the group orders unconditionally for all…
We prove that for any finite-dimensional differential graded algebra with separable semisimple part the category of perfect modules is equivalent to a full subcategory of the category of perfect complexes on a smooth projective scheme with…
Programs with a continuous state space or that interact with physical processes often require notions of equivalence going beyond the standard binary setting in which equivalence either holds or does not hold. In this paper we explore the…
The structure of transformation semigroups on a finite set is analyzed by introducing a hierarchy of functions mapping subsets to subsets. The resulting hierarchy of semigroups has a corresponding hierarchy of minimal ideals, or kernels.…
This is the second of two papers introducing and investigating two bivariate zeta functions associated to unipotent group schemes over rings of integers of number fields. In the first part, we proved some of their properties such as…
In this paper, we present a novel approach to synthesize invariant clusters for polynomial programs. An invariant cluster is a set of program invariants that share a common structure, which could, for example, be used to save the needs for…
A classical method of constructing a linear code over $\gf(q)$ with a $t$-design is to use the incidence matrix of the $t$-design as a generator matrix over $\gf(q)$ of the code. This approach has been extensively investigated in the…
When a semigroup has a unary operation, it is possible to define two binary operations, namely, left and right division. In addition it is well known that groups can be defined in terms of those two divisions. The aim of this paper is to…
We classify all spherical 2-designs that arise as orbits of finite group actions on real inner product spaces. Although it is well known that such designs can occur in representations without trivial components, we give a complete…
We describe general methods for enumerating subsemigroups of finite semigroups and techniques to improve the algorithmic efficiency of the calculations. As a particular application we use our algorithms to enumerate all transformation…
We perform a first principle semiclassical quantisation of the general finite-gap solution to the equations of a string moving on R x S^3. The derivation is only formal as we do not regularise divergent sums over stability angles. Moreover,…
We achieve new results on skew polynomial rings and their quotients, including the first explicit example of a skew polynomial ring where the ratio of the degree of a skew polynomial to the degree of its bound is not extremal. These methods…
We consider general renormalizable scalar field theory and derive six-loop beta functions for all parameters in d = 4 dimensions within the $\overline{MS}$-scheme. We do not explicitly compute relevant loop integrals but utilize…