Related papers: Ranks of $\mathcal{F}$-limits of filter sequences
The feasibility of a classification-by-rank program for modular categories follows from the Rank-Finiteness Theorem. We develop arithmetic, representation theoretic and algebraic methods for classifying modular categories by rank. As an…
We introduce a new concept of rank - relative rank associated to a filtered collection of polynomials. When the filtration is trivial our relative rank coincides with Schmidt rank (also called strength). We also introduce the notion of…
We study the classes of filters F on N such that the weak and strong F-convergence of sequences in l1 coincide. We study also an analogue of l1 weak sequential completeness theorem for filter convergence.
Given a tract $F$ in the sense of Baker and Bowler and a matrix $A$ with entries in $F$, we define several notions of rank for $A$. In this way, we are able to unify and find conceptually satisfying proofs for various results about ranks of…
In this paper, we study the symmetric rank of products of linear forms and an irreducible quadratic form. The main result presents a new, non-trivial lower bound for the rank, and the arguments rely on the apolarity lemma. In the special…
If $\mathcal P$ is a family of filters over some set $I$, a topological space $X$ is \emph{sequencewise $\mathcal P$-\brfrt compact} if, for every $I$-indexed sequence of elements of $X$, there is $F \in \mathcal P$ such that the sequence…
Let $A$ be a non-zero abelian variety over a field $F$ that is not algebraic over a finite field. We prove that the rational rank of the abelian group $A(F)$ is infinite when $F$ is large in the sense of Pop (also called ample). The main…
We introduce the monic rank of a vector relative to an affine-hyperplane section of an irreducible Zariski-closed affine cone $X$. We show that the monic rank is finite and greater than or equal to the usual $X$-rank. We describe an…
Motivated by recent works on statistics of matrices over sets of number theoretic interest, we study matrices with entries from arbitrary finite subsets $\mathcal A$ of finite rank multiplicative groups infields of characteristic zero. We…
Recall that the set of Fubini rankings on $n$ competitors consists of the $n$-tuples that encode the possible rankings of $n$ competitors in a competition allowing ties. Moreover, recall that a run (weak run) in a tuple is a subsequence of…
We develop the notion of a "filtered cospan" as an algebraic object that stands in the same relation to interlevel persistence modules as filtered chain complexes stand with respect to sublevel persistence modules. This relation is…
In this short note we give a formula for the factorization number $F_2(G)$ of a finite rank $3$ abelian $p$-group $G$. This extends a result in our previous work \cite{9}.
A filter lattice is a distributive lattice formed by all filters of a poset in the anti-inclusion order. We study the combinatorial properties of the Hasse diagrams of filter lattices of certain posets, so called Fibonacci-like cubes, in…
Let $S$ be a semigroup, let $n\in\mathbb{N}$ be a positive natural number, let $A,B\subseteq S$, let $\mathcal{U},\mathcal{V}\in\beta S$ and let let $\mathcal{F}\subseteq\{f:S^{n}\rightarrow S\}$. We say that $A$ is $\mathcal{F}$-finitely…
Let $X$ be a non-empty set and let $\mathcal{F}$ be any $C^{\ast}$-subalgebra of $\ell ^{\infty}(X)$ containing the constant functions. We show that the spectrum of $\mathcal{F}$ can be considered as a space of certain filters determined by…
A divisibility relation on ultrafilters on the set $\mathbb{N}$ of natural numbers is defined as follows: ${\cal F}\hspace{1mm}\widetilde{\mid}\hspace{1mm}{\cal G}$ if and only if every set in $\cal F$ upward closed for divisibility also…
In this paper we count the number of some particular quadruple persymmetric rank i matrices over F_2.
A rank is a notion in descriptive set theory that describes ranks such as the Cantor-Bendixson rank on the set of closed subsets of a Polish space, differentiability ranks on the set of differentiable functions in $C[0,1]$ such as the…
We establish lower bounds on the rank of matrices in which all but the diagonal entries lie in a multiplicative group of small rank. Applying these bounds we show that the distance sets of finite pointsets in $\mathbb{R}^d$ generate high…
We prove that for all $n$, simultaneously, we can choose prime filtrations of $R/I^n$ such that the set of primes appearing in these filtrations is finite.