English
Related papers

Related papers: A Comment on Budach's Mouse-in-an-Octant Problem

200 papers

We prove that if X is any complex separable infinite-dimensional Banach space with an unconditional Schauder decomposition, X supports an operator T which is chaotic and frequently hypercyclic. In contrast with the complex case, we observe…

Functional Analysis · Mathematics 2010-10-19 Manuel De la Rosa , Leonhard Frerick , Sophie Grivaux , Alfredo Peris

This paper investigates the controllability of systems governed by conformable fractional order derivatives. It first establishes the existence and uniqueness of evolution operators for non-autonomous fractional-order homogeneous systems,…

Optimization and Control · Mathematics 2025-02-11 Dev Prakash Jha , Raju K George

Robots in 3D spaces with more than six degrees of freedom are redundant. A redundant robot allows multiple configurations of the robot for the given target point in the dexterous workspace. The presence of multiple solutions helps in…

Robotics · Computer Science 2023-08-08 Vineeth P , Guru Nanma P , V Sankar , B Sachin Kumar

For a linear difference equation with the coefficients being computable sequences, we establish algorithmic undecidability of the problem of determining the dimension of the solution space including the case when some additional prior…

Symbolic Computation · Computer Science 2024-10-08 Sergei Abramov , Gleb Pogudin

A constant-rate multi-mode system is a hybrid system that can switch freely among a finite set of modes, and whose dynamics is specified by a finite number of real-valued variables with mode-dependent constant rates. Alur, Wojtczak, and…

Logic in Computer Science · Computer Science 2017-07-14 Shankara Narayanan Krishna , Aviral Kumar , Fabio Somenzi , Behrouz Touri , Ashutosh Trivedi

Mr. C. Stephanos posed the following question in the Interm\'ediaire des Math\'ematiciens: "Do there exist polyhedra with invariant facets that are susceptible to an infinite family of transformations that only alter solid angles and…

History and Overview · Mathematics 2012-03-07 Raoul Bricard

Given two weighted automata, we consider the problem of whether one is big-O of the other, i.e., if the weight of every finite word in the first is not greater than some constant multiple of the weight in the second. We show that the…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Dmitry Chistikov , Stefan Kiefer , Andrzej S. Murawski , David Purser

One-dimensional systems---ranging from travelling light to circuit cables and from DNA to superstrings---are ubiquitous and critically important to the human knowledge of the universe. However, our engagement with one-dimensional systems in…

Statistical Mechanics · Physics 2020-08-18 Weiguo Yin

This paper completely solves the controllability problems of two-dimensional multi-input discrete-time bilinear systems with and without drift. Necessary and sufficient conditions for controllability, which cover the existing results, are…

Systems and Control · Computer Science 2014-01-23 Lin Tie

First-order temporal logics are notorious for their bad computational behaviour. It is known that even the two-variable monadic fragment is highly undecidable over various linear timelines, and over branching time even one-variable…

Logic in Computer Science · Computer Science 2015-08-17 Christopher Hampson , Agi Kurucz

We extend the notion of activity for automaton semigroups and monoids introduced by Bartholdi, Godin, Klimann and Picantin to a more general setting. Their activity notion was already a generalization of Sidki's activity hierarchy for…

Formal Languages and Automata Theory · Computer Science 2026-05-27 Daniele D'Angeli , Emanuele Rodaro , Jan Philipp Wächter

The midpoint method or technique is a measurement and as each measurement it has a tolerance, but worst of all it can be invalid, called Out-of-Control or OoC. The core of all midpoint methods is the accurate measurement of the difference…

Graphics · Computer Science 2015-02-23 Valere Huypens

We study in this paper the low Mach number limit for the 2d isentropic Euler system with ill-prepared initial data belonging to the critical Besov space $B_{2,1}^2$. By combining Strichartz estimates with the special structure of the…

Analysis of PDEs · Mathematics 2012-03-20 Taoufik Hmidi , Samira Sulaiman

The deterministic membership problem for timed automata asks whether the timed language recognised by a nondeterministic timed automaton can be recognised by a deterministic timed automaton. We show that the problem is decidable when the…

Formal Languages and Automata Theory · Computer Science 2020-07-21 Lorenzo Clemente , Sławomir Lasota , Radosław Piórkowski

Data automata on data words is a decidable model proposed by Boja\'nczyk et al. in 2006. Class automata, introduced recently by Boja\'nczyk and Lasota, is an extension of data automata which unifies different automata models on data words.…

Formal Languages and Automata Theory · Computer Science 2011-06-08 Zhilin Wu

The Douglas--Rachford algorithm is a popular algorithm for solving both convex and nonconvex feasibility problems. While its behaviour is settled in the convex inconsistent case, the general nonconvex inconsistent case is far from being…

Optimization and Control · Mathematics 2020-04-14 Heinz H. Bauschke , Minh N. Dao , Scott B. Lindstrom

In 1890 German mathematician and physicist W. Hess found new special case of integrability of Euler - Poisson equations of motion of a heavy rigid body with a fixed point. In 1892 P. A. Nekrasov proved that the solution of the problem of…

Exactly Solvable and Integrable Systems · Physics 2020-12-01 Boris S. Bardin , Alexander S. Kuleshov

Mean dimension is a topological invariant for dynamical systems that is meaningful for systems with infinite dimension and infinite entropy. Given a $\mathbb{Z}^k$-action on a compact metric space $X$, we study the following three problems…

Dynamical Systems · Mathematics 2015-10-07 Yonatan Gutman , Elon Lindenstrauss , Masaki Tsukamoto

Beginning with Turing's seminal work in 1950, artificial intelligence proposes that consciousness can be simulated by a Turing machine. This implies a potential theory of everything where the universe is a simulation on a computer, which…

Computational Complexity · Computer Science 2022-06-15 Blake Wilson , Ethan Dickey , Vaishnavi Iyer , Sabre Kais

In this paper we investigate the integrability properties of a two-state vertex model on the square lattice whose microstates at a vertex has always an odd number of incoming or outcoming arrows. This model was named odd eight-vertex model…

Mathematical Physics · Physics 2018-05-23 M. J. Martins