Related papers: The boundary motive: definition and basic properti…
This paper gives some relating results for various concepts of convexity in metric spaces such as midpoint convexity, convex structure, uniform convexity and near-uniform convexity, Busemann curvature and its relation to convexity. Some…
We consider proper, algebraic semismall maps f from a complex algebraic manifold X. We show that the topological Decomposition Theorem implies a "motivic" decomposition theorem for the rational algebraic cycles of X and, in the case X is…
Let $n > m\ge 2$ be integers and let $\mathcal{A}=\{A_1,\dots,A_m\}$ be a partition of $[n]=\{1,\dots,n\}$. For $X \subseteq [n]$, its $\mathcal{A}$-boundary region $\mathcal{A}(X)$ is defined to be the union of those blocks $A_i$ of…
We define a natural compactification of an arrangement complement in a ball quotient. We show that when this complement has a moduli space interpretation, then this compactification is often one that appears naturally by means of geometric…
Open discrete mappings with a modulus condition in metric spaces are considered. Some results related to local behavior of mappings as well as theorems about continuous extension to a boundary are proved.
In this paper, we describe new methods to compute the radical (resp. real radical) of an ideal, assuming it complex (resp. real) variety is finite. The aim is to combine approaches for solving a system of polynomial equations with dual…
We define a concept which we call multiplicity. First, multiplicity of a morphism is defined. Then the multiplicity of an object over another object is defined to be the minimum of the multiplicities of all morphisms from one to another.…
Separation bounds are a fundamental measure of the complexity of solving a zero-dimensional system as it measures how difficult it is to separate its zeroes. In the positive dimensional case, the notion of reach takes its place. In this…
Investigating fairness and equity of automated systems has become a critical field of inquiry. Most of the literature in fair machine learning focuses on defining and achieving fairness criteria in the context of prediction, while not…
We study maps of bounded variation defined on a metric measure space and valued into a metric space. Assuming the source space to satisfy a doubling and Poincar\'e property, we produce a well-behaved relaxation theory via approximation by…
We introduce the notion of a relative log scheme with boundary: a morphism of log schemes together with a (log schematically) dense open immersion of its source into a third log scheme. The sheaf of relative log differentials naturally…
We define the similarity boundary of a self-similar set and use it to analyze the properties of self-similar sets in the general setting of any complete metric space. The similarity boundary is an attempt at extending the concept of the…
In the study of high-dimensional data, it is often assumed that the data set possesses an underlying lower-dimensional structure. A practical model for this structure is an embedded compact manifold with boundary. Since the underlying…
In the context of integrable partial difference equations on quad-graphs, we introduce the notion of open boundary reductions as a new means to construct discrete integrable mappings and their invariants. This represents an alternative to…
Border bases arise as a canonical generalization of Gr\"obner bases. We provide a polyhedral characterization of all order ideals (and hence border bases) that are supported by a zero-dimensional ideal: order ideals that support a border…
This paper gives a short and historical survey on the theory of pure motives in algebraic geometry and reviews some of the recent developments of this theory in noncommutative geometry. The second part of the paper outlines the new theory…
In this work we develop a theory of motives for logarithmic schemes over fields in the sense of Fontaine, Illusie, and Kato. Our construction is based on the notion of finite log correspondences, the dividing Nisnevich topology on log…
We prove explicit bounds on the number of lattice points on or near a convex curve in terms of geometric invariants such as length, curvature, and affine arclength. In several of our results we obtain the best possible constants. Our…
We propose a method to distinguish causal influence from hidden confounding in the following scenario: given a target variable Y, potential causal drivers X, and a large number of background features, we propose a novel criterion for…
We introduce a generalization for bounded geometry that we call bounded scale measure. We show that bounded scale measure is a coarse invariant unlike bounded geometry. We then show equivalent definitions for spaces with bounded scale…