# Browse

## You are looking at 1 - 10 of 76 items for :

• Mathematics and Statistics
• Refine by Access: Content accessible to me
Clear All

# From Binary Groups to Terminal Rings

Mathematica Pannonica
Author: Stuart D. Scott

Binary groups are a meaningful step up from non-associative rings and nearrings. It makes sense to study them in terms of their nearrings of zero-fixing polynomial maps. As this involves algebras of a more specialized nature these are looked into in sections three and four. One of the main theorems of this paper occurs in section five where it is shown that a binary group V is a P 0(V) ring module if, and only if, it is a rather restricted form of non-associative ring. Properties of these non-associative rings (called terminal rings) are investigated in sections six and seven. The finite case is of special interest since here terminal rings of odd order really are quite restricted. Sections eight to thirteen are taken up with the study of terminal rings of order p n (p an odd prime and n ≥ 1 an integer ≤ 7).

Open access

# On Zero Determinant Matrices that are Full

Mathematica Pannonica
Authors: Grigore Călugăreanu and Horia F. Pop

Column-row products have zero determinant over any commutative ring. In this paper we discuss the converse. For domains, we show that this yields a characterization of pre-Schreier rings, and for rings with zero divisors we show that reduced pre-Schreier rings have this property.

Finally, for the rings of integers modulo n, we determine the 2x2 matrices which are (or not) full and their numbers.

Open access

# Error Bounds Related to Midpoint and Trapezoid Rules for the Monotonic Integral Transform of Positive Operators in Hilbert Spaces

Mathematica Pannonica
Author: Silvestru Sever Dragomir

For a continuous and positive function w(λ), λ > 0 and μ a positive measure on (0, ∞) we consider the followingmonotonic integral transform

where the integral is assumed to exist forT a positive operator on a complex Hilbert spaceH. We show among others that, if β ≥ A, B ≥ α > 0, and 0 < δ ≤ (B − A)2 ≤ Δ for some constants α, β, δ, Δ, then

$0≤124δM″(w,μ)(β)≤M(w,μ)A+B2−∫01M(w,μ)((1−t)A+tB)dt≤−124ΔM″(w,μ)(α)$

and

$0≤−112δM″(w,μ)(β)≤∫01M(w,μ)((1−t)A+tB)dt−M(w,μ)(A)+M(w,μ)(B)2≤112ΔM″(w,μ)(α),$

where$M″(w,μ)$ is the second derivative of$M(w,μ)$ as a real function.

Applications for power function and logarithm are also provided.

Open access

# Hankel Determinant of Second Order for Some Classes of Analytic Functions

Mathematica Pannonica
Authors: Milutin Obradović and Nikola Tuneski

Let ƒ be analytic in the unit disk B and normalized so that ƒ (z) = z + a2z2 + a3z3 +܁܁܁. In this paper, we give upper bounds of the Hankel determinant of second order for the classes of starlike functions of order α, Ozaki close-to-convex functions and two other classes of analytic functions. Some of the estimates are sharp.

Open access

# Circles of Curvature at Points of Parabola in Isotropic Plane

Mathematica Pannonica
Authors: Vladimir Volenec, Marija Šimić Horvath, and Ema Jurkin

The authors have studied the curvature of the focal conic in the isotropic plane and the form of the circle of curvature at its points has been obtained. Hereby, we discuss several properties of such circles of curvature at the points of a parabola in the isotropic plane.

Open access

# The “k = 1” Case of a Problem of Greene and Kleitman from 1976: Join-Irreducible Elements in the Lattice of Sperner 1-Families

Mathematica Pannonica
Author: Jonathan David Farley

Let k ≥ 1. A Sperner k-family is a maximum-sized subset of a finite poset that contains no chain with k + 1 elements. In 1976 Greene and Kleitman defined a lattice-ordering on the set Sk(P) of Sperner k-families of a fifinite poset P and posed the problem: “Characterize and interpret the join- and meet-irreducible elements of Sk(P),” adding, “This has apparently not been done even for the case k = 1.”

In this article, the case k = 1 is done.

Open access

# On Self-Adjoint Linear Relations

Mathematica Pannonica
Author: Péter Berkics

A linear operator on a Hilbert space $ℍ$, in the classical approach of von Neumann, must be symmetric to guarantee self-adjointness. However, it can be shown that the symmetry could be omitted by using a criterion for the graph of the operator and the adjoint of the graph. Namely, S is shown to be densely defined and closed if and only if $k+l:k,l∈GS∩GS*=ℍ$.

In a more general setup, we can consider relations instead of operators and we prove that in this situation a similar result holds. We give a necessary and sufficient condition for a linear relation to be densely defined and self-adjoint.

Open access

# Conceptions of Topological Transitivity on Symmetric Products

Mathematica Pannonica
Authors: Franco Barragán, Sergio Macías, and Anahí Rojas

Let X be a topological space. For any positive integer n, we consider the n-fold symmetric product of X, ℱn(X), consisting of all nonempty subsets of X with at most n points; and for a given function ƒ : XX, we consider the induced functions ℱn(ƒ): ℱn(X) → ℱn(X). Let M be one of the following classes of functions: exact, transitive, ℤ-transitive, ℤ+-transitive, mixing, weakly mixing, chaotic, turbulent, strongly transitive, totally transitive, orbit-transitive, strictly orbit-transitive, ω-transitive, minimal, I N, T T ++, semi-open and irreducible. In this paper we study the relationship between the following statements: ƒM and ℱn(ƒ) ∈ M.

Open access

# Dual Pairs of Matroids with Coefficients in Finitary Fuzzy Rings of Arbitrary Rank

Mathematica Pannonica
Author: Walter Wenzel

Infinite matroids have been defined by Reinhard Diestel and coauthors in such a way that this class is (together with the finite matroids) closed under dualization and taking minors. On the other hand, Andreas Dress introduced a theory of matroids with coefficients in a fuzzy ring which is – from a combinatorial point of view – less general, because within this theory every circuit has a finite intersection with every cocircuit. Within the present paper, we extend the theory of matroids with coefficients to more general classes of matroids, if the underlying fuzzy ring has certain properties to be specified.

Open access

# Lower Estimate of Clique Size via Edge Coloring

Mathematica Pannonica
Authors: Balázs Király and Sándor Szabó

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.

Open access