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
We study the property of Kelley and the property of Kelley weakly on Hausdorff continua. We extend results known for metric continua to the class of Hausdorff continua. We also present new results about these properties.
The aim of this paper is to study the interrelationship between various forms of (F, G)-shadowing property and represent it through the diagram. We show that asymptotic shadowing is equivalent to (ℕ0, F 𝑐𝑓 )-shadowing property and that (ℕ0, F 𝑐𝑓 )-shadowing implies (F 𝑐𝑓 , F 𝑐𝑓 )-shadowing. Necessary examples are discussed to support the diagram. We also give characterization for maps to have the (F, G)-shadowing property through the shift map on the inverse limit space. Further, we relate the (F, G)-shadowing property to the positively F 𝑠-expansive map. Also, we obtain the necessary and sufficient condition for the identity map to have (ℕ0, F 𝑡)-shadowing property.
We prove that the filtered GRID invariants of Legendrian links in link Floer homology, and consequently their associated invariants in the spectral sequence, obstruct decomposable Lagrangian cobordisms in the symplectization of the standard contact structure on ℝ3, strengthening a result by Baldwin, Lidman, and the fifth author.
In [3] it is shown, answering a question of Jordán and Nguyen [9], that universal rigidity of a generic bar-joint framework in ℝ1 depends on more than the ordering of the vertices. The graph 𝐺 that was used in that paper is a ladder with three rungs. Here we provide a general answer when that ladder with three rungs in the line is universally rigid and when it is not.
In this paper the author studies the problem of finding the farthest points in an intersection of balls to a given point 𝐶0. A polynomial algorithm is presented which solves the problem under the conditions that the given point is outside of the convex hull of the balls centers. It is shown that in this particular case the problem of finding the smallest ball centered in 𝐶0 which includes the intersection of balls is actually convex.
In this article, we present new results on specific cases of a general Young integral inequality established by Páles in 1990. Our initial focus is on a bivariate function, defined as the product of two univariate and separable functions. Based on this, some new results are established, including particular Young integral-type inequalities and some upper bounds on the corresponding absolute errors. The precise role of the functions involved in this context is investigated. Several applications are presented, including one in the field of probability theory. We also introduce and study reverse variants of our inequalities. Another important contribution is to link the setting of the general Young integral inequality established by Páles to a probabilistic framework called copula theory. We show that this theory provides a wide range of functions, often dependent on adjustable parameters, that can be effectively applied to this inequality. Some illustrative graphics are provided. Overall, this article broadens the scope of bivariate inequalities and can serve related purposes in analysis, probability and statistics, among others.
Let 𝑛, 𝑠, 𝑣 be positive integers and F ⊂ 2[𝑛]. Suppose that the union of any 𝑠 sets of F has size at most 𝑠𝑣 and 𝑛 ≥ 2𝑠+3𝑣. The main result implies the best possible bound
In this work we single out a scheduling problem in which tasks are coupled and the time delay between the first and second members of the couple is fixed by technological constraints. We will show that this scheduling problem can be reduced to the question to decide if a tactically constructed 𝑘-partite auxiliary graph contains a 𝑘-clique. We will point out that before submitting the auxiliary graph to a clique solver it is expedient to carry out various inspections in order to delete nodes and edges of the graph and consequently speed up the computations. In the lack of theoretical tools we will carry out numerical experiments to test the practicality of the clique approach.
In this paper, we define the discretized Voros–Li coefficients associated to the zeta function on function fields of genus 𝑔 over a finite fields 𝔽𝑞. Furthermore, we give a finite sum representation, an integral formula and an asymptotic formula for these coefficients.
In the case of symmetries with respect to 𝑛 independent linear hyperplanes, a stability versions of the Logarithmic Brunn–Minkowski Inequality and the Logarithmic Minkowski Inequality for convex bodies are established.
