Related papers: A conjecture on bipartite graphical regular repres…

Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…

We study the collection of group structures that can be realized as a group of rational points on an elliptic curve over a finite field (such groups are well known to be of rank at most two). We also study various subsets of this collection…

We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth…

Our main result is to show that every infinite, countable, residually finite group $G$ admits a Hausdorff group topology which is neither discrete nor precompact.

In this paper we are interested in the asymptotic enumeration of Cayley graphs. It has previously been shown that almost every Cayley digraph has the smallest possible automorphism group: that is, it is a digraphical regular representation…

We describe a very simple condition that is necessary for the universal rigidity of a complete bipartite framework $(K(n,m),p,q)$. This condition is also sufficient for universal rigidity under a variety of weak assumptions, such as general…

In this note, we introduce a family of bipartite graphs called path restricted ordered bipartite graphs and present it as an abstract generalization of some well known geometric graphs like unit distance graphs on convex point sets. In the…

We enumerate factorisations of the complete bipartite graph into spanning semiregular graphs in several cases, including when the degrees of all the factors except one or two are small. The resulting asymptotic behaviour is seen to…

This paper addresses one of the fundamental open questions in the realm of existential rules: the conjecture on the finite controllability of bounded derivation depth rule sets (bdd $\Rightarrow$ fc). We take a step toward a positive…

We perform the computations necessary to establish a multiplicity one statement for the irreducible representations of a finite spin group which in turn yields the classification of irreducible representations of finite spin groups. (The…

We prove that over an algebraically closed field there is a representation embedding from the category of classical Kronecker-modules without the simple injective into the category of finite-dimensional modules over any…

In this paper, we prove the FPP conjecture, giving a strong upper bound on the unitary dual of a real reductive group. Our proof is an application of the global generation properties of $\mathcal{D}$-modules on the flag variety and their…

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

We prove that a finite group is rational if and only if it has a set of permutation characters which separate conjugacy classes. It follows from this that a finite group is rational if and only if it has a representation as a permutation…

In this note we prove the following results: $\bullet$ If a finitely presented group $G$ admits a strongly aperiodic SFT, then $G$ has decidable word problem. More generally, for f.g. groups that are not recursively presented, there exists…

We formulate and analyze several finiteness conjectures for linear algebraic groups over higher-dimensional fields. In fact, we prove all of these conjectures for algebraic tori as well as in some other situations. This work relies in an…

We use a tensor unfolding technique to prove a new identifiability result for discrete bipartite graphical models, which have a bipartite graph between an observed and a latent layer. This model family includes popular models such as…

In this paper we characterize the congruence associated to the direct sum of all irreducible representations of a finite semigroup over an arbitrary field, generalizing results of Rhodes for the field of complex numbers. Applications are…

We prove that there exist bipartite Ramanujan graphs of every degree and every number of vertices. The proof is based on analyzing the expected characteristic polynomial of a union of random perfect matchings, and involves three…

Let R be a class of groups closed under taking semidirect products with finite kernel and fully residually R-groups. We prove that R contains all R-by-{finitely generated residually finite} groups. It follows that a semidirect product of a…