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 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 S ∩ Q 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
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.
## 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)
## 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,
## 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
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