English
Related papers

Related papers: Orientable quadratic equations in wreath products

200 papers

The Donald--Flanigan problem for a finite group H and coefficient ring k asks for a deformation of the group algebra kH to a separable algebra. It is solved here for dihedral groups and for the classical Weyl groups (whose rational group…

Quantum Algebra · Mathematics 2007-05-23 Murray Gerstenhaber , Anthony Giaquinto , Mary E. Schaps

We study boundary value problems for degenerate elliptic equations and systems with square integrable boundary data. We can allow for degeneracies in the form of an $A_{2}$ weight. We obtain representations and boundary traces for solutions…

Classical Analysis and ODEs · Mathematics 2014-04-16 Pascal Auscher , Andreas Rosén , David Rule

Let $A$ be an abelian variety and $G$ a finite group of automorphisms of $A$ fixing the origin such that $A/G$ is smooth. The quotient $A/G$ can be seen as a fibration over an abelian variety whose fibers are isomorphic to a product of…

Algebraic Geometry · Mathematics 2024-07-02 Gary Martinez-Nunez

We give a classification of smooth complex manifolds with a finite abelian group action, such that the quotient is isomorphic to a projective space. The case where the manifold is a Calabi-Yau is studied in detail.

Algebraic Geometry · Mathematics 2007-05-23 A. Muhammed Uludag

There have been several algorithms designed to optimise matrix multiplication. From schoolbook method with complexity $O(n^3)$ to advanced tensor-based tools with time complexity $O(n^{2.3728639})$ (lowest possible bound achieved), a lot of…

Data Structures and Algorithms · Computer Science 2019-01-30 Shrohan Mohapatra

The Equation Problem in finitely presented groups asks if there exists an algorithm which determines in finite amount of time whether any given equation system has a solution or not. We show that the Equation Problem in central extensions…

Group Theory · Mathematics 2013-07-24 Hao Liang

For $g\geq1$ denote by $F_{2g}=\langle x_1, y_1,\dots,x_g,y_g\rangle$ the free group on $2g$ generators and by $B_g=[x_1,y_1]\dots[x_g,y_g]$. For $l,c\geq 1$ and elements $w_1,\dots,w_l\in F_{2g}$ we study orientable quadratic equations of…

Group Theory · Mathematics 2018-09-05 D. L. Gonçalves , T. Nasybullov

We study the automorphisms of a graph product of finitely-generated abelian groups W. More precisely, we study a natural subgroup Aut* W of Aut W, with Aut* W = Aut W whenever vertex groups are finite and in a number of other cases. We…

Group Theory · Mathematics 2019-02-07 Mauricio Gutierrez , Adam Piggott , Kim Ruane

A notion of \emph{graph-wreath product} is introduced. We obtain sufficient conditions for these products to satisfy the topologically inspired finiteness condition type $\operatorname{F}_n$. Under various additional assumptions we show…

Group Theory · Mathematics 2015-08-04 Peter H. Kropholler , Armando Martino

We consider the problem of separability: decide whether a Hermitian operator on a finite dimensional Hilbert tensor product is separable or entangled. We show that the tensor convolution defined for certain mappings on an almost arbitrary…

Mathematical Physics · Physics 2011-06-08 Gabriel Pietrzkowski

To answer a question about the distribution of products of elliptic curves in isogeny classes of abelian surfaces defined over finite fields, we compute specific orbital integrals in the group $\mathrm{GSp}_4$. More precisely, we compute…

Number Theory · Mathematics 2025-05-27 Thomas Rüd

Evidences have suggested that counting representations are sometimes tractable even when the corresponding classification problem is almost impossible, or "wild" in a precise sense. Such counting problems are directly related to matrix…

Representation Theory · Mathematics 2024-05-01 Yifeng Huang

We give a classification and complete algebraic description of groups allowing only finitely many (left multiplication invariant) circular orders. In particular, they are all solvable groups with a specific semi-direct product…

Group Theory · Mathematics 2017-04-21 Adam Clay , Kathryn Mann , Cristóbal Rivas

Inspired by the definition of generalized wreath product of permutation groups, we define the generalized wreath product of graphs, containing the classical Cartesian and wreath product of graphs as particular cases. We prove that the…

Combinatorics · Mathematics 2016-02-16 Alfredo Donno

We investigate numerical solutions of high order curl problems with various formulations and finite elements. We show that several classical conforming finite elements lead to spurious solutions, while mixed formulations with finite…

Numerical Analysis · Mathematics 2021-11-12 Kaibo Hu , Qian Zhang , Jiayu Han , Lixiu Wang , Zhimin Zhang

Motivated by the recent rapid development of complexity theory applied to quantum mechanical processes we present the complete derivation of Nielsen's complexity of unitaries belonging to the representations of oscillator group. Our…

Quantum Physics · Physics 2025-12-22 K. Andrzejewski , K. Bolonek-Lasoń , P. Kosiński

In analogy to the disjoint cycle decomposition in permutation groups, Ore and Specht define a decomposition of elements of the full monomial group and exploit this to describe conjugacy classes and centralisers of elements in the full…

Group Theory · Mathematics 2021-11-29 Dominik Bernhardt , Alice C. Niemeyer , Friedrich Rober , Lucas Wollenhaupt

We characterize which permutational wreath products W^(X)\rtimes G are finitely presented. This occurs if and only if G and W are finitely presented, G acts on X with finitely generated stabilizers, and with finitely many orbits on the…

Group Theory · Mathematics 2010-08-04 Yves de Cornulier

We consider the computational problem of determining the unit group of a finite ring, by which we mean the computation of a finite presentation together with an algorithm to express units as words in the generators. We show that the problem…

Number Theory · Mathematics 2026-01-29 Tommy Hofmann

Hard instances of natural computational problems are often elusive. In this note we present an example of a natural decision problem, the word problem for a certain finitely presented group, whose hard instances are easy to find. More…

Computational Complexity · Computer Science 2016-02-09 Robert H Gilman
‹ Prev 1 4 5 6 7 8 10 Next ›