English
Related papers

Related papers: Reconstructing decomposition subgroups in arithmet…

200 papers

We study a condensed version of the \'etale homotopy type of a scheme, which refines both the usual \'etale homotopy type of Friedlander-Artin-Mazur and the pro\'etale fundamental group of Bhatt-Scholze. In the first part of this paper, we…

It is important to classify covering subgroups of the fundamental group of a topological space using their topological properties in the topologized fundamental group. In this paper, we introduce and study some topologies on the fundamental…

Algebraic Topology · Mathematics 2018-07-04 M. Ab dullahi Rashid , N. Jamali , B. Mashayekhy , S. Z. Pashaei , H. Torabi

In this paper, we generalize the formal affine Demazure algebra of Hoffnung-Malag\'on-L\'opez-Savage-Zainoulline to all real finite reflection groups. We begin by generalizing the formal group ring of Calm\`es-Petrov-Zainoulline to all real…

Rings and Algebras · Mathematics 2021-05-26 Raj Gandhi

The reconstruction theorem and the multilevel Schauder estimate have central roles in the analytic theory of regularity structures [17]. Inspired by [26], we provide elementary proofs for them by using the semigroup of operators.…

Analysis of PDEs · Mathematics 2025-01-23 Masato Hoshino

We introduce a path-theoretic framework for understanding the representation theory of (quantum) symmetric and general linear groups and their higher level generalisations over fields of arbitrary characteristic. Our first main result is a…

Representation Theory · Mathematics 2018-05-04 C. Bowman , A. G. Cox

We address the inverse problem of recovering a degeneracy point within the diffusion coefficient of a one-dimensional complex parabolic equation by observing the normal derivative at one point of the boundary. The strongly degenerate case…

Analysis of PDEs · Mathematics 2026-05-13 Piermarco Cannarsa , Veronica Danesi , Anna Doubova

This article concerns the computational complexity of a fundamental problem in number theory: counting points on curves and surfaces over finite fields. There is no subexponential-time algorithm known and it is unclear if it can be…

Computational Complexity · Computer Science 2025-11-05 Diptajit Roy , Nitin Saxena , Madhavan Venkatesh

We discuss in the context of finite extensions two classical theorems of Takahasi and Howson on subgroups of free groups. We provide bounds for the rank of the intersection of subgroups within classes of groups such as virtually free…

Group Theory · Mathematics 2014-12-11 Vitor Araujo , Pedro V. Silva , Mihalis Sykiotis

A conformal restriction system is a commutative, associative, unital algebra equipped with a representation of the groupoid of univalent conformal maps on connected open sets of the Riemann sphere, and a family of linear functionals on…

Mathematical Physics · Physics 2015-06-11 Benjamin Doyon

We develop an algebraic version of Cartan method of equivalence or an analog of Tanaka prolongation for the (extrinsic) geometry of curves of flags of a vector space $W$ with respect to the action of a subgroup $G$ of the $GL(W)$. Under…

Differential Geometry · Mathematics 2011-10-04 Boris Doubrov , Igor Zelenko

Convergent rewriting systems on algebraic structures give methods to solve decision problems, to prove coherence results, and to compute homological invariants. These methods are based on higher-dimensional extensions of the critical…

Category Theory · Mathematics 2021-11-08 Cyrille Chenavier , Benjamin Dupont , Philippe Malbos

In this work, we use a labelled deduction system based on the concept of computational paths (sequence of rewrites) as equalities between two terms of the same type. We also define a term rewriting system that is used to make computations…

Logic in Computer Science · Computer Science 2019-06-24 Tiago M. L. de Veras , Arthur F. Ramos , Ruy J. G. B. de Queiroz , Anjolina G. de Oliveira

We introduce a new method for decomposing the edge set of a graph, and use it to replace the Regularity lemma of Szemer\'edi in some graph embedding problems. An algorithmic version is also given.

Combinatorics · Mathematics 2021-10-27 Béla Csaba

We look at the question of which distance-regular graphs are core-complete, meaning they are isomorphic to their own core or have a complete core. We build on Roberson's homomorphism matrix approach by which method he proved the…

Combinatorics · Mathematics 2025-04-04 Annemarie Geertsema , Chris Godsil , Krystal Guo

This is the announcement, and the long summary, of a series of articles on the algorithmic study of Thurston maps. We describe branched coverings of the sphere in terms of group-theoretical objects called bisets, and develop a theory of…

Computational Complexity · Computer Science 2017-06-20 Laurent Bartholdi , Dzmitry Dudko

This article studies automorphism groups of graph products of arbitrary groups. We completely characterise automorphisms that preserve the set of conjugacy classes of vertex groups as those automorphisms that can be decomposed as a product…

Group Theory · Mathematics 2019-08-07 Anthony Genevois , Alexandre Martin

The influence of a random environment on the dynamics of a fluctuating rough surface is investigated using a field theoretic renormalization group. The environment motion is modelled by the stochastic Navier--Stokes equation, which includes…

Statistical Mechanics · Physics 2025-02-18 N. V. Antonov , A. A. Babakin , N. M. Gulitskiy , P. I. Kakin

We describe the structure of the Whittaker or Gelfand-Graev module on a $n$-fold metaplectic cover of a $p$-adic group $G$ at both the Iwahori and spherical level. We express our answer in terms of the representation theory of a quantum…

Representation Theory · Mathematics 2022-11-08 Valentin Buciumas , Manish M. Patnaik

The structure of the UV divergencies in higher dimensional nonrenormalizable theories is analysed. Based on renormalization operation and renormalization group theory it is shown that even in this case the leading divergencies (asymptotics)…

High Energy Physics - Theory · Physics 2011-04-11 D. I. Kazakov , G. S. Vartanov

This paper describes an approach for fitting an immersed submanifold of a finite-dimensional Euclidean space to random samples. The reconstruction mapping from the ambient space to the desired submanifold is implemented as a composition of…

Machine Learning · Computer Science 2022-09-16 Joshua Hanson , Maxim Raginsky