POINTS OF SMALL HEIGHT ON AFFINE VARIETIES DEFINED OVER FUNCTION FIELDS OF FINITE TRANSCENDENCE DEGREE

2020 ◽  
pp. 1-10
Author(s):  
DRAGOS GHIOCA ◽  
DAC-NHAN-TAM NGUYEN
Keyword(s):  
Lower Bounds ◽  
Function Fields ◽  
Direct Proof ◽  
Transcendence Degree ◽  
Arbitrary Field ◽  
Constant Field ◽  
Weil Height ◽  
Small Height ◽  
Type Statement ◽  
Special Case

Abstract We provide a direct proof of a Bogomolov-type statement for affine varieties V defined over function fields K of finite transcendence degree over an arbitrary field k, generalising a previous result (obtained through a different approach) of the first author in the special case when K is a function field of transcendence degree $1$ . Furthermore, we obtain sharp lower bounds for the Weil height of the points in $V(\overline {K})$ , which are not contained in the largest subvariety $W\subseteq V$ defined over the constant field $\overline {k}$ .

scholarly journals Bounding the Size and Probability of Epidemics on Networks

2008 ◽  
Vol 45 (2) ◽  
pp. 498-512 ◽  
Author(s):  
Joel C. Miller
Keyword(s):  
Infectious Disease ◽  
Lower Bounds ◽  
Upper Bounds ◽  
Marginal Probability ◽  
Transmission Properties ◽  
Disease Spreading ◽  
Special Case

We consider an infectious disease spreading along the edges of a network which may have significant clustering. The individuals in the population have heterogeneous infectiousness and/or susceptibility. We define the out-transmissibility of a node to be the marginal probability that it would infect a randomly chosen neighbor given its infectiousness and the distribution of susceptibility. For a given distribution of out-transmissibility, we find the conditions which give the upper (or lower) bounds on the size and probability of an epidemic, under weak assumptions on the transmission properties, but very general assumptions on the network. We find similar bounds for a given distribution of in-transmissibility (the marginal probability of being infected by a neighbor). We also find conditions giving global upper bounds on the size and probability. The distributions leading to these bounds are network independent. In the special case of networks with high girth (locally tree-like), we are able to prove stronger results. In general, the probability and size of epidemics are maximal when the population is homogeneous and minimal when the variance of in- or out-transmissibility is maximal.

An Elementary Proof of Suslin Reciprocity

2005 ◽  
Vol 48 (2) ◽  
pp. 221-236 ◽  
Author(s):  
Matt Kerr
Keyword(s):  
Elementary Proof ◽  
Function Fields ◽  
Algebraic Cycles ◽  
Important Special Case ◽  
Special Case

AbstractWe state and prove an important special case of Suslin reciprocity that has found significant use in the study of algebraic cycles. An introductory account is provided of the regulator and norm maps on Milnor K2-groups (for function fields) employed in the proof.

scholarly journals On Mixed Codes with Covering Radius $1$ and Minimum Distance $2$

10.37236/969 ◽  
2007 ◽  
Vol 14 (1) ◽  
Author(s):  
Wolfgang Haas ◽  
Jörn Quistorff
Keyword(s):  
Lower Bounds ◽  
Minimum Distance ◽  
Covering Radius ◽  
Minimal Cardinality ◽  
Finite Sets ◽  
Open Problems ◽  
Latin Rectangle ◽  
Mixed Codes ◽  
Special Case

Let $R$, $S$ and $T$ be finite sets with $|R|=r$, $|S|=s$ and $|T|=t$. A code $C\subset R\times S\times T$ with covering radius $1$ and minimum distance $2$ is closely connected to a certain generalized partial Latin rectangle. We present various constructions of such codes and some lower bounds on their minimal cardinality $K(r,s,t;2)$. These bounds turn out to be best possible in many instances. Focussing on the special case $t=s$ we determine $K(r,s,s;2)$ when $r$ divides $s$, when $r=s-1$, when $s$ is large, relative to $r$, when $r$ is large, relative to $s$, as well as $K(3r,2r,2r;2)$. Some open problems are posed. Finally, a table with bounds on $K(r,s,s;2)$ is given.

Lower bounds for cutting planes proofs with small coefficients

1997 ◽  
Vol 62 (3) ◽  
pp. 708-728 ◽  
Author(s):  
Maria Bonet ◽  
Toniann Pitassi ◽  
Ran Raz
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Cutting Planes ◽  
Communication Complexity ◽  
Proof System ◽  
Small Weight ◽  
Deduction Rule ◽  
Special Case ◽  
Exponential Lower Bound

AbstractWe consider small-weight Cutting Planes (CP*) proofs; that is, Cutting Planes (CP) proofs with coefficients up to Poly(n). We use the well known lower bounds for monotone complexity to prove an exponential lower bound for the length of CP* proofs, for a family of tautologies based on the clique function. Because Resolution is a special case of small-weight CP, our method also gives a new and simpler exponential lower bound for Resolution.We also prove the following two theorems: (1) Tree-like CP* proofs cannot polynomially simulate non-tree-like CP* proofs. (2) Tree-like CP* proofs and Bounded-depth-Frege proofs cannot polynomially simulate each other.Our proofs also work for some generalizations of the CP* proof system. In particular, they work for CP* with a deduction rule, and also for any proof system that allows any formula with small communication complexity, and any set of sound rules of inference.

Introduction

2020 ◽  
pp. 1-6
Author(s):  
Peter Scholze ◽  
Jared Weinstein
Keyword(s):  
Moduli Spaces ◽  
Function Fields ◽  
Number Fields ◽  
Important Special Case ◽  
Langlands Correspondence ◽  
Key Innovation ◽  
Perfectoid Spaces ◽  
Definition Of ◽  
Special Case

This introductory chapter provides an overview of Drinfeld's work on the global Langlands correspondence over function fields. Whereas the global Langlands correspondence is largely open in the case of number fields K, it is a theorem for function fields, due to Drinfeld and L. Lafforgue. The key innovation in this case is Drinfeld's notion of an X-shtuka (or simply shtuka). The Langlands correspondence for X is obtained by studying moduli spaces of shtukas. A large part of this course is about the definition of perfectoid spaces and diamonds. There is an important special case where the moduli spaces of shtukas are classical rigid-analytic spaces. This is the case of local Shimura varieties. Some examples of these are the Rapoport-Zink spaces.

scholarly journals On value groups and residue fields of some valued function fields

1994 ◽  
Vol 37 (3) ◽  
pp. 445-454
Author(s):  
Sudesh K. Khanduja
Keyword(s):  
Cyclic Group ◽  
Function Field ◽  
Function Fields ◽  
Residue Field ◽  
Torsion Group ◽  
Transcendence Degree ◽  
Manuscripta Math ◽  
Direct Sum ◽  
Residue Fields ◽  
The One

Let K = K0(x, y) be a function field of transcendence degree one over a field K0 with x, y satisfying y2 = F(x), F(x) being any polynomial over K0. Let υ0 be a valuation of K0 having a residue field k0 and υ be a prolongation of υ to K with residue field k. In the present paper, it is proved that if G0⊆G are the value groups of υ0 and υ, then either G/G0 is a torsion group or there exists an (explicitly constructible) subgroup G1 of G containing G0 with [G1:G0]<∞ together with an element γ of G such that G is the direct sum of G1 and the cyclic group ℤγ. As regards the residue fields, a method of explicitly determining k has been described in case k/k0 is a non-algebraic extension and char k0≠2. The description leads to an inequality relating the genus of K/K0 with that of k/k0: this inequality is slightly stronger than the one implied by the well-known genus inequality (cf. [Manuscripta Math.65 (1989), 357–376’, [Manuscripta Math.58 (1987), 179–214]).

scholarly journals On the number of excursion sets of planar Gaussian fields

2020 ◽  
Vol 178 (3-4) ◽  
pp. 655-698
Author(s):  
Dmitry Beliaev ◽  
Michael McAuley ◽  
Stephen Muirhead
Keyword(s):  
Plane Wave ◽  
Lower Bounds ◽  
Upper And Lower Bounds ◽  
Gaussian Fields ◽  
Important Special Case ◽  
Level Densities ◽  
Excursion Sets ◽  
Nodal Set ◽  
Different Types ◽  
Special Case

Abstract The Nazarov–Sodin constant describes the average number of nodal set components of smooth Gaussian fields on large scales. We generalise this to a functional describing the corresponding number of level set components for arbitrary levels. Using results from Morse theory, we express this functional as an integral over the level densities of different types of critical points, and as a result deduce the absolute continuity of the functional as the level varies. We further give upper and lower bounds showing that the functional is at least bimodal for certain isotropic fields, including the important special case of the random plane wave.

scholarly journals On residually transcendental valued function fields of conics

1996 ◽  
Vol 38 (2) ◽  
pp. 137-145
Author(s):  
Sudesh K. Khanduja
Keyword(s):  
Valuation Ring ◽  
Function Fields ◽  
Residue Field ◽  
Field Extension ◽  
Transcendence Degree ◽  
Finitely Generated ◽  
Uniqueness Property ◽  
Transcendental Extension

Let K/Kobe a finitely generated field extension of transcendence degree 1. Let u0 be a valuation of Koand v a valuation of Kextending v0such that the residue field of vis a transcendental extension ofthe residue field k0of vo/such a prolongation vwill be called a residually transcendental prolongation of v0. Byan element with the uniqueness propertyfor (K, v)/(K0, v0) (or more briefly for v/v0)we mean an element / of Khaving u-valuation 0 which satisfies (i) the image of tunder the canonicalhomomorphism from the valuation ring of vonto the residue field of v(henceforth referred to as the v-residue ot t) is transcendental over ko; that is vcoincides with the Gaussian valuation on the subfield K0(t) defined by (ii) vis the only valuation of K (up to equivalence) extending the valuation .

SIMULATIONS OF UNARY ONE-WAY MULTI-HEAD FINITE AUTOMATA

2014 ◽  
Vol 25 (07) ◽  
pp. 877-896 ◽  
Author(s):  
MARTIN KUTRIB ◽  
ANDREAS MALCHER ◽  
MATTHIAS WENDLANDT
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Finite Automaton ◽  
Finite Automata ◽  
Upper And Lower Bounds ◽  
Unary Languages ◽  
Order Of Magnitude ◽  
Simulation Results ◽  
Special Case ◽  
Nondeterministic Finite Automaton

We investigate the descriptional complexity of deterministic one-way multi-head finite automata accepting unary languages. It is known that in this case the languages accepted are regular. Thus, we study the increase of the number of states when an n-state k-head finite automaton is simulated by a classical (one-head) deterministic or nondeterministic finite automaton. In the former case upper and lower bounds that are tight in the order of magnitude are shown. For the latter case we obtain an upper bound of O(n2k) and a lower bound of Ω(nk) states. We investigate also the costs for the conversion of one-head nondeterministic finite automata to deterministic k-head finite automata, that is, we trade nondeterminism for heads. In addition, we study how the conversion costs vary in the special case of finite and, in particular, of singleton unary lanuages. Finally, as an application of the simulation results, we show that decidability problems for unary deterministic k-head finite automata such as emptiness or equivalence are LOGSPACE-complete.

Sign in / Sign up

Export Citation Format

Share Document