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
The oscillatory properties of half-linear second order Euler type differential equations are studied, where the coefficients of the considered equations can be unbounded. For these equations, we prove an oscillation criterion and a non-oscillation one. We also mention a corollary which shows how our criteria improve the known results. In the corollary, the criteria give an explicit oscillation constant.
By making use of the critical point theory, the existence of periodic solutions for fourth-order nonlinear p-Laplacian difference equations is obtained. The main approach used in our paper is a variational technique and the Saddle Point Theorem. The problem is to solve the existence of periodic solutions of fourth-order nonlinear p-Laplacian difference equations. The results obtained successfully generalize and complement the existing one.
The paper focuses on existence of solutions of a system of nonlocal resonant boundary value problems , where f : [0, 1] × ℝ k → ℝ k is continuous and g : [0, 1] → ℝ k is a function of bounded variation. Imposing on the function f the following condition: the limit limλ→∞ f(t, λ a) exists uniformly in a ∈ S k−1, we have shown that the problem has at least one solution.
In this paper, using a Darbo type fixed point theorem associated with the measure of noncompactness we prove a theorem on the existence of solutions of some nonlinear functional integral equations in the space of continuous functions on interval [0, a]. We give also some examples which show that the obtained results are applicable
A basic model in financial mathematics was introduced by Black, Scholes and Merton in 1973. A classical discrete approximation in distribution is the binomial model given by Cox, Ross and Rubinstein in 1979. In this work we give a strong (almost sure, pathwise) discrete approximation of the BSM model using a suitable nested sequence of simple, symmetric random walks. The approximation extends to the stock price process, the value process, the replicating portfolio, and the greeks. An important tool in the approximation is a discrete version of the Feynman-Kac formula as well.
Our aim is to show that from an elementary discrete approach, by taking simple limits, one may get the continuous versions. We think that such an approach can be advantageous for both research and applications. Moreover, it is hoped that this approach has pedagogical merits as well: gives insight and seems suitable for teaching students whose mathematical background may not contain e.g. measure theory or stochastic analysis.
In this paper we deduce some tight Turán type inequalities for Tricomi confluent hypergeometric functions of the second kind, which in some cases improve the existing results in the literature. We also give alternative proofs for some already established Turán type inequalities. Moreover, by using these Turán type inequalities, we deduce some new inequalities for Tricomi confluent hypergeometric functions of the second kind. The key tool in the proof of the Turán type inequalities is an integral representation for a quotient of Tricomi confluent hypergeometric functions, which arises in the study of the infinite divisibility of the Fisher-Snedecor F distribution.
A semigroup is called eventually regular if each of its elements has a regular power. In this paper we study certain fundamental congruences on an eventually regular semigroup. We generalize some results of Howie and Lallement (1966) and LaTorre (1983). In particular, we give a full description of the semilattice of group congruences (together with the least such a congruence) on an arbitrary eventually regular (orthodox) semigroup. Moreover, we investigate UBG-congruences on an eventually regular semigroup. Finally, we study the eventually regular subdirect products of an E-unitary semigroup and a Clifford semigroup.
The set of Cohen-Macaulay monomial ideals with a given radical contains the so-called Cohen-Macaulay modifications. Not all Cohen-Macaulay squarefree monomial ideals admit nontrivial Cohen-Macaulay modifications. We present classes of Cohen-Macaulay squarefree monomial ideals with infinitely many nontrivial Cohen-Macaulay modifications.
The B n (k) poly-Bernoulli numbers — a natural generalization of classical Bernoulli numbers (B n = Bn (1)) — were introduced by Kaneko in 1997. When the parameter k is negative then B n (k) is a nonnegative number. Brewbaker was the first to give combinatorial interpretation of these numbers. He proved that B n (−k) counts the so called lonesum 0–1 matrices of size n × k. Several other interpretations were pointed out. We survey these and give new ones. Our new interpretation, for example, gives a transparent, combinatorial explanation of Kaneko’s recursive formula for poly-Bernoulli numbers.
Over the (1, 1)-dimensional real supercircle, we consider the K(1)-modules D λ,μ k of linear differential operators of order k acting on the superspaces of weighted densities, where K(1) is the Lie superalgebra of contact vector fields. We give, in contrast to the classical setting, a classification of these modules. This work is the simplest superization of a result by Gargoubi and Ovsienko.
A ring R is called right SSP (SIP) if the sum (intersection) of any two direct summands of R R is also a direct summand. Left SSP (SIP) rings are defined similarly. There are several interesting results on rings with SSP. For example, R is right SSP if and only if R is left SSP, and R is a von Neumann regular ring if and only if M n (R) is SSP for some n > 1. It is shown that R is a semisimple ring if and only if the column finite matrix ring ℂFMℕ(R) is SSP, where ℕ is the set of natural numbers. Some known results are proved in an easy way through idempotents of rings. Moreover, some new results on SSP rings are given.
Let G be a finite group. A subgroup H of G is said to be s-permutable in G if H permutes with all Sylow subgroups of G. Let H be a subgroup of G and let H sG be the subgroup of H generated by all those subgroups of H which are s-permutable in G. A subgroup H of G is called n-embedded in G if G has a normal subgroup T such that H G = HT and H ∩ T ≦ H sG , where H G is the normal closure of H in G. We investigate the influence of n-embedded subgroups of the p-nilpotency and p-supersolvability of G.
In 1944, Santaló asked about the average number of normals through a point of a given convex body. Since then, numerous results appeared in the literature about this problem. The aim of this paper is to add to this list some new, recent developments. We point out connections of the problem to static equilibria of rigid bodies as well as to geometric partial differential equations of surface evolution.
S. Banach in [1] proved that for any function f ∈ L 2(0, 1), f ≁ 0, there exists an ONS (orthonormal system) such that the Fourier series of this function is not summable a.e. by the method (C, α), α > 0.
D. Menshov found the conditions which should be satisfied by the Fourier coefficients of the function for the summability a.e. of its Fourier series by the method (C, α), α > 0.
In this paper the necessary and sufficient conditions are found which should be satisfied by the ONS functions (φ n (x)) so that the Fourier coefficients (by this system) of functions from class Lip 1 or A (absolutely continuous) satisfy the conditions of D. Menshov.
Motivated by the well known Kadec-Pełczynski disjointification theorem, we undertake an analysis of the supports of non-zero functions in strongly embedded subspaces of Banach functions spaces. The main aim is to isolate those properties that bring additional information on strongly embedded subspaces. This is the case of the support localization property, which is a necessary condition fulfilled by all strongly embedded subspaces. Several examples that involve Rademacher functions, the Volterra operator, Lorentz spaces or Orlicz spaces are provided.
An extension of von Neumann’s characterization of essentially selfadjoint operators is given among not necessarily densely defined symmetric operators which are assumed to be closable. Our arguments are of algebraic nature and follow the idea of [1].
We introduce the two new concepts, productly linearly independent sequences and productly irrational sequences. Then we prove a criterion for which certain infinite sequences of rational numbers are productly linearly independent. As a consequence we obtain a criterion for the irrationality of infinite products and a criterion for a sequence to be productly irrational.
The present note will present a different and direct way to generalize the convexity while keep the classical results for L 1-convergence still alive.
The Separation Problem, originally posed by K. Bezdek in [1], asks for the minimum number s(O, K) of hyperplanes needed to strictly separate an interior point O in a convex body K from all faces of K. It is conjectured that s(O, K) ≦ 2 d in d-dimensional Euclidean space. We prove this conjecture for the class of all totally-sewn neighbourly 4-dimensional polytopes.
A remarkable class of quadratic irrational elements having both explicit Engel series and continued fraction expansions in the field of Laurent series, mimicking the case of real numbers discovered by Sierpiński and later extended by Tamura, is constructed. Linear integer-valued polynomials which can be applied to construct such class are determined. Corresponding results in the case of real numbers are mentioned.
R. P. Stanley proved the Upper Bound Conjecture in 1975. We imitate his proof for the Ehrhart rings.
We give some upper bounds for the volume of integrally closed lattice polytopes. We derive some inequalities for the δ-vector of integrally closed lattice polytopes. Finally we apply our results for reflexive integrally closed and order polytopes.
The modified method of estimation of the resistance of block ciphers to truncated byte differential attack is proposed. The previously known method estimate the truncated byte differential probability for Rijndael-like ciphers. In this paper we spread the sphere of application of that method on wider class of ciphers. The proposed method based on searching the most probable truncated byte differential characteristics and verification of sufficient conditions of effective byte differentials absence.
Multiplicative complexity is the minimum number of AND-gates required to implement a given Boolean function in (AND, XOR) algebra. It is a good measure of a hardware complexity of an S-box, but an S-box cannot have too low multiplicative complexity due to security constraints. In this article we focus on generic constructions that can be used to find good n×n S-boxes with low multiplicative complexity. We tested these constructions in the specific case when n = 8. We were able to find 8 × 8 S-boxes with multiplicative complexity at most 16 (which is half of the known bound on multiplicative complexity of the AES S-box), while providing a reasonable resistance against linear and differential cryptanalysis.
Since Gentry’s breakthrough result was introduced in the year 2009, the homomorphic encryption has become a very popular topic. The main contribution of Gentry’s thesis [5] was, that it has proven, that it actually is possible to design a fully homomorphic encryption scheme. However ground-breaking Gentry’s result was, the designs, that employ the bootstrapping technique suffer from terrible performance both in key generation and homomorphic evaluation of circuits. Some authors tried to design schemes, that could evaluate homomorphic circuits of arbitrarily many inputs without need of bootstrapping. This paper introduces the notion of symmetric homomorphic encryption, and analyses the security of four such proposals, published in three different papers ([2], [7], [10]). Our result is a known plaintext key-recovery attack on every one of these schemes.
HaF is a family of hash functions developed in Poland at Poznán University of Technology, see [1, 2]. It is a classical Merkle-Damgård construction with the output sizes of 256, 512 or 1024 bits. In this paper we present a collision attack with negligible complexity (collisions can be found without using a computer) for all the members of HaF family. We have also shown that the improved function (without the critical transformation) is still insecure. It is possible to find a preimage for a short message with the complexity lower than the exhaustive search. We are also able to create some fixed points with a complexity of single compression function call.
New multivariate cryptosystems are introduced. Sequences f(n) of bijective polynomial transformations of bijective multivariate transformations of affine spaces K n , n = 2, 3, ... , where K is a finite commutative ring with special properties, are used for the constructions of cryptosystems. On axiomatic level, the concept of a family of multivariate maps with invertible decomposition is proposed. Such decomposition is used as private key in a public key infrastructure. Requirements of polynomiality of degree and density allow to estimate the complexity of encryption procedure for a public user. The concepts of stable family and family of increasing order are motivated by studies of discrete logarithm problem in Cremona group. Statement on the existence of families of multivariate maps of polynomial degree and polynomial density with the invertible decomposition is formulated. We observe known explicit constructions of special families of multivariate maps. They correspond to explicit constructions of families of nonlinear algebraic graphs of increasing girth which appeared in Extremal Graph Theory. The families are generated by pseudorandom walks on graphs. This fact ensures the existence of invertible decomposition; a certain girth property guarantees the increase of order for the family of multivariate maps, good expansion properties of families of graphs lead to good mixing properties of graph based private key algorithms. We describe the general schemes of cryptographic applications of such families (public key infrastructure, symbolic Diffie—Hellman protocol, functional versions of El Gamal algorithm).
We present an efficient endomorphism for the Jacobian of a curve C of genus 2 for divisors having a Non disjoint support. This extends the work of Costello and Lauter in [12] who calculated explicit formulæ for divisor doubling and addition of divisors with disjoint support in JF(C) using only base field operations. Explicit formulæ is presented for this third case and a different approach for divisor doubling.
The main aim of this paper is to present the concept of fault-injection backdoors in Random Number Generators. Backdoors can be activated by fault-injection techniques. Presented algorithms can be used in embedded systems like smart-cards and hardware security modules in order to implement subliminal channels in random number generators.
The methods for secure outsourcing and secure one-time programs have recently been of great research interest. Garbling schemes are regarded as a promising technique for these applications while Bellare, Hoang and Rogaway introduced the first formal security notions for garbling schemes in [3, 4]. Ever since, even more security notions have been introduced and garbling schemes have been categorized in different security classes according to these notions. In this paper, we introduce new security classes of garbling schemes and build a hierarchy for the security classes including the known classes as well as classes introduced in this paper.
In this paper we introduce a novel block cipher based on the composition of abstract finite automata and Latin cubes. For information encryption and decryption the apparatus uses the same secret keys, which consist of key-automata based on composition of abstract finite automata such that the transition matrices of the component automata form Latin cubes. The aim of the paper is to show the essence of our algorithms not only for specialists working in compositions of abstract automata but also for all researchers interested in cryptosystems. Therefore, automata theoretical background of our results is not emphasized. The introduced cryptosystem is important also from a theoretical point of view, because it is the first fully functioning block cipher based on automata network.
Differential Cryptanalysis (DC) is one of the oldest known attacks on block ciphers. DC is based on tracking of changes in the differences between two messages as they pass through the consecutive rounds of encryption. However DC remains very poorly understood. In his textbook written in the late 1990s Schneier wrote that against differential cryptanalysis, GOST is “probably stronger than DES”. In fact Knudsen have soon proposed more powerful advanced differential attacks however the potential space of such attacks is truly immense. To this day there is no method which allows to evaluate the security of a cipher against such attacks in a systematic way. Instead, attacks are designed and improved in ad-hoc ways with heuristics [6–13,21]. The best differential attack known has time complexity of 2179 [13].
In this paper we show that for a given block cipher there exists an optimal size for advanced differential properties. This new understanding allows to considerably reduce the space to be searched for “good” truncated differential properties suitable for an attack.
This paper deals with the phase-shift fault analysis of cipher Trivium. So far, only bit-flipping technique has been presented in the literature. The best fault attack on Trivium [13] combines bit-flipping with algebraic cryptanalysis and needs to induce 2 one-bit faults and to generate 420 bits per each keystream. Our attack combines phase-shifting and algebraic cryptanalysis and needs to phase-shift 2 registers of the cipher and to generate 120 bits per each keystream.
In this paper we propose a decentralized privacy-preserving system which is able to share sensible data in a way, that only predefined subsets of authorized entities can recover the data after getting an additional alarm message. The protocol uses two main communication channels: a P2P network where the encrypted information is stored, and a smaller private P2P network, which consists of the authorized parties called friend-to-friend network. We describe the communication protocol fulfilling the desired security requirements. The proposed protocol achieves unconditional security. The main cryptographic building blocks of the protocol are symmetric encryption schemes and secret sharing schemes.
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.
M. Giusti’s classification of the simple complete intersection singularities is characterized in terms of invariants. This is a basis for the implementation of a classifier in the computer algebra system Singular.
Let S be a set of n points distributed uniformly and independently in a convex, bounded set in the plane. A four-gon is called empty if it contains no points of S in its interior. We show that the expected number of empty non-convex four-gons with vertices from S is 12n 2logn + o(n 2logn) and the expected number of empty convex four-gons with vertices from S is Θ(n 2).
This paper attempts an exposition of the connection between valuation theory and hyperstructure theory. In this regards, by considering the notion of totally ordered canonical hypergroup we define a hypervaluation of a hyperfield onto a totally ordered canonical hypergroup and obtain some related basic results.
We provide sufficient conditions for a mapping acting between two Banach spaces to be a diffeomorphism. We get local diffeomorhism by standard method while in making it global we employ a critical point theory and a duality mapping. We provide application to integro-differential initial value problem for which we get differentiable dependence on parameters.
We obtain new lower and upper bounds for probabilities of unions of events. These bounds are sharp. They are stronger than earlier ones. General bounds may be applied in arbitrary measurable spaces. We have improved the method that has been introduced in previous papers. We derive new generalizations of the first and second parts of the Borel-Cantelli lemma.
It is proved that there exists an NI ring R over which the polynomial ring R[x] is not an NLI ring. This answers an open question of Qu and Wei (Stud. Sci. Math. Hung., 51(2), 2014) in the negative. Moreover a sufficient condition of R[x] to be an NLI ring is included for an NLI ring R.
A space X is almost star countable (weakly star countable) if for each open cover U of X there exists a countable subset F of X such that
In the paper, the authors introduce a new concept of geometrically r-convex functions and establish some inequalities of Hermite-Hadamard type for this class of functions.
We prove:
-
(A)
Let
\documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \usepackage{bbm} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\Delta _c (x) = \log \frac{{\Gamma (x + 1)}}{{\sqrt {2\pi } (x/e)^x }} - \frac{1}{2}\psi (x + c) (x > 0; c \geqq 0).$$ \end{document} - (i) −Δ c is completely monotonic on (0, ∞) if and only if c ≧ 2/3.
- (ii) Δ c is completely monotonic on (0, ∞) if and only if c = 0.
-
(B)
The inequalities hold for all x > 0 with the best possible constants a 0 = 0.52660… and b 0 = 2/3.
\documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \usepackage{bbm} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\frac{1}{2}\psi (x + a_0 ) < \log \frac{{\Gamma (x + 1)}}{{\sqrt {2\pi } (x/e)^x }} < \frac{1}{2}\psi (x + b_0 )$$ \end{document}
We prove the theorem mentioned in the title for ℝn where n ≧ 3. The case of the simplex was known previously. Also the case n = 2 was settled, but there the infimum was some well-defined function of the side lengths. We also consider the cases of spherical and hyperbolic n-spaces. There we give some necessary conditions for the existence of a convex polytope with given facet areas and some partial results about sufficient conditions for the existence of (convex) tetrahedra.
We analyse the oscillation and non-oscillation of second-order half-linear differential equations with periodic and asymptotically almost periodic coefficients, where the equations have the so-called Riemann-Weber form. For these equations, we find an explicit oscillation constant. Corollaries and examples are mentioned as well.
