Related papers: Corner-free sets via the torus
A mathematical structure is presented that allows one to define a physical process independent of any background. That is, it is possible, for a set of objects, to choose an object from that set through a choice process that is defined…
In this paper, we study tree--like tableaux and some of their probabilistic properties. Tree--like tableaux are in bijection with other combinatorial structures, including permutation tableaux, and have a connection to the partially…
In architecture, city planning, visual arts, and other design areas, shapes are often made with points, or with structural representations based on point-sets. Shapes made with points can be understood more generally as finite arrangements…
This paper focuses on vertices of the master corner polyhedra $P(G,g_0),$ the core of the group-theoretical approach to integer linear programming. We introduce two combinatorial operations that transform each vertex of $P(G,g_0)$ to…
We construct some infinite series of free and nearly free curves using pencils of conics with a base locus of cardinality at most two. These curves have an interesting topology, e.g. a high degree Alexander polynomial that can be explicitly…
A toric cube is a subset of the standard cube defined by binomial inequalities. These basic semialgebraic sets are precisely the images of standard cubes under monomial maps. We study toric cubes from the perspective of topological…
The score of a vertex $x$ in an oriented graph is defined to be its outdegree, \emph{i.e.}, the number of arcs with initial vertex $x$. The score sequence of an oriented graph is the sequence of all scores arranged in nondecreasing order.…
In this research, we determine the structure of (claw, bull)-free graphs. We show that every connected (claw, bull)-free graph is either an expansion of a path, an expansion of a cycle, or the complement of a triangle-free graph; where an…
Building on work of Kapouleas and Yang, we construct sequences of minimal surfaces embedded in the round 3-sphere which converge to the Clifford torus counted with multiplicity two and have second fundamental form blowing up at every point…
Fractals equipped with intrinsic arithmetic lead to a natural definition of differentiation, integration and complex numbers. Applying the formalism to the problem of a Fourier transform on fractals we show that the resulting transform has…
A stacked $d$-sphere $S$ is the boundary complex of a stacked $(d+1)$-ball, which is obtained by taking cone over a free $d$-face repeatedly from a $(d+1)$-simplex. A stacked sphere $S$ is called linear if every cone is taken over a face…
It is proved that there are triangle-free intersection graphs of line segments in the plane with arbitrarily small ratio between the maximum size of an independent set and the total number of vertices.
In this paper, we study tree--like tableaux, combinatorial objects which exhibit a natural tree structure and are connected to the partially asymmetric simple exclusion process (PASEP). There was a conjecture made on the total number of…
We study crossing-free grid morphs for planar tree drawings using 3D. A morph consists of morphing steps, where vertices move simultaneously along straight-line trajectories at constant speeds. A crossing-free morph is known between two…
Let $P$ be a set of $n$ points in the plane. A crossing-free structure on $P$ is a plane graph with vertex set $P$. Examples of crossing-free structures include triangulations of $P$, spanning cycles of $P$, also known as polygonalizations…
A one parameter set of noncommutative complex algebras is given. These may be considered deformation quantisation algebras. The commutative limit of these algebras correspond to the algebra of polynomial functions over a manifold or…
We describe, for a few small examples, the Kauffman bracket skein algebra of a surface crossed with an interval. If the surface is a punctured torus the result is a quantization of the symmetric algebra in three variables (and an algebra…
Given a finite set $A \subseteq \mathbb{R}^d$, points $a_1,a_2,\dotsc,a_{\ell} \in A$ form an $\ell$-hole in $A$ if they are the vertices of a convex polytope which contains no points of $A$ in its interior. We construct arbitrarily large…
The paper presents two edge grouping algorithms for finding a closed contour starting from a particular edge point and enclosing a fixation point. Both algorithms search a shortest simple cycle in \textit{an angularly ordered graph} derived…
John Conway's Circle Theorem is a gem of plane geometry. The six points formed by continuing the sides of a triangle beyond every vertex by the length of its opposite side, are concyclic. The theorem has attracted several proofs. We present…