相关论文: Clubs and their applications
Linear sets over finite fields are central objects in finite geometry and coding theory, with deep connections to structures such as semifields, blocking sets, KM-arcs, and rank-metric codes. Among them, $i$-clubs, a class of linear sets…
The aim of this survey is to outline the state of the art in research on a class of linearized polynomials with coefficients over finite fields, known as scattered polynomials. These have been studied in several contexts, such as in [A.…
In this paper results are proved with applications to the orbits of $(n-1)$-dimensional subspaces disjoint from a regulus $\cR$ of $(n-1)$-subspaces in $\PG(2n-1,q)$, with respect to the subgroup of $\PGL(2n,q)$ fixing $\cR$. Such results…
We develop a theory of double clubs which extends Kelly's theory of clubs to the pseudo double categories of Pare and Grandis. We then show that the club for symmetric strict monoidal categories on Cat extends to a `double club' on the…
By exploiting the connection between scattered $\mathbb{F}_q$-subspaces of $\mathbb{F}_{q^m}^3$ and minimal non degenerate $3$-dimensional rank metric codes of $\mathbb{F}_{q^m}^{n}$, $n \geq m+2$, described in [2], we will exhibit a new…
Finding large "cliquish" subgraphs is a central topic in graph mining and community detection. A popular clique relaxation are 2-clubs: instead of asking for subgraphs of diameter one (these are cliques), one asks for subgraphs of diameter…
Given an undirected graph G = (V, E) and an integer k, the s-Club asks if Gcontains a vertex subset S of at least k vertices such that G[S] has diameter at most s. Recently, Vertex r-Triangle s-Club, and Edge r-Triangle s-Club that…
Cluster algebras are a recent topic of study and have been shown to be a useful tool to characterize structures in several knowledge fields. An important problem is to establish whether or not a given cluster algebra is of finite type.…
In this paper we consider two pointsets in $\mathrm{PG}(2,q^n)$ arising from a linear set $L$ of rank $n$ contained in a line of $\mathrm{PG}(2,q^n)$: the first one is a linear blocking set of R\'edei type, the second one extends the…
A family of fractal arrangements of circles is introduced for each imaginary quadratic field $K$. Collectively, these arrangements contain (up to an affine transformation) every set of circles in the extended complex plane with integral…
A survey of enumeration problems arising from the study of graphs formed when the edges of a polygon are marked with evenly spaced points and every pair of points is joined by a line. A few of these problems have been solved, a classical…
We present a classification of the so-called "additive symmetric 2-cocycles" of arbitrary degree and dimension over Z/p, along with a partial result and some conjectures for m-cocycles over Z/p, m > 2. This expands greatly on a result…
In a graph whose vertices are assigned integer ranks, a path is well-ranked if the endpoints have distinct ranks or some interior point has a higher rank than the endpoints. A ranking is an assignment of ranks such that all nontrivial paths…
Cameron, Manna and Mehatari investigated the question of which finite groups admit a power graph that is a cograph, also called power-cograph groups (Journal of Algebra 591 (2022)). They give a classification for nilpotent groups and…
We give a general notion of combinatory completeness with respect to a faithful cartesian club and use it systematically to obtain characterisations of a number of different kinds of applicative system. Each faithful cartesian club…
In this paper, we study KM-arcs of type t, i.e. point sets of size q + t in PG(2, q) such that every line contains 0, 2 or t of its points. We use field reduction to give a different point of view on the class of translation arcs. Starting…
We study the classification of $\mathbb{Z}$-DGAs with polynomial homology $\mathbb{F}_p[x]$ with $\lvert x \rvert >0$, motivated by computations in algebraic $K$-theory. This classification problem was left open in work of Dwyer, Greenlees,…
We consider various properties and manifestations of some sign-alternating univariate polynomials borne of right-triangular integer arrays related to certain generalizations of the Fibonacci sequence. Using a theory of the root geometry of…
Club guessing principles were introduced by Shelah as a weakening of Jensen's diamond. Most spectacularly, they were used to prove Shelah's ZFC bound on the power of the first singular cardinal. These principles have found many other…
We give a brief introduction to the geometric and combinatorial group theory of Artin groups. In particular we introduce the $K(\pi,1)$ conjecture for Artin groups and survey known results as of January 2024. These notes were written as…