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 many clique search algorithms well coloring of the nodes is employed to find an upper bound of the clique number of the given graph. In an earlier work a non-traditional edge coloring scheme was proposed to get upper bounds that are typically better than the one provided by the well coloring of the nodes. In this paper we will show that the same scheme for well coloring of the edges can be used to find lower bounds for the clique number of the given graph. In order to assess the performance of the procedure we carried out numerical experiments.
This paper solves an enumerative problem which arises naturally in the context of Pascal’s hexagram. We prove that a general Desargues configuration in the plane is associated to six conical sextuples via the theorems of Pascal and Kirkman. Moreover, the Galois group associated to this problem is isomorphic to the symmetric group on six letters.
The purpose of this paper is to study the principal fibre bundle (P, M, G, π p ) with Lie group G, where M admits Lorentzian almost paracontact structure (Ø, ξ p , η p , g) satisfying certain condtions on (1, 1) tensor field J, indeed possesses an almost product structure on the principal fibre bundle. In the later sections, we have defined trilinear frame bundle and have proved that the trilinear frame bundle is the principal bundle and have proved in Theorem 5.1 that the Jacobian map π * is the isomorphism.
Many combinatorial optimization problems can be expressed in terms of zero-one linear programs. For the maximum clique problem the so-called edge reformulation is applied most commonly. Two less frequently used LP equivalents are the independent set and edge covering set reformulations. The number of the constraints (as a function of the number of vertices of the ground graph) is asymptotically quadratic in the edge and the edge covering set LP reformulations and it is exponential in the independent set reformulation, respectively. F. D. Croce and R. Tadei proposed an approach in which the number of the constraints is equal to the number of the vertices. In this paper we are looking for possible tighter variants of these linear programs.
Abstract
In 1975 C. F. Chen and C. H. Hsiao established a new procedure to solve initial value problems of systems of linear differential equations with constant coefficients by Walsh polynomials approach. However, they did not deal with the analysis of the proposed numerical solution. In a previous article we study this procedure in case of one equation with the techniques that the theory of dyadic harmonic analysis provides us. In this paper we extend these results through the introduction of a new procedure to solve initial value problems of differential equations with not necessarily constant coefficients.
Abstract
Fejes Tóth [3] studied approximations of smooth surfaces in three-space by piecewise flat triangular meshes with a given number of vertices on the surface that are optimal with respect to Hausdorff distance. He proves that this Hausdorff distance decreases inversely proportional with the number of vertices of the approximating mesh if the surface is convex. He also claims that this Hausdorff distance is inversely proportional to the square of the number of vertices for a specific non-convex surface, namely a one-sheeted hyperboloid of revolution bounded by two congruent circles. We refute this claim, and show that the asymptotic behavior of the Hausdorff distance is linear, that is the same as for convex surfaces.
Abstract
Let m ≠ 0, ±1 and n ≥ 2 be integers. The ring of algebraic integers of the pure fields of type
In this paper we explicitly give an integral basis of the field
Abstract
In [3], a universal linear algebraic model was proposed for describing homogeneous conformal geometries, such as the spherical, Euclidean, hyperbolic, Minkowski, anti-de Sitter and Galilei planes ([6]). This formalism was independent from the underlying field, providing an extension and general approach to other fields, such as finite fields. Some steps were taken even for the characteristic 2 case.
In this article, we undertake the study of the characteristic 2 case in more detail. In particular, the concept of virtual quadratic spaces is used ([4]), and a similar result is achieved for finite fields of characteristic 2 as for other fields. Some differences from the non-characteristic 2 case are also pointed out.
We present an algorithm to compute the primary decomposition of a submodule N of the free module ℤ[x 1,...,x n]m. For this purpose we use algorithms for primary decomposition of ideals in the polynomial ring over the integers. The idea is to compute first the minimal associated primes of N, i.e. the minimal associated primes of the ideal Ann (ℤ[x 1,...,x n]m/N) in ℤ[x 1,...,x n] and then compute the primary components using pseudo-primary decomposition and extraction, following the ideas of Shimoyama-Yokoyama. The algorithms are implemented in Singular.
Let A 1,...,A N and B 1,...,B M be two sequences of events and let ν N(A) and ν M(B) be the number of those A i and B j, respectively, that occur. Based on multivariate Lagrange interpolation, we give a method that yields linear bounds in terms of S k,t, k+t ≤ m on the distribution of the vector (ν N(A), ν M(B)). For the same value of m, several inequalities can be generated and all of them are best bounds for some values of S k,t. Known bivariate Bonferroni-type inequalities are reconstructed and new inequalities are generated, too.
