共查询到20条相似文献,搜索用时 31 毫秒
1.
A compact set is staircase connected if every two points a, b ∈ S can be connected by an x-monotone and y-monotone polygonal path with sides parallel to the coordinate axes. In [5] we have introduced the concepts of staircase k-stars and kernels.
In this paper we prove that if the staircase k-kernel is not empty, then it can be expressed as the intersection of a covering family of maximal subsets of staircase diameter
k of S.
相似文献
2.
Strashimir G. Popvassilev 《Discrete and Computational Geometry》2008,40(2):279-288
We call a metric space X (m,n)-equidistant if, when A⊆X has exactly m points, there are exactly n points in X each of which is equidistant from (the points of) A. We prove that, for k≥2, the Euclidean space ℝ
k
contains an (m,1)-equidistant set if and only if k≥m. Although the sphere
is (3,2)-equidistant,
and ℝ4 contain no (4,2)-equidistant sets. We discuss related results about projective spaces, and state a conjecture about
analogous to the Double Midset Conjecture. 相似文献
3.
We establish the following Helly-type theorem: Let ${\cal K}$ be a family of
compact sets in $\mathbb{R}^d$. If every d + 1 (not necessarily
distinct) members of ${\cal K}$ intersect in a starshaped set whose kernel
contains a translate of set A, then
$\cap \{ K : K\; \hbox{in}\; {\cal K} \}$ also is a starshaped set whose kernel contains a
translate of A. An analogous result holds
when ${\cal K}$ is a finite family of closed sets in $\mathbb{R}^d$.
Moreover, we have the following planar result: Define function f on
$\{0, 1, 2\}$ by f(0) = f(2) = 3, f(1) = 4. Let ${\cal K}$ be a finite
family of closed sets in the plane. For k = 0, 1, 2, if every f(k)
(not necessarily distinct) members of ${\cal K}$ intersect in a starshaped set
whose kernel has dimension at least k,
then $\cap \{K : K\; \hbox{in}\; {\cal K}\}$ also is a starshaped set whose kernel has
dimension at least k. The number f(k) is best
in each case.Received: 4 June 2002 相似文献
4.
We investigate low degree rational cohomology groups of smooth compactifications of moduli spaces of curves with level structures.
In particular, we determine
Hk([`(S)]g, \mathbb Q){H^k\left({\bar S}_{g}, {\mathbb Q}\right)} for g ≥ 2 and k ≤ 3, where [`(S)]g{{\bar S}_{g}} denotes the moduli space of spin curves of genus g. 相似文献
5.
V. N. Potapov 《Mathematical Notes》2013,93(3-4):479-486
Let Σ be a finite set of cardinality k > 0, let $\mathbb{A}$ be a finite or infinite set of indices, and let $\mathcal{F} \subseteq \Sigma ^\mathbb{A}$ be a subset consisting of finitely supported families. A function $f:\Sigma ^\mathbb{A} \to \Sigma$ is referred to as an $\mathbb{A}$ -quasigroup (if $\left| \mathbb{A} \right| = n$ , then an n-ary quasigroup) of order k if $f\left( {\bar y} \right) \ne f\left( {\bar z} \right)$ for any ordered families $\bar y$ and $\bar z$ that differ at exactly one position. It is proved that an $\mathbb{A}$ -quasigroup f of order 4 is reducible (representable as a superposition) or semilinear on every coset of $\mathcal{F}$ . It is shown that the quasigroups defined on Σ?, where ? are positive integers, generate Lebesgue nonmeasurable subsets of the interval [0, 1]. 相似文献
6.
For the cyclotomic
\mathbb Z2{\mathbb Z_2}-extension k
∞ of an imaginary quadratic field k, we consider whether the Galois group G(k
∞) of the maximal unramified pro-2-extension over k
∞ is abelian or not. The group G(k
∞) is abelian if and only if the nth layer of the
\mathbb Z2{\mathbb {Z}_2}-extension has abelian 2-class field tower for all n ≥ 1. The purpose of this paper is to classify all such imaginary quadratic fields k in part by using Iwasawa polynomials. 相似文献
7.
Jed Yang 《Journal of Graph Theory》2010,63(4):338-348
A hypertournament or a k‐tournament, on n vertices, 2≤k≤n, is a pair T=(V, E), where the vertex set V is a set of size n and the edge set E is the collection of all possible subsets of size k of V, called the edges, each taken in one of its k! possible permutations. A k‐tournament is pancyclic if there exists (directed) cycles of all possible lengths; it is vertex‐pancyclic if moreover the cycles can be found through any vertex. A k‐tournament is strong if there is a path from u to v for each pair of distinct vertices u and v. A question posed by Gutin and Yeo about the characterization of pancyclic and vertex‐pancyclic hypertournaments is examined in this article. We extend Moon's Theorem for tournaments to hypertournaments. We prove that if k≥8 and n≥k + 3, then a k‐tournament on n vertices is vertex‐pancyclic if and only if it is strong. Similar results hold for other values of k. We also show that when n≥7, k≥4, and n≥k + 2, a strong k‐tournament on n vertices is pancyclic if and only if it is strong. The bound n≥k+ 2 is tight. We also find bounds for the generalized problem when we extend vertex‐pancyclicity to require d edge‐disjoint cycles of each possible length and extend strong connectivity to require d edge‐disjoint paths between each pair of vertices. Our results include and extend those of Petrovic and Thomassen. © 2009 Wiley Periodicals, Inc. J Graph Theory 63: 338–348, 2010 相似文献
8.
Dömötör Pálvölgyi 《Discrete and Computational Geometry》2010,44(3):577-588
We show that for any concave polygon that has no parallel sides and for any k, there is a k-fold covering of some point set by the translates of this polygon that cannot be decomposed into two coverings. Moreover,
we give a complete classification of open polygons with this property. We also construct for any polytope (having dimension
at least three) and for any k, a k-fold covering of the space by its translates that cannot be decomposed into two coverings. 相似文献
9.
Yolanda Fuertes 《Archiv der Mathematik》2010,95(1):15-18
Mestre has shown that if a hyperelliptic curve C of even genus is defined over a subfield
k ì \mathbbC{k \subset \mathbb{C}} then C can be hyperelliptically defined over the same field k. In this paper, for all genera g > 1, g o 1{g\equiv1} mod 4, hence odd, we construct an explicit hyperelliptic curve defined over
\mathbbQ{\mathbb{Q}} which can not be hyperelliptically defined over
\mathbbQ{\mathbb{Q}}. 相似文献
10.
Cristina Fernández-Córdoba Jaume Pujol Mercè Villanueva 《Designs, Codes and Cryptography》2010,56(1):43-59
A code C{{\mathcal C}} is
\mathbbZ2\mathbbZ4{{\mathbb{Z}_2\mathbb{Z}_4}}-additive if the set of coordinates can be partitioned into two subsets X and Y such that the punctured code of C{{\mathcal C}} by deleting the coordinates outside X (respectively, Y) is a binary linear code (respectively, a quaternary linear code). The corresponding binary codes of
\mathbbZ2\mathbbZ4{{\mathbb{Z}_2\mathbb{Z}_4}}-additive codes under an extended Gray map are called
\mathbbZ2\mathbbZ4{{\mathbb{Z}_2\mathbb{Z}_4}}-linear codes. In this paper, the invariants for
\mathbbZ2\mathbbZ4{{\mathbb{Z}_2\mathbb{Z}_4}}-linear codes, the rank and dimension of the kernel, are studied. Specifically, given the algebraic parameters of
\mathbbZ2\mathbbZ4{{\mathbb{Z}_2\mathbb{Z}_4}}-linear codes, the possible values of these two invariants, giving lower and upper bounds, are established. For each possible
rank r between these bounds, the construction of a
\mathbbZ2\mathbbZ4{{\mathbb{Z}_2\mathbb{Z}_4}}-linear code with rank r is given. Equivalently, for each possible dimension of the kernel k, the construction of a
\mathbbZ2\mathbbZ4{{\mathbb{Z}_2\mathbb{Z}_4}}-linear code with dimension of the kernel k is given. Finally, the bounds on the rank, once the kernel dimension is fixed, are established and the construction of a
\mathbbZ2\mathbbZ4{{\mathbb{Z}_2\mathbb{Z}_4}}-linear code for each possible pair (r, k) is given. 相似文献
11.
Carsten Thomassen 《Combinatorica》2001,21(2):321-333
Dedicated to the memory of Paul Erdős
A graph G is k-linked if G has at least 2k vertices, and, for any vertices , , ..., , , , ..., , G contains k pairwise disjoint paths such that joins for i = 1, 2, ..., k. We say that G is k-parity-linked if G is k-linked and, in addition, the paths can be chosen such that the parities of their lengths are prescribed. We prove the existence of a function g(k) such that every g(k)-connected graph is k-parity-linked if the deletion of any set of less than 4k-3 vertices leaves a nonbipartite graph. As a consequence, we obtain a result of Erdős–Pósa type for odd cycles in graphs
of large connectivity. Also, every -connected graph contains a totally odd -subdivision, that is, a subdivision of in which each edge of corresponds to an odd path, if and only if the deletion of any vertex leaves a nonbipartite graph.
Received May 13, 1999/Revised June 19, 2000 相似文献
12.
We prove a volume-rigidity theorem for Fuchsian representations of fundamental groups of hyperbolic k-manifolds into Isom
. Namely, we show that if M is a complete hyperbolic k-manifold with finite volume, then the volume of any representation of π1(M) into isom
, 3 ≤ k ≤ n, is less than the volume of M, and the volume is maximal if and only if the representation is discrete, faithful and ‘k-Fuchsian’
Stefano Francaviglia: Supported by an INdAM and a Marie Curie Intra European fellowship
Ben Klaff: Supported by a CIRGET fellowship and by the Chaire de Recherche du Canada en algèbre, combinatoire et informatique
mathématique de l’UQAM. 相似文献
13.
Let k be a field of characteristic 0 and let [`(k)] \bar{k} be a fixed algebraic closure of k. Let X be a smooth geometrically integral k-variety; we set [`(X)] = X ×k[`(k)] \bar{X} = X{ \times_k}\bar{k} and denote by [`(X)] \bar{X} . In [BvH2] we defined the extended Picard complex of X as the complex of Gal( [`(k)]