Related papers: Iteration of Exponentials with Sign Changes
Using the sign expansion of the surreal numbers, we give a possible notion of convergence for surreal sequences.
This article is a survey of the exponential polynomials (also called single-variable Bell polynomials) from the point of view of Analysis. Some new properties are included and several Analysis-related applications are mentioned.
We study analytically the statistics of multiple sign changes in a discrete non-Markovian sequence ,\psi_i=\phi_i+\phi_{i-1} (i=1,2....,n) where \phi_i's are independent and identically distributed random variables each drawn from a…
We construct fast, structure-preserving iterations for computing the sign decomposition of a unitary matrix $A$ with no eigenvalues equal to $\pm i$. This decomposition factorizes $A$ as the product of an involutory matrix $S =…
In various areas of applied numerics, the problem of calculating the logarithm of a matrix A emerges. Since series expansions of the logarithm usually do not converge well for matrices far away from the identity, the standard numerical…
We consider signed graphs, i.e, graphs with positive or negative signs on their edges. We determine the admissible parameters for the $\{5,6,\ldots,10\}$-regular signed graphs which have only two distinct eigenvalues. For each obtained…
We prove the existence of signed combinatorial interpretations for several large families of structure constants. These families include standard bases of symmetric and quasisymmetric polynomials, as well as various bases in Schubert…
In this note we discuss a variant of linear logic with idempotent exponential modalities. We propose a sequent calculus system and discuss its semantics. We also give a concrete relational model for this calculus.
We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling.
We prove Bourgain's Return Times Theorem for a range of exponents $p$ and $q$ that are outside the duality range. An oscillation result is used to prove hitherto unknown almost everywhere convergence for the signed average analog of…
We develop a class of integrals on a manifold M called exponential iterated integrals, an extension of K. T. Chen's iterated integrals. It is shown that the matrix entries of any upper triangular representation of the fundamental group of M…
Bounds on the entropy of patterns of sequences generated by independently identically distributed (i.i.d.) sources are derived. A pattern is a sequence of indices that contains all consecutive integer indices in increasing order of first…
A set of non-negative integers is an additive basis with range $n$, if its sumset covers all consecutive integers from 0 to $n$, but not $n+1$. If the range is exactly twice the largest element of the basis, the basis is restricted.…
Sign tests are among the most successful procedures in multivariate nonparametric statistics. In this paper, we consider several testing problems in multivariate analysis, directional statistics and multivariate time series analysis, and we…
In this paper, we consider mappings on uniform domains with exponentially integrable distortion whose Jacobian determinants are integrable. We show that such mappings can be extended to the boundary and moreover these extensions are…
Many problems can be specified by patterns of propositional formulae depending on a parameter, e.g. the specification of a circuit usually depends on the number of bits of its input. We define a logic whose formulae, called "iterated…
We introduce a method for deriving constraints on the symbol of Feynman integrals from the form of their asymptotic expansions in the neighborhood of Landau loci. In particular, we show that the behavior of these integrals near singular…
Data vectors generalise finite multisets: they are finitely supported functions into a commutative monoid. We study the question if a given data vector can be expressed as a finite sum of others, only assuming that 1) the domain is…
Guided by classical concepts, we define the notion of \emph{ends} of an iterated function system and prove that the number of ends is an upper bound for the number of nondegenerate components of its attractor. The remaining isolated points…
Exponential error bounds achievable by universal coding and decoding are derived for frame-asynchronous discrete memoryless %asynchronous multiple access channels with two senders, via the method of subtypes, a refinement of the method of…