Related papers: A characterization of sets in $\mathbb{R}^2$ with …

We construct finite sets of real numbers that have a small difference set and strong local properties. In particular, we construct a set $A$ of $n$ real numbers such that $|A-A|=n^{\log_2 3}$ and that every subset $A'\subseteq A$ of size…

Given a metric pair $(X,A)$, i.e. a metric space $X$ and a distinguished closed set $A \subset X$, one may construct in a functorial way a pointed pseudometric space $\mathcal{D}_\infty(X,A)$ of persistence diagrams equipped with the…

In this paper, we examine some properties of the fixed point set of a digitally continuous function. The digital setting requires new methods that are not analogous to those of classical topological fixed point theory, and we obtain results…

This paper concerns matrix "convex" functions of (free) noncommuting variables, $x = (x_1, \ldots, x_g)$. Helton and McCullough showed that a polynomial in $x$ which is matrix convex is of degree two or less. We prove a more general result:…

An open set in C^n is pseudoconvex if and only if its intersection with every affine subspace of complex dimension two as seen as an open set in C^2 is pseudoconvex.

Let $G$ be a connected graph with vertex set $V$. The distance, $d_G(u, v)$, between vertices $u$ and $v$ of $G$ is defined as the length of a shortest path between $u$ and $v$ in $G$. The distance matrix of $G$ is the matrix $\mathbf{D}(G)…

Let $N$ be a lattice of rank $n$ and let $M = N^{\vee}$ be its dual lattice. In this note we show that given two compact, bounded, full-dimensional convex sets $K_1 \subseteq K_2 \subseteq M_{\R} \coloneqq M \otimes_{\Z} \R$, there is a…

A $\mathcal{C}$-set is a functor from the category $\mathcal{C}$ to the category of finite sets and functions. The category of $\mathcal{C}$-sets, $\mathcal{C} - \operatorname*{set}$, is defined as the category whose objects are…

Characterizing the solution sets in a problem by closedness under operations is recognized as one of the key aspects of algorithm development, especially in constraint satisfaction. An example from the Boolean satisfiability problem is that…

In this paper, we first consider the graph of $(F_1,F_{2},\cdots,F_{n})$ on $\overline{\mathbb{D}}^{n},$ where $F_{j}(z)=\bar{z}^{m_{j}}_{j}+R_{j}(z),j=1,2,\cdots,n,$ which has non-isolated CR-singularities if $m_{j}>1$ for some…

Codimension two defects of the $(0,2)$ six dimensional theory $\mathscr{X}[\mathfrak{j}]$ have played an important role in the understanding of dualities for certain $\mathcal{N}=2$ SCFTs in four dimensions. These defects are typically…

A mathematical relation between elements of one- and multi-dimensional discrete Fourier transforms (DFT) is found. A method of analysing the multi-dimensional data by their single one-dimensional (1-D) DFT is offered. An experiment of…

In the field of statistics, many kind of divergence functions have been studied as an amount which measures the discrepancy between two probability distributions. In the differential geometrical approach in statistics (information…

Federer's characterization of sets of finite perimeter states (in Euclidean spaces) that a set is of finite perimeter if and only if the measure-theoretic boundary of the set has finite Hausdorff measure of codimension one. In complete…

We construct a family of closeness functions on the space of finite volume Lorentzian geometries using the abundance of discrete intervals in the underlying random causal sets. Although strictly weaker than a Lorentzian Gromov-Hausdorff…

We characterize inclusions of compact noncommutative convex sets with the property that every continuous affine function on the smaller set can be extended to a continuous affine function on the larger set with a uniform bound. As an…

We give a complete characterization of compact sets with positive reach (=proximally $C^1$ sets) in the plane and of one-dimensional sets with positive reach in ${\mathbb R}^d$. Further, we prove that if $\emptyset \neq A\subset{\mathbb…

It is a well-known result by Saks \cite{Saks1934} that there exists a function $f \in L^1(\mathbb{R}^2)$ so that for almost every $(x,y)\in \mathbb{R}^2$ \[ \lim_{\substack{\mathrm{diam} R\rightarrow 0, \\ (x,y) \in R \in…

The level of a function f on an n-dimensional space encloses a region. The volume of a region between two such levels depends on both levels. Fixing one of them the volume becomes a function of the remaining level. We show that if the…

We study {0,\alpha}-sets, which are sets of unit vectors of $\mathbb{C}^m$ in which any two distinct vectors have angle 0 or \alpha. We investigate some distance-regular graphs that provide new constructions of {0,\alpha}-sets using a…