综合数学
The goal of this paper is to present invariants of planar point clouds, that is functions which take the same value before and after a linear transformation of a planar point cloud via a $2 \times 2$ invertible matrix. In the approach we…
In a recent paper, Chiney and Samanta have introduced a new definition of soft topology, using the soft elementary intersection and union. In this paper, basing at this approach, we introduce a definition of soft elementary compact set, and…
If an n-side unit regular polygon is divided into m equal sized parts, then what is the minimum length of the split line ${l_{m,n}}$? This problem has its practical application in real world. This paper proved that ${l_{2,3}} = \sqrt…
We formulate a general approach to higher concurrencies in general and neural codes in particular, and suggest how the higher order aspects may be dealt with in using topology.
The five (5) families of quadrature rules with periods of one or two intervals for the real line and spline classes $C^0$, $C^1$ are presented. The formulae allow one to calculate the points or weights of these quadrature rules in a very…
In this paper, we present a foundation study for proper colouring of edge-set graphs. The authors consider that a detailed study of the colouring of edge-set graphs corresponding to the family of paths is best suitable for such foundation…
Let $v\geq 2$ be a fixed integer, and let $x \geq 1$ and $z \geq x$ be large numbers. The exact asymptotic formula for the number of Wieferich primes $p$ such that $ v^{p-1} \equiv 1 \bmod p^2$ in the short interval $[x,x+z]$ is proposed in…
We remark that there is no smooth function $f(x)$ on $[0, 1]$ which is flat at $0$ such that the derivative $f^{(n)}$ of any order $n\geq 0$ is positive on $(0,1]$. Moreover, the number of zeros of the $n$-th derivative $f^{(n)}$ grows to…
This paper is devoted to the theory of prime numbers. In this paper we first introduce the notion of a matrix of prime numbers. Then, in order to investigate the density of prime numbers in separate rows of the matrix under consideration,…
Given a triangle ABC, we derive the probability distribution function and the moments of the area of an inscribed triangle RST whose vertices are uniformly distributed on AB, BC, and CA. The theoretical results are confirmed by a Monte…
Our purpose in this article is first, following [8], to prove that if $\alpha $, $\beta $ are any points of the open unit disc $D(0;1)$ in the complex plane ${\bf C}$ and $r$, $s$ are any positive real numbers such that ${\overline{D}}(…
Let $P$ be the set of all prime numbers, ${q_1},{q_2}, \cdots ,{q_m} \in P$, $P_k$ be the k-th $(k = 1,2, \cdots m)$ element of $P$ in ascending order of size, ${\alpha _1},{\alpha _2}, \cdots ,{\alpha _m}$ be positive integers, and ${\beta…
In this article I present results from a statistical study of prime numbers that shows a behaviour that is not compatible with the thesis that they are distributed randomly. The analysis is based on studying two arithmetical progressions…
A rather natural construction for a smooth random surface in space is the level surface of value zero, or 'nodal' surface f(x,y,z)=0, of a (real) random function f; the interface between positive and negative regions of the function. A…
A hybrid analytical method for solving linear and nonlinear fractional partial differential equations is presented. The proposed analytical method is an elegant combination of the Natural Transform Method (NTM) and a well-known method,…
In this paper Lowen type multi-fuzzy topological space has been introduced and characterization of topology by its nbd system is studied. Also the product multi-fuzzy topological space has been introduced and it has been investigated that…
The odd wheel is the only type of 4-critical graph in which one vertex always gets a unique color. This supports Frederic Guthrie's approach to the Four Color Problem.
I argue that there is no 4-chromatic planar graph with a joinable pair of color identical vertices, i.e., given a 4-chromatic planar graph G and a pair of vertices {u, v} in G, if the color of u equals the color of v in every 4-coloring of…
I argue that, given vertices u and v in a 4-chromatic graph G, if the color of u equals the color of v in every 4-coloring of G then G has no planar supergraph where u and v are adjacent. This is equivalent to the Four Color Theorem.
In our recent publication we have proposed a new methodology for determination of the two-term Machin-like formula for pi with small arguments of the arctangent function of kind $$ \frac{\pi }{4} = {2^{k - 1}}\arctan \left(…