English
Related papers

Related papers: The Identity Problem in $\mathbb{Z} \wr \mathbb{Z}…

200 papers

The structure of transformation semigroups on a finite set is analyzed by introducing a hierarchy of functions mapping subsets to subsets. The resulting hierarchy of semigroups has a corresponding hierarchy of minimal ideals, or kernels.…

Probability · Mathematics 2016-12-02 G. Budzban , Ph. Feinsilver

A hyperidentity $E$ can be viewed as a statement in second order logic. When combined with a similarity type $\tau$, it can also be considered as a set of first order statements. Based on examples from "A small basis for…

Logic · Mathematics 2014-08-13 Gerhard R. Paseman

We give a positive answer, in the measurable-group-theory context, to von Neumann's problem of knowing whether a non-amenable countable discrete group contains a non-cyclic free subgroup. We also get an embedding result of the free-group…

Group Theory · Mathematics 2009-03-11 Damien Gaboriau , Russell Lyons

It is well-known that the graph isomorphism problem can be posed as an equivalent problem of determining whether an auxiliary graph structure contains a clique of specific order. However, the algorithms that have been developed so far for…

Data Structures and Algorithms · Computer Science 2019-10-29 Giannis Nikolentzos , Michalis Vazirgiannis

In this paper we formulate some conjectures in sub-Riemannian geometry concerning a characterisation of the Koranyi-Kaplan ball in a group of Heisenberg type through the existence of a solution to suitably overdetermined problems. We prove…

Analysis of PDEs · Mathematics 2023-09-25 Nicola Garofalo , Dimiter Vassilev

The concept of a C-approximable group, for a class of finite groups C, is a common generalization of the concepts of a sofic, weakly sofic, and linear sofic group. Glebsky raised the question whether all groups are approximable by finite…

Group Theory · Mathematics 2017-05-25 Nikolay Nikolov , Jakob Schneider , Andreas Thom

A countable structure is indivisible if for every coloring with finite range there is a monochromatic isomorphic subcopy of the structure. Each indivisible structure naturally corresponds to an indivisibility problem which outputs such a…

Logic · Mathematics 2025-06-18 Kenneth Gill

In algebraic geometry over a variety of universal algebras $\Theta $, the group $Aut(\Theta ^{0})$ of automorphisms of the category $\Theta ^{0}$ of finitely generated free algebras of $\Theta $ is of great importance. In this paper,…

Rings and Algebras · Mathematics 2007-05-23 Yefim Katsov , Ruvim Lipyanski , Boris Plotkin

In the paper we study the semigroup $\mathscr{C}_{\mathbb{Z}}$ which is a generalization of the bicyclic semigroup. We describe main algebraic properties of the semigroup $\mathscr{C}_{\mathbb{Z}}$ and prove that every non-trivial…

Group Theory · Mathematics 2012-01-04 Iryna Fihel , Oleg Gutik

The problem behind this paper is the proper measurement of the degree of quality/acceptability/distance to arbitrage of trades. We are narrowing the class of coherent acceptability indices introduced by Cherny and Madan (2007) by imposing…

Risk Management · Quantitative Finance 2011-04-05 Alexander Cherny , Damir Filipović

The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank free group. We give the first fully polynomial algorithm to…

Group Theory · Mathematics 2008-01-06 Abdó Roig , Enric Ventura , Pascal Weil

Given a morphism $\varphi : G \to A \wr B$ from a finitely presented group $G$ to a wreath product $A \wr B$, we show that, if the image of $\varphi$ is a sufficiently large subgroup, then $\mathrm{ker}(\varphi)$ contains a non-abelian free…

Group Theory · Mathematics 2026-02-11 Anthony Genevois , Romain Tessera

A quantum computer can efficiently find the order of an element in a group, factors of composite integers, discrete logarithms, stabilisers in Abelian groups, and `hidden' or `unknown' subgroups of Abelian groups. It is already known how to…

Quantum Physics · Physics 2007-05-23 Michele Mosca , Artur Ekert

For a finitely generated group $G$, the \emph{Diophantine problem} over $G$ is the algorithmic problem of deciding whether a given equation $W(z_1,z_2,\ldots,z_k) = 1$ (perhaps restricted to a fixed subclass of equations) has a solution in…

Group Theory · Mathematics 2023-06-06 Richard Mandel , Alexander Ushakov

We prove that the problems of representing a finite ordered complemented semigroup or finite lattice-ordered semigroup as an algebra of binary relations over a finite set are undecidable. In the case that complementation is taken with…

Logic · Mathematics 2015-03-17 Murray Neuzerling

The membership problem for an algebraic structure asks whether a given element is contained in some substructure, which is usually given by generators. In this work we study the membership problem, as well as the conjugacy problem, for…

Computational Complexity · Computer Science 2025-08-07 Lukas Fleischer , Florian Stober , Alexander Thumm , Armin Weiß

In a recent paper by L. Fel two new identities for the degree of syzygies are given. We present an algebraic proof of them, using only basic homological algebra tools. We also extend these results.

Commutative Algebra · Mathematics 2012-06-12 Ivan Martino , Neeraj Kumar

Given a unitary representation of a finite group on a finite-dimensional Hilbert space, we show how to find a state whose translates under the group are distinguishable with the highest probability. We apply this to several quantum oracle…

Quantum Physics · Physics 2015-03-19 Orest Bucicovschi , Daniel Copeland , David A. Meyer , James Pommersheim

A groupoid identity is said to be linear of length $2k$ if the same $k$ variables appear on both sides of the identity exactly once. We classify and count all varieties of groupoids defined by a single linear identity. For $k=3$, there are…

Group Theory · Mathematics 2007-05-23 J. D. Phillips , Petr Vojtěchovský

Irreducible decompositions of monomial ideals in polynomial rings over a field are well-understood. In this paper, we investigate decompositions in the set of monomial ideals in the semigroup ring A[\mathbb{R}_{\geq 0}^d] where A is an…

Commutative Algebra · Mathematics 2012-05-21 Daniel Ingebretson , Sean Sather-Wagstaff