相关论文: Metrics and Ambits and Sprawls, Oh My
We suggest a variation of the Hellerstein--Koutsoupias--Papadimitriou indexability model for datasets equipped with a similarity measure, with the aim of better understanding the structure of indexing schemes for similarity-based search and…
The main goals of this paper are: i) To develop an abstract differential calculus on metric measure spaces by investigating the duality relations between differentials and gradients of Sobolev functions. This will be achieved without…
The \emph{index set} of a computable structure $\mathcal{A}$ is the set of indices for computable copies of $\mathcal{A}$. We determine the complexity of the index sets of various mathematically interesting structures, including arbitrary…
Measuring comodules are defined and shown to provide a useful generalization of the set of maps between modules with a broad range of applications. Three applications are described. Connections on bundles are described in terms of measuring…
Indexes are useful for summarizing multivariate information into single metrics for monitoring, communicating, and decision-making. While most work has focused on defining new indexes for specific purposes, more attention needs to be…
Any procedure applied to data, and any quantity derived from data, is required to respect the nature and symmetries of the data. This axiom applies to refinement procedures and multiresolution transforms as well as to more basic operations…
Functions whose composition with every metric is a metric are said to be metric-preserving. In this article, we investigate a variation of the concept of metric-preserving functions where metrics are replaced by ultrametrics.
Metric mean dimension is a geometric invariant of dynamical systems with infinite topological entropy. We relate this concept with the fractal structure of the phase space and the H\"older regularity of the map. Afterwards we improve our…
There are versions of "calculus" in many settings, with various mixtures of algebra and analysis. In these informal notes we consider a few examples that suggest a lot of interesting questions.
The number of academic papers being published is increasing exponentially in recent years, and recommending adequate citations to assist researchers in writing papers is a non-trivial task. Conventional approaches may not be optimal, as the…
We introduce several highness notions on degrees related to the problem of computing isomorphisms between structures, provided that isomorphisms exist. We consider variants along axes of uniformity, inclusion of negative information, and…
In this paper we will relate hyperstructures and the general $\mathscr{H}$-principle to known mathematical structures, and also discuss how they may give rise to new mathematical structures. The main purpose is to point out new ideas and…
Allometric scaling can reflect underlying mechanisms, dynamics and structures in complex systems; examples include typical scaling laws in biology, ecology and urban development. In this work, we study allometric scaling in scientific…
We consider the problem of computing a lightest derivation of a global structure using a set of weighted rules. A large variety of inference problems in AI can be formulated in this framework. We generalize A* search and heuristics derived…
In this survey we overview known results and get several new results on digraph compositions which generalize several classes of digraphs, such as quasi-transitive digraphs. After an introductory section, the paper is divided into six…
It is shown the construction of a module structure [2] with universe over a set of a particular kind of mathematical proofs, the base ring of this module will be built on a maximal consistent extension of a set of propositions, this…
We study $\infty$-modulus on general metric spaces and establish its relation to shortest lengths of paths. This connection was already known for modulus on graphs, but the formulation in metric measure spaces requires more attention to…
Graphs are used in almost every scientific discipline to express relations among a set of objects. Algorithms that compare graphs, and output a closeness score, or a correspondence among their nodes, are thus extremely important. Despite…
Metric search is concerned with the efficient evaluation of queries in metric spaces. In general,a large space of objects is arranged in such a way that, when a further object is presented as a query, those objects most similar to the query…
Many concrete problems are formulated in terms of a finite set of points in $R^n$ which, via the ambient Euclidean metric, becomes a finite metric space. To obtain information from such a space, it is often useful to associate a graph to…