A note on uniform definability and minimal fields of definition

2000 ◽  
Vol 65 (2) ◽  
pp. 817-821
Author(s):  
Rahim Moosa

Let k ⊂ K be a field extension, where K is an algebraically closed field of any characteristic and k is the prime field. Recall the following property of Hilbert Schemes (see, for example, [1], Proposition 1.16): Suppose ⊂ × S is a flat family of closed subschemes of parametrised by a scheme S/k. Then for every closed subscheme Z ⊂ in , if [Z] denotes the Hilbert point of Z in Hilb() then the residue field of Hilb() at [Z] is the minimal field of definition for Z. Intuitively, this says that as a family parametrised by Hilb(), each fibre of lies above a point whose “co-ordinates” generate its minimal field of definition.In the following note we are concerned with a more naive form of the above situation, for which we wish to give an elementary account. Suppose ϕ(x,y) is a system of polynomial equations over k (in variables x = (x1,…, xm) and parameters y = (y1, …, yn)), such thatis a family of (possibly reducible) affine varieties in Km. Each nonempty member of this family has a unique minimal field of definition. The question arises as to whether it is possible to express this family of varieties using parameters that come, pointwise, from these minimal fields of definition. That is, is there a system of polynomial equations ψ(x, z) over k, such that each ψ(x, b) with b ∈ KN is of the form Va for some a ∈ Kn; and such that each Va ∈ is defined by ψ(x, b) for some b ∈ KN whose coordinates generate the minimal field of definition for Va? Moreover, we would like b to be obtained definably from a.

Author(s):  
Amir Akbary ◽  
Peng-Jie Wong

Let [Formula: see text] be the group of [Formula: see text]-torsion points of a commutative algebraic group [Formula: see text] defined over a number field [Formula: see text]. For a prime [Formula: see text] of [Formula: see text], we let [Formula: see text] be the number of [Formula: see text]-solutions of the system of polynomial equations defining [Formula: see text] when reduced modulo [Formula: see text]. Here, [Formula: see text] is the residue field at [Formula: see text]. Let [Formula: see text] denote the number of primes [Formula: see text] of [Formula: see text] such that [Formula: see text]. We then, for algebraic groups of dimension one, compute the [Formula: see text]th moment limit [Formula: see text] by appealing to the Chebotarev density theorem. We further interpret this limit as the number of orbits of the action of the absolute Galois group of [Formula: see text] on [Formula: see text] copies of [Formula: see text] by an application of Burnside’s Lemma. These concrete examples suggest a possible approach for determining the number of orbits of a group acting on [Formula: see text] copies of a set.


2016 ◽  
Vol 81 (3) ◽  
pp. 1115-1123
Author(s):  
G. IGUSA ◽  
J. F. KNIGHT

AbstractSchweber [10] defined a reducibility that allows us to compare the computing power of structures of arbitrary cardinality. Here we focus on the ordered field ${\cal R}$ of real numbers and a structure ${\cal W}$ that just codes the subsets of ω. In [10], it was observed that ${\cal W}$ is reducible to ${\cal R}$. We prove that ${\cal R}$ is not reducible to ${\cal W}$. As part of the proof, we show that for a countable recursively saturated real closed field ${\cal P}$ with residue field k, some copy of ${\cal P}$ does not compute a copy of k.


2014 ◽  
Vol 13 (06) ◽  
pp. 1450013 ◽  
Author(s):  
Francis N. Castro ◽  
Ivelisse M. Rubio

We present an elementary method to compute the exact p-divisibility of exponential sums of systems of polynomial equations over the prime field. Our results extend results by Carlitz and provide concrete and simple conditions to construct families of polynomial equations that are solvable over the prime field.


1968 ◽  
Vol 9 (2) ◽  
pp. 146-151 ◽  
Author(s):  
F. J. Rayner

Letkbe any algebraically closed field, and denote byk((t)) the field of formal power series in one indeterminatetoverk. Letso thatKis the field of Puiseux expansions with coefficients ink(each element ofKis a formal power series intl/rfor some positive integerr). It is well-known thatKis algebraically closed if and only ifkis of characteristic zero [1, p. 61]. For examples relating to ramified extensions of fields with valuation [9, §6] it is useful to have a field analogous toKwhich is algebraically closed whenkhas non-zero characteristicp. In this paper, I prove that the setLof all formal power series of the form Σaitei(where (ei) is well-ordered,ei=mi|nprt,n∈ Ζ,mi∈ Ζ,ai∈k,ri∈ Ν) forms an algebraically closed field.


2009 ◽  
Vol 47 (5) ◽  
pp. 3608-3623 ◽  
Author(s):  
Daniel J. Bates ◽  
Jonathan D. Hauenstein ◽  
Chris Peterson ◽  
Andrew J. Sommese

Author(s):  
I. Nikitin

Given a bivariate system of polynomial equations with fixed support sets [Formula: see text] it is natural to ask which multiplicities its solutions can have. We prove that there exists a system with a solution of multiplicity [Formula: see text] for all [Formula: see text] in the range [Formula: see text], where [Formula: see text] is the set of all integral vectors that shift B to a subset of [Formula: see text]. As an application, we classify all pairs [Formula: see text] such that the system supported at [Formula: see text] does not have a solution of multiplicity higher than [Formula: see text].


Author(s):  
Matthias Aschenbrenner ◽  
Lou van den Dries ◽  
Joris van der Hoeven

This chapter deals with valued differential fields, starting the discussion with an overview of the asymptotic behavior of the function vsubscript P: Γ‎ → Γ‎ for homogeneous P ∈ K K{Y}superscript Not Equal To. The chapter then shows that the derivation of any valued differential field extension of K that is algebraic over K is also small. It also explains how differential field extensions of the residue field k give rise to valued differential field extensions of K with small derivation and the same value group. Finally, it discusses asymptotic couples, dominant part, the Equalizer Theorem, pseudocauchy sequences, and the construction of canonical immediate extensions.


2018 ◽  
Vol 61 (3) ◽  
pp. 673-703 ◽  
Author(s):  
Benjamin Klopsch ◽  
Anitha Thillaisundaram

AbstractLet p ≥ 3 be a prime. A generalized multi-edge spinal group $$G = \langle \{ a\} \cup \{ b_i^{(j)} {\rm \mid }1 \le j \le p,\, 1 \le i \le r_j\} \rangle \le {\rm Aut}(T)$$ is a subgroup of the automorphism group of a regular p-adic rooted tree T that is generated by one rooted automorphism a and p families $b^{(j)}_{1}, \ldots, b^{(j)}_{r_{j}}$ of directed automorphisms, each family sharing a common directed path disjoint from the paths of the other families. This notion generalizes the concepts of multi-edge spinal groups, including the widely studied GGS groups (named after Grigorchuk, Gupta and Sidki), and extended Gupta–Sidki groups that were introduced by Pervova [‘Profinite completions of some groups acting on trees, J. Algebra310 (2007), 858–879’]. Extending techniques that were developed in these more special cases, we prove: generalized multi-edge spinal groups that are torsion have no maximal subgroups of infinite index. Furthermore, we use tree enveloping algebras, which were introduced by Sidki [‘A primitive ring associated to a Burnside 3-group, J. London Math. Soc.55 (1997), 55–64’] and Bartholdi [‘Branch rings, thinned rings, tree enveloping rings, Israel J. Math.154 (2006), 93–139’], to show that certain generalized multi-edge spinal groups admit faithful infinite-dimensional irreducible representations over the prime field ℤ/pℤ.


2018 ◽  
Vol 0 (0) ◽  
Author(s):  
Matvei Kotov ◽  
Dmitry Panteleev ◽  
Alexander Ushakov

Abstract We investigate security properties of two secret-sharing protocols proposed by Fine, Moldenhauer, and Rosenberger in Sections 4 and 5 of [B. Fine, A. Moldenhauer and G. Rosenberger, Cryptographic protocols based on Nielsen transformations, J. Comput. Comm. 4 2016, 63–107] (Protocols I and II resp.). For both protocols, we consider a one missing share challenge. We show that Protocol I can be reduced to a system of polynomial equations and (for most randomly generated instances) solved by the computer algebra system Singular. Protocol II is approached using the technique of Stallings’ graphs. We show that knowledge of {m-1} shares reduces the space of possible values of a secret to a set of polynomial size.


Sign in / Sign up

Export Citation Format

Share Document