相关论文: Generalized binary arrays from quasi-orthogonal co…

The theory of "subalgebra basis" analogous to standard basis (the generalization of Gr\"{o}bner bases to monomial ordering which are not necessarily well ordering \cite{GP1}.) for ideals in polynomial rings over a field is developed. We…

Axial algebras of Jordan type $\eta$ are a special type of commutative non-associative algebras. They are generated by idempotents whose adjoint operators have the minimal polynomial dividing $(x-1)x(x-\eta)$, where $\eta$ is a fixed value…

G-algebras, or Groebner bases algebras, were considered by Levandovsky, these algebras include very important families of algebras, like the Weyl algebras and the universal enveloping algebra of a finite dimensional Lie algebra. These…

Generalized Pascal matrix whose elements are generalized binomial coefficients is included in the group of generalized Riordan arrays. There is a special set of generalized Riordan arrays defined by parameter $q$. If $q=0$, they are…

The distribution of a given sequence in the set of all sequences with n ones and m = M - n zeros are found by relating the problem to the partitions of a natural number in m natural summands, taking into account the order. The formulas…

Considering finite extensions K[A] \subseteq K[B] of positive affine semigroup rings over a field K we have developed in [1] an algorithm to decompose K[B] as a direct sum of monomial ideals in K[A]. By computing the regularity of…

We fully classify completely multiplicative sequences which are given by generalised polynomial formulae, and obtain a similar result for (not necessarily completely) multiplicative sequences under the additional restriction that the…

Skew Boolean algebras (skew BA) and Boolean-like algebras (nBA) are one-pointed and n-pointed noncommutative generalisation of Boolean algebras, respectively. We show that any nBA is a cluster of n isomorphic right-handed skew BAs,…

A weighted Hamming metric is introduced in [4] and it showed that the binary generalized Goppa code is a perfect code in some weighted Hamming metric. In this paper, we study the weight structures which admit the binary Hamming code and the…

A generalized pseudo effect algebra (GPEA) is a partially ordered partial algebraic structure with a smallest element 0, but not necessarily with a unit (i.e, a largest element). If a GPEA admits a so-called unitizing automorphism, then it…

In this paper, we construct an infinite family of three-weight binary codes from linear codes over the ring $R=\mathbb{F}_2+v\mathbb{F}_2+v^2\mathbb{F}_2$, where $v^3=1.$ These codes are defined as trace codes. They have the algebraic…

Goppa, in the 1970s, discovered the relation between algebraic geometry and codes, which led to the family of Goppa codes. As one of the most interesting subclasses of linear codes, the family of Goppa codes is often chosen as a key in the…

Generalized linear mixed-effects models in the context of genome-wide association studies (GWAS) represent a formidable computational challenge: the solution of millions of correlated generalized least-squares problems, and the processing…

We present a technique for deriving certain new natural dualities for any variety of algebras generated by a finite Heyting chain. The dualities we construct are tailored to admit a transparent translation to the more pictorial…

In order to enumerate the fake projective planes, as announced in~\cite{CS}, we found explicit generators and a presentation for each maximal arithmetic subgroup $\bar\Gamma$ of~$PU(2,1)$ for which the (appropriately normalized) covolume…

We show that in a complex d-dimensional vector space, one can find O(d) bases whose elements form a 2-design. Such vector sets generalize the notion of a maximal collection of mutually unbiased bases (MUBs). MUBs have manifold applications…

We study the problem of the computation of Groebner basis for the ideal of linear recurring relations of a doubly periodic array. We find a set of indexes such that, along with some conditions, guarantees that the set of polynomials…

We explore an elementary construction that produces finitely presented groups with diverse homological finiteness properties -- the {\em binary subgroups}, $B(\Sigma,\mu)<G_1\times\dots\times G_m$. These full subdirect products require…

In this paper, we present a modern version of Gordan's algorithm on binary forms. Symbolic method is reinterpreted in terms of $\mathsf{SL}_2(\mathbb{C})$--equivariant homomorphisms defined upon Cayley operator and polarization operator. A…

It has been discovered that linear codes may be described by binomial ideals. This makes it possible to study linear codes by commutative algebra and algebraic geometry methods. In this paper, we give a decoding algorithm for binary linear…