Related papers: Sparse matrices describing iterations of integer-v…

One matrix structure in the area of monotone Boolean functions is defined here. Some of its combinatorial, algebraic and algorithmic properties are derived. On the base of these properties, three algorithms are built. First of them…

A 0-1 matrix $M$ contains a 0-1 matrix $P$ if $M$ has a submatrix $P'$ which can be turned into $P$ by changing some of the ones to zeroes. Matrix $M$ is $P$-saturated if $M$ does not contain $P$, but any matrix $M'$ derived from $M$ by…

In this note, we consider a framework for the analysis of iterative algorithms which can described in terms of a structured set-valued operator. More precisely, at each point in the ambient space, we assume that the value of operator can be…

We consider the problem of characterizing entrywise functions that preserve the cone of positive definite matrices when applied to every off-diagonal element. Our results extend theorems of Schoenberg [Duke Math. J. 9], Rudin [Duke Math. J.…

We study a general class of multiplicative functions by relating "short averages" to its "long average". More precisely, we estimate asymptotically the variance of such a class of functions in short intervals using Fourier analysis and…

Let $X$ be a real Banach space with a normalized duality mapping uniformly norm-to-weak$^\star$ continuous on bounded sets or a reflexive Banach space which admits a weakly continuous duality mapping $J_{\Phi}$ with gauge $\phi$. Let $f$ be…

Many algorithms use data structures that maintain properties of matrices undergoing some changes. The applications are wide-ranging and include for example matchings, shortest paths, linear programming, semi-definite programming, convex…

Let ${\cal A}=\{A_1,\ldots, A_r\}$ be a partition of a set $\{1,\ldots,m\}\times\{1,\ldots, n\}$ into $r$ nonempty subsets, and $A=(a_{ij})$ be an $m\times n$ matrix. We say that $A$ has a pattern ${\cal A}$ provided that $a_{ij}=a_{i'j'}$…

Let T be a bounded operator on a Hilbert space H, and F = {f_j: j in J} an at most countable set of vectors in H. In this note, we characterize the pairs {T, F} such that {T^n f: f in F, n in I} form a frame of H, for the cases of I = N_0…

We completely describe a new domain for abstract interpretation of numerical programs. Fixpoint iteration in this domain is proved to converge to finite precise invariants for (at least) the class of stable linear recursive filters of any…

Consider the set of scalars $\alpha$ for which the $\alpha$th Hadamard power of any $n\times n$ positive semi-definite (p.s.d.) matrix with non-negative entries is p.s.d. It is known that this set is of the form $\{0, 1, \dots, n-3\}\cup…

Two point correlation functions of the off-critical primary fields \phi_{1, 1+s} are considered in the perturbed minimal models M_{2, 2N+3} + \phi_{1,3}. They are given as infinite series of form factor contributions. The form factors of…

We study invariant sets and measures generated by iterated function systems defined on countable discrete spaces that are uniform grids of a finite dimension. The discrete spaces of this type can be considered as models of spaces in which…

In this article, we investigate sparse subsets of the natural numbers and study the sparseness of some sets associated with the Euler's totient function $\phi$ via the property of `Banach Density'. These sets related to the totient function…

Let $A$ be a unital dense algebra of linear mappings on a complex vector space $X$. Let $\phi=\sum_{i=1}^n M_{a_i,b_i}$ be a locally quasi-nilpotent elementary operator of length $n$ on $A$. We show that, if $\{a_1,\ldots,a_n\}$ is locally…

The computation of matrix functions is a well-studied problem. Of special importance are the exponential and the logarithm of a matrix, where the latter also raises existence and uniqueness questions. This is particularly relevant in the…

A formula $\phi$ is called \emph{$n$-provable} in a formal arithmetical theory $S$ if $\phi$ is provable in $S$ together with all true arithmetical $\Pi_{n}$-sentences taken as additional axioms. While in general the set of all $n$-provable…

Subspace iterations are used to minimise a generalised Ritz functional of a large, sparse Hermitean matrix. In this way, the lowest $m$ eigenvalues are determined. Tests with $1 \leq m \leq 32$ demonstrate that the computational cost (no.…

A discrete map based on the sum of an integer's distinct primes factors and the sum of its other factors is defined and its iteration is studied.

We introduce local iterated function systems and present some of their basic properties. A new class of local attractors of local iterated function systems, namely local fractal functions, is constructed. We derive formulas so that these…