Infinite lexicographic products

We generalize the lexicographic product of first-order structures by presenting a framework for constructions which, in a sense, mimic iterating the lexicographic product infinitely and not necessarily countably many times. We then define dense substructures in infinite products and show that any countable product of countable transitive homogeneous structures has a unique countable dense substructure, up to isomorphism. Furthermore, this dense substructure is transitive, homogeneous and elementarily embeds into the product. This result is then utilized to construct a rigid elementarily indivisible structure.     

A survey of tensor products and related constructions in two lectures

We survey tensor products of lattices with zero and related constructions focused on two topics: amenable lattices and box products. Received August 21, 1998; accepted in final form September 9, 1998.     

Graphical complexity of products of permutation groups

In this paper we study representations of permutation groups as automorphism groups of colored graphs and supergraphs. In particular, we consider how such representations for various products of permutation groups can be obtained from representations of factors and how the degree of complexity increases in such constructions.     

On products and duality of binary, quadratic, regular operads

Since its introduction by Loday in 1995, with motivation from algebraic K-theory, dendriform dialgebras have been studied quite extensively with connections to several areas in Mathematics and Physics. A few more similar structures have been found recently, such as the tri-, quadri-, ennea- and octo-algebras, with increasing complexity in their constructions and properties. We consider these constructions as operads and their products and duals, in terms of generators and relations, with the goal to clarify and simplify the process of obtaining new algebra structures from known structures and from linear operators.     

On the arithmetic product of combinatorial species

We introduce two new binary operations on combinatorial species; the arithmetic product and the modified arithmetic product. The arithmetic product gives combinatorial meaning to the product of Dirichlet series and to the Lambert series in the context of species. It allows us to introduce the notion of multiplicative species, a lifting to the combinatorial level of the classical notion of multiplicative arithmetic function. Interesting combinatorial constructions are introduced; cloned assemblies of structures, hyper-cloned trees, enriched rectangles, etc. Recent research of Cameron, Gewurz and Merola, about the product action in the context of oligomorphic groups, motivated the introduction of the modified arithmetic product. By using the modified arithmetic product we obtain new enumerative results. We also generalize and simplify some results of Canfield, and Pittel, related to the enumerations of tuples of partitions with the restrictions met.     

General constructions of biquandles and their symmetries

Biquandles are algebraic objects with two binary operations whose axioms encode the generalized Reidemeister moves for virtual knots and links. These objects also provide set theoretic solutions of the well-known Yang-Baxter equation. The first half of this paper proposes some natural constructions of biquandles from groups and from their simpler counterparts, namely, quandles. We completely determine all words in the free group on two generators that give rise to (bi)quandle structures on all groups. We give some novel constructions of biquandles on unions and products of quandles, including what we refer as the holomorph biquandle of a quandle. These constructions give a wealth of solutions of the Yang-Baxter equation. We also show that for nice quandle coverings a biquandle structure on the base can be lifted to a biquandle structure on the covering. In the second half of the paper, we determine automorphism groups of these biquandles in terms of associated quandles showing elegant relationships between the symmetries of the underlying structures.     

几类加法非正则半环

In this paper, we introduce Green＇s .-relations on semirings and define [left, right] adequate semirings to explore additively non-regular semirings. We characterize the semirings which are strong b-lattices of [left, right] skew-halfrings. Also, as further generalization, the semirings are described which are subdirect products of an additively commutative idempotent semiring and a [left, right] skew-halfring. We extend results of constructions of generalized Clifford semirings （given by M. K. Sen, S. K. MaRy, K. P. Shum, 2005） and the semirings which are subdirect products of a distributive lattice and a ring （given by S. Ghosh, 1999） to additively non-regular semirings.     

张量代数上一种带辫子的Poisson结构

对应结合代数的R-冲积构造,考虑了相应半古典极限的Poisson结构构造.进而给出了张量代数上一种带辫子的Poisson结构,该结果推广了Poisson多项式环和双Poisson-Ore扩张.     

A Survey on Hypergraph Products

A surprising diversity of different products of hypergraphs have been discussed in the literature. Most of the hypergraph products can be viewed as generalizations of one of the four standard graph products. The most widely studied variant, the so-called square product, does not have this property, however. Here we survey the literature on hypergraph products with an emphasis on comparing the alternative generalizations of graph products and the relationships among them. In this context the so-called 2-sections and L2-sections are considered. These constructions are closely linked to related colored graph structures that seem to be a useful tool for the prime factor decompositions w.r.t. specific hypergraph products. We summarize the current knowledge on the propagation of hypergraph invariants under the different hypergraph multiplications. While the overwhelming majority of the material concerns finite (undirected) hypergraphs, the survey also covers a summary of the few results on products of infinite and directed hypergraphs.     

Algebraic Structure of n-Body Systems

A general method to easily build global and relative operators for any number n of elementary systems if they are defined for 2 is presented. It is based on properties of the morphisms valued in the tensor products of algebras of the kinematics and it allows also the generalization to any n of relations demonstrated for two. The coalgebra structures play a peculiar role in the explicit constructions. Three examples are presented concerning the Galilei, Poincaré and deformed Galilei algebras.     

Generalized Shuffles Related to Nijenhuis and TD-Algebras

Shuffle type products are well known in mathematics and physics. They are intimately related to Loday's dendriform algebras and were extensively used to give explicit constructions of free Rota–Baxter algebras. In the literature there exist at least two other Rota–Baxter type algebras, namely, the Nijenhuis algebra and the so-called TD-algebra. The explicit construction of the free unital commutative Nijenhuis algebra uses a modified quasi-shuffle product, called the right-shift shuffle. We show that another modification of the quasi-shuffle, the so-called left-shift shuffle, can be used to give an explicit construction of the free unital commutative TD-algebra. We explore some basic properties of TD-operators. Our construction is related to Loday's unital commutative tridendriform algebra, including the involutive case. The concept of Rota–Baxter, Nijenhuis and TD-bialgebras is introduced at the end, and we show that any commutative bialgebra provides such objects.     

New constructions for perfect hash families and related structures using combinatorial designs and codes

In this paper, we consider explicit constructions of perfect hash families using combinatorial methods. We provide several direct constructions from combinatorial structures related to orthogonal arrays. We also simplify and generalize a recursive construction due to Atici, Magliversas, Stinson and Wei [3]. Using similar methods, we also obtain efficient constructions for separating hash families which result in improved existence results for structures such as separating systems, key distribution patterns, group testing algorithms, cover‐free families and secure frameproof codes. © 2000 John Wiley & Sons, Inc. J Combin Designs 8:189–200, 2000     

Twistors for modules over algebras

We study the concept of module twistor for a module over an algebra. This concept provides a unifying framework for various deformed constructions of modules over algebras, such as module R-matrices, (n-factor iterated) twisted tensor products and L-R-twisted tensor products of algebras. Among the main results, we find the relations among these constructions. Furthermore, we study some properties of module twistors.     

Free Subproducts and Free Scaled Products of II1-Factors

The constructions of free subproducts of von Neumann algebras and free scaled products are introduced, and results about them are proved, including rescaling results and results about free trade in free scaled products.     

Self-dual codes from orbit matrices and quotient matrices of combinatorial designs

In this paper we give constructions of self-orthogonal and self-dual codes, with respect to certain scalar products, with the help of orbit matrices of block designs and quotient matrices of symmetric (group) divisible designs (SGDDs) with the dual property. First we describe constructions from block designs and their extended orbit matrices, where the orbit matrices are induced by the action of an automorphism group of the design. Further, we give some further constructions of self-dual codes from symmetric block designs and their orbit matrices. Moreover, in a similar way as for symmetric designs, we give constructions of self-dual codes from SGDDs with the dual property and their quotient matrices.     

Constructions for rotational Steiner quadruple systems

A direct construction for rotational Steiner quadruple systems of order p+ 1 having a nontrivial multiplier automorphism is presented, where p≡13 (mod24) is a prime. We also give two improved product constructions. By these constructions, the known existence results of rotational Steiner quadruple systems are extended. © 2009 Wiley Periodicals, Inc. J Combin Designs 17: 353–368, 2009     

WLR-regular orthogroups

A regular orthogroup S with the property that D _e =R _e or D _e =L _e for any idempotent e∈S is called a WLR-regular orthogroup. In this paper, we give constructions of such semigroups in terms of spined products of left and right regular orthogroups with respect to Clifford semigroups. WLR-cryptogroups and its special cases are also investigated. Research supported by General Scientific Research Project of Shanghai Normal University No. SK200707.     

Perfect contrast XOR-based visual cryptography schemes via linear algebra

XOR-based visual cryptography scheme (XVCS) was proposed to solve the poor visual quality problem without darkening the background in the reconstructed secret image. However, investigations on XVCS are not sufficient. In this paper, we focus on the traditional model of VCS for general access structures and exploit some extended capabilities for XVCS. Our main contributions are: (1) we put forward constructions of perfect contrast XVCS using the linear algebraic technique without any assumptions such as participants may carry multiple shares or prior information about the shares are to be submitted during the secret reconstruction phase; (2) for some restricted access structures, we achieve perfect contrast and perfect pixel expansion, namely both 1, which is impossible for any OR-based visual cryptography scheme (OVCS); (3) for general access structures, we achieve perfect contrast with smaller pixel expansion compared with many of the results in the literature; (4) Theoretical analysis on the proposed constructions are provided, as well as extensive experimental results and comparisons for demonstrating the effectiveness and advantages of our constructions.     

On the construction of authentication and secrecy codes

We present several recursive constructions for authentication and secrecy codes using t-designs. These constructions are based on combinatorial structures called authentication perpendicular arrays, introduced by Stinson. As a by-product we obtain a method for constructing sets of permutations which are uniform and t-homogeneous for arbitrarily large t. A table of parameters for codes whose existence is known is included.     

A class of highly symmetric graphs,symmetric cylindrical constructions and their spectra

In this article, we introduce the algebra of block-symmetric cylinders and we show that symmetric cylindrical constructions on base-graphs admitting commutative decompositions behave as generalized tensor products. We compute the characteristic polynomial of such symmetric cylindrical constructions in terms of the spectra of the base-graph and the cylinders in a general setting. This gives rise to a simultaneous generalization of some well-known results on the spectra of a variety of graph amalgams, as various graph products, graph subdivisions and generalized Petersen graph constructions. While our main result introduces a connection between spectral graph theory and commutative decompositions of graphs, we focus on commutative cyclic decompositions of complete graphs and tree-cylinders along with a subtle group labeling of trees to introduce a class of highly symmetric graphs containing the Petersen and the Coxeter graphs. Also, using techniques based on recursive polynomials we compute the characteristic polynomials of these highly symmetric graphs as an application of our main result.