English
Related papers

Related papers: On the Descriptive Complexity of Groups without Ab…

200 papers

In this paper, we study the relation between periodicity of two-dimensional words and their abelian pattern complexity. A pattern $\cal{P}$ in $\mathbb{Z}^n$ is the set of all translations of some finite subset $F$ of $\mathbb{Z}^n$. An…

Combinatorics · Mathematics 2021-12-28 Nikolai Geravker , Svetlana Puzynina

The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven a useful tool for studying resolution-based proof systems when comparing the strength of different subsystems, showing…

Computational Complexity · Computer Science 2015-03-13 Jakob Nordström

Using Hecke characters, we construct two infinite families of newforms with complex multiplication, one by $\mathbb{Q}(\sqrt{-3})$ and the other by $\mathbb{Q}(\sqrt{-2})$. The values of the $p$-th Fourier coefficients of all the forms in…

Number Theory · Mathematics 2018-07-12 Alexis Gomez , Dermot McCarthy , Dylan Young

Let $G$ be a $(2,m,n)$-group and let $x$ be the number of distinct primes dividing $\chi$, the Euler characteristic of $G$. We prove, first, that, apart from a finite number of known exceptions, a non-abelian simple composition factor $T$…

Group Theory · Mathematics 2014-02-26 Nick Gill

We present syntactic characterisations for the union closed fragments of existential second-order logic and of logics with team semantics. Since union closure is a semantical and undecidable property, the normal form we introduce enables…

Logic in Computer Science · Computer Science 2023-06-22 Matthias Hoelzel , Richard Wilke

This paper has two parts. The first is concerned with a variant of a family of games introduced by Holy and Schlicht, that we call \emph{Welch games}. Player II having a winning strategy in the Welch game of length $\omega$ on $\kappa$ is…

Logic · Mathematics 2023-08-08 Matthew Foreman , Menachem Magidor , Martin Zeman

We study basic properties of the category of smooth representations of a p-adic group G with coefficients in any commutative ring R in which p is invertible. Our main purpose is to prove that Hecke algebras are noetherian whenever R is ; a…

Representation Theory · Mathematics 2007-05-23 Jean-Francois Dat

It is well-known that abelian varieties are projective, and so that there exist explicit polynomial and rational functions which define both the variety and its group law. It is however difficult to find any explicit polynomial and rational…

Algebraic Geometry · Mathematics 2018-08-07 David Urbanik

In 1981, Neil Immerman described a two-player game, which he called the "separability game" \cite{Immerman81}, that captures the number of quantifiers needed to describe a property in first-order logic. Immerman's paper laid the groundwork…

Computational Complexity · Computer Science 2022-07-05 Ronald Fagin , Jonathan Lenchner , Nikhil Vyas , Ryan Williams

Whenever a given Poisson manifold is equipped with discrete symmetries the corresponding algebra of invariant functions or the algebra of functions twisted by the symmetry group can have new deformations, which are not captured by…

Mathematical Physics · Physics 2022-12-28 Alexey Sharapov , Evgeny Skvortsov , Arseny Sukhanov

We investigate the parameterized complexity of Binary CSP parameterized by the vertex cover number and the treedepth of the constraint graph, as well as by a selection of related modulator-based parameters. The main findings are as follows:…

Discrete Mathematics · Computer Science 2023-09-22 Hans L. Bodlaender , Carla Groenland , Michał Pilipczuk

This article contains a review of categorifications of semisimple representations of various rings via abelian categories and exact endofunctors on them. A simple definition of an abelian categorification is presented and illustrated with…

Representation Theory · Mathematics 2007-05-23 Mikhail Khovanov , Volodymyr Mazorchuk , Catharina Stroppel

In this paper, we determine the descriptive complexity of subsets of the Polish space of marked groups defined by various group theoretic properties. In particular, using Grigorchuk groups, we establish that the sets of solvable groups,…

Group Theory · Mathematics 2020-11-04 Mustafa Gökhan Benli , Burak Kaya

It is known that the second Leibniz homology group $HL_2(stl_n(R))$ of the Steinberg Leibniz algebra $stl_n(R)$ is trivial for $n\geq 5$. In this paper, we determine $HL_2(stl_n(R))$ explicitly (which are shown to be not necessarily…

Quantum Algebra · Mathematics 2009-11-24 Qifen Jiang , Ran Shen , Yucai Su

We introduce some classical complexity-theoretic techniques to Parameterized Complexity. First, we study relativization for the machine models that were used by Chen, Flum, and Grohe (2005) to characterize a number of parameterized…

Computational Complexity · Computer Science 2018-07-18 Ralph Christian Bottesch

Universal solutions to deformation quantization problems can be conveniently classified by the cohomology of suitable graph complexes. In particular, the deformation quantizations of (finite-dimensional) Poisson manifolds and Lie bialgebras…

Quantum Algebra · Mathematics 2022-03-22 Kevin Morand

Two players alternate moves in the following impartial combinatorial game: Given a finitely generated abelian group $A$, a move consists of picking some nonzero element $a \in A$. The game then continues with the quotient group $A/ \langle…

Combinatorics · Mathematics 2020-01-29 Martin Brandenburg

In this paper we continue the study of the higher-rank graphs associated to finite-dimensional complex semisimple Lie algebras, introduced by the author and R. Yuncken, whose construction relies on Kashiwara's theory of crystals. First we…

Combinatorics · Mathematics 2026-04-22 Marco Matassa

For a complex reflection group $W$ with reflection representation $\mathfrak{h}$, we define and study a natural filtration by Serre subcategories of the category $\mathcal{O}_c(W, \mathfrak{h})$ of representations of the rational Cherednik…

Representation Theory · Mathematics 2018-02-15 Ivan Losev , Seth Shelley-Abrahamson

We study the classification of omega_1-separable groups using Ehrenfeucht-Fraisse games and prove a strong classification result assuming PFA, and a strong non-structure theorem assuming diamond.

Logic · Mathematics 2008-02-03 Paul C. Eklof , Matthew Foreman , Saharon Shelah