Related papers: New Steiner systems from old ones by paramodificat…
Cycle switching is a particular form of transformation applied to isomorphism classes of a Steiner triple system of a given order $v$ (an $STS(v)$), yielding another $STS(v)$. This relationship may be represented by an undirected graph. An…
Two-dimensional unconventional magnetism has recently attracted growing interest due to its intriguing physical properties and promising applications in spintronics. However, existing studies on stacking-induced unconventional magnetism…
We study the deformation theory of projective Stanley-Reisner schemes associated to combinatorial manifolds. We achieve detailed descriptions of first order deformations and obstruction spaces. Versal base spaces are given for certain…
In this paper new Steiner systems $S(2,6,111)$, $S(2,6,121)$, $S(2,6,126)$, $S(2,7,169)$, $S(2,7,175)$ and possibly others with point-transitive (commutative except $S(2,6,111)$ case) automorphism groups are introduced.
Local operations of combinatorial structures (graphs, Hadamard matrices, codes, designs) that maintain the basic parameters unaltered, have been widely used in the literature under the name of switching. We show an equivalence between two…
We re-address the problem of construction of new infinite-dimensional completely integrable systems on the basis of known ones, and we reveal a working mechanism for such transitions. By splitting the problem's solution in two steps, we…
The possibility of deforming the (associative or Lie) product to obtain alternative descriptions for a given classical or quantum system has been considered in many papers. Here we discuss the possibility of obtaining some novel alternative…
This paper considers two closely related concepts, mixed Steiner system and nonuniform group divisible design (GDD). The distinction between the two concepts is the minimum Hamming distance, which is required for mixed Steiner systems but…
A generalized twistor transform for spinning particles in 3+1 dimensions is constructed that beautifully unifies many types of spinning systems by mapping them to the same twistor, thus predicting an infinite set of duality relations among…
A permutation may be represented by a collection of paths in the plane. We consider a natural class of such representations, which we call tangles, in which the paths consist of straight segments at 45 degree angles, and the permutation is…
New universal invariant operators are introduced in a class of geometries which include the quaternionic structures and their generalisations as well as 4-dimensional conformal (spin) geometries. It is shown that, in a broad sense, all…
Several methods for generating random Steiner triple systems (STSs) have been proposed in the literature, such as Stinson's hill-climbing algorithm and Cameron's algorithm, but these are not yet completely understood. Those algorithms, as…
Extreme deformation can drastically morph a structure from one structural form into another. Programming such deformation properties into the structure is often challenging and in many cases an impossible task. The morphed forms do not hold…
For a finite field of odd number of elements we construct families of permutation binomials and permutation trinomials with one fixed-point (namely zero) and remaining elements being permuted as disjoint cycles of same length. Binomials and…
The concept of swapping the two most important spin interactions -- exchange and spin-orbit coupling -- is proposed based on two-dimensional multilayer van der Waals heterostructures. Specifically, we show by performing realistic ab initio…
Coding theory and $t$-designs have close connections and interesting interplay. In this paper, we first introduce a class of ternary linear codes and study their parameters. We then focus on their three-weight subcodes with a special weight…
The Kramer-Mesner method for constructing designs with a prescribed automorphism group $G$ has proven effective many times. In the special case of Steiner designs, the task reduces to solving an exact cover problem, with the advantage that…
It has been observed that representations learned by distinct neural networks conceal structural similarities when the models are trained under similar inductive biases. From a geometric perspective, identifying the classes of…
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…
Block-transitive Steiner $t$-designs form a central part of the study of highly symmetric combinatorial configurations at the interface of several disciplines, including group theory, geometry, combinatorics, coding and information theory,…