English
Related papers

Related papers: On Alternation and the Union Theorem

200 papers

Using properties of Blum complexity measures and certain complexity class operators, we exhibit a total computable and non-decreasing function $t_{\mathsf{poly}}$ such that for all $k$, $\Sigma_k\mathsf{P} =…

Computational Complexity · Computer Science 2024-06-14 Matthew Fox , Chaitanya Karamchedu

Let $f(z)=\sum_{n=1}^\infty a(n)e^{2\pi i nz}\in S_k^{new}(\Gamma_0(N))$ be a newform of even weight $k\geq2$ that does not have complex multiplication. Then $a(n)\in\mathbb{R}$ for all $n$, so for any prime $p$, there exists…

Number Theory · Mathematics 2020-04-13 Jesse Thorner

For a prime $p$, we show that uniqueness of factorization into irreducible $\Sigma_{p^2}$-invariant representations of $\mathbb{Z}/p \wr \mathbb{Z}/p$ holds if and only if $p=2$. We also show nonuniqueness of factorization for…

Group Theory · Mathematics 2023-05-30 José Cantarero , Jorge Gaspar-Lara

This article describes a Turing machine which can solve for $\beta^{'}$ which is RE-complete. RE-complete problems are proven to be undecidable by Turing's accepted proof on the Entscheidungsproblem. Thus, constructing a machine which…

Computational Complexity · Computer Science 2018-04-24 Mark Inman

Let $p$ be a prime and let $S_2(\Gamma(p))$ be the space of weight $2$ cusp forms for the principal congruence subgroup $\Gamma(p)$. Then $\mathrm{SL}_2(\mathbb{F}_p)$ acts on $S_2(\Gamma(p))$ in a natural way. Around 1928, Hecke proved…

Representation Theory · Mathematics 2025-08-26 Zhe Chen , Yongqi Feng

Motivated by the observation that $2+2=4$, we consider four-dimensional $\mathcal{N}=2$ superconformal field theories on $S^2\times\Sigma$, turning on a suitable rigid supergravity background. On the one hand, reduction of a…

High Energy Physics - Theory · Physics 2026-01-05 Leonardo Rastelli , Brandon C. Rayhaun , Matteo Sacchi , Gabi Zafrir

Let $\mathrm{Mod}(S_g)$ be the mapping class group of the closed orientable surface of genus $g \geq 2$. In this article, we derive necessary and sufficient conditions under which two torsion elements in $\mathrm{Mod}(S_g)$ will have…

Geometric Topology · Mathematics 2023-10-11 Rajesh Dey , Kashyap Rajeevsarathy

We present a pseudoclassical mechanics model which exhibits gauge symmetry and time-reparametrization invariance. As such, first- and second-class constraints restrict the phase space, and the Hamiltonian weakly vanishes. We show that the…

High Energy Physics - Theory · Physics 2023-04-07 Mauricio Valenzuela

For any time bound f, let H(f) denote the hierarchy conjecture which means that the restriction of the numbers of work tapes of deterministic Turing machines to some b generates an infinite hierarchy of proper subclasses DTIME_b(f) \subset…

Computational Complexity · Computer Science 2013-10-01 Armin Hemmerling

We develop further our fibre bundle construct of non-commutative space-time on a Minkowski base space. We assume space-time is non-commutative due to the existence of additional non-commutative algebraic structure at each point x of…

Mathematical Physics · Physics 2017-08-15 James Moffat , Teodora Oniga , Charles H. -T. Wang

This is a conitunation of [1] and [2]. We prove that if function $f$ belongs to the class $\Lambda_{\omega} \overset{\text{def}}{=} \{f: \omega_{f}(\delta)\leq \text{const} \omega(\delta)\} $ for an arbitrary modulus of continuity $\omega$,…

Functional Analysis · Mathematics 2016-05-18 Qinbo Liu

We generalize the classical definition of effectively closed subshift to finitely generated groups. We study classical stability properties of this class and then extend this notion by allowing the usage of an oracle to the word problem of…

Group Theory · Mathematics 2019-04-26 Nathalie Aubrun , Sebastián Barbieri , Mathieu Sablik

We reprove a result of Boppana and Lagarias: If Pi_2^P is different from Sigma_2^P then there exists a partial function f that is computable by a polynomial-size family of circuits, but no inverse of f is computable by a polynomial-size…

Computational Complexity · Computer Science 2011-02-25 Jean-Camille Birget

The Fewest Clues Problem (FCP) framework has been introduced to study the complexity of determining whether a solution to an \NP~problem can be uniquely identified by specifying a subset of the certificate. For a given problem $P \in \NP$,…

Computational Complexity · Computer Science 2025-04-17 Atsuki Nagao , Mei Sekiguchi

A new class UF of problems is introduced, strictly included in the class NP, which arises in the analysis of the time verifying the intermediate results of computations. The implications of the introduction of this class are considered.…

Computational Complexity · Computer Science 2016-03-03 Anatoly D. Plotnikov

Motivated by the theory of proof complexity generators we consider the following $\Sigma^p_2$ search problem $\mbox{DD}_P$ determined by a propositional proof system $P$: given a $P$-proof $\pi$ of a disjunction $\bigvee_i {\alpha}_i$, no…

Computational Complexity · Computer Science 2026-05-13 Jan Krajicek

Let $\mathbb{G}$ be a locally compact abelian group and let $1<p\leq 2$. $\mathbb{G}^{'}$ is the dual group of $\mathbb{G}$, and $p^{'}$ the conjugate exponent of $p$. An operator $T$ between Banach spaces $X$ and $Y$ is said to be…

Functional Analysis · Mathematics 2009-01-22 In Sook Park

In this paper, we provide both a preservation and breaking of symmetry theorem for $2\pi$-periodic problems of the form \begin{align*} \begin{cases} -u''(t) + g(u(t)) = f(t)\cr u(0) - u(2\pi) = u'(0) - u'(2\pi) = 0 \end{cases} \end{align*}…

Analysis of PDEs · Mathematics 2021-09-16 Edward Huynh , Keoni Castellano

In this paper we prove a noncommutative version of Hardy-Littlewood inequalities relating a function and its Fourier coefficients on the group $SU(2)$. As a consequence, we use it to obtain lower bounds for the $L^p-L^q$ norms of Fourier…

Functional Analysis · Mathematics 2016-04-29 Rauan Akylzhanov , Erlan Nursultanov , Michael Ruzhansky

The purpose of the present paper is to prove for finitely generated groups of type I the following conjecture of A.Fel'shtyn and R.Hill, which is a generalization of the classical Burnside theorem. Let G be a countable discrete group, f one…

Representation Theory · Mathematics 2016-09-07 Alexander Fel'shtyn , Evgenij Troitsky
‹ Prev 1 2 3 10 Next ›