Browse

You are looking at 31 - 40 of 11,145 items for :

  • Mathematics and Statistics x
  • Refine by Access: All Content x
Clear All
Studia Scientiarum Mathematicarum Hungarica
Authors:
Sophie Leuchtner
,
Carlos M. Nicolás
, and
Andrew Suk

Given a finite point set P in the plane, a subset S⊆P is called an island in P if conv(S) ⋂ P = S. We say that S ⊂ P is a visible island if the points in S are pairwise visible and S is an island in P. The famous Big-line Big-clique Conjecture states that for any k ≥ 3 and l ≥ 4, there is an integer n = n(k, l), such that every finite set of at least n points in the plane contains l collinear points or k pairwise visible points. In this paper, we show that this conjecture is false for visible islands, by replacing each point in a Horton set by a triple of collinear points. Hence, there are arbitrarily large finite point sets in the plane with no 4 collinear members and no visible island of size 13.

Restricted access

In this article, we define the notion of a generalized open book of a n-manifold over the k−sphere Sk , k < n. We discuss Lefschetz open book embeddings of Lefschetz open books of closed oriented 4-manifolds into the trivial open book over S2 of the 7−sphere S7 . If X is the double of a bounded achiral Lefschetz fibration over D2 , then X naturally admits a Lefschetz open book given by the bounded achiral Lefschetz fibration. We show that this natural Lefschetz open book of X admits a Lefschetz open book embedding into the trivial open book over S2 of the 7−sphere S7 .

Restricted access

We show that if a non-degenerate PL map f : NM lifts to a topological embedding in M × k then it lifts to a PL embedding in there. We also show that if a stable smooth map Nn Mm, mn, lifts to a topological embedding in M × , then it lifts to a smooth embedding in there.

Restricted access

This short note deals with polynomial interpolation of complex numbers verifying a Lipschitz condition, performed on consecutive points of a given sequence in the plane. We are interested in those sequences which provide a bound of the error at the first uninterpolated point, depending only on its distance to the last interpolated one.

Open access

For a lattice L of finite length n, let RCSub(L) be the collection consisting of the empty set and those sublattices of L that are closed under taking relative complements. That is, a subset X of L belongs to RCSub(L) if and only if X is join-closed, meet-closed, and whenever {a, x, b} ⊆ S, yL, xy = a, and xy = b, then yS. We prove that (1) the poset RCSub(L) with respect to set inclusion is lattice of length n + 1, (2) if RCSub(L) is a ranked lattice and L is modular, then L is 2-distributive in András P. Huhn’s sense, and (3) if L is distributive, then RCSub(L) is a ranked lattice.

Open access

In this paper, centralizing (semi-centralizing) and commuting (semi-commuting) derivations of semirings are characterized. The action of these derivations on Lie ideals is also discussed and as a consequence, some significant results are proved. In addition, Posner’s commutativity theorem is generalized for Lie ideals of semirings and this result is also extended to the case of centralizing (semi-centralizing) derivations of prime semirings. Further, we observe that if there exists a skew-commuting (skew-centralizing) derivation D of S, then D = 0. It is also proved that for any two derivations d 1 and d 2 of a prime semiring S with char S ≠ 2 and x d 1 x d 2 = 0, for all xS implies either d 1 = 0 or d 2 = 0.

Open access
Open access

We study a combinatorial notion where given a set S of lattice points one takes the set of all sums of p distinct points in S, and we ask the question: ‘if S is the set of lattice points of a convex lattice polytope, is the resulting set also the set of lattice points of a convex lattice polytope?’ We obtain a positive result in dimension 2 and a negative result in higher dimensions. We apply this to the corner cut polyhedron.

Restricted access

A leaf of a tree is a vertex of degree one and a branch vertex of a tree is a vertex of degree at least three. In this paper, we show a degree condition for a claw-free graph to have spanning trees with at most five branch vertices and leaves in total. Moreover, the degree sum condition is best possible.

Restricted access

We prove that the number of unit distances among n planar points is at most 1.94 • n 4/3, improving on the previous best bound of 8 n 4/3. We also give better upper and lower bounds for several small values of n. We also prove some variants of the crossing lemma and improve some constant factors.

Restricted access