Related papers: One Powell generator is redundant

We define the triple Riordan group, whose elements consist of $4$-tuples of power series $(g, f_1, f_2, f_3)$ with $g\in \mathbf{R}[[x^3]]$, and $f_1, f_2, f_3 \in x\mathbf{R}[[x^3]]$, for an appropriate ring $\mathbf{R}$. The construction…

Deciding whether an ideal of a number field is principal and finding a generator is a fundamental problem with many applications in computational number theory. For indefinite quaternion algebras, the decision problem reduces to that in the…

Let G be any abelian group and {a_sG_s}_{s=1}^k be a finite system of cosets of subgroups G_1,...,G_k. We show that if {a_sG_s}_{s=1}^k covers all the elements of G at least m times with the coset a_tG_t irredundant then [G:G_t]\le 2^{k-m}…

In this paper we revisit the notion of grouped dispersal that have been introduced by Soubeyrand and co-authors \cite{soubeyrand2011patchy} to model the simultaneous (and hence dependent) dispersal of several propagules from a single source…

We have obtained the perturbative expressions up to sixth order for the energy of the bound state in a one dimensional, arbitrarily weak, short range finite well, applying a method originally developed by Gat and Rosenstein Ref. [3]. The…

For a positively presented group G, we provide a criterion for two tuples of positive group generators of G to be Hurwitz equivalent or Hurwitz-conjugation equivalent. We also present an algorithmic approach to solve the Hurwitz equivalence…

We give an algorithmic proof of the theorem that a closed orientable irreducible and atoroidal 3-manifold has only finitely many Heegaard splittings in each genus, up to isotopy. The proof gives an algorithm to determine the Heegaard genus…

We sketch a simplification of proofs of old results on the arithmeticity of the group generated by opposing integral unipotent radicals in higher rank arithmetic groups

Famously, every finite simple group $G$ can be generated by a pair of elements. Moreover, Liebeck and Shalev (1995) proved that the probability that a pair of elements generate $G$ tends to $1$ as $|G| \to \infty$. More generally, work of…

When considering the unit group of $\mathcal{O}_F G$ ($\mathcal{O}_F$ the ring of integers of an abelian number field $F$ and a finite group $G$) certain components in the Wedderburn decomposition of $FG$ cause problems for known generic…

There is a long-standing conjecture attributed to I Schur that if $G$ is a finite group with Schur multiplier $M(G)$ then the exponent of $M(G)$ divides the exponent of $G$. It is easy to see that this conjecture holds for exponent 2 and…

Following an idea of Rowland we give a conjectural way to generate increasing sequences of primes using algorithms involving the gcd. These algorithms seem not so useless for searching primes since it appears we found sometime primes much…

We consider the operation of division in Pimenov algebras. We obtain necessary and sufficient conditions for prime elements in Pimenov algebras with a number of generators less than five. We adduce examples of the factorization of elements…

Let G be a finite group. Denote by \psi(G) the sum \psi(G)=\sum_{x\in G}|x| where |x| denotes the order of the element x, and by o(G) the quotient o(G)=\frac{\psi(G)}{|G|}. Confirming a conjecture posed by E.I. Khukhro, A. Moreto and M.…

A smallest generating set of a semigroup is a generating set of the smallest cardinality. Similarly, an irredundant generating set $X$ is a generating set such that no proper subset of $X$ is also a generating set. A semigroup $S$ is…

We consider a nodal curve $C$ in the complex projective plane whose irreducible components $C_i$ are smooth. A minimal set of generators $G$ for the first and second syzygy modules of the Jacobian ideal of $C$ are described, using recent…

In the representation theory of split reductive algebraic groups, it is well known that every Weyl module with minuscule highest weight is irreducible over every field. Also, the adjoint representation of $E_8$ is also irreducible over…

Let G be a unipotent algebraic subgroup of some GL_m(C) defined over Q. We describe an algorithm for finding a finite set of generators of the subgroup G(Z) = G \cap GL_m(Z). This is based on a new proof of the result (in more general form…

Developed by Buchberger for commutative polynomial rings, Groebner Bases are frequently applied to solve algorithmic problems, such as the congruence problem for ideals. Until now, these ideas have been transmitted to different in part…

A general technique is presented for constructing a quantum theory of a finite number of interacting particles satisfying Poincar\'e invariance, cluster separability, and the spectral condition. Irreducible representations and…