Related papers: Rank axioms and supersimplicity
Let U be a numeration system, a set X of integers is U-star-free if the set made up of the U-representations of the elements in X is a star-free regular language. Answering a question of A. de Luca and A. Restivo, we obtain a complete…
We introduce various notions of rank for a symmetric tensor, namely: rank, border rank, catalecticant rank, generalized rank, scheme length, border scheme length, extension rank and smoothable rank. We analyze the stratification induced by…
Schmidt characterised the class of rayless graphs by an ordinal rank function, which makes it possible to prove statements about rayless graphs by transfinite induction. Halin asked whether Schmidt's rank function can be generalised to…
We observe that a recent theorem of Sato, Toms-White-Winter and Kirchberg-Rordam also holds for certain nonunital C*-algebras. Namely, we show that an algebraically simple, separable, nuclear, nonelementary C*-algebra with strict…
In the context of commutative $C^*$-algebras we solve a problem related to a question of M. Rieffel by showing that the all-units rank and the norm-one rank coincide with the topological stable rank. We also introduce the notion of unitary…
In this work, we consider ranking problems among a finite set of candidates: for instance, selecting the top-$k$ items among a larger list of candidates or obtaining the full ranking of all items in the set. These problems are often…
This paper addresses the problem of rank aggregation, which aims to find a consensus ranking among multiple ranking inputs. Traditional rank aggregation methods are deterministic, and can be categorized into explicit and implicit methods…
Determining the precise rank is an important problem in many large-scale applications with matrix data exploiting low-rank plus noise models. In this paper, we suggest a universal approach to rank inference via residual subsampling (RIRS)…
The article establishes a long list of rigidity properties of lattices in G = SO(n,1) with n>=3 and G = SU(n,1) with n>=2 that are analogous to superrigidity of lattices in higher-rank Lie groups. The arguments are set in the context of…
Let $C$ be a curve of genus at least three defined over a number field, and let $r$ be the rank of the rational points of its Jacobian. Under mild hypotheses on $r$, recent results by Katz, Rabinoff, Zureick-Brown, and Stoll bound the…
Learning to rank is a supervised learning problem where the output space is the space of rankings but the supervision space is the space of relevance scores. We make theoretical contributions to the learning to rank problem both in the…
In this paper we give characterizations of the super-stable theories, in terms of an external property called representation. In the sense of the representation property, the mentioned class of first-order theories can be regarded as "not…
Let $G$ be a linear semisimple Lie group without compact factors. We show that uniform approximate lattices $\Lambda$ arising as regular model sets in $G$ determine the ambient group $G$ in a strong sense. Specifically, for every…
We define an extension of parity from the integers to the rational numbers. Three parity classes are found -- even, odd and `none'. Using the 2-adic valuation, we partition the rationals into subgroups with a rich algebraic structure. The…
Let A be a unital maximal full algebra of operator fields with base space the k-cube [0,1]^k and fibre algebras, say, {A_t}_{t \in [0,1]^k}. Then the stable rank of A is bounded above by the supremum of the stable ranks sr(C([0,1]^k)…
Motivated from one-dimensional rigidity results of entire solutions to Liouville equation, we consider the semilinear equation \begin{align} \label{liouvilleequationab} \Delta u=G(u) \quad \mbox{in $\mathbb{R}^n$}, \end{align}where $G>0,…
We show that an infinite residually finite boundedly generated group has an infinite chain of finite index subgroups with ranks uniformly bounded, and give (sublinear) upper bounds on the ranks of arbitrary finite index subgroups of…
We study principles of the form: if a name $\sigma$ is forced to have a certain property $\varphi$, then there is a ground model filter $g$ such that $\sigma^g$ satisfies $\varphi$. We prove a general correspondence connecting these name…
A new axiom is proposed, the Ground Axiom, asserting that the universe is not a nontrivial set forcing extension of any inner model. The Ground Axiom is first-order expressible, and any model of ZFC has a class forcing extension which…
We develop a pseudo-likelihood theory for rank one matrix estimation problems in the high dimensional limit. We prove a variational principle for the limiting pseudo-maximum likelihood which also characterizes the performance of the…