Related papers: Regularity and counting lemmas for multidimensiona…
We study the upper and lower regularity dimensions in relation to the notions of doubling and uniformly perfect. These two regularity properties are closely related which is quantified thanks to the regularity dimensions. The regularity…
I formulate a deformation of the dimensional-regularization technique that is useful for theories where the common dimensional regularization does not apply. The Dirac algebra is not dimensionally continued, to avoid inconsistencies with…
While many approaches exist in the literature to learn low-dimensional representations for data collections in multiple modalities, the generalizability of multi-modal nonlinear embeddings to previously unseen data is a rather overlooked…
We present a common ground for infinite sums, unordered sums, Riemann/Lebesgue integrals, arc length and some generalized means. It is based on extending functions on finite sets using Hausdorff metric in a natural way.
We establish a general theorem improving regularity of solutions of elliptic pseudodifferential equations. It allows to resolve in a unified way the regularity issue for a broad class of nonlinear elliptic equations and systems appearing in…
There are two basic ways of weakening the definition of the well-known metric regularity property by fixing one of the points involved in the definition. The first resulting property is called metric subregularity and has attracted a lot of…
The rigidity matrix is a fundamental tool for studying the infinitesimal rigidity properties of Euclidean bar-joint frameworks. In this paper we generalize this tool and introduce a rigidity matrix for bar-joint frameworks in arbitrary…
Standard statistical techniques often require transforming data to have mean $0$ and standard deviation $1$. Typically, this process of "standardization" or "normalization" is applied across subjects when each subject produces a single…
Neural networks appear to have mysterious generalization properties when using parameter counting as a proxy for complexity. Indeed, neural networks often have many more parameters than there are data points, yet still provide good…
We revisit and generalize the geometric procedure of regularizing a sequence of real numbers with respect to a so-called regularizing function. This approach was studied by S. Mandelbrojt and becomes useful and necessary when working with…
In this work, we use the theory of error bounds to study metric regularity of the sum of two multifunctions, as well as some important properties of variational systems. We use an approach based on the metric regularity of epigraphical…
This paper investigates the theory of sum-rank metric codes for which the individual matrix blocks may have different sizes. Various bounds on the cardinality of a code are derived, along with their asymptotic extensions. The duality theory…
We estimate the frequency of singular matrices and of matrices of a given rank whose entries are parametrised by arbitrary polynomials over the integers and modulo a prime $p$. In particular, in the integer case, we improve a recent bound…
An ill-defined integral equation for modeling the mass-spectrum of mesons is regulated with an additional but unphysical parameter. This parameter dependance is removed by renormalization. Illustrative graphical examples are given.
In this talk we go over several new developments regarding the techniques for a large class of non-hermitian matrix models with unitary randomness (complex random numbers). In particular, we discuss: (a) - A diagrammatic approach based on a…
The study of the graph diameter of polytopes is a classical open problem in polyhedral geometry and the theory of linear optimization. In this paper we continue the investigation initiated in [4] by introducing a vast hierarchy of…
We develop several efficient algorithms for the classical \emph{Matrix Scaling} problem, which is used in many diverse areas, from preconditioning linear systems to approximation of the permanent. On an input $n\times n$ matrix $A$, this…
This paper illustrates the richness of the concept of regular sets of time bounds and demonstrates its application to problems of computational complexity. There is a universe of bounds whose regular subsets allow to represent several time…
In this note we use recent results concerning the sum theorem for maximal monotone multifunctions in general Banach spaces to find new characterizations and properties of regular maximal monotone multifunctions and then use these to…
We present fast and accurate ways to normalize two and three dimensional vectors and quaternions and compute their length. Our approach is an adaptation of ideas used in the linear algebra library LAPACK, and we believe that the…