Related papers: A Construction for Difference Sets with Local Prop…
We develop a new method leading the structure of finite subsets S and T of an abelian group with $|S+T|\le |S|+|T|$. We show also how to recover the known results in this area in a relatively short space.
We consider mappings, which are structure consisting of a single function (and possibly some number of unary relations) and address the problem of approximating a continuous mapping by a finite mapping. This problem is the inverse problem…
Let $p\geq 3$ be a prime and $n\geq 1$ be an integer. Let $K\subseteq {\mathbb{F}_p}$ denote a fixed subset with $0\in K$. Let $A\subseteq ({\mathbb{F}_p})^n$ be an arbitrary subset such that $$\{…
The Erd\H{o}s distinct distance problem is a ubiquitous problem in discrete geometry. Somewhat less well known is Erd\H{o}s' distinct angle problem, the problem of finding the minimum number of distinct angles between $n$ non-collinear…
For a linear code $C$ of length $n$ with dimension $k$ and minimum distance $d$, it is desirable that the quantity $kd/n$ is large. Given an arbitrary field $\mathbb{F}$, we introduce a novel, but elementary, construction that produces a…
By using nonstandard analysis, we prove embeddability properties of difference sets $A-B$ of sets of integers. (A set $A$ is "embeddable" into $B$ if every finite configuration of $A$ has shifted copies in $B$.) As corollaries of our main…
We continue the study of the fine properties of sets having locally finite distributional fractional perimeter. We refine the characterization of their blow-ups and prove a Leibniz rule for the intersection of sets with locally finite…
The main result of the article is a complete characterization of the local structure of two-dimensional sets with positive reach in $R^d$. We also present a more elementary proof of a recent result of A. Lytchak which describes for $k\leq…
Four constructions result from a desire to create enhancements to Cantor's infinite real set cardinality. Each continues to keep Cantor's cardinality formulation in place while providing new comparisons of arbitrary infinite sets. To…
Constructing a discretization of a given set is a major problem in various theoretical and applied disciplines. An offset discretization of a set $X$ is obtained by taking the integer points inside a closed neighborhood of $X$ of a certain…
We give an explicit construction of a large subset of F^n, where F is a finite field, that has small intersection with any affine variety of fixed dimension and bounded degree. Our construction generalizes a recent result of Dvir and Lovett…
Let X be an affine variety and L be a solvable Lie subalgebra of Lie(Aut(X)) generated by a finite collection of locally finite Lie subalgebras. The authors of [arXiv:2507.09679] wondered whether L is itself locally finite. Here we present…
A difference set is said to have classical parameters if $ (v,k, \lambda) = (\frac{q^d-1}{q-1}, \frac{q^{d-1}-1}{q-1}, \frac{q^{d-2}-1}{q-1}).$ The case $d=3$ corresponds to planar difference sets. We focus here on the family of abelian…
Over an arbitrary field of positive characteristic we construct an example of a locally finite variety of Lie algebras which does not have a finite basis of its polynomial identities. As a consequence we construct varieties of Lie algebras…
Methods were developed in Ref. [1] for constructing reference metrics (and from them differentiable structures) on three-dimensional manifolds with topologies specified by suitable triangulations. This note generalizes those methods by…
In this article, we prove that for a definable set in an o-minimal structure with connected link (at 0 or infinity), the inner distance of the link is equivalent to the inner distance of the set restricted to the link. With this result, we…
Locating arrays (LAs) can be used to detect and identify interaction faults among factors in a component-based system. The optimality and constructions of LAs with a single fault have been investigated extensively under the assumption that…
We define twelve variants of a Reifenberg's affine approximation property, which are known to be connected with the singular sets of minimal surfaces. With this motivation we investigate the regularity of the sets possessing these. We…
Local certification is a distributed mechanism enabling the nodes of a network to check the correctness of the current configuration, thanks to small pieces of information called certificates. For many classic global properties, like…
We study the problems of bounding the number weak and strong independent sets in $r$-uniform, $d$-regular, $n$-vertex linear hypergraphs with no cross-edges. In the case of weak independent sets, we provide an upper bound that is tight up…