scholarly journals Lines in Higgledy-Piggledy Arrangement

10.37236/4149 ◽  
2014 ◽  
Vol 21 (2) ◽  
Author(s):  
Szabolcs L. Fancsali ◽  
Péter Sziklai
Keyword(s):  
Lower Bound ◽  
Closed Fields ◽  
Algebraically Closed Fields ◽  
Set Of Points

In this article, we examine sets of lines in $\mathsf{PG}(d,\mathbb{F})$ meeting each hyperplane in a generator set of points. We prove that such a set has to contain at least $\lfloor1.5d\rfloor$ lines if the field $\mathbb{F}$ has at least $\lfloor1.5d\rfloor$ elements, and at least $2d-1$ lines if the field $\mathbb{F}$ is algebraically closed. We show that suitable $2d-1$ lines constitute such a set (if $|\mathbb{F}|\ge2d-1$), proving that the lower bound is tight over algebraically closed fields. At last, we will see that the strong $(s,A)$ subspace designs constructed by Guruswami and Kopparty have better (smaller) parameter $A$ than one would think at first sight.

Recursion theory in a lower semilattice

1992 ◽  
Vol 57 (3) ◽  
pp. 892-911 ◽  
Author(s):  
Alex Feldman
Keyword(s):  
Lower Bound ◽  
Partial Order ◽  
Algebraic Structure ◽  
Algebraic Closure ◽  
Recursion Theory ◽  
Vector Spaces ◽  
Algebraic Structures ◽  
Recursively Enumerable ◽  
Closed Fields ◽  
Algebraically Closed Fields

In §3 we construct a universal, ℵ0-categorical recursively presented partial order with greatest lower bound operator. This gives us the unique structure which embeds every countable lower semilattice. In §§5 and 6 we investigate the recursive and recursively enumerable substructures of this structure, in particular finding a suitable definition for the simple-maximal hierarchy and giving an example of an infinite recursively enumerable substructure which does not contain any infinite recursive substructure.The idea of looking at the lattice of recursively enumerable substructures of some recursive algebraic structure was introduced by Metakides and Nerode in [5], and since then many different kinds of algebraic structures have been studied in this way, including vector spaces, Boolean algebras, groups, algebraically closed fields, and equivalence relations. Since different algebraic structures have different recursion theoretic properties, one natural question is whether an algebraic structure with relatively little structure (such as a partial order or an equivalence relation) exhibits behavior more like classical recursion theory than one with more structure (such as vector spaces or algebraically closed fields).In [6] and [7], Metakides and Remmel studied recursion theory on orderings, and, as they point out in [6], orderings differ from most other algebraic structures in that the algebraic closure operation on orderings is trivial; but this does not present a problem for them, given the questions they explore. Moreover, they take an approach of proving general theorems which can then be applied to specific orderings. Our tack is different, although also well-established (see, for example, [3]), in which a “largest” structure is defined (in §3) which corresponds to the natural numbers in classical recursion theory. In order to distinguish substructures from subsets, a function symbol is added, namely greatest lower bound. The greatest lower bound function is fundamental to the study of orderings and occurs naturally in many of them, and thus is an appropriate addition to the theory of orderings. In §4 we redefine the concepts of simple and maximal in a manner appropriate to this structure, and prove several existence theorems.

scholarly journals Perfect pseudo-algebraically closed fields are algebraically bounded

2004 ◽  
Vol 271 (2) ◽  
pp. 627-637 ◽  
Author(s):  
Zoé Chatzidakis ◽  
Ehud Hrushovski
Keyword(s):  
Closed Fields ◽  
Algebraically Closed Fields

scholarly journals Nilpotent orbits of exceptional Lie algebras over algebraically closed fields of bad characteristic

1985 ◽  
Vol 38 (3) ◽  
pp. 330-350 ◽  
Author(s):  
D. F. Holt ◽  
N. Spaltenstein
Keyword(s):  
Finite Field ◽  
Lie Algebras ◽  
Closed Field ◽  
Nilpotent Orbits ◽  
Reductive Algebraic Group ◽  
Exceptional Lie Algebras ◽  
Closed Fields ◽  
Characteristic 3 ◽  
Algebraically Closed Fields

AbstractThe classification of the nilpotent orbits in the Lie algebra of a reductive algebraic group (over an algebraically closed field) is given in all the cases where it was not previously known (E7 and E8 in bad characteristic, F4 in characteristic 3). The paper exploits the tight relation with the corresponding situation over a finite field. A computer is used to study this case for suitable choices of the finite field.

scholarly journals Finding Points in General Position

2017 ◽  
Vol 27 (04) ◽  
pp. 277-296 ◽  
Author(s):  
Vincent Froese ◽  
Iyad Kanj ◽  
André Nichterlein ◽  
Rolf Niedermeier
Keyword(s):  
Lower Bound ◽  
General Position ◽  
Subset Selection ◽  
Selection Problem ◽  
Fixed Parameter Tractability ◽  
Maximum Cardinality ◽  
Exponential Time ◽  
Running Time ◽  
Fixed Parameter ◽  
Set Of Points

We study the General Position Subset Selection problem: Given a set of points in the plane, find a maximum-cardinality subset of points in general position. We prove that General Position Subset Selection is NP-hard, APX-hard, and present several fixed-parameter tractability results for the problem as well as a subexponential running time lower bound based on the Exponential Time Hypothesis.

scholarly journals Adelic descent theory

2017 ◽  
Vol 153 (8) ◽  
pp. 1706-1746
Author(s):  
Michael Groechenig
Keyword(s):  
Vector Bundles ◽  
Continuous Functions ◽  
Topological Spaces ◽  
Reductive Algebraic Group ◽  
Perfect Complexes ◽  
Descent Theory ◽  
Closed Fields ◽  
Ring Of Continuous Functions ◽  
Reconstruction Theorem ◽  
Algebraically Closed Fields

A result of André Weil allows one to describe rank $n$ vector bundles on a smooth complete algebraic curve up to isomorphism via a double quotient of the set $\text{GL}_{n}(\mathbb{A})$ of regular matrices over the ring of adèles (over algebraically closed fields, this result is also known to extend to $G$-torsors for a reductive algebraic group $G$). In the present paper we develop analogous adelic descriptions for vector and principal bundles on arbitrary Noetherian schemes, by proving an adelic descent theorem for perfect complexes. We show that for Beilinson’s co-simplicial ring of adèles $\mathbb{A}_{X}^{\bullet }$, we have an equivalence $\mathsf{Perf}(X)\simeq |\mathsf{Perf}(\mathbb{A}_{X}^{\bullet })|$ between perfect complexes on $X$ and cartesian perfect complexes for $\mathbb{A}_{X}^{\bullet }$. Using the Tannakian formalism for symmetric monoidal $\infty$-categories, we conclude that a Noetherian scheme can be reconstructed from the co-simplicial ring of adèles. We view this statement as a scheme-theoretic analogue of Gelfand–Naimark’s reconstruction theorem for locally compact topological spaces from their ring of continuous functions. Several results for categories of perfect complexes over (a strong form of) flasque sheaves of algebras are established, which might be of independent interest.

scholarly journals Intersections of algebraically closed fields

1986 ◽  
Vol 30 (2) ◽  
pp. 103-119 ◽  
Author(s):  
C.J. Ash ◽  
John W. Rosenthal
Keyword(s):  
Closed Fields ◽  
Algebraically Closed Fields
Sign in / Sign up

Export Citation Format

Share Document