Related papers: Construction of 3-Designs Using (1,\sigma)-Resolut…
This paper gives two methods for constructing associative 3-folds in R^7, based around the fundamental idea of evolution equations, and uses these methods to construct examples of these geometric objects. The paper is a generalisation of…
In their study of cyclic pattern containment, Domagalski et al. conjecture differential equations for the generating functions of circular permutations avoiding consecutive patterns of length 3. In this note, we prove and significantly…
We present a simple dyadic construction that yields a new counterexample to Zygmund's conjecture. Our result recovers Soria's classical result in dimension three, through a different construction, and gives new ones in all other dimensions…
We construct the {\cal N}=4 supersymmetric nonlinear sigma model in three dimensions which can be expanded in 1/N. We evaluate the effective action at leading order in the 1/N expansion and show the finiteness of the model to this order.
We present a closed-form solution for n-th term of a general three-term recurrence relation with arbitrary given n-dependent coefficients. The derivation and corresponding proof are based on two approaches, which we develop and describe in…
We introduce a class of singular log schemes in three dimensions and conjecture that log schemes in this class admit log crepant log resolutions. We provide examples as evidence and relate this conjecture to the conjecture made in [4] and…
We introduce the notion of a simultaneous categorical resolution of singularities, a categorical version of simultaneous resolutions of rational double points of surface degenerations. Furthermore, we suggest a construction of simultaneous…
We revisit the undecidability result of rank 3 intersection type inhabitation (Urzyczyn 2009) in pursuit of two goals. First, we strengthen the previous result by showing that intersection type inhabitation is undecidable for types of rank…
A Metis design is one for which v=r+k+1. This paper deals with Metis designs that are quasi-residual. The parameters of such designs and the corresponding symmetric designs can be expressed by Fibonacci numbers. Although the question of…
In this article one builds a class of recursive sets, one establishes properties of these sets, and one proposes applications.
We prove that the Cayley-Menger determinant of an $n$-dimensional simplex is an absolutely irreducible polynomial for $n\geq3.$ We also study the irreducibility of polynomials associated to related geometric constructions.
We provide a classification of the homogeneous 3-dimensional permutation structures, i.e. homogeneous structures in a language of 3 linear orders, partially answering a question of Cameron. We also arrive at a natural description of all…
Delorme suggested that the set of all complete intersection numerical semigroups can be computed recursively. We have implemented this algorithm, and particularized it to several subfamilies of this class of numerical semigroups: free and…
The paper addresses aggregation issues for composite (modular) solutions. A systemic view point is suggested for various aggregation problems. Several solution structures are considered: sets, set morphologies, trees, etc. Mainly, the…
Combinatorial $t$-designs have been an interesting topic in combinatorics for decades. It was recently reported that the image sets of a fixed size of certain special polynomials may constitute a $t$-design. Till now only a small amount of…
A rule for constructing interpolation nodes for $n$th degree polynomials on the simplex is presented. These nodes are simple to define recursively from families of 1D node sets, such as the Lobatto-Gauss-Legendre (LGL) nodes. The resulting…
We show arithmetic triplets of Gaussian squares are in 3-to-1 correspondence with Pythagorean triples thereof. This correspondence would transform a solution to the Magic Square of Squares puzzle into a larger structure of perfect Gaussian…
This article explores the limits of geometric construction using various tools, both classical and modern. Starting with ruler and compass constructions, we examine how adding methods such as origami, marked rulers (neusis), conic sections,…
Starting with the irreducible triangulations of a fixed surface and splitting vertices, all the triangulations of the surface up to a given number of vertices can be generated. The irreducible triangulations have previously been determined…
Let $G$ be a group which admits the structure of an iterated semidirect product of finitely generated free groups. We construct a finite, free resolution of the integers over the group ring of $G$. This resolution is used to define…