English
Related papers

Related papers: Formalized Confluence of Quasi-Decreasing, Strongl…

200 papers

Consider a three dimensional partially hyperbolic diffeomorphism. It is proven that under some rigid hypothesis on the tangent bundle dynamics, the map is (modulo finite covers and iterates) either an Anosov diffeomorphism, a skew-product…

Dynamical Systems · Mathematics 2020-06-30 Pablo D. Carrasco , Enrique Pujals , Federico Rodriguez-Hertz

We provide a characterisation of strong bisimilarity in a fragment of CCS that contains only prefix, parallel composition, synchronisation and a limited form of replication. The characterisation is not an axiomatisation, but is instead…

Logic in Computer Science · Computer Science 2008-10-14 Daniel Hirschkoff , Damien Pous

The ADM Hamiltonian formulation of general relativity with prescribed lapse and shift is a weakly hyperbolic system of partial differential equations. In general weakly hyperbolic systems are not mathematically well posed. For well…

General Relativity and Quantum Cosmology · Physics 2015-05-13 J. David Brown

In this paper, we apply Clausen-Scholze's theory of solid modules to the existence of adelic decompositions for schemes of finite type over $\mathbb{Z}$. Specifically, we use the six-functor formalism for solid modules to define the…

Algebraic Geometry · Mathematics 2025-07-29 Christopher Brav , Grigorii Konovalov

As a sequel to our recent work on Casselman--Shahidi's holomorphicity conjecture on half-normalized intertwining operators for quasi-split classical groups, we modify our method, based on a lemma of Heiermann--Opdam, to prove certain cases…

Representation Theory · Mathematics 2024-09-24 Caihua Luo

This paper is concerned with the characterizations of quasi self-adjoint extensions of a class of formally non-self-adjoint discrete Hamiltonian systems. Some properties of the solutions and the characterization of the minimal linear…

Spectral Theory · Mathematics 2025-12-11 Guojing Ren , Guixin Xu

In a previous paper the authors applied the Abstract Interpretation approach for approximating the probabilistic semantics of biological systems, modeled specifically using the Chemical Ground Form calculus. The methodology is based on the…

Logic in Computer Science · Computer Science 2009-12-01 Roberta Gori , Francesca Levi

The work of this paper is devoted to obtaining strong laws for intermediately trimmed sums of random variables with infinite means. Particularly, we provide conditions under which the intermediately trimmed sums of independent but not…

Probability · Mathematics 2023-10-03 Rita Giuliano , Milto Hadjikyriakou

This paper develops an algorithmic-based approach for proving inductive properties of propositional sequent systems such as admissibility, invertibility, cut-elimination, and identity expansion. Although undecidable in general, these…

Logic in Computer Science · Computer Science 2021-01-11 Carlos Olarte , Elaine Pimentel , Camilo Rocha

This paper considers systems subject to nonholonomic constraints which are not uniform on the whole configuration manifold. When the constraints change, the system undergoes a transition in order to comply with the new imposed conditions.…

Differential Geometry · Mathematics 2007-05-23 Jorge Cortes , Alexandre M. Vinogradov

We propose a real-space formalism of the topological Euler class, which characterizes the fragile topology of two-dimensional systems with real wave functions. This real-space description is characterized by local Euler markers whose…

Mesoscale and Nanoscale Physics · Physics 2025-02-21 Dexin Li , Citian Wang , Huaqing Huang

Iterative abstraction refinement techniques are one of the most prominent paradigms for the analysis and verification of systems with large or infinite state spaces. This paper investigates the changes of truth values of system properties…

Logic in Computer Science · Computer Science 2026-01-14 Jakob Piribauer , Vinzent Zschuppe

In this paper, we investigate multidimensional first-order quasi-linear systems and find necessary conditions for them to admit Hamiltonian formulation. The insufficiency of the conditions is related to the Poisson cohomology of the…

Exactly Solvable and Integrable Systems · Physics 2024-09-11 Xin Hu , Matteo Casati

We verify a confluence result for the rewriting calculus of the linear category introduced in our previous paper. Together with the termination result proved therein, the generalized coherence theorem for linear category is established.…

Category Theory · Mathematics 2021-05-04 Ryu Hasegawa

We establish a natural translation from word rewriting systems to strictly positive polymodal logics. Thereby, the latter can be considered as a generalization of the former. As a corollary we obtain examples of undecidable strictly…

Logic · Mathematics 2016-02-19 Lev D. Beklemishev

Let $\rho_\ell$ be a semisimple $\ell$-adic representation of a number field $K$ that is unramified almost everywhere. We introduce a new notion called weak abelian direct summands of $\rho_\ell$ and completely characterize them, for…

Number Theory · Mathematics 2024-05-29 Gebhard Böckle , Chun-Yin Hui

We introduce a new type of equivalence between blocks of finite group algebras called a strong isotypy. A strong isotypy is equivalent to a $p$-permutation equivalence and restricts to an isotypy in the sense of Brou\'{e}. To prove these…

Representation Theory · Mathematics 2023-10-18 John Revere McHugh

On the basis of the f-deformed oscillator formalism, we propose to construct nonlinear coherent states for Hamiltonian systems having linear and quadratic terms in the the number operator by means of the two following definitions: i) as…

Quantum Physics · Physics 2015-12-03 R. Román-Ancheyta , J. Récamier

This paper presents a formalisation of pGCL in Isabelle/HOL. Using a shallow embedding, we demonstrate close integration with existing automation support. We demonstrate the facility with which the model can be extended to incorporate…

Logic in Computer Science · Computer Science 2012-11-28 David Cock

Factorization -- a simple form of standardization -- is concerned with reduction strategies, i.e. how a result is computed. We present a new technique for proving factorization theorems for compound rewriting systems in a modular way, which…

Logic in Computer Science · Computer Science 2020-12-29 Beniamino Accattoli , Claudia Faggian , Giulio Guerrieri