Trace formulas for a discrete Schrödinger operator

The Schrödinger operator with complex decaying potential on a lattice is considered. Trace formulas are derived on the basis of classical results of complex analysis. These formulas are applied to obtain global estimates of all zeros of the Fredholm determinant in terms of the potential.     

Combinatorics of a statistical model constructed from the 2 × <Emphasis Type="Italic">n</Emphasis> square lattice

Various weight functions for the model of a 2×n square lattice are defined so that the graded Euler characteristic for the complex corresponding to this model remain equal to the usual one. Differentials preserving these gradings and determining one-dimensional cohomology are also specified.     

Weighted inequalities for Hardy-type operators on the cone of decreasing functions in an Orlicz space

We establish criteria for the validity of modular inequalities for the Hardy operator on the cone Ω of nonnegative decreasing functions from weighted Orlicz spaces with general weight. The result is based on the theorem on the reduction of modular inequalities for positively homogeneous operators on the cone Ω, which enables passing to modular inequalities for modified operators on the cone of all nonnegative functions from an Orlicz space. It is shown that, for the Hardy operator, the modified operator is a generalized Hardy operator. This enables us to establish explicit criteria for the validity of modular inequalities.     

Bergman Subspaces and Subkernels: Degenerate $$L^p$$ Mapping and Zeroes

Regularity and irregularity of the Bergman projection on \(L^p\) spaces is established on a natural family of bounded, pseudoconvex domains. The family is parameterized by a real variable \(\gamma \). A surprising consequence of the analysis is that, whenever \(\gamma \) is irrational, the Bergman projection is bounded only for \(p=2\).     

On Constructive number fields and computability of solutions of PDEs

In this paper we find a connection between constructive number fields and computable reals. This connection is applied to prove the computability in the rigorous sense of computable analysis) of solutions of some important systems of partial differential equations, by means of algorithms which are really used in numerical analysis.     

Hybrid genetic algorithms with selective crossover for the capacitated p-median problem

Central European Journal of Operations Research - The paper suggests two ways of combining a genetic algorithm with integer programming to improve the quality of the problem solution. The...     

Measuring centrality by a generalization of degree

Network analysis has emerged as a key technique in communication studies, economics, geography, history and sociology, among others. A fundamental issue is how to identify key nodes, for which purpose a number of centrality measures have been developed. This paper proposes a new parametric family of centrality measures called generalized degree. It is based on the idea that a relationship to a more interconnected node contributes to centrality in a greater extent than a connection to a less central one. Generalized degree improves on degree by redistributing its sum over the network with the consideration of the global structure. Application of the measure is supported by a set of basic properties. A sufficient condition is given for generalized degree to be rank monotonic, excluding counter-intuitive changes in the centrality ranking after certain modifications of the network. The measure has a graph interpretation and can be calculated iteratively. Generalized degree is recommended to apply besides degree since it preserves most favourable attributes of degree, but better reflects the role of the nodes in the network and has an increased ability to distinguish among their importance.