Related papers: Primitive normalisers in quasipolynomial time

We extend the notion of an $H$-normal quotient digraph of an $H$-vertex-transitive digraph to that of an $H$-subnormal quotient digraph. Using these concepts, together with bipartite halves of bipartite digraphs, we show that, for each…

We consider the problem of quasinormal modes (QNM) for strongly hyperbolic systems on stationary, asymptotically anti-de Sitter black holes, with very general boundary conditions at infinity. We argue that for a time slicing regular at the…

We reveal a natural algebraic problem whose complexity appears to interpolate between the well-known complexity classes BQP and NP: (*) Decide whether a univariate polynomial with exactly m monomial terms has a p-adic rational root. In…

We discuss recent progress on the problem of classifying point-primitive generalised polygons. In the case of generalised hexagons and generalised octagons, this has reduced the problem to primitive actions of almost simple groups of Lie…

I approach the Problem of Time and other foundations of Quantum Cosmology using a combined histories, timeless and semiclassical approach. This approach is along the lines pursued by Halliwell. It involves the timeless probabilities for…

We consider semigroup dynamical systems defined by several monnomials over a number field $K$. We prove a finiteness result for preperiodic points of such systems which are $S$-integral with respect to a non-preperiodic point $\beta$, which…

In a previous work [Asymptotically quasiperiodic solutions for time-dependent Hamiltonians, arXiv preprint arXiv:2211.06623 (2022)], we consider time-dependent perturbations of a Hamiltonian vector field having an invariant torus supporting…

Let $H$ be a subgroup of a group $G$. The permutizer $P_G(H)$ is the subgroup generated by all cyclic subgroups of $G$ which permute with $H$. A subgroup $H$ of a group $G$ is strongly permutable in $G$ if $P_U(H)=U$ for every subgroup $U$…

We give a complete characterization of countable primitive groups in several settings including linear groups, subgroups of mapping class groups, groups acting minimally on trees and convergence groups. The latter category includes as a…

In a \emph{separability problem}, we are given two sets $K$ and $L$ from a class $\mathcal{C}$, and we want to decide whether there exists a set $S$ from a class $\mathcal{S}$ such that $K\subseteq S$ and $S\cap L=\emptyset$. In this case,…

The nonvanishing problem asks if a coefficient of a polynomial is nonzero. Many families of polynomials in algebraic combinatorics admit combinatorial counting rules and simultaneously enjoy having saturated Newton polytopes (SNP). Thereby,…

Recently, S.~Kanti Patra and Md.~Moid Shaik proved the existence of monochromatic solutions to systems of polynomial equations near zero for particular dense subsemigroups $S$ of $((0,\infty),+)$. We extend their results to a much larger…

Navarro has conjectured a necessary and sufficient condition for a finite group $G$ to have a self-normalising Sylow $2$-subgroup, which is given in terms of the ordinary irreducible characters of $G$. The first-named author has reduced the…

The $k$-subset sum problem over finite fields is a classical NP-complete problem.Motivated by coding theory applications, a more complex problem is the higher $m$-th moment $k$-subset sum problem over finite fields. We show that there is a…

This work was inspired by two natural questions. The first question is when Lie(G')=Lie(G)', where G is a connected algebraic supergroup defined over a field of characteristic zero. The second question is whether the unipotent radical of…

Optimizing and certifying the positivity of polynomials are fundamental primitives across mathematics and engineering applications, from dynamical systems to operations research. However, solving these problems in practice requires large…

We prove that the discrete logarithm problem can be solved in quasi-polynomial expected time in the multiplicative group of finite fields of fixed characteristic. More generally, we prove that it can be solved in the field of cardinality…

The Unbounded Subset-Sum Problem (USSP) is defined as: given sum $s$ and a set of integers $W\leftarrow \{p_1,\dots,p_n\}$ output a set of non-negative integers $\{y_1,\dots,y_n\}$ such that $p_1y_1+\dots+p_ny_n=s$. The USSP is an…

In the Subset Sum problem we are given a set of $n$ positive integers $X$ and a target $t$ and are asked whether some subset of $X$ sums to $t$. Natural parameters for this problem that have been studied in the literature are $n$ and $t$ as…

We introduce the term "protonormal" to refer to a subgroup H of a group G such that for every x in G the subgroups x^{-1}Hx and H commute as sets. If moreover (G,H) is a Hecke pair we show that the Hecke algebra H(G,H) is generated by the…