𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Bose-Burton type theorem for quadrics

✍ Scribed by Klaus Metsch


Publisher
John Wiley and Sons
Year
2003
Tongue
English
Weight
224 KB
Volume
11
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

Let Q be a non‐degenerate quadric defined by a quadratic form in the finite projective space PG(d,q). Let r be the dimension of the generators of Q. For all k with 2 ≤ k < r we determine the smallest cardinality of a set B of points with the property that every subspace of dimension k that is contained in Q meets B. It turns out that the smallest examples consist of the non‐singular points of quadrics SQ for suitable subspaces S of codimension k of PG(d,q). For k = 1, the same result was known before. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 317–338, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/jcd.10051


📜 SIMILAR VOLUMES


A Fixed Point Theorem of Krasnoselskii—S
✍ T. A. Burton; Colleen Kirk 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 351 KB

In this paper we focus on three fixed point theorems and an integral equation. Schaefer's fixed point theorem will yield a Tperiodic solution of z(t) = a(t) + D(t, s)g(s, z(s)) ds 6, if D and g satisfy certain sign conditions independent of their magnitude. A combination of the contraction mapping t

A dirac-type theorem for squares of grap
✍ Tomasz Traczyk Jr. 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 221 KB

We prove that if G is a connected graph with p vertices and minimum degree greater than max( p/4 -1,3) then G2 is pancyclic. The result is best possible of its kind.

A Łoś type theorem for linear metric for
✍ Seyed-Mohammad Bagheri 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 223 KB

## Abstract We define an ultraproduct of metric structures based on a maximal probability charge and prove a variant of Łoś theorem for linear metric formulas. We also consider iterated ultraproducts (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

A Gallai–Edmonds-type structure theorem
✍ Bianca Spille; László Szegő 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

## Abstract As a generalization of matchings, Cunningham and Geelen introduced the notion of path‐matchings. We give a structure theorem for path‐matchings which generalizes the fundamental Gallai–Edmonds structure theorem for matchings. Our proof is purely combinatorial. © 2004 Wiley Periodicals,

A Capelli type theorem for multiplicativ
✍ Anca Iuliana Bonciocat; Nicolae Ciprian Bonciocat 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 190 KB

## Abstract We prove a Capelli type theorem on the canonical decomposition for multiplicative convolutions of polynomials. We derive then some irreducibility criteria for convolutions of polynomials in several variables over a given field. The irreducibility conditions are expressed only in terms o

A Kruskal–Katona Type Theorem for the Li
✍ S Bezrukov; A Blokhuis 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 154 KB

We present an analog of the well-known Kruskal-Katona theorem for the poset of subspaces of PG(n, 2) ordered by inclusion. For given k, (k < ) and m the problem is to find a family of size m in the set of -subspaces of PG(n, 2), containing the minimal number of k-subspaces. We introduce two lexicogr