Related papers: Corner-free sets via the torus
We find all analytic surfaces in space $\mathbb{R}^3$ such that through each point of the surface one can draw two transversal circular arcs fully contained in the surface. The problem of finding such surfaces traces back to the works of…
One of the key steps in the proof of the Banach-Tarski Theorem is the introduction of a free group of rotations. First, a free group of reduced words is generated where each element of the set is represented as an ACL2 list. Then we…
The symmetry data of a $d$-dimensional quantum field theory (QFT) can often be captured in terms of a higher-dimensional symmetry topological field theory (SymTFT). In top down (i.e., stringy) realizations of this structure, the QFT in…
Tree-like tableaux are combinatorial objects that appear in a combinatorial understanding of the PASEP model from statistical mechanics. In this understanding, the corners of the Southeast border correspond to the locations where a particle…
In Digital Geometry, gaps are some basic portion of a digital object that a discrete ray can cross without intersecting any voxel of the object itself. Such a notion is quite important in combinatorial image analysis and it is strictly…
We show how the description of a shear-free ray congruence in Minkowski space as an evolving family of semi-conformal mappings can naturally be formulated on a finite graph. For this, we introduce the notion of holomorphic function on a…
The goals of this paper are to obtain theoretical models of what happens when a computer calculates the rotation set of a homeomorphism, and to find a good algorithm to perform simulations of this rotation set. To do that we introduce the…
Given a finite point set $X$ in the plane, the degree of a pair $\{x,y\} \subset X$ is the number of empty triangles $t=conv\{x,y,z\}$, where empty means $t\cap X=\{x,y,z\}$. Define $deg X$ as the maximal degree of a pair in $X$. Our main…
In this article, we have defined nil clean graph of a ring $R$. The vertex set is the ring $R$, two ring elements $a$ and $b$ are adjacent if and only if $a + b$ is nil clean in $R$. Graph theoretic properties like girth, dominating set,…
Twisted hypercubes are graphs that generalize the structure of the hypercube by relaxing the symmetry constraint while maintaining degree-regularity and connectivity. We study the zero forcing number of twisted hypercubes. Zero forcing is a…
A set A of integers is said to be sum-free if there are no solutions to the equation x + y = z with x,y and z all in A. Answering a question of Cameron and Erdos, we show that the number of sum-free subsets of {1,...,N} is O(2^(N/2)).
A famous result of Hausdorff states that a sphere with countably many points removed can be partitioned into three pieces A,B,C such that A is congruent to B (i.e., there is an isometry of the sphere which sends A to B), B is congruent to…
Let $\PP^d$ be the $d$-fold direct product of the set of primes. We prove that if $A$ is a subset of $\PP^d$ of positive relative upper density then $A$ contains infinitely many "corners", that is sets of the form $\{x,x+te_1,...,x+te_d\}$…
Starting from any given rational-sided, right triangle, for example the $(3,4,5)$-triangle with area $6$, we use Euclidean geometry to show that there are infinitely many other rational-sided, right triangles of the same area. We show…
Here we examine some Erdos-Falconer-type problems in vector spaces over finite fields involving right angles. Our main goals are to show that a) a subset A of F_q^d of size >> q^[(d+2)/3] contains three points which generate a right angle,…
We prove a quantitative Roth-type theorem for polynomial corners in $\mathbb{R}^2$. Let $P_1$ and $P_2$ be two linearly independent polynomials with zero constant term. We show that any measurable subset of $[0,1]^2$ with positive measure…
According to one of many equivalent definitions of twistors a (null) twistor is a null geodesic in Minkowski spacetime. Null geodesics can intersect at points (events). The idea of Penrose was to think of a spacetime point as a derived…
A triangle in a hypergraph is a collection of distinct vertices u,v,w and distinct edges e,f,g with u,v \in e, v,w \in f, w,u \in g, and \{u,v,w\} \cap e \cap f \cap g=\emptyset. The i-degree of a vertex in a hypergraph is the number of…
We define and study a class of subshifts of finite type (SFTs) defined by a family of allowed patterns of the same shape where, for any contents of the shape minus a corner, the number of ways to fill in the corner is the same. The main…
This note gives a generalization of spherical twists, and describe the autoequivalences associated to certain non-spherical objects. Typically these are obtained by deforming the structure sheaves of (0,-2)-curves on threefolds, or…