Related papers: New light on solving the sextic by iteration: An a…

We study dynamical systems arising from word maps on simple groups. We develop a geometric method based on the classical trace map for investigating periodic points of such systems. These results lead to a new approach to the search of…

We study Coxeter diagrams of some unitary reflection groups. Using solely the combinatorics of diagrams, we give a new proof of the classification of root lattices defined over $\cE = \ZZ[e^{2 \pi i/3}]$: there are only four such lattices,…

In this paper, an exact bitwise MAP (Maximum A Posteriori) estimation algorithm for group testing problems is presented. We assume a simplest non-adaptive group testing scenario including N-objects with binary status and M-disjunctive…

We study skew-product dynamics for a large class of finitely-generated semi--hyperbolic semigroups of rational maps acting on the Riemann sphere, which generalizes both the theory of iteration of a single rational map of a single complex…

We consider the dynamics of rational semigroups (semigroups of rational maps) on the Riemann sphere. We provide proof that a random backward iteration algorithm to draw the pictures of the Julia sets, previously proven to work in the…

Let V $\subset$ C n be an equidimensional algebraic set and g be an n-variate polynomial with rational coefficients. Computing the critical points of the map that evaluates g at the points of V is a cornerstone of several algorithms in real…

We consider the complex reflection group \( \mathcal{G} \), identified as No. 8 in the Shephard-Todd classification. In this paper, we present computations of the vector-valued invariants associated with various representations of \(…

Symmetries and equivariance are fundamental to the generalization of neural networks on domains such as images, graphs, and point clouds. Existing work has primarily focused on a small number of groups, such as the translation, rotation,…

Let $\mathcal A$ be a hyperplane arrangement in a vector space $V$ and $G \leq GL(V)$ a group fixing $\mathcal A$. In case when $G$ is a complex reflection group and $\mathcal A=\mathcal A(G)$ is its reflection arrangement in $V$, Douglass,…

For an unknown finite group $G$ of automorphisms of a finite-dimensional Hilbert space, we find sharp bounds on the number of generic $G$-orbits needed to recover $G$ up to group isomorphism, as well as the number needed to recover $G$ as a…

It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…

The graph isomorphism (GI) problem, which asks whether two graphs are structurally identical, occupies a unique position in computational complexity -- it is neither known to be solvable in polynomial time, nor proven to be NP-complete. We…

We introduce a new infinite class of superintegrable quantum systems in the plane. Their Hamiltonians involve reflection operators. The associated Schr\"odinger equations admit separation of variables in polar coordinates and are exactly…

We study the dynamics of a family of replicator maps, depending on two parameters. Such studies are motivated by the analysis of the dynamics of evolutionary games under selections. From the dynamics viewpoint, we prove the existence of…

Let G be a finite group acting on a symplectic complex vector space V. Assume that the quotient V/G has a holomorphic symplectic resolution. We prove that G is generated by "symplectic reflectionsd"', i.e. symplectomorphisms with fixed…

An integral hyperbolic lattice is called reflective if its automorphism group is generated by reflections, up to finite index. Since 1981, it is known that their number is essentially finite. We show that K3 surfaces over C with reflective…

The set-theoretical reflection equation and its solutions, the reflection maps, recently introduced by two of the authors, is presented in general and then applied in the context of quadrirational Yang-Baxter maps. We provide a method for…

A graph G is a (Euclidean) unit disk graph if it is the intersection graph of unit disks in the Euclidean plane $\mathbb{R}^2$. Recognizing them is known to be $\exists\mathbb{R}$-complete, i.e., as hard as solving a system of polynomial…

Let $W$ be a rank $n$ irreducible finite reflection group and let $p_1(x),\ldots,p_n(x)$, $x\in\mathbb{R}^n$, be a basis of algebraically independent $W$-invariant real homogeneous polynomials. The orbit map $\overline…

We present a method of constructing discrete integrable systems with crystallographic reflection group (Weyl) symmetries, thus clarifying the relationship between different discrete integrable systems in terms of their symmetry groups.…