Related papers: Decomposition Lemmas
We define a fragment of monadic infinitary second-order logic corresponding to an abstract separation property. We use this to define the concept of a separation subclass. We use model theoretic techniques and games to show that separation…
We present pumping lemmas for five classes of functions definable by fragments of weighted automata over the min-plus semiring, the max-plus semiring and the semiring of natural numbers. As a corollary we show that the hierarchy of…
We are interested in the problem of translating between two representations of closure systems, namely implicational bases and meet-irreducible elements. Albeit its importance, the problem is open. Motivated by this problem, we introduce…
Partition of unities appear in many places in analysis. Typically they are generated by compactly supported functions with a certain regularity. In this paper we consider partition of unities obtained as integer-translates of entire…
We find solutions for a linear deformation of the symmetric three-term recursion relation. The orthogonal polynomials of the first and second kind associated with the deformed relation are obtained. The new density (weight) function is…
We calculate some infinite sums containing the digamma function in closed-form. These sums are related either to the incomplete beta function or to the Bessel functions. The calculations yield interesting new results as by-products, such as…
A foundational theory of compositional categorical rewriting theory is presented, based on a collection of fibration-like properties that collectively induce and intrinsically structure the large collection of lemmata used in the proofs of…
In this paper we demonstrate how to partition the real number line into four subsets which may be reassembled, via "piecewise rigid functions" that preserve Lebesgue measure, into two copies of the line. We then employ a similar process to…
We define the operation of composing two hereditary classes of permutations using the standard composition of permutations as functions and we explore properties and structure of permutation classes considering this operation. We mostly…
A standard informal method for analyzing the asymptotic complexity of a program is to extract a recurrence that describes its cost in terms of the size of its input, and then to compute a closed-form upper bound on that recurrence. We give…
We show that the M\"obius function of an interval in a permutation poset where the lower bound is sum (resp. skew) indecomposable depends solely on the sum (resp. skew) indecomposable permutations contained in the upper bound, and that this…
We consider the connection of functional decompositions of rational functions over the real and complex numbers, and a question about curves on a Riemann sphere which are invariant under a rational function.
This paper presents a precursory yet novel approach to the question answering task using structural decomposition. Our system first generates linguistic structures such as syntactic and semantic trees from text, decomposes them into…
Nonparametric extension of tensor regression is proposed. Nonlinearity in a high-dimensional tensor space is broken into simple local functions by incorporating low-rank tensor decomposition. Compared to naive nonparametric approaches, our…
Sequences whose terms are equal to the number of functions with specified properties are considered. Properties are based on the notion of derangements in a more general sense. Several sequences which generalize the standard notion of…
In this note we consider several kind of partition functions of one-dimensional models with nearest - neighbor interactions $I_n, n\in \mathbf{Z}$ and spin values $\pm 1$. We derive systems of recursive equations for each kind of such…
We consider the so-called Dickman subordinator, whose Levy measure has density 1/x restricted to the interval (0,1). The marginal density of this process, known as the Dickman function, appears in many areas of mathematics, from number…
We investigate a general framework of multiplicative multitask feature learning which decomposes each task's model parameters into a multiplication of two components. One of the components is used across all tasks and the other component is…
The definition of conservative-irreversible functions is extended to smooth manifolds. The local representation of these functions is studied and reveals that not each conservative-irreversible function is given by the weighted product of…
We discuss a class of regions and conformal mappings which are useful in several problems of approximation theory, harmonic analysis and spectral theory.