相关论文: Primitive normalisers in quasipolynomial time

Let $\mathbb{F}_{q^n}$ be a finite field with $q^n$ elements. An element $\alpha \in \mathbb{F}_{q^n}$ is called $k$-normal over $\mathbb{F}_q$ if $\alpha$ and its conjugates generate a vector subspace of $\mathbb{F}_{q^n}$ of dimension…

In this paper we propose a new approach for developing a proof that P=NP. We propose to use a polynomial-time reduction of a NP-complete problem to Linear Programming. Earlier such attempts used polynomial-time transformation which is a…

Given a finite abelian group $G$ and $t\in \mathbb{N}$, there are two natural types of subsets of the Cartesian power $G^t$; namely, Cartesian powers $S^t$ where $S$ is a subset of $G$, and (cosets of) subgroups $H$ of $G^t$. A basic…

A subgroup $H$ of a group $G$ is called $\mathbb P$-subnormal in $G$ whenever either $H=G$ or there is a chain of subgroups $H=H_0\subset H_1\subset ... \subset H_n=G$ such that $|H_i:H_{i-1}|$ is a prime for all $i$. In this paper, we…

We consider the problem of dualizing a monotone CNF (equivalently, computing all minimal transversals of a hypergraph), whose associated decision problem is a prominent open problem in NP-completeness. We present a number of new polynomial…

Motivated by a connection, described here for the first time, between the hidden normal subgroup problem (HNSP) and abelian hypergroups (algebraic objects that model collisions of physical particles), we develop a stabilizer formalism using…

We introduce the first provably efficient algorithm to check if a finitely generated subgroup of an almost simple semi-simple group over the rationals is Zariski-dense. We reduce this question to one of computing Galois groups, and to this…

We derive a class of regular black holes from the proper-time renormalization group approach to asymptotically safe gravity. A central challenge is the robustness of physical predictions to the regularization scheme. We address this by…

A subset of Q^n is called semilinear (or piecewise linear) if it is Boolean combination of linear half-spaces. We study the computational complexity of the constraint satisfaction problem (CSP) over the rationals when all the constraints…

We provide a general sufficient condition for extendability of quasimorphisms on subgroups. This condition recovers the result of Hull--Osin on quasimorphisms on hyperbolically embedded subgroups, and the proof given in this paper is much…

In this work we revisit the elementary scheduling problem $1||\sum p_j U_j$. The goal is to select, among $n$ jobs with processing times and due dates, a subset of jobs with maximum total processing time that can be scheduled in sequence…

A set of natural numbers is primitive if no element of the set divides another. Erd\H{o}s conjectured that if S is any primitive set, then \sum_{n\in S} 1/(n log n) \le \sum_{n\in \P} 1/(p log p), where \P denotes the set of primes. In this…

Symmetries occur naturally in CSP or SAT problems and are not very difficult to discover, but using them to prune the search space tends to be very challenging. Indeed, this usually requires finding specific elements in a group of…

We present a quantum algorithm which identifies with certainty a hidden subgroup of an arbitrary finite group G in only a polynomial (in log |G|) number of calls to the oracle. This is exponentially better than the best classical algorithm.…

Let k_0 be a field of characteristic 0, k its algebraic closure, G a connected reductive group defined over k. Let H\subset G be a spherical subgroup. We assume that k_0 is a large field, for example, k_0 is either the field R of real…

For fixed $r\geq 3$ and $n$ divisible by $r$, let ${\mathcal H}={\mathcal H}^r_{n,M}$ be the random $M$-edge $r$-graph on $V=\{1,\ldots ,n\}$; that is, ${\mathcal H}$ is chosen uniformly from the $M$-subsets of ${\mathcal K}:={V \choose r}$…

A classification is given of rank 3 group actions which are quasiprimitive but not primitive. There are two infinite families and a finite number of individual imprimitive examples. When combined with earlier work of Bannai, Kantor,…

We consider a quasilinear parabolic stochastic partial differential equation driven by a multiplicative noise and study regularity properties of its weak solution satisfying classical a priori estimates. In particular, we determine…

We consider the following two finiteness conditions on normalizers and centralizers in a group G: (i) |N_G(H):H| is finite for every non-normal subgroup H of G, and (ii) |C_G(x):<x>| is finite for every non-normal cyclic subgroup <x> of G.…

We give a new framework for proving the existence of low-degree, polynomial approximators for Boolean functions with respect to broad classes of non-product distributions. Our proofs use techniques related to the classical moment problem…