Related papers: A framework for constructing sets without configur…

Let $K\subset \mathbb{R}$ be a self-similar set generated by some iterated function system. In this paper we prove, under some assumptions, that $K$ can be identified with a subshift of finite type. With this identification, we can…

In the area of Tame Geometry, different model-theoretic tameness conditions are established and their relationships are analyzed. We construct a subfield $K$ of the real numbers that lacks several of such tameness properties. As our main…

Let $K$ be a nonarchimedean local field of characteristic zero with valuation ring $R$, for instance, $K=\mathbb{Q}_p$ and $R=\mathbb{Z}_p$. We prove a general integral geometric formula for $K$-analytic groups and homogeneous $K$-analytic…

\kmeans clustering is a fundamental problem in many scientific and engineering domains. The optimization problem associated with \kmeans clustering is nonconvex, for which standard algorithms are only guaranteed to find a local optimum.…

In this paper we give new methods to construct zero divisors in A_n =R^(2^n) the Cayley_Dickson algebras over the real numbers, for n larger than 4, and we also relate the set of zero divisors in A_{n+1} with the Stiefel Manifold V_{2^n…

We introduce a generalized framework for studying higher-order versions of the multiscale method known as Localized Orthogonal Decomposition. Through a suitable reformulation, we are able to accommodate both conforming and nonconforming…

Nonparametric feature selection in high-dimensional data is an important and challenging problem in statistics and machine learning fields. Most of the existing methods for feature selection focus on parametric or additive models which may…

Let $r_k(N)$ be the largest cardinality of a subset of $\{1,\ldots,N\}$ which does not contain any arithmetic progressions (APs) of length $k$. In this paper, we give new upper and lower bounds for fractal dimensions of a set which does not…

The study of substructures in random objects has a long history, beginning with Erd\H{o}s and R\'enyi's work on subgraphs of random graphs. We study the existence of certain substructures in random subsets of vector spaces over finite…

In recent years the theory of dendroidal sets has emerged as an important framework for higher algebra. In this article we introduce the concept of a $C^*$-algebraic drawing of a dendroidal set. It depicts a dendroidal set as an object in…

We show that if $B \subset \mathbb{R}^n$ and $E \subset A(n,k)$ is a nonempty collection of $k$-dimensional affine subspaces of $\mathbb{R}^n$ such that every $P \in E$ intersects $B$ in a set of Hausdorff dimension at least $\alpha$ with…

In the framework of shape constrained estimation, we review methods and works done in convex set estimation. These methods mostly build on stochastic and convex geometry, empirical process theory, functional analysis, linear programming,…

Motivated by practical generalizations of the classic $k$-median and $k$-means objectives, such as clustering with size constraints, fair clustering, and Wasserstein barycenter, we introduce a meta-theorem for designing coresets for…

We present a framework for constructing examples of smooth projective curves over number fields with explicitly given elements in their second K-group using elementary algebraic geometry. This leads to new examples for hyperelliptic curves…

Given any dimension function $h$, we construct a perfect set $E \subseteq \mathbb{R}$ of zero $h$-Hausdorff measure, that contains any finite polynomial pattern. This is achieved as a special case of a more general construction in which we…

We develop an approach to construct Poisson algebras for non-linear scalar field theories that is based on the Cahiers topos model for synthetic differential geometry. In this framework the solution space of the field equation carries a…

The problems of optimally estimating a phase, a direction, and the orientation of a Cartesian frame (or trihedron) with general pure states are addressed. Special emphasis is put on estimation schemes that allow for inconclusive answers or…

Kim defined a very general combinatorial abstraction of the diameter of polytopes called subset partition graphs to study how certain combinatorial properties of such graphs may be achieved in lower bound constructions. Using Lov\'asz'…

We consider the problem of determining the maximum cardinality of a subset containing no arithmetic progressions of length $k$ in a given set of size $n$. It is proved that it is sufficient, in a certain sense, to consider the interval…

We introduce a new regression framework designed to deal with large-scale, complex data that lies around a low-dimensional manifold with noises. Our approach first constructs a graph representation, referred to as the skeleton, to capture…