Browse Our Mathematics and Statistics Journals

**Mathematics and statistics journals publish papers on the theory and application of mathematics, statistics, and probability. Most mathematics journals have a broad scope that encompasses most mathematical fields. These commonly include logic and foundations, algebra and number theory, analysis (including differential equations, functional analysis and operator theory), geometry, topology, combinatorics, probability and statistics, numerical analysis and computation theory, mathematical physics, etc.**

# Mathematics and Statistics

In this article, we define the notion of a generalized open book of a *n*-manifold over the *k*−sphere *S ^{k}
*,

*k < n*. We discuss Lefschetz open book embeddings of Lefschetz open books of closed oriented 4-manifolds into the trivial open book over

*S*of the 7−sphere

^{2}*S*. If X is the double of a bounded achiral Lefschetz fibration over

^{7}*D*, then

^{2}*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

*S*of the 7−sphere

^{2}*S*.

^{7}We show that if a non-degenerate PL map *f* : *N* → *M* lifts to a topological embedding in *N ^{n}
* →

*M*≥

^{m}, m*n*, lifts to a topological embedding in

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.

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, y* ∈ *L, x* ∧ *y* = *a*, and *x* ∨ *y* = *b*, then *y* ∈ *S*. 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.

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 *x* ∈ *S* implies either *d*
_{1} = 0 or *d*
_{2} = 0.

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.

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.

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.

Two hexagons in the space are said to intersect *heavily* if their intersection consists of at least one common vertex as well as an interior point. We show that the number of hexagons on *n* points in 3-space without heavy intersections is o(*n*
^{2}), under the assumption that the hexagons are ‘fat’.