Related papers: A construction of free digroup

In this article, we introduce halo products as a natural generalisation of wreath products. They also encompass lampshuffler groups $\mathrm{FSym}(H) \rtimes H$ and lampcloner groups $\mathrm{FGL}(H) \rtimes H$, as well as many possible…

It is well-known that any isotopically connected diffeomorphism group $G$ of a manifold determines uniquely a singular foliation $\F_G$. A one-to-one correspondence between the class of singular foliations and a subclass of diffeomorphism…

Let $f: X \to Y$ be a regular covering of a surface $Y$ of finite type with nonempty boundary, with finitely-generated (possibly infinite) deck group $G$. We give necessary and sufficient conditions for an integral homology class on $X$ to…

In [Discrete differential calculus on simplicial complexes and constrained homology, Chin. Ann. Math. Ser. B 44(4), 615-640, 2023], the constrained (co)homology for simplicial complexes and independence hypergraphs is constructed via…

In this paper, we prove that: (1) Let $f:G\rightarrow H$ be a continuous $d$-open surjective homomorphism; if $G$ is an $\mathbb{R}$-factorizabile paratopological group, then so is $H$. Peng and Zhang's result \cite[Theorem 1.7]{PZ} is…

Let F_2 be the free group generated by x and y. In this article, we prove that the commutator of x^m and y^n is a product of two squares if and only if mn is even. We also show using topological methods that there are infinitely many…

We prove that the subgroup graph of a finite group $G$ is regular if and only if $G$ is cyclic with square-free order.

Let X be a complex nonsingular affine algebraic variety, K a holomorphically convex subset of X, and Y a homogeneous variety for some complex linear algebraic group. We prove that a holomorphic map f:K-->Y can be uniformly approximated on K…

We construct a pair (E ,F), where E is a holomorphic vector bundle over a compact Riemann surface and F a holomorphic subbundle of E, such that both F and E/F admit holomorphic connections, but E does not.

Using graph-theoretic techniques for f.g. subgroups of $F^{\mathbb{Z}[t]}$ we provide a criterion for a f.g. subgroup of a f.g. fully residually free group to be of finite index. Moreover, we show that this criterion can be checked…

We improve on earlier results on the closure under free products of the class of automaton semigroups. We consider partial automata and show that the free product of two self-similar semigroups (or automaton semigroups) is self-similar (an…

An involution on a semigroup S (or any algebra with an underlying associative binary operation) is a function f:S->S that satisfies f(xy)=f(y)f(x) and f(f(x))=x for all x,y in S. The set I(S) of all such involutions on S generates a…

For an arbitrary separated scheme $X$ of finite type over a finite field $\mathbb F_q$ and an integer $j=-1,-2,$ we prove under the assumption of resolution of singularities, that the two groups $H_{-1}(X,\mathbb Z(j))$ and…

Let $G=G_1\ast\dots\ast G_k\ast F$ be a countable group which splits as a free product, where all groups $G_i$ are freely indecomposable and not isomorphic to $\mathbb{Z}$, and $F$ is a finitely generated free group. If for all…

We propose an algebraic study of the simple graph isomorphism problem. We define a Hopf algebra from an explicit realization of its elements as formal power series. We show that these series can be evaluated on graphs and count occurrences…

The interpolated free group factors L(F_r), 1 < r <= \infty, are defined and proofs of their properties with respect to compression by projections and taking free products are proved. Hence it follows that all the free group factor are…

Every countable directed graph generates a Fock space Hilbert space and a family of partial isometries. These operators also arise from the left regular representations of free semigroupoids derived from directed graphs. We develop a…

We discuss a partial normalisation of a finite graph of finite groups $(\Gamma(-), X)$ which leaves invariant the fundamental group. In conjunction with an easy graph-theoretic result, this provides a flexible and rather useful tool in the…

An explicit algorithm is presented for testing whether two non-directed graphs are isomorphic or not. It is shown that for a graph of n vertices, the number of n independent operations needed for the test is polynomial in n. A proof that…

Given a complex analytic singularity $(X, 0)$, we show that if there exists an automorphism $F: (X, 0) \to (X, 0)$ that is contracting, then $(X, 0)$ is quasi-homogeneous.