Related papers: Construction of 3-Designs Using (1,\sigma)-Resolut…
In this paper, using group actions, we introduce a new method for constructing partial geometric designs (sometimes referred to as $1\frac{1}{2}$-designs). Using this new method, we construct several infinite families of partial geometric…
A \textbf{single change covering design} is a $v$-set $X$ and an ordered list $\cL$ of $b$ blocks of size $k$ where every $t$-set must occur in at least one block. Each pair of consecutive blocks differs by exactly one element. A single…
In this article we prove several important properties of 2^{k-p} minimum aberration (MA) designs with k>2, where n=2^{k-p} is the number of runs. We develop a simple method to build MA designs of resolution III. Furthermore, we introduce a…
Family of replica matrices, related to general ultrametric spaces with general measures, is introduced. These matrices generalize the known Parisi matrices. Some functionals of replica approach are computed. Replica symmetry breaking…
I propose a scheme of constructing classical integrable models in 3+1 discrete dimensions, based on a relaxed version of the problem of factorizing a matrix into the product of four matrices of a special form.
We introduce a simple lattice model in which percolation is constructed on top of critical percolation clusters, and show that it can be repeated recursively any number $n$ of generations. In two dimensions, we determine the percolation…
This paper presents a methodology for constructing iterative schemes of any order of convergence for solving nonlinear systems of equations. It also provides formulas for the order of convergence of any iterative schemes constructed using…
Methods were developed in Ref. [1] for constructing reference metrics (and from them differentiable structures) on three-dimensional manifolds with topologies specified by suitable triangulations. This note generalizes those methods by…
Convergent rewriting systems are well-known tools in the study of the word-rewriting problem. In particular, a presentation of a monoid by a finite convergent rewriting system gives an algorithm to decide the word problem for this monoid.…
A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree polynomials on the Euclidean sphere or on the Hamming cube. We prove lower…
A Ryser design $\mathcal{D}$ on $v$ points is a collection of $v$ proper subsets (called blocks) of a point-set with $v$ points such that every two blocks intersect each other in $\lambda$ points (and $\lambda < v$ is a fixed number) and…
As indicated by the third author in [19], there is a gap in the previous version of this paper by the first two authors [5]. We provide in this version an argument to fix the aforementioned gap. The main proposition, whose proof uses…
In the nineties, A.G. Spera introduced a construction principle for divisible designs. Using this method, we get series of divisible designs from finite Laguerre geometries. We show a close connection between some of these divisible designs…
We examine a family of 3-point mappings that include mappings solvable through linearization. The different origins of mappings of this type are examined: projective equations and Gambier systems. The integrable cases are obtained through…
We provide separations between the parameterized versions of Res(1) (Resolution) and Res(2). Using a different set of parameterized contradictions, we also separate the parameterized versions of Res*(1) (tree-Resolution) and Res*(2).
We give the first example of a mosaic of three combinatorial designs with distinct parameters $2$-$(13,3,1)$, $2$-$(13,4,2)$, and $2$-$(13,6,5)$. Furthermore, we give examples of mosaics of $2$-$(9,3,2)$ designs that are not resolvable,…
We prove the undecidability of the third order pattern matching problem in typed lambda-calculi with dependent types and in those with type constructors by reducing the second order unification problem to them.
Three-dimensional isospectral systems are constructed using the framework of supersymmetric quantum mechanics. In case the supercharge of first order in momentum is used, it is proved that the constructed systems reduce to a trivial…
Let $R$ be a commutative ring. We show that pure injective resolutions and pure projective resolutions can be constructed for unbounded complexes of $R$-modules. We use these to obtain a closed symmetric monoidal structure on the unbounded…
The existence of large sets of Kirkman triple systems (LKTSs) is one of the best-known open problems in combinatorial design theory. Steiner quadruple systems with resolvable derived designs (RDSQSs) play an important role in the recursive…