Related papers: $2\times 2$ monotone grid classes are finitely bas…
We prove that there are only finitely many conjugacy classes of arithmetic maximal hyperbolic reflection groups.
The problem of efficiently characterizing degree sequences of simple hypergraphs is a fundamental long-standing open problem in Graph Theory. Several results are known for restricted versions of this problem. This paper adds to the list of…
Silting modules are abundant. Indeed, they parametrise the definable torsion classes over a noetherian ring, and the hereditary torsion pairs of finite type over a commutative ring. Also the universal localisations of a hereditary ring, or…
We prove a finiteness result for the systolic area of groups, answering a question of M. Gromov. Namely, we show that there are only finitely many possible unfree factors of fundamental groups of~2-complexes whose systolic area is uniformly…
In this paper, we study the stability result of a well-known theorem of Bondy. We prove that for any 2-connected non-hamiltonian graph, if every vertex except for at most one vertex has degree at least $k$, then it contains a cycle of…
The determination of the density functions for products of random elements from specified classes of matrices is a basic problem in random matrix theory and is also of interest in theoretical physics. For connected simple Lie groups of…
The existence of an infinite simple boundedly generated 2-generated group and the existence of a boundedly simple 2-generated group containing a free non-cyclic subgroup are proved.
In this paper we define Ordered Generating System for finite non-abelian groups, which is a generalization of the basis theorem for finite abelian groups. We prove the following: If each composition factor of a group G has Ordered…
S. Bigelow proved that the braid groups are linear. That is, there is a faithful representation of the braid group into the general linear group of some field. Using this, we deduce from previously known results that the mapping class group…
In these notes we focus on commutative finite-dimensional normed algebras and some basic examples.
The aim of this note is to describe the structure of finite meadows. We will show that the class of finite meadows is the closure of the class of finite fields under finite products. As a corollary, we obtain a unique representation of…
The $2$-to-$1$ mapping over finite fields has a wide range of applications, including combinatorial mathematics and coding theory. Thus, constructions of $2$-to-$1$ mappings have attracted considerable attention recently. Based on…
We enumerate the pattern class Av(2143,4231) and completely describe its permutations. The main tools are simple permutations and monotone grid classes.
We investigate the 2-domination number for grid graphs, that is the size of a smallest set $D$ of vertices of the grid such that each vertex of the grid belongs to $D$ or has at least two neighbours in $D$. We give a closed formula giving…
We prove the existence of nonperiodic, properly embedded minimal surfaces in $\mathbb{R}^2\times\mathbb{S}^1$ with genus zero, infinitely many ends and one limit end (in particular, they have infinite total curvature).
For a commutative ring R we investigate the property that the sets of minimal primes of finitely generated ideals of R is always finite. We prove this property passes to polynomial ring extensions (in an arbitrary number of variables) over…
We classify the module categories over the double (possibly twisted) of a finite group.
A B-group is a group such that all its minimal generating sets (with respect to inclusion) have the same size. We prove that the class of finite B-groups is closed under taking quotients and that every finite B-group is solvable. Via a…
In this paper, we present an algorithm that enumerates a certain class of signed permutations, referred to as grid signed permutation classes. In the case of permutations, the corresponding grid classes are of interest because they are…
The number of finite additive 2-bases is known to grow exponentially. While this fact has been established by Marzuola and Miller (2010) using complex analytic techniques embedded in the study of numerical sets, we provide a direct, short…