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

You are looking at 31 - 40 of 164 items for

  • Refine by Access: Content accessible to me x
Clear All

Recently [3] we proved a general zero density theorem for a large class of functions which included among others the Riemann zeta function, Dedekind zeta functions, Dirichlet 𝐿-functions. The goal of the present work is a (slight) improvement of this general theorem which might lead to stronger results in some applications.

Open access

This paper serves as a kick-off to address the question of how to define and investigate the stability of bi-continuous semigroups. We will see that the mixed topology is the key concept in this framework.

Open access

An endo-commutative algebra is a nonassociative algebra in which the square mapping preserves multiplication. In this paper, we give a complete classification of 2-dimensional endo-commutative straight algebras of rank one over an arbitrary non-trivial field, where a straight algebra of dimension 2 satisfies the condition that there exists an element x such that x and x 2 are linearly independent. We list all multiplication tables of the algebras up to isomorphism.

Open access

In this paper, we consider the simultaneous sign changes of coefficients of Rankin–Selberg L-functions associated to two distinct Hecke eigenforms supported at positive integers represented by some certain primitive reduced integral binary quadratic form with negative discriminant D. We provide a quantitative result for the number of sign changes of such sequence in the interval (x, 2x] for sufficiently large x.

Open access

In this paper, we derive several asymptotic formulas for the sum of d(gcd(m,n)), where d(n) is the divisor function and m,n are in Piatetski-Shapiro and Beatty sequences.

Open access

Let 𝑛 ∈ ℕ. An element (x 1, … , x 𝑛) ∈ En is called a norming point of T L ( nE) if ‖x 1‖ = ⋯ = ‖xn ‖ = 1 and |T (x 1, … , xn )| = ‖T‖, where L ( nE) denotes the space of all continuous n-linear forms on E. For T L ( nE), we define

Norm(T) = {(x 1, … , x n) ∈ En ∶ (x 1, … , x n) is a norming point of T}.

Norm(T) is called the norming set of T. We classify Norm(T) for every T L (2 𝑑 (1, w)2), where 𝑑 (1, w)2 = ℝ2 with the octagonal norm of weight 0 < w < 1 endowed with x , y d * 1 , w = max x , y , x + y 1 + w .

Open access

In this paper, we introduce and study the class of k-strictly quasi-Fredholm linear relations on Banach spaces for nonnegative integer k. Then we investigate its robustness through perturbation by finite rank operators.

Open access

We construct an algebra of dimension 2ℵ0 consisting only of functions which in no point possess a finite one-sided derivative. We further show that some well known nowhere differentiable functions generate algebras, which contain functions which are differentiable at some points, but where for all functions in the algebra the set of points of differentiability is quite small.

Open access

A proper edge coloring of a graph 𝐺 is strong if the union of any two color classes does not contain a path with three edges (i.e. the color classes are induced matchings). The strong chromatic index 𝑞(𝐺) is the smallest number of colors needed for a strong coloring of 𝐺. One form of the famous (6, 3)-theorem of Ruzsa and Szemerédi (solving the (6, 3)-conjecture of Brown–Erdős–Sós) states that 𝑞(𝐺) cannot be linear in 𝑛 for a graph 𝐺 with 𝑛 vertices and 𝑐𝑛2 edges. Here we study two refinements of 𝑞(𝐺) arising from the analogous (7, 4)-conjecture. The first is 𝑞𝐴(𝐺), the smallest number of colors needed for a proper edge coloring of 𝐺 such that the union of any two color classes does not contain a path or cycle with four edges, we call it an A-coloring. The second is 𝑞𝐵(𝐺), the smallest number of colors needed for a proper edge coloring of 𝐺 such that all four-cycles are colored with four different colors, we call it a B-coloring. These notions lead to two stronger and one equivalent form of the (7, 4)-conjecture in terms of 𝑞𝐴(𝐺), 𝑞𝐵(𝐺) where 𝐺 is a balanced bipartite graph. Since these are questions about graphs, perhaps they will be easier to handle than the original special(7, 4)-conjecture. In order to understand the behavior of 𝑞𝐴(𝐺) and 𝑞𝐵(𝐺), we study these parameters for some graphs.

We note that 𝑞𝐴(𝐺) has already been extensively studied from various motivations. However, as far as we know the behavior of 𝑞𝐵(𝐺) is studied here for the first time.

Open access

Over integral domains of characteristics different from 2, we determine all the matrices a b c d which are similar to c a d b .

Open access