Related papers: Scale-valued sets: a minimal framework for general…
The normal form for a system of ode's is constructed from its polynomial symmetries of the linear part of the system, which is assumed to be semi-simple. The symmetries are shown to have a simple structure such as invariant function times…
From the advent of the application of satellite imagery to land cover mapping, one of the growing areas of research interest has been in the area of image classification. Image classifiers are algorithms used to extract land cover…
Recently, J.~T.~Denniston, A.~Melton, and S.~E.~Rodabaugh introduced a lattice-valued analogue of the concept of institution of J.~A.~Goguen and R.~M.~Burstall, comparing it, moreover, with the (lattice-valued version of the) notion of…
This work is concerned with variational analysis of so-called spectral functions and spectral sets of matrices that only depend on eigenvalues of the matrix. Based on our previous work [H. T. B\`ui, M. N. B\`ui, and C. Clason, Convex…
Sharply o-minimal structures (denoted \so-minimal) are a strict subclass of the o-minimal structures, aimed at capturing some finer features of structures arising from algebraic geometry and Hodge theory. Sharp o-minimality associates to…
The Scaled Relative Graph (SRG) is a geometric tool that maps the action of a multi-valued nonlinear operator onto the 2D plane, used to analyze the convergence of a wide range of iterative methods. As the SRG includes the spectrum for…
We review some recent developments in 1-st order GLSM construction, or so-called Gross-Neveu formalism for sigma models. We recall the general idea behind this framework and describe a 1-st order GLSM data from which the general generalized…
Spherical Designs are finite sets of points on the sphere $\mathbb{S}^{d}$ with the property that the average of certain (low-degree) polynomials in these points coincides with the global average of the polynomial on $\mathbb{S}^{d}$. They…
We study the problem of determining whether a given frame is scalable, and when it is, understanding the set of all possible scalings. We show that for most frames this is a relatively simple task in that the frame is either not scalable or…
This paper provides an advanced mathematical theory of the Generalized Singular Value Decomposition (GSVD) and its applications. We explore the geometry of the GSVD which provides a long sought for ellipse picture which includes a…
The immensely fruitful concept of Grothendieck topology or covering issued from the efforts of algebraic geometers to study "sheaf-like" objects defined on categories more general than the lattice of open sets on a topological space. In the…
Small-angle scattering (SAS) of X-rays, neutrons or light from ensembles of randomly oriented and placed deterministic fractal structures are studied theoretically. In the standard analysis, a very few parameters can be determined from SAS…
The Singular Value Decomposition (SVD) is one of the most important matrix factorizations, enjoying a wide variety of applications across numerous application domains. In statistics and data analysis, the common applications of SVD such as…
We apply our new approach of quantum Separation of Variables (SoV) to the complete characterization of the transfer matrix spectrum of quantum integrable lattice models associated to gl(n)-invariant R-matrices in the fundamental…
Covering is a common type of data structure and covering-based rough set theory is an efficient tool to process this data. Lattice is an important algebraic structure and used extensively in investigating some types of generalized rough…
Generative modeling of set-structured data, such as point clouds, requires reasoning over local and global structures at various scales. However, adopting multi-scale frameworks for ordinary sequential data to a set-structured data is…
Multi-scale structures are prevalent in both natural and artificial systems, as they can handle increasing complexity. Several terms are employed almost interchangeably across various application domains to refer to the multi-scale concept…
Functions with uniform level sets can represent orders, preference relations or other binary relations and thus turn out to be a tool for scalarization that can be used, e.g., in multicriteria optimization, decision theory, mathematical…
Let G be a graph whose edges are labeled by ideals of a commutative ring. We introduce a generalized spline, which is a vertex-labeling of G by elements of the ring so that the difference between the labels of any two adjacent vertices lies…
A lattice is a partially ordered set supporting a meet (or join) operation that returns the largest lower bound (smallest upper bound) of two elements. Just like graphs, lattices are a fundamental structure that occurs across domains…