Related papers: Simple t-designs: A recursive construction for arb…
Many semantical aspects of programming languages, such as their operational semantics and their type assignment calculi, are specified by describing appropriate proof systems. Recent research has identified two proof-theoretic features that…
We prove that it is decidable if a finitely based permutation class contains infinitely many simple permutations, and establish an unavoidable substructure result for simple permutations: every sufficiently long simple permutation contains…
The present work re-enacts the classical theory of t-structures reducing the classical definition given in *Faisceaux Pervers* to a rather primitive categorical gadget: suitable reflective factorization systems. This translation is only…
Design patterns are distilled from many real systems to catalog common programming practice. However, some object-oriented design patterns are distorted or overly complicated because of the lack of supporting programming language constructs…
We consider designs for cancer trials which allow each medical centre to treat only a limited number of cancer types with only a limited number of drugs. We specify desirable properties of these designs, and prove some consequences. Then we…
The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…
T-convergence groups is a natural extension of lattice-valued topological groups, which is a newly introduced mathematical structure. In this paper, we will further explore the theory of T-convergence groups. The main results include: (1)…
Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…
We discuss the recently developed method of refined absorption and how it is used to provide a new proof of the Existence Conjecture for combinatorial designs. This method can also be applied to resolve open problems in extremal and…
Combinatorial $t$-designs have wide applications in coding theory, cryptography, communications and statistics. It is well known that the supports of all codewords with a fixed weight in a code may give a $t$-design. In this paper, we first…
Given a set of 'simple-minded' objects in a derived category, Rickard constructed a complex, which over a symmetric algebra provides a derived equivalence sending the 'simple-minded' objects to simple ones. We characterise in terms of…
Superposing multiple plane waves can generate helicity lattices in which the optical helicity varies regularly in space. Here we propose an inverse design method for constructing arbitrary helicity structures based on placing a digital…
All components of complements of discriminant varieties of simple real function singularities are explicitly listed. New invariants of such components (for not necessarily simple singularities) are introduced. A combinatorial algorithm…
Martin-L\"of's Intuitionistic Theory of Types is becoming popular for formal reasoning about computer programs. To handle recursion schemes other than primitive recursion, a theory of well-founded relations is presented. Using primitive…
Higher-order tensors appear in various areas of mechanics as well as physics, medicine or earth sciences. As these tensors are highly complex, most are not well understood. Thus, the analysis and the visualization process form a highly…
The main purpose of this paper is to provide combinatorial constraints on the constructability of free and nearly free arrangements of smooth plane conics admitting certain ${\rm ADE}$ singularites.
A spherical $t$-design is a finite subset $X$ of the unit sphere such that every polynomial of degree at most $t$ has the same average over $X$ as it does over the entire sphere. Determining the minimum possible size of spherical designs,…
Let X be a scheme, and let G be an affine group scheme acting on X. Under reasonable hypotheses on X and G, we construct a t-structure on the derived category of G-equivariant coherent sheaves that in many ways resembles the perverse…
We study the interaction of structural subtyping with parametric polymorphism and recursively defined type constructors. Although structural subtyping is undecidable in this setting, we describe a notion of parametricity for type…
We show how to construct all the extensions of left braces by ideals with trivial structure. This is useful to find new examples of left braces. But, to do so, we must know the basic blocks for extensions: the left braces with no ideals…