Related papers: Construction of 3-Designs Using (1,\sigma)-Resolut…
We show a one-to-one correspondence between arrangements of d lines in the projective plane, and lines in P^{d-2}. We apply this correspondence to classify (3,q)-nets over the complex numbers for all q<=6. When q=6, we have twelve possible…
The paper presents a systematic construction of primitive Pythagorean triples. The order of enumeration on the set of primitive Pythagorean triples is defined. The order is based on the representation of a primitive Pythagorean triple by…
Simple constructions are given for finite semifields that include as special cases both old semifields and recently constructed semifields.
The intersection matrix of a finite simplicial complex has as each of its entries the rank of the intersection of its respective simplices. We prove that such matrix defines the triangulation of a closed connected surface up to isomorphism.
A new construction of naturally reductive spaces is presented. This construction gives a large amount of new families of naturally reductive spaces. First the infinitesimal models of the new naturally reductive spaces are constructed. A…
We consider a coset construction of minimal models. We define it rigorously and prove that it gives superconformal minimal models. This construction allows to build all primary fields of superconformal models and to calculate their…
We review some recent results related to the self-assembly of infinite structures in the Tile Assembly Model. These results include impossibility results, as well as novel tile assembly systems in which shapes and patterns that represent…
We describe a new way to construct finite geometric objects. For every k we obtain a symmetric configuration E(k-1) with k points on a line. In particular, we have a constructive existence proof for such configurations. The method is very…
Constacyclic codes over finite fields are of theoretical importance as they are closely related to a number of areas of mathematics such as algebra, algebraic geometry, graph theory, combinatorial designs and number theory. However, the…
The normal forms of different one- and two- parametric solutions of Thirring model are connected with each other by making use of generalized conformal shift transformations. A new alternative sources of superselection rules are shown and…
We wish to renew the discussion over recent combinatorial structures that are 3-uniform hypergraph expanders, viewing them in a more general perspective, shedding light on a previously unknown relation to the zig-zag product. We do so by…
It is well known that the graph of a total $\mathbf{\Sigma}^1_n$-function is $\mathbf{\Pi}^1_n$. We prove the consistency of the dual assertion at the third projective level: there is a model of $\ZFC$ in which the graph of every total…
Generalized $t$-designs, which form a common generalization of objects such as $t$-designs, resolvable designs and orthogonal arrays, were defined by Cameron [P.J. Cameron, A generalisation of $t$-designs, \emph{Discrete Math.}\ {\bf 309}…
The three-dimensional reconstruction of scenes from multiple views has made impressive strides in recent years, chiefly by methods correlating isolated feature points, intensities, or curvilinear structure. In the general setting, i.e.,…
The Schwinger oscillator operator representation of SU(3) is analysed with particular reference to the problem of multiplicity of irreducible representations. It is shown that with the use of an $Sp(2,R)$ unitary representation commuting…
The triangulations of a regular convex polygon are enumerated according to the number of diagonals parallel to a fixed edge. The enumeration uses the Shapiro convolution identity, as well as an interpretation of this identity in terms of…
We discuss a construction that gives counterexamples to various questions of unique determination of convex bodies.
We investigate the standard generalized Gorenstein algebras of homological dimension three, giving a structure theorem for their resolutions. Moreover in many cases we are able to give a complete description of their graded Betti numbers.
Computational techniques for the construction of quasi-symmetric block designs are explored and applied to the case with $56$ points. One new $(56,16,18)$ and many new $(56,16,6)$ designs are discovered, and non-existence of $(56,12,9)$ and…
We present a generic construction of finite realisations of amalgamation patterns. An amalgamation pattern is specified by a finite collection of finite template structures together with a collection of partial isomorphisms between them. A…