English
Related papers

Related papers: On Alternation and the Union Theorem

200 papers

We prove that for any prime $p>2$, $q=p^\nu$ a power of $p$, $n\ge p$ and $G=S_n$ or $G=A_n$ (symmetric or alternating group) there exists a Galois extension $K/\mathbb F_q(T)$ ramified only over $\infty$ with $\mathrm{Gal}(K/\mathbb…

Number Theory · Mathematics 2023-01-03 Alexei Entin , Noam Pirani

We prove a version of the weight part of Serre's conjecture for mod $p$ Galois representations attached to automorphic forms on rank 2 unitary groups which are non-split at $p$. More precisely, let $F/F^+$ denote a CM extension of a totally…

Number Theory · Mathematics 2022-12-21 Karol Koziol , Stefano Morra

We make progress towards understanding the structure of Littlewood-Richardson coefficients $g_{\lambda,\mu}^{\nu}$ for products of Jack symmetric functions. Building on recent results of the second author, we are able to prove new cases of…

Combinatorics · Mathematics 2023-09-29 Per Alexandersson , Ryan Mickler

In this work, we present an algorithmic treatment of the representation theory of the algebra of partially transposed permutation operators, denoted by $\mathcal{A}^d_{p,p}$, which is a matrix representation of the abstract walled Brauer…

Quantum Physics · Physics 2026-02-17 Michał Horodecki , Michał Studziński , Marek Mozrzymas

Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of stability. Examples can be found in areas as diverse as voting theory,…

Computational Complexity · Computer Science 2015-02-06 Dorothea Baumeister , Felix Brandt , Felix Fischer , Jan Hoffmann , Joerg Rothe

The $\textbf{P}$ vs. $\textbf{NP}$ problem is an important problem in contemporary mathematics and theoretical computer science. Many proofs have been proposed to this problem. This paper proposes a theoretic proof for $\textbf{P}$ vs.…

Computational Complexity · Computer Science 2020-07-02 Changlin Wan , Zhongzhi Shi

Let $p>3$ be a prime, and let $q_p(2)=(2^{p-1}-1)/p$ be the Fermat quotient of $p$ to base 2. Recently, Z. H. Sun proved that \sum_{k=1}^{p-1}\frac{1}{k\cdot 2^k}\equiv q_p(2)-\frac{p}{2}q_p(2)^2 \pmod{p^2} which is a generalization of a…

Number Theory · Mathematics 2011-10-20 Romeo Mestrovic

It has been shown in "On the Hausdorff-Young theorem for commutative hypergroups" by Sina Degenfeld-Schonburg, that one can extend the domain of Fourier transform of a commutative hypergroup $K$ to $L^p(K)$ for $1\leq p \leq 2$, and the…

Functional Analysis · Mathematics 2022-09-29 Choiti Bandyopadhyay , Parasar Mohanty

Otto's Theorem characterises the bisimulation-invariant PTIME queries over graphs as exactly those that can be formulated in the polyadic mu-calculus, hinging on the Immerman-Vardi Theorem which characterises PTIME (over ordered structures)…

Logic in Computer Science · Computer Science 2022-09-22 Florian Bruse , David Kronenberger , Martin Lange

We establish, for $1 < p < \infty$, higher order $\mathcal{S}^p$-differentiability results of the function $\varphi : t\in \mathbb{R} \mapsto f(A+tK) - f(A)$ for selfadjoint operators $A$ and $K$ on a separable Hilbert space $\mathcal{H}$…

Functional Analysis · Mathematics 2019-06-14 Clément Coine

We prove algorithmic versions of the polynomial Freiman-Ruzsa theorem of Gowers, Green, Manners, and Tao (Annals of Mathematics, 2025) in additive combinatorics. In particular, we give classical and quantum polynomial-time algorithms that,…

Combinatorics · Mathematics 2025-09-03 Srinivasan Arunachalam , Davi Castro-Silva , Arkopal Dutt , Tom Gur

The periodic tiling conjecture (PTC) asserts, for a finitely generated Abelian group $G$ and a finite subset $F$ of $G$, that if there is a set $A$ that solves the tiling equation $\mathbb{1}_F * \mathbb{1}_A = 1$, there is also a periodic…

Classical Analysis and ODEs · Mathematics 2025-05-13 Rachel Greenfeld , Terence Tao

A notion of alternating timed automata is proposed. It is shown that such automata with only one clock have decidable emptiness problem over finite words. This gives a new class of timed languages which is closed under boolean operations…

Logic in Computer Science · Computer Science 2007-05-23 Slawomir Lasota , Igor Walukiewicz

It is well known that if $G$ admits a f.g. subgroup $H$ with a weaklyaperiodic SFT (resp. an undecidable domino problem), then $G$itself has a weakly aperiodic SFT (resp. an undecidable domino problem).We prove that we can replace the…

Formal Languages and Automata Theory · Computer Science 2015-08-27 Emmanuel Jeandel

Let $f(z) = \sum_{n=1}^\infty a_f(n)q^n$ be a holomorphic cuspidal newform with even integral weight $k\geq 2$, level $N$, trivial nebentypus, and no complex multiplication (CM). For all primes $p$, we may define $\theta_p\in [0,\pi]$ such…

Number Theory · Mathematics 2022-01-26 Alexandra Hoey , Jonas Iskander , Steven Jin , Fernando Trejos Suárez

The Birkhoff Ergodic Theorem concludes that time averages, that is, Birkhoff averages, $\Sigma_{n=1}^N f(x_n)/N$ of a function $f$ along an ergodic trajectory $(x_n)$ of a function $T$ converges to the space average $\int f d\mu$, where…

Dynamical Systems · Mathematics 2015-08-04 Suddhasattwa Das , Yoshitaka Saiki , Evelyn Sander , James A. Yorke

In this paper we propose the PCP-like theorem for sub-linear time inapproximability. Abboud et al. have devised the distributed PCP framework for proving sub-quadratic time inapproximability. Here we try to go further in this direction.…

Computational Complexity · Computer Science 2024-01-03 Hengzhao Ma , Jianzhong Li

In this paper we present two new results on the number of certain conjugacy classes of a finite group. For a finite group $G$, let $n(G)$ be the maximum of $k_{p}(G)$ taken over all primes $p$ where $k_{p}(G)$ denotes the number of…

Group Theory · Mathematics 2025-05-08 Burcu Çınarcı , Thomas Michael Keller , Attila Maróti , Iulian I. Simion

The purpose of the present paper is to discuss the following conjecture of Fel'shtyn and Hill, which is a generalization of the classical Burnside theorem: Let G be a countable discrete group, f its automorphism, R(f) the number of…

Representation Theory · Mathematics 2016-09-07 Alexander Fel'shtyn , Evgenij Troitsky , Anatoly Vershik

Recently the first author proved a congruence proposed in 2006 by Adamchuk: $\sum_{k=1}^{\lfloor\frac{2p}{3}\rfloor}\binom{2k}{k}\equiv 0\pmod{p^2}$ for any prime $p=1 \pmod{3}$. In this paper, we provide more examples (with proofs) of…

Number Theory · Mathematics 2020-07-21 Guo-Shuai Mao , Roberto Tauraso