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
A positive integer
Let (𝑃𝑛)𝑛≥0 and (𝑄𝑛)𝑛≥0 be the Pell and Pell–Lucas sequences. Let 𝑏 be a positive integer such that 𝑏 ≥ 2. In this paper, we prove that the following two Diophantine equations 𝑃𝑛 = 𝑏𝑑𝑃𝑚 + 𝑄𝑘 and 𝑃𝑛 = 𝑏𝑑𝑄𝑚 + 𝑃𝑘 with 𝑑, the number of digits of 𝑃𝑘 or 𝑄𝑘 in base 𝑏, have only finitely many solutions in nonnegative integers (𝑚, 𝑛, 𝑘, 𝑏, 𝑑). Also, we explicitly determine these solutions in cases 2 ≤ 𝑏 ≤ 10.
Grätzer and Lakser asked in the 1971 Transactions of the American Mathematical Society if the pseudocomplemented distributive lattices in the amalgamation class of the subvariety generated by 𝟐𝑛 ⊕ 𝟏 can be characterized by the property of not having a *-homomorphism onto 𝟐𝑖 ⊕ 𝟏 for 1 < 𝑖 < 𝑛.
In this article, their question from 1971 is answered.
This paper introduces and examines the concept of a *-Rickart *-ring, and proves that every Rickart *-ring is also a *-Rickart *-ring. A necessary and sufficient condition for a *-Rickart *-ring to be a Rickart *-ring is also provided. The relationship between *-Rickart *-rings and *-Baer *-rings is investigated, and several properties of *-Rickart *-rings are presented. The paper demonstrates that the property of *-Rickart extends to both the center and *-corners of a *-ring, and investigates the extension of a *-Rickart *-ring to its polynomial *-ring. Additionally, *-Rickart *-rings with descending chain condition on *-biideals are studied, and all *-Rickart (*-Baer) *-rings with finitely many elements are classified.
Very recently, the authors in [5] proposed the exponential-type operator connected with
A bi-cyclic 4-polytope in ℝ4 was introduced by Z. Smilansky as the convex hull of evenly spaced points on a generalized trigonometric moment curve in ℝ4. We present combinatorial geometric conditions that yield the face lattices of a class of such 4-polytopes.
A classical result of Dowker (Bull. Amer. Math. Soc. 50: 120-122, 1944) states that for any plane convex body 𝐾, the areas of the maximum (resp. minimum) area convex 𝑛-gons inscribed (resp. circumscribed) in 𝐾 is a concave (resp. convex) sequence. It is known that this theorem remains true if we replace area by perimeter, or convex 𝑛-gons by disk-𝑛-gons, obtained as the intersection of 𝑛 closed Euclidean unit disks. It has been proved recently that if 𝐶 is the unit disk of a normed plane, then the same properties hold for the area of 𝐶-𝑛-gons circumscribed about a 𝐶-convex disk 𝐾 and for the perimeters of 𝐶-𝑛-gons inscribed or circumscribed about a 𝐶-convex disk 𝐾, but for a typical origin-symmetric convex disk 𝐶 with respect to Hausdorff distance, there is a 𝐶-convex disk 𝐾 such that the sequence of the areas of the maximum area 𝐶-𝑛-gons inscribed in 𝐾 is not concave. The aim of this paper is to investigate this question if we replace the topology induced by Hausdorff distance with a topology induced by the surface area measure of the boundary of 𝐶.
A 𝑞-graph with 𝑒 edges and 𝑛 vertices is defined as an 𝑒 × 𝑛 matrix with entries from {0, … , 𝑞}, such that each row of the matrix (called a 𝑞-edge) contains exactly two nonzero entries. If 𝐻 is a 𝑞-graph, then 𝐻 is said to contain an 𝑠-copy of the ordinary graph 𝐹, if a set 𝑆 of 𝑞-edges can be selected from 𝐻 such that their intersection graph is isomorphic to 𝐹, and for any vertex 𝑣 of 𝑆 and any two incident edges 𝑒, 𝑓 ∈ 𝑆 the sum of the entries of 𝑒 and 𝑓 is at least 𝑠. The extremal number ex(𝑛, 𝐹, 𝑞, 𝑠) is defined as the maximal number of edges in an 𝑛-vertex 𝑞-graph such that it does not contain contain an 𝑠-copy of the forbidden graph 𝐹.
In the present paper, we reduce the problem of finding ex(𝑛, 𝐹, 𝑞, 𝑞 + 1) for even 𝑞 to the case 𝑞 = 2, and determine the asymptotics of ex(𝑛, 𝐶2𝑘+1, 𝑞, 𝑞 + 1).
For positive integers 𝑛, 𝑟, 𝑠 with 𝑟 > 𝑠, the set-coloring Ramsey number 𝑅(𝑛; 𝑟, 𝑠) is the minimum 𝑁 such that if every edge of the complete graph 𝐾𝑁 receives a set of 𝑠 colors from a palette of 𝑟 colors, then there is guaranteed to be a monochromatic clique on 𝑛 vertices, that is, a subset of 𝑛 vertices where all of the edges between them receive a common color. In particular, the case 𝑠 = 1 corresponds to the classical multicolor Ramsey number. We prove general upper and lower bounds on 𝑅(𝑛; 𝑟, 𝑠) which imply that 𝑅(𝑛; 𝑟, 𝑠) = 2Θ(𝑛𝑟) if 𝑠/𝑟 is bounded away from 0 and 1. The upper bound extends an old result of Erdős and Szemerédi, who treated the case 𝑠 = 𝑟 − 1, while the lower bound exploits a connection to error-correcting codes. We also study the analogous problem for hypergraphs.
