Searcharxiv⌕ Search

arXiv subjects

Dzmitry Rumiantsau

Publications and source records attributed to Dzmitry Rumiantsau.

3 recordsLinked to original sources

Polynomiality of the faithful dimension of nilpotent groups over finite truncated valuation rings

The faithful dimension of a finite group $\mathrm G$ over $\mathbb C$, denoted by $m_\mathrm{faithful}(\mathrm G)$, is the smallest integer $n$ such that $\mathrm G$ can be embedded in $\mathrm{GL}_n(\mathbb C)$. Continuing our previous work (arXiv:1712.02019), we address the problem of determining the faithful dimension of a finite $p$-group of the form $\mathcal G_R:=\exp(\mathfrak g_R)$ associated to $\mathfrak g_R:=\mathfrak g \otimes_\mathbb Z R $ in the Lazard correspondence, where $\mathfrak g$ is a nilpotent $\mathbb Z$-Lie algebra and $R$ ranges over finite truncated valuation rings. Our first main result is that if $R$ is a finite field with $p^f$ elements and $p$ is sufficiently large, then $m_\mathrm{faithful}(\mathcal G_R)=fg(p^f)$ where $g(T)$ belongs to a finite list of polynomials $g_1,\ldots,g_k$, with non-negative integer coefficients. The list of polynomials is uniquely determined by the Lie algebra $\mathfrak g$. Furthermore, for $1\leq i\leq k$ the set of pairs $(p,f)$ for which $g=g_i$ is a finite union of Cartesian products $\mathcal P\times \mathcal F$, where $\mathcal P$ is a Frobenius set of prime numbers and $\mathcal F$ is a subset of $\mathbb N$ that belongs to the Boolean algebra generated by arithmetic progressions. Next we formulate a conjectural polynomiality property for $m_\mathrm{faithful}(\mathcal G_R)$ in the more general setting where $R$ is a finite truncated valuation ring, and prove special cases of this conjecture. In particular, we show that for a vast class of Lie algebras $\mathfrak g $ that are defined by partial orders, $m_\mathrm{faithful}(\mathcal G_R)$ is given by a single polynomial-type formula. Finally, we compute $m_\mathrm{faithful}(\mathcal G_R)$ precisely in the case where $\mathfrak g$ is the free metabelian nilpotent Lie algebra of class $c$ on $n$ generators and $R$ is a finite truncated valuation ring.

math.GR↗

Predicting attractors from spectral properties of stylized gene regulatory networks

How the architecture of gene regulatory networks ultimately shapes gene expression patterns is an open question, which has been approached from a multitude of angles. The dominant strategy has been to identify non-random features in these networks and then argue for the function of these features using mechanistic modelling. Here we establish the foundation of an alternative approach by studying the correlation of eigenvectors with synthetic gene expression data simulated with a basic and popular model of gene expression dynamics -- attractors of Boolean threshold dynamics in signed directed graphs. Eigenvectors of the graph Laplacian are known to explain collective dynamical states (stationary patterns) in Turing dynamics on graphs. In this study, we show that eigenvectors can also predict collective states (attractors) for a markedly different type of dynamics, Boolean threshold dynamics, and category of graphs, signed directed graphs. However, the overall predictive power depends on details of the network architecture, in a predictable fashion. Our results are a set of statistical observations, providing the first systematic step towards a further theoretical understanding of the role of eigenvectors in dynamics on graphs.

q-bio.MN↗

Finding polynomial roots by dynamical systems -- a case study

We investigate two well known dynamical systems that are designed to find roots of univariate polynomials by iteration: the methods known by Newton and by Ehrlich-Aberth. Both are known to have found all roots of high degree polynomials with good complexity. Our goal is to determine in which cases which of the two algorithms is more efficient. We come to the conclusion that Newton is faster when the polynomials are given by recursion so they can be evaluated in logarithmic time with respect to the degree, or when all the roots are all near the boundary of their convex hull. Conversely, Ehrlich-Aberth has the advantage when no fast evaluation of the polynomials is available, and when roots are in the interior of the convex hull of other roots.

math.NA↗