Related papers: Ranks Based on Strong Amalgamation Fraisse Classes
We consider $K$-semialgebras for a commutative semiring $K$ that are at the same time $\Sigma$-algebras and satisfy certain linearity conditions. When each finite system of guarded polynomial fixed point equations has a unique solution over…
The subrank of tensors is a measure of how much a tensor can be ''diagonalized''. This parameter was introduced by Strassen to study fast matrix multiplication algorithms in algebraic complexity theory and is closely related to many central…
Consider a matrix $\mathbf{F} \in \mathbb{K}[x]^{m \times n}$ of univariate polynomials over a field $\mathbb{K}$. We study the problem of computing the column rank profile of $\mathbf{F}$. To this end we first give an algorithm which…
Let $F$ be a finitely generated regular field extension of transcendence degree $\geq 2$ over a perfect field $k$. We show that the multiplicative group $F^\times/k^\times$ endowed with the equivalence relation induced by algebraic…
We develop a version of controlled algebra for simplicial rings. This generalizes the methods which lead to successful proofs of the algebraic K- theory isomorphism conjecture (Farrell-Jones Conjecture) for a large class of groups. This is…
Correlation matrices are omnipresent in multivariate data analysis. When the number d of variables is large, the sample estimates of correlation matrices are typically noisy and conceal underlying dependence patterns. We consider the case…
We study classes of reproducing kernels $K$ on general domains; these are kernels which arise commonly in machine learning models; models based on certain families of reproducing kernel Hilbert spaces. They are the positive definite kernels…
Duality relations between Lie algebras are a significant phenomenon in Lie algebra representation theory, with level-rank duality as a famous example. Level-rank dualities for affine Lie algebras of type $A^{(1)}$ were first discovered by…
The polynomial automorphisms of the affine plane over a field K form a group which has the structure of an amalgamated free product. This well-known algebraic structure can be used to determine some key results about the symmetry and…
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…
We introduce $k$-variance, a generalization of variance built on the machinery of random bipartite matchings. $K$-variance measures the expected cost of matching two sets of $k$ samples from a distribution to each other, capturing local…
Kruskal's theorem states that a sum of product tensors constitutes a unique tensor rank decomposition if the so-called k-ranks of the product tensors are large. We prove a "splitting theorem" for sets of product tensors, in which the k-rank…
The top-k classification accuracy is one of the core metrics in machine learning. Here, k is conventionally a positive integer, such as 1 or 5, leading to top-1 or top-5 training objectives. In this work, we relax this assumption and…
We introduce descent methods to the study of strong approximation on algebraic varieties. We apply them to two classes of varieties defined by P(t)=N_{K/k}(z): firstly for quartic extensions of number fields K/k and quadratic polynomials…
In a number of recent papers, (k+l)-graphs have been constructed from k-graphs by inserting new edges in the last l dimensions. These constructions have been motivated by C*-algebraic considerations, so they have not been treated…
Let $R$ be a strong $n$-coherent ring such that each finitely $n$-presented $R$-module has finite projective dimension. We consider $\mathcal{FP}_{n}(R)$ the full subcategory of $R$-Mod of finitely $n$-presented modules. We prove that…
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…
In this paper we consider the decomposition of positive semidefinite matrices as a sum of rank one matrices. We introduce and investigate the properties of various measures of optimality of such decompositions. For some classes of positive…
We develop a theory of k-partitions of the set of infinite words recognizable by classes of finite automata. The theory enables to complete proofs of existing results about topological classifications of the (aperiodic) omega-regular…
The k-truss model is one of the most important models in cohesive subgraph analysis. The k-truss decomposition problem is to compute the trussness of each edge in a given graph, and has been extensively studied. However, the conventional…