Related papers: Rank axioms and supersimplicity
We study the structure and compute the stable rank of C*-algebras of finite higher-rank graphs. We completely determine the stable rank of the C*-algebra when the k-graph either contains no cycle with an entrance, or is cofinal. We also…
Rank-based approaches are among the most popular nonparametric methods for univariate data in tackling statistical problems such as hypothesis testing due to their robustness and effectiveness. However, they are unsatisfactory for more…
Integer partitions have fascinated people for centuries, from Ramanujan's groundbreaking congruences to the modern theory of modular forms. This paper investigates the statistical properties of odd unimodal sequences--a natural refinement…
Suppose $f(x,y)$ is a binary form of degree $d$ with coefficients in a field $K \subseteq \mathbb C$. The $K$-rank of $f$ is the smallest number of $d$-th powers of linear forms over $K$ of which $f$ is a $K$-linear combination. We prove…
We observe that a simple condition suffices to describes non-forking independence over models in a stable theory. Under mild assumptions, this description can be extended to non-forking independence over algebraically closed subsets,…
We consider the problem of statistical inference for ranking data, specifically rank aggregation, under the assumption that samples are incomplete in the sense of not comprising all choice alternatives. In contrast to most existing methods,…
Randomized rankings have been of recent interest to achieve ex-ante fairer exposure and better robustness than deterministic rankings. We propose a set of natural axioms for randomized group-fair rankings and prove that there exists a…
Let $G$ be an ordered group that is a direct sum of a rank-one torsion-free abelian group and a finite-rank torsion-free abelian group, with order structure arising from the natural order on the first summand. A necessary condition and a…
For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group,…
We introduce stratified labelings as a novel semantical approach to abstract argumentation frameworks. Compared to standard labelings, stratified labelings provide a more fine-grained assessment of the controversiality of arguments using…
We describe in this paper a connection between bifix codes, symbolic dynamical systems and free groups. This is in the spirit of the connection established previously for the symbolic systems corresponding to Sturmian words. We introduce a…
We develop a new notion of independence suggested by Scanlon (th-independence). We prove that in a large class of theories (which includes all simple theories) this notion has many of the properties needed for an adequate geometric…
Let ${\mathcal A}$ denote the family of all functions $f$ analytic in the unit disk $\ID$ and satisfying the normalization $f(0)=0= f'(0)-1$. Let $\mathcal{S}$ denote the subclass of ${\mathcal A}$ consisting of univalent functions in…
Semantic role labeling (SRL) is a fundamental yet challenging task in the NLP community. Recent works of SRL mainly fall into two lines: 1) BIO-based; 2) span-based. Despite ubiquity, they share some intrinsic drawbacks of not considering…
By arithmeticity and superrigidity, a commensurability class of lattices in a higher rank Lie group is defined by a unique algebraic group over a unique number subfield of $\mathbb{R}$ or $\mathbb{C}$. We prove an adelic version of…
In many cases (e.g. for many Segre or Segre embeddings of multiprojective spaces) we prove that a hypersurface of the $b$-secant variety of $X\subset \mathbb {P}^r$ has $X$-rank $>b$. We prove it proving that the $X$-rank of a general point…
In this paper, we introduce the notion of K-rank, where K is an strong amalgamation Fraisse class. Roughly speaking, the K-rank of a partial type is the number of "copies" of K that can be "independently coded" inside of the type. We study…
We extend L\"uck's determinant conjecture from groups to invariant random subgroups (IRS) of free groups, a framework generalizing groups where a non-sofic object is known to exist. For every free group, we prove the existence of an IRS…
The problem of ranking/ordering instances, instead of simply classifying them, has recently gained much attention in machine learning. In this paper we formulate the ranking problem in a rigorous statistical framework. The goal is to learn…
We establish certain topological properties of rank understood as a function on the set of invariant measures on a topological dynamical system. To be exact, we show that rank is of Young class LU (i.e., it is the limit of an increasing…