English
Related papers

Related papers: Almost solutions of equations in permutations

200 papers

We establish conditions guaranteeing that all eventually positive increasing solutions of a half-linear delay differential equation are regularly varying and derive precise asymptotic formulae for them. The results here presented are new…

Classical Analysis and ODEs · Mathematics 2025-04-18 Serena Matucci , Pavel Řehák

In this paper, we establish the lower semicontinuity of the solution mapping and of the approximate solution mapping for parametric fixed point problems under some suitable conditions. As applications, the lower semicontinuity result…

Optimization and Control · Mathematics 2017-07-18 Yu Han , Nan-jing Huang

We prove a.s. (almost sure) unisolvency of interpolation by continuous random sampling with respect to any given density, in spaces of multivariate a.e. (almost everywhere) analytic functions. Examples are given concerning polynomial and…

Numerical Analysis · Mathematics 2023-03-27 Francesco Dell'Accio , Alvise Sommariva , Marco Vianello

Nielsen transformations form the basis of a simple and widely used procedure for solving word equations. We make progress on the problem of determining when this procedure terminates in the presence of length constraints. To do this, we…

Logic in Computer Science · Computer Science 2025-01-22 Benjamin Przybocki , Clark Barrett

The scalar difference equation $x_{n+1}=f_{n}(x_{n},x_{n-1},...,x_{n-k})$ may exhibit symmetries in its form that allow for reduction of order through substitution or a change of variables. Such form symmetries can be defined generally…

Dynamical Systems · Mathematics 2008-05-28 H. Sedaghat

For a large class of nonlinear evolution PDEs, and more generally, of nonlinear semigroups, as well as their approximating numerical methods, two rather natural stability type convergence conditions are given, one being necessary, while the…

General Mathematics · Mathematics 2008-06-30 Elemer E Rosinger

This article is devoted to the study of solutions of non-homogenous linear differential equations having entire coefficients. We get all non-trivial solutions of infinite order of equation $f^{(n)}+a_{n-1}(z)f^{(n-1)}+\ldots…

Complex Variables · Mathematics 2022-08-24 Naveen Mehra , S. K. Chanyal

We present a new technique for computing permutation polynomials based on equivalence relations. The equivalence relations are defined by expanded normalization operations and new functions that map permutation polynomials (PPs) to other…

Information Theory · Computer Science 2020-01-03 Sergey Bereg , Brian Malouf , Linda Morales , Thomas Stanley , I. Hal Sudborough , Alexander Wong

The problem of finding \emph{distance} between \emph{pattern} of length $m$ and \emph{text} of length $n$ is a typical way of generalizing pattern matching to incorporate dissimilarity score. For both Hamming and $L_1$ distances only a…

Data Structures and Algorithms · Computer Science 2018-05-04 Przemysław Uznański

We study a large class of models with an arbitrary (finite) number of degrees of freedom, described by Hamiltonians which are polynomial in bosonic creation and annihilation operators, and including as particular cases n-th harmonic…

Mathematical Physics · Physics 2010-05-21 G Alvarez , F Finkel , A Gonzalez-Lopez , M A Rodriguez

The Bohl-Perron result on exponential dichotomy for a linear difference equation $$ x(n+1)-x(n) + \sum_{l=1}^m a_l(n)x(h_l(n))=0, h_l(n)\leq n, $$ states (under some natural conditions) that if all solutions of the non-homogeneous equation…

Dynamical Systems · Mathematics 2014-06-24 Leonid Berezansky , Elena Braverman

We describe geometrically and algebraically the set of unattainable points for the Rational Hermite Interpolation Problem (i.e. those points where the problem does not have a solution). We show that this set is a union of equidimensional…

Commutative Algebra · Mathematics 2017-10-03 Cortadellas Teresa , D'Andrea Carlos , Montoro Eulalia

In this talk I present a simple and unified approach to both exact and quasi-exact solvabilities of the one-dimensional Schr\"odinger equation. It is based on the prepotential together with Bethe ansatz equations. This approach gives the…

High Energy Physics - Theory · Physics 2019-12-06 Choon-Lin Ho

We shall consider a result of Fel'dman, where a sharp Baker-type lower bound is obtained for linear forms in the values of some E-functions. Fel'dman's proof is based on an explicit construction of Pad\'e approximations of the first kind…

Number Theory · Mathematics 2017-04-07 Keijo Väänänen

Let M(n, d) be the maximum size of a permutation array on n symbols with pairwise Hamming distance at least d. We use various combinatorial, algebraic, and computational methods to improve lower bounds for M(n, d). We compute the Hamming…

Discrete Mathematics · Computer Science 2016-10-03 Sergey Bereg , Avi Levy , I. Hal Sudborough

Recently, finding the sparsest solution of an underdetermined linear system has become an important request in many areas such as compressed sensing, image processing, statistical learning, and data sparse approximation. In this paper, we…

Optimization and Control · Mathematics 2020-03-31 Jialiang Xu

We study bounded deviation of non-deterministic finite transducers under the Hamming distance: the bounded comparison problem asks, given two transducers and $k \in \mathbb{N}$, whether for every input the two transducers produce words at…

Formal Languages and Automata Theory · Computer Science 2026-04-29 Luc Dartois , Pierre-Cyrille Héam , Ismaël Jecker , Silvio Vescovo

This paper deals with bounded solutions of quasilinear elliptic equations on Riemannian manifolds satisfying special condition.

Analysis of PDEs · Mathematics 2009-11-13 A. B. Ivanov

The paper deals with homogenization and higher order approximations of solutions to nonlocal evolution equations of convolution type whose coefficients are periodic in the spatial variables and random stationary in time. We assume that the…

Analysis of PDEs · Mathematics 2026-02-11 Marina Kleptsyna , Andrey Piatnitski , Alexandre Popier

We provide bounds on the compression size of the solutions to 22 problems in computer science. For each problem, we show that solutions exist with high probability, for some simple probability measure. Once this is proven, derandomization…

Computational Complexity · Computer Science 2023-04-25 Samuel Epstein