相关论文: The simultaneous conjugacy problem in groups of pi…
A natural generalization of the recognition problem for a geometric graph class is the problem of extending a representation of a subgraph to a representation of the whole graph. A related problem is to find representations for multiple…
We show that the equation associated with a group word $w \in G \ast {\mathbf F}_2$ can be solved over a hyperlinear group $G$ if its content - that is its augmentation in ${\mathbf F}_2$ - does not lie in the second term of the lower…
We propose self-similar contracting groups as a platform for cryptographic schemes based on simultaneous conjugacy search problem (SCSP). The class of these groups contains extraordinary examples like Grigorchuk group, which is known to be…
Many isomorphism problems for tensors, groups, algebras, and polynomials were recently shown to be equivalent to one another under polynomial-time reductions, prompting the introduction of the complexity class TI (Grochow & Qiao, ITCS '21;…
In 1951, Higman constructed a remarkable group $$H=\left\langle a,b,c,d \, \left| \, b^a = b^2, c^b = c^2, d^c = d^2, a^d = a^2 \right. \right\rangle$$ and used it to produce the first examples of infinite simple groups. By studying fixed…
We show that all groups in a very large class of Coxeter groups are locally quasiconvex and have uniform membership problem solvable in quadratic time. If a group in the class satisfies a further hypothesis it is subgroup separable and…
This paper proposes a Newton-type method to solve numerically the eigenproblem of several diagonalizable matrices, which pairwise commute. A classical result states that these matrices are simultaneously diagonalizable. From a suitable…
We consider a family of linear singularly perturbed Cauchy problems which combines partial differential operators and linear fractional transforms. We construct a collection of holomorphic solutions on a full covering by sectors of a…
We survey two decades of work on the (sequential) topological complexity of configuration spaces of graphs (ordered and unordered), aiming to give an account that is unifying, elementary, and self-contained. We discuss the traditional…
Bir\'{o}, Hujter, and Tuza introduced the concept of $H$-graphs (1992), intersection graphs of connected subgraphs of a subdivision of a graph $H$. They naturally generalize many important classes of graphs, e.g., interval graphs and…
We obtain sufficient conditions ensuring the existence of a uniformly continuous and H\"older continuous homeomorphism between the solutions of a linear system of differential equations with piecewise constant argument of generalized type…
Simultaneous Embedding with Fixed Edges (SEFE) is a problem where given $k$ planar graphs we ask whether they can be simultaneously embedded so that the embedding of each graph is planar and common edges are drawn the same. Problems of SEFE…
In this note we investigate the conjugacy problem in lamplighter groups with particular interest in the role of their geometry. In particular we show that the conjugacy length function is linear.
This study aims to discuss the existence and uniqueness of solution of fuzzy Volterra integral equation with piecewise continuous kernel. Such problems appears in many balance problems for hereditary dynamic systems, e.g. in electric load…
The mapping class group of a closed surface of genus $g$ is an extension of the Torelli group by the symplectic group. This leads to two natural problems: (a) compute (stably) the symplectic decomposition of the lower central series of the…
We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by using a result of O. Maslakova that one can algorithmically find generating sets for the fixed subgroups of free group automorphisms, and one…
Joint network topology inference represents a canonical problem of jointly learning multiple graph Laplacian matrices from heterogeneous graph signals. In such a problem, a widely employed assumption is that of a simple common component…
In a previous work, the third named author found a combinatorics of line arrangements whose realizations live in the cyclotomic group of the fifth roots of unity and such that their non-complex-conjugate embedding are not topologically…
We reformulate Fourier-space crystallography in the language of cohomology of groups. Once the problem is understood as a classification of linear functions on the lattice, restricted by a particular group relation, and identified by gauge…
In a previous paper {GN2} an effective solution of the lattice point counting problem in general domains in semisimple S-algebraic groups and affine symmetric varieties was established. The method relies on the mean ergodic theorem for the…