Hilbert Spaces of Distributions Having an Orthogonal Basis of Exponentials.
Identifying codes of Cartesian product of two cliques of the same size.
Inductorless Chua's circuit: experimental time series analysis.
Infinite trees and inverse gaussian random variables
Integral representation of -variable positive real functions
Intermittent behavior and synchronization of two coupled noisy driven oscillators.
Interpolation Formulas Over Finite Sets
Interpolation formulas over finite sets.
Invariance groups of finite functions and orbit equivalence of permutation groups
Which subgroups of the symmetric group Sn arise as invariance groups of n-variable functions defined on a k-element domain? It appears that the higher the difference n-k, the more difficult it is to answer this question. For k ≤ n, the answer is easy: all subgroups of Sn are invariance groups. We give a complete answer in the cases k = n-1 and k = n-2, and we also give a partial answer in the general case: we describe invariance groups when n is much larger than n-k. The proof utilizes Galois connections...
Invariant resistive networks in Euclidean spaces and their relation to geometry
Geometric properties of finite systems of homogeneous resistive wire segments in a Euclidean -space are studied in the case that the absorption of energy of such a system in an arbitrary linear electrical field is invariant under any orthogonal transformation of the system.
Inversion of square matrices in processors with limited calculation abillities
An iterative inversion algorithm for a class of square matrices is derived and tested. The inverted matrix can be defined over both real and complex fields. This algorithm is based only on the operations of addition and multiplication. The numerics of the algorithm can cope with a short number representation and therefore can be very useful in the case of processors with limited possibilities, like different neuro-computers and accelerator cards. The quality of inversion can be traced and tested....
Kritérium dominantnosti kořenů
L'addition parallèle d'opérateurs interprétée comme inf-convolution de formes quadratiques convexes
Le problème du voyageur de commerce dans un produit cartésien de deux graphes
Les graphes de transfert et la notion de graphe inverse
L'Espace Vectoriel Pseudo-Booléen Généralisé
Limit behaviour of trajectories involving subgradients of convex functions
Linear fractional transformations and companion matrices
Local dependency in networks
Many real world data and processes have a network structure and can usefully be represented as graphs. Network analysis focuses on the relations among the nodes exploring the properties of each network. We introduce a method for measuring the strength of the relationship between two nodes of a network and for their ranking. This method is applicable to all kinds of networks, including directed and weighted networks. The approach extracts dependency relations among the network's nodes from the structure...
Lower and upper bounds of shortest paths in reachability graphs.