English
Related papers

Related papers: Local Nash Realizations

200 papers

The paper examines questions of local asymptotic stability of random dynamical systems. Results concerning stochastic dynamics in general metric spaces, as well as in Banach spaces, are obtained. The results pertaining to Banach spaces are…

Dynamical Systems · Mathematics 2015-03-17 Igor V. Evstigneev , Sergey A. Pirogov , Klaus R. Schenk-Hoppé

This paper is concerned with the local reducibility properties of linear realizations of codes on finite graphs. Trimness and properness are dual properties of constraint codes. A linear realization is locally reducible if any constraint…

Information Theory · Computer Science 2016-11-18 G. David Forney, , Heide Gluesing-Luerssen

The reachable sets of nonlinear control systems can in general only be numerically approximated, and are often very expensive to calculate. In this paper, we propose an algorithm that tracks only the boundaries of the reachable sets and…

Numerical Analysis · Mathematics 2025-02-20 Janosch Rieger , Kyria Wawryk

This is the second in a series of papers on the relation between algebraic set theory and predicative formal systems. In part I, we introduced the notion of a predicative category of small maps and obtained the result that such categories…

Logic · Mathematics 2008-01-16 Benno van den Berg , Ieke Moerdijk

Numerical methods for developing port-Hamiltonian representations of general linear time-invariant systems are studied. The approach extends previous port-Hamiltonian characterizations to include the general non-minimal case and the case…

Optimization and Control · Mathematics 2025-12-16 Christopher Beattie , Volker Mehrmann , Hongguo Xu

We study pure Nash equilibria in infinite-duration games on graphs, with partial visibility of actions but communication (based on a graph) among the players. We show that a simple communication mechanism consisting in reporting the…

Computer Science and Game Theory · Computer Science 2019-06-27 Patricia Bouyer , Nathan Thomasset

Based on a recently developed rank Theorem for Eisenstein power series, we provide new proofs of the following two results of W. Pawlucki: I) The non regular locus of a complex or real analytic map is an analytic set. II) The set of…

Algebraic Geometry · Mathematics 2023-03-15 Andre Belotto da Silva , Octave Curmi , Guillaume Rond

Given a countable discrete amenable group, we study conditions under which a set map into a Banach space (or more generally, a complete semi-normed space) can be realized as the ergodic sum of a vector under a group representation, such…

Dynamical Systems · Mathematics 2025-09-03 Raimundo Briceño , Godofredo Iommi

We study local approximation properties in hierarchical spline spaces through a twofold approach. First, we design and analyze a robust adaptive refinement algorithm to construct locally graded meshes. Second, we establish rigorous…

Numerical Analysis · Mathematics 2026-04-22 Gustavo A. Fernandez Lezcano , Eduardo M. Garau , Bárbara Ivaniszyn

Noncommutative rational functions, i.e., elements of the universal skew field of fractions of a free algebra, can be defined through evaluations of noncommutative rational expressions on tuples of matrices. This interpretation extends their…

Rings and Algebras · Mathematics 2018-04-24 Jurij Volčič

This paper is intended to give a characterization of the optimality case in Nash's inequality, based on methods of nonlinear analysis for elliptic equations and techniques of the calculus of variations. By embedding the problem into a…

Analysis of PDEs · Mathematics 2018-12-03 Emeric Bouin , Jean Dolbeault , Christian Schmeiser

The reduction of dynamical systems has a rich history, with many important applications related to stability, control and verification. Reduction of nonlinear systems is typically performed in an exact manner - as is the case with…

Optimization and Control · Mathematics 2007-07-26 Paulo Tabuada , Aaron D. Ames , Agung Julius , George J. Pappas

We study fundamental reachability problems on pseudo-orbits of linear dynamical systems. Pseudo-orbits can be viewed as a model of computation with limited precision and pseudo-reachability can be thought of as a robust version of classical…

Logic in Computer Science · Computer Science 2022-07-07 Julian D'Costa , Toghrul Karimov , Rupak Majumdar , Joël Ouaknine , Mahmoud Salamati , James Worrell

Nash equilibria provide a principled framework for modeling interactions in multi-agent decision-making and control. However, many equilibrium-seeking methods implicitly assume that each agent has access to the other agents' objectives and…

Computer Science and Game Theory · Computer Science 2026-03-19 Mahdis Rabbani , Navid Mojahed , Shima Nazari

Poset-causal systems form a class of decentralized systems introduced by Shah and Parrilo [32] and studied mainly in the context of optimal decentralized control. In this paper we develop part of the realization theory for poset-causal…

Optimization and Control · Mathematics 2020-10-13 Sanne ter Horst , Jaccie Zeelie

We show the existence of a Locality-Sensitive Hashing (LSH) family for the angular distance that yields an approximate Near Neighbor Search algorithm with the asymptotically optimal running time exponent. Unlike earlier algorithms with this…

Data Structures and Algorithms · Computer Science 2015-09-10 Alexandr Andoni , Piotr Indyk , Thijs Laarhoven , Ilya Razenshteyn , Ludwig Schmidt

Cohen and Glashow argued that very special conformal field theories of a particular kind (i.e. with HOM(2) or SIM(2) invariance) cannot be constructed within the framework of local field theories. We, however, show examples of local…

High Energy Physics - Theory · Physics 2018-07-18 Yu Nakayama

The method of nonlinear realizations is applied to construct new dynamical realizations of the Lifshitz group in mechanics, hydrodynamics, and field theory.

High Energy Physics - Theory · Physics 2023-08-08 Timofei Snegirev

We propose local symplectic surgery, a two-timescale procedure for finding local Nash equilibria in two-player zero-sum games. We first show that previous gradient-based algorithms cannot guarantee convergence to local Nash equilibria due…

Machine Learning · Computer Science 2019-01-28 Eric V. Mazumdar , Michael I. Jordan , S. Shankar Sastry

We consider dynamical systems arising from substitutions over a finite alphabet. We prove that such a system is linearly repetitive if and only if it is minimal. Based on this characterization we extend various results from primitive…

Dynamical Systems · Mathematics 2015-02-24 D. Damanik , D. Lenz