Étale Fundamental Groups of Strongly $\boldsymbol{F}$-Regular Schemes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fundamental Groups of Schemes

0BQ6 Contents 1. Introduction 1 2. Schemesétale over a point 1 3. Galois categories 2 4. Functors and homomorphisms 9 5. Finité etale morphisms 11 6. Fundamental groups 14 7. Topological invariance of the fundamental group 15 8. Finité etale covers of proper schemes 17 9. Local connectedness 19 10. Fundamental groups of normal schemes 24 11. Group actions and integral closure 26 12.

متن کامل

Quadrance polygons, association schemes and strongly regular graphs

Quadrance between two points A1 = [x1, y1] and A2 = [x2, y2] is the number Q(A1, A2) := (x2 − x1) + (y2 − y1). In this paper, we present some interesting results arise from this notation. In Section 1, we will study geometry over finite fields under quadrance notations. The main purpose of Section 1 is to answer the question, for which a1, . . . an, we have a polygon A1 . . . An such that Q(Ai,...

متن کامل

On the Automorphism Groups of Strongly Regular Graphs

We derive strong structural constraints on the automorphism groups of strongly regular (s. r.) graphs, giving a surprisingly strong answer to a decades-old problem, with tantalizing implications to testing isomorphism of s. r. graphs, and raising new combinatorial challenges. S. r. graphs, while not believed to be Graph Isomorphism (GI) complete, have long been recognized as hard cases for GI, ...

متن کامل

On the Automorphism Groups of Strongly Regular Graphs II

We derive strong constraints on the automorphism groups of strongly regular (SR) graphs, resolving old problems motivated by Peter Cameron’s 1981 description of large primitive groups. Trivial SR graphs are the disjoint unions of cliques of equal size and their complements. Graphic SR graphs are the line-graphs of cliques and of regular bipartite cliques (complete bipartite graphs with equal pa...

متن کامل

On Strongly $H_{v}$-groups

‎The largest class of hyperstructures is the one which satisfies the weak properties; these are called $H_{v}$-structures‎. ‎In this paper we introduce a special product of elements in $H_{v}$-group $H$ and define a new class of $H_{v}$-groups called strongly $H_{v}$-groups‎. ‎Then we show that in strongly $H_{v}$-groups $beta=beta^{ast}$‎. ‎Also we express $theta$-hyperoperation and investigat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Mathematics Research Notices

سال: 2017

ISSN: 1073-7928,1687-0247

DOI: 10.1093/imrn/rnx253