English
Related papers

Related papers: Circularity and repetitiveness in non-injective DF…

200 papers

Circular (or cyclic) proofs have received increasing attention in recent years, and have been proposed as an alternative setting for studying (co)inductive reasoning. In particular, now several type systems based on circular reasoning have…

Logic in Computer Science · Computer Science 2025-09-01 Gianluca Curzi , Anupam Das

This paper addresses the resilience of large-scale closed-loop structured systems in the sense of arbitrary pole placement when subject to failure of feedback links. Given a structured system with input, output, and feedback matrices, we…

Optimization and Control · Mathematics 2019-04-01 RaviTeja Gundeti , Shana Moothedath , Prasanna Chaporkar

In the present paper, we define the concept of weak topological conjugacy and we establish sufficient conditions to obtain this kind of topological conjugacy between two limit sets. We use the character of recurrence to obtain the results.

Dynamical Systems · Mathematics 2021-05-20 Everaldo de Mello Bonotto , Daniela Paula Demuner , Ginnara Mexia Souto

Chirality is a recurrent theme in the study of biological systems, in which active processes are driven by the internal conversion of chemical energy into work. Bacterial flagella, acto-myosin filaments and microtubule bundles are active…

Soft Condensed Matter · Physics 2020-05-01 Livio Nicola Carenza , Giuseppe Gonnella , Davide Marenduzzo , Giuseppe Negro

In this paper, we first introduce and study the notions of strongly $\phi$-flat modules and strongly nonnil-injective modules. And then, we investigate the homology dimensions of modules and rings in terms of these two notions. Finally we…

Commutative Algebra · Mathematics 2023-02-21 Xiaolei Zhang , Shiqi Xing , Wei Qi

We study some stronger forms of sensitivity, namely, F-sensitivity and weakly F-sensitivity for non-autonomous discrete dynamical systems. We obtain a condition under which these two forms of sensitivity are equivalent. We also justify the…

Dynamical Systems · Mathematics 2019-05-27 Radhika Vasisht , Ruchi Das

Formal explainability guarantees the rigor of computed explanations, and so it is paramount in domains where rigor is critical, including those deemed high-risk. Unfortunately, since its inception formal explainability has been hampered by…

Artificial Intelligence · Computer Science 2024-12-04 Xuanxiang Huang , Joao Marques-Silva

This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…

Logic in Computer Science · Computer Science 2025-09-03 Seth Bulin

Reversible systems feature both forward computations and backward computations, where the latter undo the effects of the former in a causally consistent manner. The compositionality properties and equational characterizations of strong and…

Logic in Computer Science · Computer Science 2023-10-03 Marco Bernardo , Andrea Esposito

We consider here an elliptic coupled system describing the dynamics of liquid crystals flows. This system is posed on the whole n-dimensional space. We introduce first the notion of very weak solutions for this system. Then, within the…

Analysis of PDEs · Mathematics 2023-04-28 Oscar Jarrin

The main purpose of this study is to introduce and study two new classes of continuity called eR-continuous functions and weakly eR-continuous functions via e-regular sets. Both of the forms of continuous functions we have described are…

General Topology · Mathematics 2024-05-16 B. S. Ayhan

Circular D0L-systems are those with finite synchronizing delay. We introduce a tool called graph of overhangs which can be used to find the minimal value of synchronizing delay of a given D0L-system. By studying the graphs of overhangs, a…

Combinatorics · Mathematics 2017-05-31 Karel Klouda , Kateřina Medková

We define the notion of circular words, then consider on such words a constraint derived from the Fibonacci condition. We give several results on the structure of these circular words, then mention possible applications to various…

Formal Languages and Automata Theory · Computer Science 2011-08-19 Benoît Rittaud , Laurent Vivier

We consider weak invariance principles (functional limit theorems) in the domain of a stable law. A general result is obtained on lifting such limit laws from an induced dynamical system to the original system. An important class of…

Dynamical Systems · Mathematics 2015-04-29 Ian Melbourne , Roland Zweimüller

We prove strong completeness results for some modal logics with the universal modality, with respect to their topological semantics over 0-dimensional dense-in-themselves metric spaces. We also use failure of compactness to show that, for…

Logic · Mathematics 2020-08-12 Robert Goldblatt , Ian Hodkinson

We consider the problem of asymptotic stability and linear inviscid damping for perturbations of a point vortex and similar degenerate circular flows. Here, key challenges include the lack of strict monotonicity and the necessity of working…

Analysis of PDEs · Mathematics 2018-01-24 Michele Coti Zelati , Christian Zillinger

The weak-strong uniqueness of solutions to a broad class of cross-diffusion systems with volume filling is established. In general, the diffusion matrices are neither symmetric nor positive definite. This issue is overcome by supposing that…

Analysis of PDEs · Mathematics 2025-10-01 Maria Heitzinger , Ansgar Jüngel

Decision-focused learning (DFL) has emerged as a powerful end-to-end alternative to conventional predict-then-optimize (PTO) pipelines by directly optimizing predictive models through downstream decision losses. Existing DFL frameworks are…

Machine Learning · Computer Science 2025-12-01 Xinyu Wang , Jinxiao Du , Yiyang Peng , Wei Ma

We prove that the problem of deciding whether a given morphic sequence is uniformly recurrent is decidable. The proof uses decidability of HD0L periodicity problem, which was recently proved in papers of F.Durand and I.Mitrofanov.

Combinatorics · Mathematics 2012-07-19 Ivan Mitrofanov

We discuss integrable discretizations of 3-dimensional cyclic systems, that is, orthogonal coordinate systems with one family of circular coordinate lines. In particular, the underlying circle congruences are investigated in detail, and…

Exactly Solvable and Integrable Systems · Physics 2022-05-19 Udo Hertrich-Jeromin , Gudrun Szewieczek