首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 62 毫秒
1.
If every k-membered subfamily of a family of plane convex bodies has a line transversal, then we say that this family has property T(k). We say that a family \({\mathcal{F}}\) has property \({T-m}\), if there exists a subfamily \({\mathcal{G} \subset \mathcal{F}}\) with \({|\mathcal{F} - \mathcal{G}| \le m}\) admitting a line transversal. Heppes [7] posed the problem whether there exists a convex body K in the plane such that if \({\mathcal{F}}\) is a finite T(3)-family of disjoint translates of K, then m = 3 is the smallest value for which \({\mathcal{F}}\) has property \({T-m}\). In this paper, we study this open problem in terms of finite T(3)-families of pairwise disjoint translates of a regular 2n-gon \({(n \ge 5)}\). We find out that, for \({5 \le n \le 34}\), the family has property \({T - 3}\) ; for \({n \ge 35}\), the family has property \({T - 2}\).  相似文献   

2.
What is the maximum of the sum of the pairwise (non-obtuse) angles formed by n lines in the Euclidean 3-space? This question was posed by Fejes Tóth in (Acta Math Acad Sci Hung 10:13–19, 1959). Fejes Tóth solved the problem for \({n \leq 6}\), and proved the asymptotic upper bound \({n^{2} \pi /5}\) as \({n \to \infty}\). He conjectured that the maximum is asymptotically equal to \({n^{2} \pi /6}\) as \({n \to \infty}\). The main result of this paper is an upper bound on the sum of the angles of n lines in the Euclidean 3-space that is asymptotically equal to \({3n^{2} \pi /16}\) as \({n \to \infty}\).  相似文献   

3.
The width w of a curve \(\gamma \) in Euclidean space \({\mathbf {R}}^n\) is the infimum of the distances between all pairs of parallel hyperplanes which bound \(\gamma \), while its inradius r is the supremum of the radii of all spheres which are contained in the convex hull of \(\gamma \) and are disjoint from \(\gamma \). We use a mixture of topological and integral geometric techniques, including an application of Borsuk Ulam theorem due to Wienholtz and Crofton’s formulas, to obtain lower bounds on the length of \(\gamma \) subject to constraints on r and w. The special case of closed curves is also considered in each category. Our estimates confirm some conjectures of Zalgaller up to 99% of their stated value, while we also disprove one of them.  相似文献   

4.
Let \(\mathbb {M}^d\) denote the d-dimensional Euclidean, hyperbolic, or spherical space. The r-dual set of a given set in \(\mathbb {M}^d\) is the intersection of balls of radii r centered at the points of the a given set. In this paper we prove that for any set of given volume in \(\mathbb {M}^d\) the volume of the r-dual set becomes maximal if the set is a ball. As an application we prove the following. The Kneser–Poulsen Conjecture states that if the centers of a family of N congruent balls in Euclidean d-space is contracted, then the volume of the intersection does not decrease. A uniform contraction is a contraction where all the pairwise distances in the first set of centers are larger than all the pairwise distances in the second set of centers, that is, when the pairwise distances of the two sets are separated by some positive real number. We prove a special case of the Kneser–Poulsen conjecture namely, we prove the conjecture for uniform contractions (with sufficiently large N) in \(\mathbb {M}^d\).  相似文献   

5.
A theorem of van der Waerden reads that an equilateral pentagon in Euclidean 3-space \({\mathbb {E}}^3\) with all diagonals of the same length is necessarily planar and its vertex set coincides with the vertex set of some convex regular pentagon. We prove the following many-dimensional analogue of this theorem: for \(n\geqslant 2,\) every n-dimensional cross-polytope in \({\mathbb {E}}^{2n-2}\) with all diagonals of the same length and all edges of the same length necessarily lies in \({\mathbb {E}}^n\) and hence is a convex regular cross-polytope. We also apply our theorem to the study of two-distance preserving mappings of Euclidean spaces.  相似文献   

6.
We prove the stability of the affirmative part of the solution to the complex Busemann–Petty problem. Namely, if K and L are origin-symmetric convex bodies in \({{\mathbb C}^n}\), n = 2 or n = 3, \({\varepsilon >0 }\) and \({{\rm Vol}_{2n-2}(K\cap H) \le {\rm Vol}_{2n-2}(L \cap H) + \varepsilon}\) for any complex hyperplane H in \({{\mathbb C}^n}\) , then \({({\rm Vol}_{2n}(K))^{\frac{n-1}n}\le({\rm Vol}_{2n}(L))^{\frac{n-1}n} + \varepsilon}\) , where Vol2n is the volume in \({{\mathbb C}^n}\) , which is identified with \({{\mathbb R}^{2n}}\) in the natural way.  相似文献   

7.
A well-known result of Kupitz from 1982 asserts that the maximal number of edges in a convex geometric graph (CGG) on n vertices that does not contain \(k+1\) pairwise disjoint edges is kn (provided \(n>2k\)). For \(k=1\) and \(k=n/2-1\), the extremal examples are completely characterized. For all other values of k, the structure of the extremal examples is far from known: their total number is unknown, and only a few classes of examples were presented, that are almost symmetric, consisting roughly of the kn “longest possible” edges of CK(n), the complete CGG of order n. In order to understand further the structure of the extremal examples, we present a class of extremal examples that lie at the other end of the spectrum. Namely, we break the symmetry by requiring that, in addition, the graph admit an independent set that consists of q consecutive vertices on the boundary of the convex hull. We show that such graphs exist as long as \(q \le n-2k\) and that this value of q is optimal. We generalize our discussion to the following question: what is the maximal possible number f(nkq) of edges in a CGG on n vertices that does not contain \(k+1\) pairwise disjoint edges, and, in addition, admits an independent set that consists of q consecutive vertices on the boundary of the convex hull? We provide a complete answer to this question, determining f(nkq) for all relevant values of nk and q.  相似文献   

8.
An asymptotic formula for the mean value of the V. I. Arnold function A(n) = \(\tfrac{{\sigma (n)}}{{\tau (n)}}\) is obtained, here σ(n) = \(\mathop \Sigma \limits_{d|n} \) d is the sum of all divisors of the number n, τ (n) = \(\mathop \Sigma \limits_{d|n} \) 1 is their quantity.  相似文献   

9.
Let I be an interval. We consider the non-monotonic convex self-mappings \(f:I\rightarrow I\) such that \(f^2\) is convex. They have the property that all iterates \(f^n\) are convex. In the class of these mappings we study three families of functions possessing convex iterative roots. A function f is said to be iteratively convex if f possesses convex iterative roots of all orders. A mapping f is said to be dyadically convex if for every \(n\ge 2\) there exists a convex iterative root \(f^{1/2^n}\) of order \(2^n\) and the sequence \(\{f^{1/2^n}\}\) satisfies the condition of compatibility, that is \( f^{1/2^n}\circ f^{1/2^n}= f^{1/2^{n-1}}.\) A function f is said to be flowly convex if it possesses a convex semi-flow of f, that is a family of convex functions \(\{f^t,t>0\}\) such that \(f^t\circ f^s=f^{t+s}, \ \ t,s >0\) and \(f^1=f\). We show the relations among these three types of convexity and we determine all convex iterative roots of non-monotonic functions.  相似文献   

10.
In the Hyperbolic space \({\mathbb{H}^n}\) (n ≥ 3) there are uncountably many topological types of convex hypersurfaces. When is a locally convex hypersurface in \({\mathbb{H}^n}\) globally convex, that is, when does it bound a convex set? We prove that any locally convex proper embedding of an (n ? 1)-dimensional connected manifold is the boundary of a convex set whenever the complement of (n ? 1)-flats of the resulting hypersurface is connected.  相似文献   

11.
Dror Varolin 《Mathematische Annalen》2016,365(3-4):1137-1154
Let M be a 3-manifold with torus boundary components \(T_{1}\) and \(T_2\). Let \(\phi :T_{1} \rightarrow T_{2}\) be a homeomorphism, \(M_\phi \) the manifold obtained from M by gluing \(T_{1}\) to \(T_{2}\) via the map \(\phi \), and T the image of \(T_{1}\) in \(M_\phi \). We show that if \(\phi \) is “sufficiently complicated” then any incompressible or strongly irreducible surface in \(M_\phi \) can be isotoped to be disjoint from T. It follows that every Heegaard splitting of a 3-manifold admitting a “sufficiently complicated” JSJ decomposition is an amalgamation of Heegaard splittings of the components of the JSJ decomposition.  相似文献   

12.
The skeleton of a polyhedral set is the union of its edges and vertices. Let \(\mathcal {P}\) be a set of fat, convex polytopes in three dimensions with n vertices in total, and let f max be the maximum complexity of any face of a polytope in \(\mathcal {P}\). We prove that the total length of the skeleton of the union of the polytopes in \(\mathcal {P}\) is at most O(α(n)?log? n?logf max) times the sum of the skeleton lengths of the individual polytopes.  相似文献   

13.
Let Q0 be the classical generalized quadrangle of order q = 2n(n≥2) arising from a non-degenerate quadratic form in a 5-dimensional vector space defined over a finite field of order q. We consider the rank two geometry \(\mathcal {X}\) having as points all the elliptic ovoids of Q0 and as lines the maximal pencils of elliptic ovoids of Q0 pairwise tangent at the same point. We first prove that \(\mathcal {X}\) is isomorphic to a 2-fold quotient of the affine generalized quadrangle Q?Q0, where Q is the classical (q,q2)-generalized quadrangle admitting Q0 as a hyperplane. Further, we classify the cliques in the collinearity graph Γ of \(\mathcal {X}\). We prove that any maximal clique in Γ is either a line of \(\mathcal {X}\) or it consists of 6 or 4 points of \(\mathcal {X}\) not contained in any line of \(\mathcal {X}\), accordingly as n is odd or even. We count the number of cliques of each type and show that those cliques which are not contained in lines of \(\mathcal {X}\) arise as subgeometries of Q defined over \(\mathbb {F}_{2}\).  相似文献   

14.
Let \(n \ge r \ge s \ge 0\) be integers and \(\mathcal {F}\) a family of r-subsets of [n]. Let \(W_{r,s}^{\mathcal {F}}\) be the higher inclusion matrix of the subsets in \({{\mathcal {F}}}\) vs. the s-subsets of [n]. When \(\mathcal {F}\) consists of all r-subsets of [n], we shall simply write \(W_{r,s}\) in place of \(W_{r,s}^{\mathcal {F}}\). In this paper we prove that the rank of the higher inclusion matrix \(W_{r,s}\) over an arbitrary field K is resilient. That is, if the size of \(\mathcal {F}\) is “close” to \({n \atopwithdelims ()r}\) then \({{\mathrm{rank}}}_{K}( W_{r,s}^{\mathcal {F}}) = {{\mathrm{rank}}}_{K}(W_{r,s})\), where K is an arbitrary field. Furthermore, we prove that the rank (over a field K) of the higher inclusion matrix of r-subspaces vs. s-subspaces of an n-dimensional vector space over \({\mathbb {F}}_q\) is also resilient if \(\mathrm{char}(K)\) is coprime to q.  相似文献   

15.
The anti-Ramsey number, AR(nG), for a graph G and an integer \(n\ge |V(G)|\), is defined to be the minimal integer r such that in any edge-colouring of \(K_n\) by at least r colours there is a multicoloured copy of G, namely, a copy of G that each of its edges has a distinct colour. In this paper we determine, for large enough \(n,\, AR(n,L\cup tP_2)\) and \(AR(n,L\cup kP_3)\) for any large enough t and k, and a graph L satisfying some conditions. Consequently, we determine AR(nG), for large enough n, where G is \(P_3\cup tP_2\) for any \(t\ge 3,\, P_4\cup tP_2\) and \(C_3\cup tP_2\) for any \(t\ge 2,\, kP_3\) for any \(k\ge 3,\, tP_2\cup kP_3\) for any \(t\ge 1,\, k\ge 2\), and \(P_{t+1}\cup kP_3\) for any \(t\ge 3,\, k\ge 1\). Furthermore, we obtain upper and lower bounds for AR(nG), for large enough n, where G is \(P_{k+1}\cup tP_2\) and \(C_k\cup tP_2\) for any \(k\ge 4,\, t\ge 1\).  相似文献   

16.
Let q be a power of a prime p, and let \(r=nk+1\) be a prime such that \(r\not \mid q\), where n and k are positive integers. Under a simple condition on q, r and k, a Gauss period of type (nk) is a normal element of \({\mathbb {F}}_{q}^{n}\) over \({\mathbb {F}}_q\); the complexity of the resulting normal basis of \({\mathbb {F}}_{q}^{n}\) over \({\mathbb {F}}_q\) is denoted by C(nkp). Recent works determined C(nkp) for \(k\le 7\) and all qualified n and q. In this paper, we show that for any given \(k>0\), C(nkp) is given by an explicit formula except for finitely many primes \(r=nk+1\) and the exceptional primes are easily determined. Moreover, we describe an algorithm that allows one to compute C(nkp) for the exceptional primes \(r=nk+1\). Our numerical results cover C(nkp) for \(k\le 20\) and all qualified n and q.  相似文献   

17.
18.
For any positive integer n, let \(\sigma (\mathrm{n})\) and p(n) denote the sum of divisors and the least prime divisor of n respectively. Let a, b be positive integers. In this paper we prove the following two results: (i) If 4 | a and \(\gcd (a, b)=1\), then a and b do not satisfy \(\sigma (a)= \sigma (b)=a+b\). (ii) If \(a>10^{8}\) and \(p(a)>2\log _{2}a+1\), where \(\log _{2}{a}\) is the logarithm of a with base 2, then a and b do not satisfy \(\sigma (a)=\sigma (b)=a+b+\lambda \), where \(\lambda \in \{0,\pm 1\}\).  相似文献   

19.
In cluster categories, mutation of torsion pairs provides a generalisation for the mutation of cluster tilting subcategories, which models the combinatorial structure of cluster algebras. In this paper we present a geometric model for mutation of torsion pairs in the cluster category \(\mathcal {C}_{D_{n}}\) of Dynkin type D n . Using a combinatorial model introduced by Fomin and Zelevinsky in [7], subcategories in \(\mathcal {C}_{D_{n}}\) correspond to rotationally invariant collections of arcs in a regular 2n-gon, called diagrams of Dynkin type D n . Torsion pairs in \(\mathcal {C}_{D_{n}}\) have been classified by Holm, Jørgensen and Rubey in [10] and correspond to diagrams of Dynkin type D n satisfying a certain combinatorial condition, called Ptolemy diagrams of Dynkin type D n . We define mutation of a diagram \(\mathcal {X}\) of Dynkin type D n with respect to a compatible diagram \(\mathcal {D}\) of Dynkin type D n consisting of pairwise non-crossing arcs. Such a diagram \(\mathcal {D}\) partitions the regular 2n-gon into cells and mutation of \(\mathcal {X}\) with respect to \(\mathcal {D}\) can be thought of as a rotation of each of these cells. We show that mutation of Ptolemy diagrams of Dynkin type D n corresponds to mutation of the corresponding torsion pairs in the cluster category of Dynkin type D n .  相似文献   

20.
For an integer N greater than 5 and a triple \({\mathfrak{a}}=[a_{1},a_{2},a_{3}]\) of integers with the properties 0<a i N/2 and a i a j for ij, we consider a modular function \(W_{\mathfrak{a}}(\tau)=\frac{\wp (a_{1}/N;L_{\tau})-\wp (a_{3}/N;L_{\tau})}{\wp (a_{2}/N;L_{\tau})-\wp(a_{3}/N;L_{\tau})}\) for the modular group Γ 1(N), where ?(z;L τ ) is the Weierstrass ?-function relative to the lattice L τ generated by 1 and a complex number τ with positive imaginary part. For a pair of such triples \({\mathfrak{A}}=[{\mathfrak{a}},{\mathfrak{b}}]\) and a pair of non-negative integers F=[m,n], we define a modular function \(T_{{\mathfrak{A}},F}\) for the group Γ 0(N) as the trace of the product \(W_{\mathfrak{a}}^{m}W_{\mathfrak{b}}^{n}\) to the modular function field of Γ 0(N). In this article, we study the integrality of singular values of the functions \(W_{\mathfrak{a}}\) and \(T_{{\mathfrak{A}},F}\) by using their modular equations. We prove that the functions \(T_{{\mathfrak{A}},F}\) for suitably chosen \({\mathfrak{A}}\) and F generate the modular function field of Γ 0(N), and from Shimura reciprocity and Gee–Stevenhagen method we obtain that singular values \(T_{{\mathfrak{A}},F}(\tau)\) for suitably chosen \({\mathfrak{A}}\) and F generate ring class fields. Further, we study the class polynomial of \(T_{{\mathfrak{A}},F}\) for Schertz N-system.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号