English
Related papers

Related papers: Post's correspondence problem for hyperbolic and v…

200 papers

We give an algorithm that decides whether a single equation in a group that is virtually a class $2$ nilpotent group with a virtually cyclic commutator subgroup, such as the Heisenberg group, admits a solution. This generalises the work of…

Group Theory · Mathematics 2023-06-22 Alex Levine

Let $G$ be a complex classical group, and let $V$ be its defining representation (possibly plus a copy of the dual). A foundational problem in classical invariant theory is to write down generators and relations for the ring of…

Representation Theory · Mathematics 2024-11-20 Rebecca Bourn , William Q. Erickson , Jeb F. Willenbring

The Modular Isomorphism Problem asks, if an isomorphism between modular group algebras of finite $p$-groups over a field $F$ implies an isomorphism of the group bases. We explore the differences of knowledge on the problem when $F$ is…

Rings and Algebras · Mathematics 2026-02-26 Leo Margolis , Taro Sakurai

Let X be a normal complex algebraic variety, and p a prime. We show that there exists an integer N=N(X, p) such that: any non-trivial, irreducible representation of the fundamental group of X, which arises from geometry, must be non-trivial…

Algebraic Geometry · Mathematics 2016-12-22 Daniel Litt

We consider two algorithmic problems concerning sub-semigroups of Heisenberg groups and, more generally, two-step nilpotent groups. The first problem is Intersection Emptiness, which asks whether a finite number of given finitely generated…

Group Theory · Mathematics 2022-10-28 Ruiwen Dong

Several results are presented for site percolation on quasi-transitive, planar graphs $G$ with one end, when properly embedded in either the Euclidean or hyperbolic plane. If $(G_1,G_2)$ is a matching pair derived from some quasi-transitive…

Probability · Mathematics 2024-09-12 Geoffrey R. Grimmett , Zhongyang Li

For a graph $H$, the $H$-recolouring problem $\operatorname{Recol}(H)$ asks, for two given homomorphisms from a given graph $G$ to $H$, if one can get between them by a sequence of homomorphisms of $G$ to $H$ in which consecutive…

Combinatorics · Mathematics 2024-03-06 Jae-baek Lee , Jonathan A. Noel , Mark Siggers

In recent work, Rosenbaum and Wagner showed that isomorphism of explicitly listed $p$-groups of order $n$ could be tested in $n^{\frac{1}{2}\log_p n + O(p)}$ time, roughly a square root of the classical bound. The $O(p)$ term is entirely…

Computational Complexity · Computer Science 2015-11-03 Eugene M. Luks

We systematically study the connection between P, C and strong CP in the context of both non-supersymmetric and supersymmetric left-right theories. We find that the solution to the strong CP problem requires both supersymmetry and parity…

High Energy Physics - Phenomenology · Physics 2009-10-30 Rabindra N. Mohapatra , Andrija Rasin , Goran Senjanovic

A triangle group is denoted by $\Delta(p,q,r)$ and has finite presentation $$ \Delta(p,q,r)=\langle x,y | x^p=y^q=(xy)^r=1 \rangle .$$ We examine a method for composition of permutation representations of a triangle group $\Delta(p,q,r)$…

Group Theory · Mathematics 2017-08-03 Siddiqua Mazhar

An abstract $n$-polytope $\mathcal{P}$ is a partially-ordered set which captures important properties of a geometric polytope, for any dimension $n$. For even $n \ge 2$, the incidences between elements in the middle two layers of the Hasse…

Combinatorics · Mathematics 2024-06-21 Marston Conder , Isabelle Steinmann

The homotopy symmetric $C^*$-algebras are those separable $C^*$-algebras for which one can unsuspend in E-theory. We find a new simple condition that characterizes homotopy symmetric nuclear $C^*$-algebras and use it to show that the…

Operator Algebras · Mathematics 2016-03-07 Marius Dadarlat , Ulrich Pennig

The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision version of the homomorphism problem received a lot of…

Computational Complexity · Computer Science 2009-02-10 Andrei A. Bulatov , Victor Dalmau , Martin Grohe , Daniel Marx

Let $(G,\alpha)$ and $(H,\beta)$ be locally compact Hausdorff groupoids with Haar systems, and let $(X,\lambda)$ be a topological correspondence from $(G,\alpha)$ to $(H,\beta)$ which induce the ${C}^*$-correspondence $\mathcal{H}(X)\colon…

Operator Algebras · Mathematics 2017-09-27 Rohit Dilip Holkar

Using the probability theory-based approach, this paper reveals the equivalence of an arbitrary NP-complete problem to a problem of checking whether a level set of a specifically constructed harmonic cost function (with all diagonal entries…

Computational Complexity · Computer Science 2012-08-06 Alexander Y. Davydov

The breakdown of conventional bulk-boundary correspondence, a cornerstone of topological physics, is one of counter-intuitive phenomena in non-Hermitian systems, that is deeply rooted in symmetry. In particular, preserved chiral symmetry is…

Mesoscale and Nanoscale Physics · Physics 2025-04-08 Miao Zhang , Yue Zhang , Shuai Li , Rui Tian , Tianhao Wu , Yingchao Xu , Yi-an Li , Yuanbang Wei , Hong Gao , M. Suhail Zubairy , Fuli Li , Bo Liu

Fix a finite group $G$. We study the computational complexity of counting problems of the following flavor: given a group $\Gamma$, count the number of homomorphisms $\Gamma \to G$. Our first result establishes that this problem is…

Group Theory · Mathematics 2026-04-22 Eric Samperton , Armin Weiß

For large masses, the two heavy neutral Higgs bosons are nearly degenerate in many 2--Higgs doublet models, and particularly in supersymmetric models. In such a scenario the mixing between the states can be very large if the theory is…

High Energy Physics - Phenomenology · Physics 2011-09-13 S. Y. Choi , J. Kalinowski , Y. Liao , P. M. Zerwas

We identify type-preserving representations $\phi: \pi_1(\Sigma)\to \mathrm{PSL}(2,\mathbb{R})$ of the fundamental group of every punctured surface $\Sigma = \Sigma_{g,p}$ that are not Fuchsian yet send all non-peripheral simple closed…

Geometric Topology · Mathematics 2025-11-19 Inyoung Ryu

We consider stamps with different values (denominations) and same dimensions, and an envelope with a fixed maximum number of stamp positions. The local postage stamp problem is to find the smallest value that cannot be realized by the sum…

Data Structures and Algorithms · Computer Science 2026-01-30 Léo Colisson Palais , Jean-Guillaume Dumas , Alexis Galan , Bruno Grenet , Aude Maignan
‹ Prev 1 8 9 10 Next ›