Related papers: Hypomorphic Sperner systems and nonreconstructible…
We study semifinite harmonic functions on arbitrary branching graphs. We give a detailed exposition of an algebraic method which allows one to classify semifinite indecomposable harmonic functions on some multiplicative branching graphs.…
Indecomposible semifinite harmonic functions on the direct product of graded graphs are classified. As a particular case, the full list of indecomposible traces for the infinite inverse symmetric semigroup is obtained.
We consider a category whose morphisms are bordisms of $n$-dimensional pseudomanifolds equipped with a certain additional structure (coloring). On the other hand, we consider the product $G$ of $(n+1)$ copies of infinite symmetric group. We…
We define a new class of set functions that in addition to being monotone and subadditive, also admit a very limited form of submodularity defined over a permutation of the ground set. We refer to this permutation as a submodular order.…
We prove that if S is a set of functions from a set A to itself, S is closed under composition, and S contains all transpositions of A, then the action of S on Acan be recovered from the semigroup consisting of S together with its…
We consider a product of three copies of infinite symmetric group and its representations spherical with respect to the diagonal subgroup. We show that such representations generate functors from a certain category of simplicial…
We construct a theory of holant clones to capture the notion of expressibility in the holant framework. Their role is analogous to the role played by functional clones in the study of weighted counting Constraint Satisfaction Problems. We…
A family of recently investigated Bernstein functions is revisited and those functions for which the derivatives are logarithmically completely monotonic are identified. This leads to the definition of a class of Bernstein functions, which…
We present a type system that combines, in a controlled way, first-order polymorphism with intersectiontypes, union types, and subtyping, and prove its safety. We then define a type reconstruction algorithm that issound and terminating.…
The Mishchenko-Fomenko theorem on superintegrable Hamiltonian systems is generalized to superintegrable Hamiltonian systems with noncompact invariant submanifolds. It is formulated in the case of globally superintegrable Hamiltonian systems…
The existence of quasi-bi-Hamiltonian structures for a two-dimensional superintegrable $(k_1,k_2,k_3)$-dependent Kepler-related problem is studied. We make use of an approach that is related with the existence of some complex functions…
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.…
The Humbert-Bessel are multi-index functions with various applications in electromagnetism. New families of functions sharing some similarities with Bessel functions are often introduced in the mathematical literature, but at a closer…
For a class C of operations on a nonempty base set A, an operation f is called a C-subfunction of an operation g, if f = g(h_1, ..., h_n), where all the inner functions h_i are members of C. Two operations are C-equivalent if they are…
We obtain recurrences for smallest parts functions which resemble Euler's recurrence for the ordinary partition function. The proofs involve the holomorphic projection of non-holomorphic modular forms of weight 2.
A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…
We discuss the solvability of a fairly general class of systems of perturbed Hammerstein integral equations with functional terms that depend on several parameters. The nonlinearities and the functionals are allowed to depend on the…
We examine various categorical structures that can and cannot be constructed. We show that total computable functions can be mimicked by constructible functors. More generally, whatever can be done by a Turing machine can be constructed by…
Every mathematical structure has an elementary extension to a pseudo-countable structure, one that is seen as countable inside a suitable class model of set theory, even though it may actually be uncountable. This observation, proved easily…
We define the notion of computability of F{\o}lner sets for finitely generated amenable groups. We prove, by an explicit description, that the Kharlampovich group, a finitely presented solvable group with unsolvable word problem, has…