Related papers: Multivariate Permutation Polynomial Systems and No…
Within the study of uncertain dynamical systems, iterated random functions are a key tool. There, one samples a family of functions according to a stationary distribution. Here, we introduce an extension, where one sample functions…
Multimodal regression estimation methods are introduced for regression models involving circular response and/or covariate. The regression estimators are based on the maximization of the conditional densities of the response variable over…
The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…
We study some classes of semi-linear differential equations including both well-posed and ill-posed cases that can generate cocycles (or cocycle correspondences with generating cocycles). Under exponential dichotomy condition with other…
Investigating the possibility of applying techniques from linear systems theory to the setting of nonlinear systems has been the focus of many papers. The pseudo linear form representation of nonlinear dynamical systems has led to the…
When calculating higher terms of the epsilon-expansion of massive Feynman diagrams, one needs to evaluate particular cases of multiple inverse binomial sums. These sums are related to the derivatives of certain hypergeometric functions with…
Quantum pseudorandomness, also known as unitary designs, comprise a powerful resource for quantum computation and quantum engineering. While it is known in theory that pseudorandom unitary operators can be constructed efficiently, realizing…
We study degree preserving maps over the set of irreducible polynomials over a finite field. In particular, we show that every permutation of the set of irreducible polynomials of degree $k$ over $\mathbb{F}_q$ is induced by an action from…
Consider the representations of an algebraic group G. In general, polynomial invariant functions may fail to separate orbits. The invariant subring may not be finitely generated, or the number and complexity of the generators may grow…
Qualitative and quantitative aspects for variational inequalities governed by strongly pseudomonotone operators on Hilbert space are investigated in this paper. First, we establish a global error bound for the solution set of the given…
Randomness is both a useful way to model natural systems and a useful tool for engineered systems, e.g. in computation, communication and control. Fully random transformations require exponential time for either classical or quantum…
Fractional factorial designs are widely used for designing screening experiments. Nonregular fractional factorial designs can have better properties than regular designs, but their construction is challenging. Current research on the…
We consider the problem of learning high dimensional polynomial transformations of Gaussians. Given samples of the form $p(x)$, where $x\sim N(0, \mathrm{Id}_r)$ is hidden and $p: \mathbb{R}^r \to \mathbb{R}^d$ is a function where every…
Discrete models have a long tradition in engineering, including finite state machines, Boolean networks, Petri nets, and agent-based models. Of particular importance is the question of how the model structure constrains its dynamics. This…
This paper describes a new method for generating stationary integer-valued time series from renewal processes. We prove that if the lifetime distribution of renewal processes is nonlattice and the probability generating function is…
Solving a polynomial system, or computing an associated Gr\"obner basis, has been a fundamental task in computational algebra. However, it is also known for its notorious doubly exponential time complexity in the number of variables in the…
Invariant manifolds provide the geometric structures for describing and understanding dynamics of nonlinear systems. The theory of invariant manifolds for both finite and infinite dimensional autonomous deterministic systems, and for…
Let us consider a polynomial algebra in three variables equipped with an integer grading. We construct a system of group-generating automorphisms that preserve a given grading.
The AMAS group at the Paul Scherrer Institute developed an object oriented library for high performance simulation of high intensity ion beam transport with space charge. Such particle-in-cell (PIC) simulations require a method to generate…
We present here a probabilistic approach to the generation of new polynomials in two discrete variables. This extends our earlier work on the 'classical' orthogonal polynomials in a previously unexplored direction, resulting in the…