English
Related papers

Related papers: On the Skolem Problem for Continuous Linear Dynami…

200 papers

A continuous selection of polynomial functions is a continuous function whose domain can be partitioned into finitely many pieces on which the function coincides with a polynomial. Given a set of finitely many polynomials, we show that…

Optimization and Control · Mathematics 2020-07-09 Feng Guo , Liguo Jiao , Do Sang Kim

In the recent work [DFM1, DFM2] G. David, J. Feneuil, and the first author have launched a program devoted to an analogue of harmonic measure for lower-dimensional sets. A relevant class of partial differential equations, analogous to the…

Analysis of PDEs · Mathematics 2019-08-09 Svitlana Mayboroda , Zihui Zhao

The aim of this expository article is to present recent developments in the centuries old discussion on the interrelations between continuous and differentiable real valued functions of one real variable. The truly new results include,…

Functional Analysis · Mathematics 2018-06-29 Krzysztof C. Ciesielski , Juan B. Seoane Sepúlveda

In this survey paper we review classical results and recent progress about a certain topic in the spectral theory of two-dimensional canonical systems. Namely, we consider the questions whether the spectrum $\sigma$ is discrete, and if it…

Spectral Theory · Mathematics 2025-04-02 Jakob Reiffenstein , Harald Woracek

In this work we first provide sufficient conditions to assure the persistence of some zeros of functions having the form $$g(z,\varepsilon)=g_0(z)+\sum_{i=1}^k \varepsilon^i g_i(z)+\mathcal{O}(\varepsilon^{k+1}),$$ for $|\varepsilon|\neq0$…

Dynamical Systems · Mathematics 2017-08-15 Murilo R. Cândido , Jaume Llibre , Douglas D. Novaes

This paper considers an optimization problem for a dynamical system whose evolution depends on a collection of binary decision variables. We develop scalable approximation algorithms with provable suboptimality bounds to provide…

Optimization and Control · Mathematics 2016-10-31 Insoon Yang , Samuel A. Burden , Ram Rajagopal , S. Shankar Sastry , Claire J. Tomlin

Many problems in static program analysis can be modeled as the context-free language (CFL) reachability problem on directed labeled graphs. The CFL reachability problem can be generally solved in time $O(n^3)$, where $n$ is the number of…

Formal Languages and Automata Theory · Computer Science 2023-08-21 Paraschos Koutris , Shaleen Deep

Identification of nonlinear dynamical systems is crucial across various fields, facilitating tasks such as control, prediction, optimization, and fault detection. Many applications require methods capable of handling complex systems while…

Machine Learning · Statistics 2024-11-05 Luc Brogat-Motte , Riccardo Bonalli , Alessandro Rudi

We investigate Lawruk elliptic boundary-value problems for homogeneous differential equations in a two-sided refined Sobolev scale. These problems contain additional unknown functions in the boundary conditions of arbitrary orders. The…

Analysis of PDEs · Mathematics 2018-12-31 Anna Anop

One of the most basic, longstanding open problems in the theory of dynamical systems is whether reachability is decidable for one-dimensional piecewise affine maps with two intervals. In this paper we prove that for injective maps, it is…

Dynamical Systems · Mathematics 2023-03-20 Faraz Ghahremani , Edon Kelmendi , Joël Ouaknine

We provide a new method to approximate a (possibly discontinuous) function using Christoffel-Darboux kernels. Our knowledge about the unknown multivariate function is in terms of finitely many moments of the Young measure supported on the…

Optimization and Control · Mathematics 2021-04-09 Swann Marx , Edouard Pauwels , Tillmann Weisser , Didier Henrion , Jean Lasserre

$ $We study solutions of difference equations in the rings of sequences and, more generally, solutions of equations with a monoid action in the ring of sequences indexed by the monoid. This framework includes, for example, difference…

Algebraic Geometry · Mathematics 2020-03-19 Gleb Pogudin , Thomas Scanlon , Michael Wibmer

The uncertainty principle lemma for the Laplacian on Euclidean spaces shows the borderline-behavior of a potential for the following question : whether the Schr\"odinger operator has a finite or infinite number of the discrete pectrum. In…

Differential Geometry · Mathematics 2009-01-13 Kazuo Akutagawa , Hironori Kumura

We consider a class of Hamiltonian PDEs that can be split into a linear unbounded operator and a regular non linear part, and we analyze their numerical discretizations by symplectic methods when the initial value is small in Sobolev norms.…

Numerical Analysis · Mathematics 2009-04-10 Erwan Faou , Benoit Grebert

In this paper, without the axiom of choice, we show that if a certain downward L\"owenheim-Skolem property holds then all grounds are uniformly definable. We also prove that the axiom of choice is forceable if and only if the universe is a…

Logic · Mathematics 2020-01-07 Toshimichi Usuba

We investigate error bounds for numerical solutions of divergence structure linear elliptic PDEs on compact manifolds without boundary. Our focus is on a class of monotone finite difference approximations, which provide a strong form of…

Numerical Analysis · Mathematics 2023-06-05 Brittany Froese Hamfeldt , Axel G. R. Turnquist

We consider the Skorokhod problem in a time-varying interval. We prove existence and uniqueness for the solution. We also express the solution in terms of an explicit formula. Moving boundaries may generate singularities when they touch. We…

Probability · Mathematics 2007-12-19 Krzysztof Burdzy , Weining Kang , Kavita Ramanan

By use of window functions, time-frequency analysis tools like Short Time Fourier Transform overcome a shortcoming of the Fourier Transform and enable us to study the time- frequency characteristics of signals which exhibit transient os-…

Information Theory · Computer Science 2013-07-25 Sangnam Nam

The study of word equations (or the existential theory of equations over free monoids) is a central topic in mathematics and theoretical computer science. The problem of deciding whether a given word equation has a solution was shown to be…

Logic in Computer Science · Computer Science 2018-02-05 Joel Day , Vijay Ganesh , Paul He , Florin Manea , Dirk Nowotka

One often wishes for the ability to formally analyze large-scale systems---typically, however, one can either formally analyze a rather small system or informally analyze a large-scale system. This work tries to further close this…

Numerical Analysis · Mathematics 2020-08-06 Matthias Althoff