Related papers: Zariski Density and Computing in Arithmetic Groups
This is a collection of examples showing how the GAP system can be used to compute information about the generating graphs of finite groups. It includes all examples that were needed for the computational results in the paper "Hamiltonian…
For $i=1,\ldots,k$, let $\mathbf{G}_i$ be a connected, simply connected, semisimple algebraic group over some local field $\kappa_i$ of characteristic zero. Let $G_i=\mathbf{G}_i(\kappa_i)$ be the $\kappa_i$-points of $\mathbf{G}_i$ and…
The graph G(p) associated with the p-groups of maximal class is a major tool in their classification. We introduce a subgraph of the graph G(p) called its frame. Its construction is based on the Lazard correspondence. We show that every…
We present an improved algorithm for the computation of Zariski chambers on algebraic surfaces. The new algorithm significantly outperforms the so far available method and allows therefore to treat surfaces of high Picard number, where huge…
We present a new approach to calculating the higher Frobenius-Schur indicators for the simple modules over the Drinfeld double of a finite group. In contrast to the formula by Kashina-Sommerh{\"a}user-Zhu that involves a sum over all group…
The generalized density matrix (GDM) method is used to calculate microscopically the parameters of the collective Hamiltonian. Higher order anharmonicities are obtained consistently with the lowest order results, the mean field…
The latent block model is used to simultaneously rank the rows and columns of a matrix to reveal a block structure. The algorithms used for estimation are often time consuming. However, recent work shows that the log-likelihood ratios are…
Given a polynomial ring $P$ over a field $K$, an element $g \in P$, and a $K$-subalgebra $S$ of $P$, we deal with the problem of saturating $S$ with respect to $g$, i.e. computing $Sat_g(S) = S[g, g^{-1}]\cap P$. In the general case we…
Density level sets can be estimated using plug-in methods, excess mass algorithms or a hybrid of the two previous methodologies. The plug-in algorithms are based on replacing the unknown density by some nonparametric estimator, usually the…
Commonly-used clustering algorithms usually find ellipsoidal, spherical or other regular-structured clusters, but are more challenged when the underlying groups lack formal structure or definition. Syncytial clustering is the name that we…
We show that finite quasisimple groups of Lie type in characteristic $p$ with an irreducible representation of prime degree $r$ over a finite field of characteristic $p$ have orders bounded above by a function of $r$, independent of $p$. We…
In a simple connected graph $G=(V,E)$, a subset of vertices $S \subseteq V$ is a dominating set if any vertex $v \in V\setminus S$ is adjacent to some vertex $x$ from this subset. A number of real-life problems can be modeled using this…
We use tools of mathematical logic to analyse the notion of a path on an complex algebraic variety, and are led to formulate a "rigidity" property of fundamental groups specific to algebraic varieties, as well as to define a bona fide…
Given discrete groups $\Gamma \subset \Delta$ we characterize $(\Gamma,\sigma)$-invariant spaces that are also invariant under $\Delta$. This will be done in terms of subspaces that we define using an appropriate Zak transform and a…
We study the algorithmic tractability of finding large independent sets in dense random hypergraphs. In the sparse regime, much of the natural algorithms can be formulated within either the local or the low-degree polynomial (LDP)…
The height gap theorem states that the finite subsets $F$ of matrices generating non-virtually solvable groups have normalized height $\widehat{h}(F)$ bounded below by a constant. It was first proved by Breuillard and another proof was…
We study the recently introduced problem of finding dense common subgraphs: Given a sequence of graphs that share the same vertex set, the goal is to find a subset of vertices $S$ that maximizes some aggregate measure of the density of the…
Estimation of Gaussian graphical models is important in natural science when modeling the statistical relationships between variables in the form of a graph. The sparsity and clustering structure of the concentration matrix is enforced to…
Algorithms working with linear algebraic groups often represent them via defining polynomial equations. One can always choose defining equations for an algebraic group to be of the degree at most the degree of the group as an algebraic…
The densest k-subgraph (DkS) problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant gap between known upper and lower bounds for DkS: the…