Related papers: Labels of real projective varieties
We classify (possibly non commutative) algebras of low rank over a domain R. We first review results for algebras of rank 2 and for finite-dimensional division algebras over the real numbers. These results motivate us to consider which…
We recall the definition of classical polar varieties, as well as those of affine and projective reciprocal polar varieties. The latter are defined with respect to a non-degenerate quadric, which gives us a notion of orthogonality. In…
Let $\mathbb X\subset\mathbb P(V)$ be a projective variety, which is not contained in a hyperplane. Then every vector $v$ in $V$ can be written as a sum of vectors from the affine cone $X$ over $\mathbb X$. The minimal number of summands in…
We provide a setting-independent definition of reals by introducing the notion of a streak. We show that various standard constructions of reals satisfy our definition. We study the structure of reals by noting that its pieces correspond to…
In this paper, we proved two results regarding the arithmetics of separably $\mathbb{A}^1$-connected varieties of rank one. First we proved over a large field, there is an $\mathbb{A}^1$-curve through any rational point of the boundary, if…
Let X be a geometrically irreducible smooth projective curve over a field k. We describe the algebra of endomorphisms of indecomposable unstable vector bundles over X of rank 2 and degree d. Fixing some numerical invariants, namely the…
Much like admissibility is the key concept underlying preferred semantics, strong admissibility is the key concept underlying grounded semantics, as membership of a strongly admissible set is sufficient to show membership of the grounded…
In this paper, we consider the problem of making skeptical inferences for the multi-label ranking problem. We assume that our uncertainty is described by a convex set of probabilities (i.e. a credal set), defined over the set of labels.…
This note gives the complete projective classification of rational, cuspidal plane curves of degree at least 6, and having only weighted homogeneous singularities. It also sheds new light on some previous characterizations of free and…
A graph class admits an implicit representation if, for every positive integer $n$, its $n$-vertex graphs have a $O(\log n)$-bit (adjacency) labeling scheme, i.e., their vertices can be labeled by binary strings of length $O(\log n)$ such…
The notion of a subtractive category, recently introduced by the author, is a ``categorical version'' of the notion of a (pointed) subtractive variety of universal algebras, due to A. Ursini. We show that a subtractive variety $\C$, whose…
For a given graph whose edges are labeled with general real numbers, we consider the set of functions from the vertex set into the Euclidean plane such that the distance between the images of neighbouring vertices is equal to the…
The concept of sum labelling was introduced in 1990 by Harary. A graph is a sum graph if its vertices can be labelled by distinct positive integers in such a way that two vertices are connected by an edge if and only if the sum of their…
We introduce the notion of a projectively simple ring, which is an infinite-dimensional graded k-algebra A such that every 2-sided ideal has finite codimension in A (over the base field k). Under some (relatively mild) additional…
Extreme multi-label classification or XMLC, is an active area of interest in machine learning. Compared to traditional multi-label classification, here the number of labels is extremely large, hence, the name extreme multi-label…
We present a method for associating labeled directed graphs to finite-dimensional Lie algebras, thereby enabling rapid identification of key structural algebraic features. To formalize this approach, we introduce the concept of…
The Graceful Tree Conjecture of Rosa from 1967 asserts that the vertices of each tree T of order n can be injectively labelled by using the numbers {1,2,...,n} in such a way that the absolute differences induced on the edges are pairwise…
The aim of this note is threefold. The first is to obtain a simple characterization of relative constructible sheaves when the parameter space is projective. The second is to study the relative Fourier-Mukai for relative constructible…
We focus on the supervised binary classification problem, which consists in guessing the label $Y$ associated to a co-variate $X \in \R^d$, given a set of $n$ independent and identically distributed co-variates and associated labels…
Given an undirected graph representing similarities between a set of items and an additive measure evaluating the items, we treat the position of a special subset of items in an ordinal ranking through a collection of combinatorial…