Related papers: A numerical characterization of Dunkl systems
In this note unbounded hyperexpansive weighted composition operators are investigated. AS a consequence unbounded hyperexpansive multiplication and composition operators are characterized.
We present a description of finite dimensional quantum entanglement, based on a study of the space of all convex decompositions of a given density matrix. On this space we construct a system of real polynomial equations describing separable…
We introduce first weighted function spaces on Rd using the Dunkl convolution that we call Besov-Dunkl spaces. We provide characterizations of these spaces by decomposition of functions. Next we obtain in the real line and in radial case on…
In article the basic principles put in a basis of algorithmicallysoftware of hypercomplex number calculations, structure of a software, structure of functional subsystems are considered. The most important procedures included in subsystems…
Complex numbers define the relationship between entities in many situations. A canonical example would be the off-diagonal terms in a Hamiltonian matrix in quantum physics. Recent years have seen an increasing interest to extend the tools…
Generating functions for plane overpartitions are obtained using various methods such as nonintersecting paths, RSK type algorithms and symmetric functions. We extend some of the generating functions to cylindric partitions. Also, we show…
Hypercomplex numbers are unital algebras over the real numbers. We offer a short demonstration of the practical value of hypercomplex analytic functions in the field of partial differential equations.
We give an elementary characterization of rational functions among meromorphic functions in the complex plane.
We establish some connections between nonresonant $A$-hypergeometric systems and de Rham-type complexes. This allows us to determine which of these $A$-hypergeometric systems "come from geometry."
We study the intersection numbers defined on twisted homology or cohomology groups that are associated with hypergeometric integrals corresponding to degenerate hyperplane arrangements in the projective $k$-space. We present formulas to…
We introduce a combinatorial characterization of simpliciality for arrangements of hyperplanes. We then give a sharp upper bound for the number of hyperplanes of such an arrangement in the projective plane over a finite field, and present…
Non-parametric representations of dynamical systems based on the image of a Hankel matrix of data are extensively used for data-driven control. However, if samples of data are missing, obtaining such representations becomes a difficult…
To study discrete dynamical systems of different types --- deterministic, statistical and quantum --- we develop various approaches. We introduce the concept of a system of discrete relations on an abstract simplicial complex and develop…
We give divisibility results for the (global) characteristic varieties of hypersurface complements expressed in terms of the local characteristic varieties at points along one of the irreducible components of the hypersurface. As an…
The method of obtaining the set of noncanonical hypercomplex number systems by conversion of infinite hypercomplex number system to finite hypercomplex number system depending on multiplication rules and factorization method is described.…
In this work we develop some categorical aspects of the double structure of a module.
It is an open question to give a combinatorial interpretation of the Falk invariant of a hyperplane arrangement, i.e. the third rank of successive quotients in the lower central series of the fundamental group of the arrangement. In this…
We describe the dimensions of Hochschild (co)homology groups of weighted projective curves over complex numbers. Surprisingly, all but one of those numbers depend only on the genus of the underlying non-weighted curve and the number of…
We outline the construction of differential invariants for higher--rank tensors.
Two discrete dynamical systems are discussed and analyzed whose trajectories encode significant explicit information about a number of problems in combinatorial probability, including graphical enumeration on Riemann surfaces and random…