Applications of a Grassmannian technique to hyperbolicity, Chow equivalency, and Seshadri constants

Author(s):  
Eric Riedl ◽  
David Yang

In this paper we further develop a Grassmannian technique used to prove results about very general hypersurfaces and present three applications. First, we provide a short proof of the Kobayashi conjecture given previously established results on the Green–Griffiths–Lang conjecture. Second, we completely resolve a conjecture of Chen, Lewis, and Sheng on the dimension of the space of Chow-equivalent points on a very general hypersurface, proving the remaining cases and providing a short, alternate proof for many of the previously known cases. Finally, we relate Seshadri constants of very general points to Seshadri constants of arbitrary points of very general hypersurfaces.

Filomat ◽  
2017 ◽  
Vol 31 (11) ◽  
pp. 3091-3093
Author(s):  
Dejan Ilic ◽  
Darko Kocev

In this paper we give a short proof of the main results of Kumam, Dung and Sitthithakerngkiet (P. Kumam, N.V. Dung, K. Sitthithakerngkiet, A Generalization of Ciric Fixed Point Theorems, FILOMAT 29:7 (2015), 1549-1556).


2021 ◽  
Vol 344 (7) ◽  
pp. 112430
Author(s):  
Johann Bellmann ◽  
Bjarne Schülke
Keyword(s):  

2021 ◽  
Author(s):  
Maria Chudnovsky ◽  
Cemil Dibek
Keyword(s):  

2020 ◽  
Vol 8 (1) ◽  
pp. 36-39
Author(s):  
Lei Cao ◽  
Ariana Hall ◽  
Selcuk Koyuncu

AbstractWe give a short proof of Mirsky’s result regarding the extreme points of the convex polytope of doubly substochastic matrices via Birkhoff’s Theorem and the doubly stochastic completion of doubly sub-stochastic matrices. In addition, we give an alternative proof of the extreme points of the convex polytopes of symmetric doubly substochastic matrices via its corresponding loopy graphs.


2021 ◽  
Vol 30 (2) ◽  
Author(s):  
Tom Gur ◽  
Yang P. Liu ◽  
Ron D. Rothblum

AbstractInteractive proofs of proximity allow a sublinear-time verifier to check that a given input is close to the language, using a small amount of communication with a powerful (but untrusted) prover. In this work, we consider two natural minimally interactive variants of such proofs systems, in which the prover only sends a single message, referred to as the proof. The first variant, known as -proofs of Proximity (), is fully non-interactive, meaning that the proof is a function of the input only. The second variant, known as -proofs of Proximity (), allows the proof to additionally depend on the verifier's (entire) random string. The complexity of both s and s is the total number of bits that the verifier observes—namely, the sum of the proof length and query complexity. Our main result is an exponential separation between the power of s and s. Specifically, we exhibit an explicit and natural property $$\Pi$$ Π that admits an with complexity $$O(\log n)$$ O ( log n ) , whereas any for $$\Pi$$ Π has complexity $$\tilde{\Omega}(n^{1/4})$$ Ω ~ ( n 1 / 4 ) , where n denotes the length of the input in bits. Our lower bound also yields an alternate proof, which is more general and arguably much simpler, for a recent result of Fischer et al. (ITCS, 2014). Also, Aaronson (Quantum Information & Computation 2012) has shown a $$\Omega(n^{1/6})$$ Ω ( n 1 / 6 ) lower bound for the same property $$\Pi$$ Π .Lastly, we also consider the notion of oblivious proofs of proximity, in which the verifier's queries are oblivious to the proof. In this setting, we show that s can only be quadratically stronger than s. As an application of this result, we show an exponential separation between the power of public and private coin for oblivious interactive proofs of proximity.


1988 ◽  
Vol 19 (2) ◽  
pp. 171-171 ◽  
Author(s):  
Stephen H. Friedberg

Sign in / Sign up

Export Citation Format

Share Document