scholarly journals RATIONAL CURVES ON CUBIC HYPERSURFACES OVER FINITE FIELDS

Mathematika ◽  
2021 ◽  
Vol 67 (2) ◽  
pp. 366-387
Author(s):  
Adelina Mânzăţeanu
Keyword(s):  
Finite Fields ◽  
Rational Curves ◽  
Cubic Hypersurfaces

scholarly journals One-cycles on rationally connected varieties

2014 ◽  
Vol 150 (3) ◽  
pp. 396-408 ◽  
Author(s):  
Zhiyu Tian ◽  
Hong R. Zong
Keyword(s):  
Complete Intersection ◽  
Finite Fields ◽  
Chow Group ◽  
Rational Curves ◽  
Positive Answer ◽  
Tate Conjecture ◽  
Rationally Connected ◽  
Rationally Connected Varieties

AbstractWe prove that every curve on a separably rationally connected variety is rationally equivalent to a (non-effective) integral sum of rational curves. That is, the Chow group of 1-cycles is generated by rational curves. Applying the same technique, we also show that the Chow group of 1-cycles on a separably rationally connected Fano complete intersection of index at least 2 is generated by lines. As a consequence, we give a positive answer to a question of Professor Totaro about integral Hodge classes on rationally connected 3-folds. And by a result of Professor Voisin, the general case is a consequence of the Tate conjecture for surfaces over finite fields.

scholarly journals Lines on Cubic Hypersurfaces Over Finite Fields

2017 ◽  
pp. 19-51 ◽  
Author(s):  
Olivier Debarre ◽  
Antonio Laface ◽  
Xavier Roulleau
Keyword(s):  
Finite Fields ◽  
Cubic Hypersurfaces

Finite Fields

1996 ◽  
Author(s):  
Rudolf Lidl ◽  
Harald Niederreiter
Keyword(s):  
Finite Fields

Maximum Distance Separable Hankel Rhotrices over Finite Fields

2018 ◽  
Vol 43 (1-4) ◽  
pp. 13-45
Author(s):  
Prof. P. L. Sharma ◽  
◽  
Mr. Arun Kumar ◽  
Mrs. Shalini Gupta ◽  
◽  
...  
Keyword(s):  
Finite Fields ◽  
Maximum Distance ◽  
Maximum Distance Separable

Notes on three-pass protocol

2020 ◽  
Vol 25 (4) ◽  
pp. 4-9
Author(s):  
Yerzhan R. Baissalov ◽  
Ulan Dauyl
Keyword(s):  
Finite Fields ◽  
Matrix Algebras ◽  
Associative Structures

The article discusses primitive, linear three-pass protocols, as well as three-pass protocols on associative structures. The linear three-pass protocols over finite fields and the three-pass protocols based on matrix algebras are shown to be cryptographically weak.

Sign in / Sign up

Export Citation Format

Share Document