Fractional Powers of Almost Non-Negative Operators

Mathematics Subject Classification: Primary 47A60, 47D06.

On Nilpotent Subsemigroups in some Matrix Semigroups

2000 Mathematics Subject Classification: 20M20, 20M10.

N–Dimensional Orthogonal Tile Sizing Problem

AMS subject classification: 68Q22, 90C90

Density of Polynomials in the L^2 Space on the Real and the Imaginary Axes and in a Sobolev Space

2000 Mathematics Subject Classification: 41A10, 30E10, 41A65.

On the Arithmetic of Errors

An approximate number is an ordered pair consisting of a (real) number and an error bound, briefly error, which is a (real) non-negative number. To compute with approximate numbers the arithmetic operations on errors should be well-known. To model computations with errors one should suitably define and study arithmetic operations and order relations over the set of non-negative numbers. In this work we discuss the algebraic properties of non-negative numbers starting from familiar properties of real numbers. We focus on certain operations of errors which seem not to have been sufficiently studied algebraically. In this work we restrict ourselves to arithmetic operations for errors related to addition and multiplication by scalars. We pay special attention to subtractability-like properties of errors and the induced “distance-like” operation. This operation is implicitly used under different names in several contemporary fields of applied mathematics (inner subtraction and inner addition in interval analysis, generalized Hukuhara difference in fuzzy set theory, etc.) Here we present some new results related to algebraic properties of this operation.

Supersymmetry and Ghosts in Quantum Mechanics

2000 Mathematics Subject Classification: 81Q60, 35Q40.

Oscillation Criteria of Second-Order Quasi-Linear Neutral Delay Difference Equations

2000 Mathematics Subject Classification: 39A10.

On strongly regular graphs with m2 = qm3 and m3 = qm2

2010 Mathematics Subject Classification: 05C50.

Algorithmic Minimization of Non-zero Entries in 0,1-Matrices

In this paper we present algorithms which work on pairs of 0,1- matrices which multiply again a matrix of zero and one entries. When applied over a pair, the algorithms change the number of non-zero entries present in the matrices, meanwhile their product remains unchanged. We establish the conditions under which the number of 1s decreases. We recursively define as well pairs of matrices which product is a specific matrix and such that by applying on them these algorithms, we minimize the total number of non-zero entries present in both matrices. These matrices may be interpreted as solutions for a well known information retrieval problem, and in this case the number of 1 entries represent the complexity of the retrieve and information update operations.

Matrix Power S-box Analysis

* Work supported by the Lithuanian State Science and Studies Foundation.

Resolvent and Scattering Matrix at the Maximum of the Potential

2000 Mathematics Subject Classification: 35P25, 81U20, 35S30, 47A10, 35B38.