English
Related papers

Related papers: A rank function for Fra\"{\i}ss\'{e} classes and t…

200 papers

A conjecture by the second author, proven by Bonnaf\'e-Rouquier, says that the multiplicity matrix for baby Verma modules over the restricted rational Cherednik algebra has rank one over $\mathbb{Q}$ when restricted to each block of the…

Representation Theory · Mathematics 2023-03-31 Gwyn Bellamy , Ulrich Thiel

We introduce concepts of intermediate rank for countable groups that "interpolate" between consecutive values of the classical (integer-valued) rank. Various classes of groups are proved to have intermediate rank behaviors. We are…

Metric Geometry · Mathematics 2012-11-13 Sylvain Barré , Mikael Pichot

We investigate the question of when free structures of infinite rank (in a variety) possess model-theoretic properties like categoricity in higher power, saturation, or universality. Concentrating on left $R$-modules we show, among other…

Rings and Algebras · Mathematics 2025-01-08 Anand Pillay , Philipp Rothmaler

The Beta Rank Function (BRF) $x(u) =A(1-u)^b/u^a$, where $u$ is the normalized and continuous rank of an observation $x$, has wide applications in fitting real-world data from social science to biological phenomena. The underlying…

Methodology · Statistics 2019-10-15 Oscar Fontanelli , Pedro Miramontes , Ricardo Mansilla , Germinal Cocho , Wentian Li

A rack of order $n$ is a binary operation $\rack$ on a set $X$ of cardinality $n$, such that right multiplication is an automorphism. More precisely, $(X,\rack)$ is a rack provided that the map $x\mapsto x\rack y$ is a bijection for all…

Geometric Topology · Mathematics 2012-03-30 Simon R. Blackburn

We introduce and study the class of groups graded by root systems. We prove that if {\Phi} is an irreducible classical root system of rank at least 2 and G is a group graded by {\Phi}, then under certain natural conditions on the grading,…

Group Theory · Mathematics 2014-03-12 Mikhail Ershov , Andrei Jaikin-Zapirain , Martin Kassabov

In this paper we initiate the study of racks from the combined perspective of combinatorics and finite group theory. A rack R is a set with a self-distributive binary operation. We study the combinatorics of the partially ordered set {\cal…

Combinatorics · Mathematics 2015-12-07 Istvan Heckenberger , John Shareshian , Volkmar Welker

Using the natural action of $S_\infty$ we show that a countable hereditary class $\mathcal C$ of finitely generated structures has the joint embedding property (JEP) and the weak amalgamation property (WAP) if and only if there is a…

Logic · Mathematics 2022-01-25 Zakhar Kabluchko , Katrin Tent

As a generalization of the Dedekind zeta function, Weng defined the high rank zeta functions and proved that they have standard properties of zeta functions, namely, meromorphic continuation, functional equation, and having only two simple…

Number Theory · Mathematics 2008-02-04 Masatoshi Suzuki

If $g\in G$ is a non-trivial element in a residually finite group, then there exists by definition a finite group $Q$ and a homomorphism $\varphi: G \to Q$ such that $\varphi(g) \neq e$. The residual finiteness growth $\text{RF}_G$ of a…

Group Theory · Mathematics 2025-10-27 Jonas Deré , Joren Matthys

Let $\cK$ and $\cH$ be finite dimensional Hilbert spaces and let $\fP$ denote the cone of all positive linear maps acting from $\fB(\cK)$ into $\fB(\cH)$. We show that each map of the form $\phi(X)=AXA^*$ or $\phi(X)=AX^TA^*$ is an exposed…

Functional Analysis · Mathematics 2014-06-24 Marcin Marciniak

We present a novel approach to the representation theory of finite dimensional algebras motivated by the emerging theory of graph limits. We introduce the rank spectrum of a finite dimensional algebra $R$ over a finite field. The elements…

Representation Theory · Mathematics 2016-03-15 Gabor Elek

Motivated by results on generic-case complexity in group theory, we apply the ideas of effective Baire category and effective measure theory to study complexity classes of functions which are "fractionally computable" by a partial…

Group Theory · Mathematics 2007-06-30 Ilya Kapovich , Paul Schupp

We calculate the possible Scott ranks of countable models of Peano arithmetic. We show that no non-standard model can have Scott rank less than $\omega$ and that non-standard models of true arithmetic must have Scott rank greater than…

Logic · Mathematics 2022-08-04 Antonio Montalbán , Dino Rossegger

Let $k$ be a field of characteristic zero and let $K=k(t)$ be the rational function field over $k$. In this paper we combine a formula of Ulmer for ranks of certain Jacobians over $K$ with strong upper bounds on endomorphisms of Jacobians…

Number Theory · Mathematics 2010-07-09 Douglas Ulmer , Yuri G. Zarhin

We present a structural approach of some results about jumps in the behavior of the profile (alias generating function) of hereditary classes of finite structures. We start with the following notion due to N.Thi\'ery and the second author.…

Combinatorics · Mathematics 2014-09-05 Djamila Oudrar , Maurice Pouzet

Let $f\in \mathbb{R}[x_1,\ldots, x_k]$, for $k\ge 2$. For any finite sets $A_1,\ldots, A_k\subset \mathbb{R}$, consider the set $$ f(A_1,\ldots, A_k):=\{f(a_1,\ldots, a_k)\mid (a_1,\cdots,a_k)\in A_1\times\cdots \times A_k\}, $$ that is,…

Combinatorics · Mathematics 2025-11-07 Yaara Jahn , Orit E. Raz

An infinite structure has the finite length property (over a given field) if, for each of its finite powers, chains of equivariant subspaces in the corresponding free vector space are bounded in length. Prior work showed that the countable…

Combinatorics · Mathematics 2026-05-22 Jingjie Yang , Mikołaj Bojańczyk , Bartek Klin

For any given Cuntz semigroup, we introduce a function associated to it, called the ``Rank Ratio Function". This function ensures global control over the oscillation of the rank of any pair of elements in the Cuntz semigroup and, also,…

Operator Algebras · Mathematics 2025-06-13 M. Ali Asadi-Vasfi

Prolog's ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. {\em ranking} and {\em unranking} functions. Starting from a…

Logic in Computer Science · Computer Science 2008-08-06 Paul Tarau