Related papers: Some new Steiner designs $S(2,6,91)$
There are sequences of directions such that, given any compact set K in R^n, the sequence of iterated Steiner symmetrals of K in these directions converges to a ball. However examples show that Steiner symmetrization along a sequence of…
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…
We present a continuous nonlinear optimization model for the Spin Glass Problem (SGP), building on a classical result by Rosenberg (1972), which shows that for a class of multilinear polynomial problems the optimal values of the continuous…
We give a systematic development of the application of matrix norms to rapid mixing in spin systems. We show that rapid mixing of both random update Glauber dynamics and systematic scan Glauber dynamics occurs if any matrix norm of the…
Let G be a finite subgroup of GL_n(C). A study is made of the ways in which resolutions of the quotient space C^n / G can parametrise G-constellations, that is, G-regular finite length sheaves. These generalise G-clusters, which are used in…
In this article, we present a comprehensive framework for constructing smooth, localized solutions in systems of semi-linear partial differential equations, with a particular emphasis to the Gray-Scott model. Specifically, we construct a…
The seven and nine dimensional geometries associated with certain classes of supersymmetric $AdS_3$ and $AdS_2$ solutions of type IIB and D=11 supergravity, respectively, have many similarities with Sasaki-Einstein geometry. We further…
A Kirkman triple system of order $v$, KTS$(v)$, is a resolvable Steiner triple system on $v$ elements. In this paper, we investigate an open problem posed by Doug Stinson, namely the existence of KTS$(v)$ which contain as a subdesign a…
Representations of a group $G$ in vector spaces over a field $K$ form a category. One can reconstruct the given group $G$ from its representations to vector spaces as the full group of monoidal automorphisms of the underlying functor. This…
The Steiner Tree problem is a classical problem in combinatorial optimization: the goal is to connect a set $T$ of terminals in a graph $G$ by a tree of minimum size. Karpinski and Zelikovsky (1996) studied the $\delta$-dense version of…
Finite covers are a technique for building new structures from simpler ones. The original motivation to study finite covers is in the Ladder theorem of Zilber which describes how totally categorical structures are built from strictly…
Optimal recursive decomposition (or DR-planning) is crucial for analyzing, designing, solving or finding realizations of geometric constraint sytems. While the optimal DR-planning problem is NP-hard even for general 2D bar-joint constraint…
We present novel algorithms for design and design space exploration. The designs discovered by these algorithms are compositions of function types specified in component libraries. Our algorithms reduce the design problem to quantified…
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…
15 exactly solvable inhomogeneous (spinless) fermion systems on one-dimensional lattices are constructed explicitly based on the discrete orthogonal polynomials of Askey scheme, e.g. the Krawtchouk, Hahn, Racah, Meixner, $q$-Racah…
In this paper optimal designs for regression problems with spherical predictors of arbitrary dimension are considered. Our work is motivated by applications in material sciences, where crystallographic textures such as the missorientation…
The demand for inverse design is increasing as the ability to fabricate sub-10 nm features expands the design space by orders of magnitude. Efficient inverse design benefits from differentiable models of light-structure interaction. While…
The NP-hard Maximum Planar Subgraph problem asks for a planar subgraph $H$ of a given graph $G$ such that $H$ has maximum edge cardinality. For more than two decades, the only known non-trivial exact algorithm was based on integer linear…
Symmetry group methods are applied to obtain all explicit group-invariant radial solutions to a class of semilinear Schrodinger equations in dimensions $n\neq 1$. Both focusing and defocusing cases of a power nonlinearity are considered,…
We explicitly determine the locations of G orbifold conformal field theories, G=Z_M, M=2,3,4,6, G=\hat D_n, n=4,5, or G the binary tetrahedral group \hat T, within the moduli space M^{K3} of N=(4,4) superconformal field theories associated…