Results 1  10
of
662,239
SURFACE OVER AN ARBITRARY FIELD
"... A derived equivalence for a degree 6 del Pezzo surface over an arbitrary field Citation for published version: ..."
Abstract
 Add to MetaCart
A derived equivalence for a degree 6 del Pezzo surface over an arbitrary field Citation for published version:
Springer’s regular elements over arbitrary fields
, 2004
"... Abstract. Springer’s theory of regular elements in complex reflection groups is generalized to arbitrary fields. Consequences for the cyclic sieving phenomenon in combinatorics are discussed. 1. ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
Abstract. Springer’s theory of regular elements in complex reflection groups is generalized to arbitrary fields. Consequences for the cyclic sieving phenomenon in combinatorics are discussed. 1.
GALOIS THEORY FOR ARBITRARY FIELD EXTENSIONS
"... 1.2. Three flavors of Galois extensions 2 1.3. Galois theory for algebraic extensions 3 ..."
Abstract
 Add to MetaCart
1.2. Three flavors of Galois extensions 2 1.3. Galois theory for algebraic extensions 3
Light Field Rendering
, 1996
"... A number of techniques have been proposed for flying through scenes by redisplaying previously rendered or digitized views. Techniques have also been proposed for interpolating between views by warping input images, using depth information or correspondences between multiple images. In this paper, w ..."
Abstract

Cited by 1330 (22 self)
 Add to MetaCart
, we describe a simple and robust method for generating new views from arbitrary camera positions without depth information or feature matching, simply by combining and resampling the available images. The key to this technique lies in interpreting the input images as 2D slices of a 4D function
Groups of type E7 over arbitrary fields
 Comm. Algebra
"... Abstract. Freudenthal triple systems come in two flavors, degenerate and nondegenerate. The best criterion for distinguishing between the two which is available in the literature is by descent. We provide an identity which is satisfied only by nondegenerate triple systems. We then use this to define ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
this to define algebraic structures whose automorphism groups produce all adjoint algebraic groups of type E7 over an arbitrary field of characteristic ̸ = 2, 3. The main advantage of these new structures is that they incorporate a previously unconsidered invariant (a symplectic involution) of these groups in a
CHAPTER V Algebraic Groups over Arbitrary Fields
"... In this chapter, we study algebraic groups, especially nonsplit reductive groups, over arbitrary fields. The algebraic groups over a field k that become isomorphic to a fixed algebraic group over kal are classified by a certain cohomology group. In the first section, we explain this, and discuss wha ..."
Abstract
 Add to MetaCart
In this chapter, we study algebraic groups, especially nonsplit reductive groups, over arbitrary fields. The algebraic groups over a field k that become isomorphic to a fixed algebraic group over kal are classified by a certain cohomology group. In the first section, we explain this, and discuss
Axiomatic quantum field theory in curved spacetime
, 2008
"... The usual formulations of quantum field theory in Minkowski spacetime make crucial use of features—such as Poincare invariance and the existence of a preferred vacuum state—that are very special to Minkowski spacetime. In order to generalize the formulation of quantum field theory to arbitrary globa ..."
Abstract

Cited by 683 (18 self)
 Add to MetaCart
The usual formulations of quantum field theory in Minkowski spacetime make crucial use of features—such as Poincare invariance and the existence of a preferred vacuum state—that are very special to Minkowski spacetime. In order to generalize the formulation of quantum field theory to arbitrary
Minimum rank of a tree over an arbitrary field
, 2007
"... For a field F and graph G of order n, the minimum rank of G over F is defined to be the smallest possible rank over all symmetric matrices A ∈ Fn×n whose (i, j)th entry (for i = j) is nonzero whenever {i, j} is an edge in G and is zero otherwise. It is shown that the minimum rank of a tree is indep ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
For a field F and graph G of order n, the minimum rank of G over F is defined to be the smallest possible rank over all symmetric matrices A ∈ Fn×n whose (i, j)th entry (for i = j) is nonzero whenever {i, j} is an edge in G and is zero otherwise. It is shown that the minimum rank of a tree
Results 1  10
of
662,239