Related papers: Generalized Number Systems and Application to Hype…

Lehmer's code defines a bijection between the symmetric group and the set of staircase compositions. In this paper, we characterize a poset structure on these compositions that is equivalent to the strong Bruhat order on the symmetric…

Let $\mathbb{N}^{d}$ be the $d$-dimensional monoid of non-negative integers. A generalized numerical semigroup is a submonoid $ S\subseteq \mathbb{N}^d$ such that $H(S)=\mathbb{N}^d \setminus S$ is a finite set. We introduce irreducible…

In this article we prove in the main theorem that, there is a bijection between the isomorphism classes of a certain type of real hyperplane arrangements on the one hand, and the antipodal pairs of convex cones of an associated…

We extend the theory of distributional kernel operators to a framework of generalized functions, in which they are replaced by integral kernel operators. Moreover, in contrast to the distributional case, we show that these generalized…

The class of non-commutative hypercomplex number systems (HNS) of 4-dimension, constructed by using of non-commutative Grassmann-Clifford procedure of doubling of 2-dimensional systems is investigated in the article and established here are…

We develop basic notions and methods of algebraic geometry over the algebraic objects called hyperrings. Roughly speaking, hyperrings generalize rings in such a way that an addition is `multi-valued'. This paper largely consisits of two…

We construct new families of completely regular codes by concatenation methods. By combining parity check matrices of cyclic Hamming codes, we obtain families of completely regular codes. In all cases, we compute the intersection array of…

We present a structure associated to the class of linear codes. The properties of that structure are similar to some structures in the linear algebra techniques into the framework of the Gr\"obner bases tools. It allows to get some insight…

Using an algebraic approach based on the theory of Coxeter groups, we design, and describe the performance of, a class of line codes for parallel transmission of $b$ bits over $b+1$ wires that admit especially simple encoding and decoding…

A superintegrable generalization of the classical and quantum Zernike systems is reviewed. The corresponding Hamiltonians are endowed with higher-order integrals and can be interpreted as higher-order superintegrable perturbations of the 2D…

We establish a so-called counting lemma that allows embeddings of certain linear uniform hypergraphs into sparse pseudorandom hypergraphs, generalizing a result for graphs [Embedding graphs with bounded degree in sparse pseudorandom graphs,…

Representing images by compact codes has proven beneficial for many visual recognition tasks. Most existing techniques, however, perform this coding step directly in image feature space, where the distributions of the different classes are…

We develop a new method to compute the homology groups of finite topological spaces (or equivalently of finite partially ordered sets) by means of spectral sequences giving a complete and simple description of the corresponding…

We decribe the correspondence between normalised $\omega$-operads and certain lax monoidal structures on the category of globular sets. As with ordinary monoidal categories, one has a notion of category enriched in a lax monoidal category.…

Centraliser algebras of monomial representations of finite groups may be constructed and studied using methods similar to those employed in the study of permutation groups. Guided by results of D. G. Higman and others, we give an explicit…

We arrange the orders in an algebraic number field in a tree. This tree can be used to enumerate all orders of bounded index in the maximal order as well as the orders over some given order.

We present a common generalization of counting lattice points in rational polytopes and the enumeration of proper graph colorings, nowhere-zero flows on graphs, magic squares and graphs, antimagic squares and graphs, compositions of an…

We survey structures endowed with natural partial orderings and prove their universality. These partial orders include partial orders on sets of words, partial orders formed by geometric objects, grammars, polynomials and homomorphism order…

We generalize a well-known algorithm for the generation of all subsets of a set in lexicographic order with respect to the sets as lists of elements (subset-lex order). We obtain algorithms for various combinatorial objects such as the…

This paper develops a basic theory of H-groups. We introduce a special quotient of H-groups and extend some algebraic constructions of topological groups to the category of H-groups and H-maps. We use these constructions to prove some…