English
Related papers

Related papers: A-classification of map-germs via $_V$K-equivalenc…

200 papers

Let $K$ be a closed polydisc or ball in $\C^n$, and let $Y$ be a quasi projective algebraic manifold which is Zariski locally equivalent to $\C^p$, or a complement of an algebraic subvariety of codimension $\ge 2$ in such manifold. If $r$…

Complex Variables · Mathematics 2007-05-23 Kolarič Dejan

Any simple group-grading of a finite dimensional complex algebra induces a natural family of digraphs. We prove that $|E\circ E^{\text{op}}\cup E^{\text{op}}\circ E|\geq |E|$ for any digraph $\Gamma =(V,E)$ without parallel edges, and…

Rings and Algebras · Mathematics 2013-05-22 Yuval Ginosar , Ofir Schnabel

We present Gradient Activation Maps (GAM) - a machinery for explaining predictions made by visual similarity and classification models. By gleaning localized gradient and activation information from multiple network layers, GAM offers…

Computer Vision and Pattern Recognition · Computer Science 2021-09-03 Oren Barkan , Omri Armstrong , Amir Hertz , Avi Caciularu , Ori Katz , Itzik Malkiel , Noam Koenigstein

There are several equivalent characterizations of the valuation rank of an ordered or valued field. In this paper, we extend the theory to the case of an ordered or valued {\it difference} field (that is, ordered or valued field endowed…

Logic · Mathematics 2018-11-08 Salma Kuhlmann , Mickael Matusinski , Francoise Point

Given a set of points labeled with $k$ labels, we introduce the heat map sorting problem as reordering and merging the points and dimensions while preserving the clusters (labels). A cluster is preserved if it remains connected, i.e., if it…

Data Structures and Algorithms · Computer Science 2023-09-15 Sepideh Aghamolaei , Mohammad Ghodsi

A k-ranking of a graph G is a labeling of the vertices of G with values from {1,...,k} such that any path joining two vertices with the same label contains a vertex having a higher label. The tree-depth of G is the smallest value of k for…

Combinatorics · Mathematics 2015-11-12 Michael D. Barrus , John Sinkovic

We give an axiomatic characterization of maps from algebraic K-theory. The results apply to a class of maps from algebraic K-theory to any suitable cohomology theory or to algebraic K-theory, which includes all group morphisms. In…

K-Theory and Homology · Mathematics 2008-07-24 Elisenda Feliu

In this paper we obtain a Carleman approximation theorem for maps from Stein manifolds to Oka manifolds. More precisely, we show that under suitable complex analytic conditions on a totally real set $ M $ of a Stein manifold $X$, every…

Complex Variables · Mathematics 2019-04-18 Brett Chenoweth

Let G be a complex semisimple Lie group, K a maximal compact subgroup and V an irreducible representation of K. Denote by M the unique closed orbit of G in P(V) and by O its image via the moment map. For any measure on M we construct a map…

Differential Geometry · Mathematics 2010-12-10 Leonardo Biliotti , Alessandro Ghigi

In this paper, we study the graph classification problem from the graph homomorphism perspective. We consider the homomorphisms from $F$ to $G$, where $G$ is a graph of interest (e.g. molecules or social networks) and $F$ belongs to some…

Machine Learning · Computer Science 2020-07-03 Hoang NT , Takanori Maehara

The classification, both up to isomorphism or up to equivalence, of the gradings on a finite dimensional nonassociative algebra A over an algebraically closed field F, such that its group scheme of automorphisms is smooth, is shown to be…

Rings and Algebras · Mathematics 2014-07-03 Alberto Elduque

A proper labeling of a graph is an assignment of integers to some elements of a graph, which may be the vertices, the edges, or both of them, such that we obtain a proper vertex coloring via the labeling subject to some conditions. The…

Discrete Mathematics · Computer Science 2017-01-25 Ali Dehghan , Mohammad-Reza Sadeghi , Arash Ahadi

We consider Kempe changes on the $k$-colorings of a graph on $n$ vertices. If the graph is $(k-1)$-degenerate, then all its $k$-colorings are equivalent up to Kempe changes. However, the sequence between two $k$-colorings that arises from…

Combinatorics · Mathematics 2021-12-07 Marthe Bonamy , Vincent Delecroix , Clément Legrand-Duchesne

We establish exact sequences in $KK$-theory for graded relative Cuntz-Pimsner algebras associated to nondegenerate $C^*$-correspondences. We use this to calculate the graded $K$-theory and $K$-homology of relative Cuntz-Krieger algebras of…

Operator Algebras · Mathematics 2021-10-26 Quinn Patterson , Adam Sierakowski , Aidan Sims , Jonathan Taylor

For a graph $G = (V, E)$, the $\gamma$-graph of $G$, denoted $G(\gamma) = (V(\gamma), E(\gamma))$, is the graph whose vertex set is the collection of minimum dominating sets, or $\gamma$-sets of $G$, and two $\gamma$-sets are adjacent in…

Combinatorics · Mathematics 2019-07-31 Stephen Finbow , Christopher M. van Bommel

We decompose the K-theory space of a Waldhausen category in terms of its Dwyer-Kan simplicial localization. This leads to a criterion for functors to induce equivalences of K-theory spectra that generalizes and explains many of the criteria…

K-Theory and Homology · Mathematics 2011-08-09 Andrew J. Blumberg , Michael A. Mandell

Weighted cup-length calculations in singular cohomology led Farber and Grant in 2008 to general lower bounds for the topological complexity of lens spaces. We replace singular cohomology by K-theory, and weighted cup-length arguments by…

Algebraic Topology · Mathematics 2013-01-01 Jesus Gonzalez , Maurilio Velasco , W. Stephen Wilson

This paper studies the consistency of the kernel-based neural ranking model K-NRM, a recent state-of-the-art neural IR model, which is important for reproducible research and deployment in the industry. We find that K-NRM has low variance…

Information Retrieval · Computer Science 2018-09-28 Mary Arpita Pyreddy , Varshini Ramaseshan , Narendra Nath Joshi , Zhuyun Dai , Chenyan Xiong , Jamie Callan , Zhiyuan Liu

Let $A \leq G$ be a subgroup of a group $G$. An $A$-complement of $G$ is a subgroup $H$ of $G$ such that $G = A H$ and $A \cap H = \{1\}$. The \emph{classifying complements problem} asks for the description and classification of all…

Group Theory · Mathematics 2015-12-01 A. L. Agore , G. Militaru

This study combines two different learning paradigms, k-nearest neighbor (k-NN) rule, as memory-based learning paradigm and relevance vector machines (RVM), as statistical learning paradigm. This combination is performed in kernel space and…

Machine Learning · Computer Science 2021-03-09 Sara Hosseinzadeh Kassani , Farhood Rismanchian , Peyman Hosseinzadeh Kassani
‹ Prev 1 8 9 10 Next ›