Related papers: Clubs and their applications

Higher-rank graphs (or $k$-graphs) were introduced by Kumjian and Pask to provide combinatorial models for the higher-rank Cuntz-Krieger $C^*$-algebras of Robertson and Steger. Here we consider a family of finite 2-graphs whose path spaces…

In this paper we present several algorithms related with the computation of the homology of groups, from a geometric perspective (that is to say, carrying out the calculations by means of simplicial sets and using techniques of Algebraic…

A $k$-arc in PG($2,q$) is a set of $k$ points no three of which are collinear. A hyperfocused $k$-arc is a $k$-arc in which the $k \choose 2$ secants meet some external line in exactly $k-1$ points. Hyperfocused $k$-arcs can be viewed as…

We produce group structures on certain sets of topological vector bundles of fixed rank. In particular, we put a group structure on complex rank $2$ bundles on $\mathbb{C}P^3$ with fixed first Chern class. We show that this binary operation…

We show that the K_{2i}(Z[x]/(x^m),(x)) is finite of order (mi)!(i!)^{m-2} and that K_{2i+1}(Z[x]/(x^m),(x)) is free abelian of rank m-1. This is accomplished by showing that the equivariant homotopy groups of the topological Hochschild…

Rank-metric codes were studied by E. Gabidulin in 1985 after a brief introduction by Delsarte in 1978 as an equivalent of Reed-Solomon codes, but based on linearized polynomials. They have found applications in many areas, including linear…

The regular embeddings of complete bipartite graphs $K_{n,n}$ in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined. The method depends on earlier classifications in…

In this paper, we first determine the minimum possible size of an Fq-linear set of rank k in PG(1, q^n). We obtain this result by relating it to the number of directions determined by a linearized polynomial whose domain is restricted to a…

We consider $m \times s$ matrices (with $m\geq s$) in a real affine subspace of dimension $n$. The problem of finding elements of low rank in such spaces finds many applications in information and systems theory, where low rank is…

This paper systematically studies finite rank dimension groups, as well as finite dimensional ordered real vector spaces with Riesz interpolation. We provide an explicit description and classification of finite rank dimension groups, in the…

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 use tools of additive combinatorics for the study of subvarieties defined by {\it high rank} families of polynomials in high dimensional $\mathbb{F} _q$-vector spaces. In the first, analytic part of the paper we prove a number properties…

We study combinatorial principles known as stick and club. Several variants of these principles and cardinal invariants connected to them are also considered. We introduce a new kind of side-by-side product of partial orders which we call…

We consider various regular graphs defined on the set of elements of given rank of a finite polar space. It is likely that no two such graphs, of the same kind but defined for different ranks, can have the same degree. We shall prove this…

Real points of Schottky space ${\mathcal S}_{g}$ are in correspondence with extended Kleinian groups $K$ containing, as a normal subgroup, a Schottky group $\Gamma$ of rank $g$ such that $K/\Gamma \cong {\mathbb Z}_{2n}$ for a suitable…

While lattices in semi-simple Lie groups are studied very well, only little is known about discrete subgroups of infinite covolume. The main class of examples are Schottky groups. Here we investigate some new examples. We consider subgroups…

Recently the first named author defined a 2-parametric family of groups $G_n^k$. Those groups may be regarded as analogues of braid groups. Study of the connection between the groups $G_n^k$ and dynamical systems led to the discovery of the…

This article proves a conjecture by Zuber about the enumeration of fully packed loops (FPLs). The conjecture states that the number of FPLs whose link pattern consists of two noncrossing matchings which are separated by $m$ nested arches is…

Using the general theory of [10] ( hep-th 9412058 ), quantum Poincar\'e groups (without dilatations) are described and investigated. The description contains a set of numerical parameters which satisfy certain polynomial equations. For most…

Arrangement graphs were introduced for their connection to computational networks and have since generated considerable interest in the literature. In a pair of recent articles by Chen, Ghorbani and Wong, the eigenvalues for the adjacency…