English
Related papers

Related papers: Conservation theorems on semi-classical arithmetic

200 papers

In this paper, we propose an adaptive high-order method for hyperbolic systems of conservation laws. The proposed method is based on a dual formulation approach: Two numerical solutions, corresponding to conservative and nonconservative…

Numerical Analysis · Mathematics 2026-01-29 Alina Chertock , Qingcheng Fu , Alexander Kurganov , Lorenzo Micalizzi

A theory T is tight if different deductively closed extensions of T (in the same language) cannot be bi-interpretable. Many well-studied foundational theories are tight, including PA [Visser2006], ZF, Z2, and KM [enayat2017]. In this…

Logic · Mathematics 2023-05-16 Alfredo Roque Freire , Kameryn J. Williams

In this paper, we give a new proof of the classical KAM theorem on the persistence of an invariant quasi-periodic torus, whose frequency vector satisfies the Bruno-R\"ussmann condition, in real-analytic non-degenerate Hamiltonian systems…

Dynamical Systems · Mathematics 2015-06-18 Abed Bounemoura , Stephane Fischler

We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…

Logic · Mathematics 2026-01-06 Saharon Shelah

To every $Q$-irreducible representation $r$ of a finite group $H$, there corresponds a simple factor $A$ of $Q[H]$ with an involution $\tau$. To this pair $(A,\tau)$, we associate an arithmetic group $\Omega$ consisting of all $(2g-2)\times…

Geometric Topology · Mathematics 2015-04-10 Fritz Grunewald , Michael Larsen , Alexander Lubotzky , Justin Malestein

It was shown by Visser that Peano Arithmetic has the property that any two bi-interpretable extensions of it (in the same language) are equivalent. Enayat proposed to refer to this property of a theory as tightness and to carry out a more…

Logic · Mathematics 2025-12-11 Piotr Gruza , Leszek Aleksander Kołodziejczyk , Mateusz Łełyk

It is shown that the Kadanoff-Baym equations at consistent first-order gradient approximation reveal exact rather than approximate conservation laws related to global symmetries of the system. The conserved currents and energy-momentum…

Nuclear Theory · Physics 2011-08-12 J. Knoll , Yu. B. Ivanov , D. N. Voskresensky

Partial differential equations (PDEs) describing thermodynamically isolated systems typically possess conserved quantities (like mass, momentum, and energy) and dissipated quantities (like entropy). Preserving these conservation and…

Numerical Analysis · Mathematics 2025-12-01 Boris D. Andrews , Patrick E. Farrell

Motivated by the study of resolvent estimates in the presence of trapping, we prove a semiclassical propagation theorem in a neighborhood of a compact invariant subset of the bicharacteristic flow which is isolated in a suitable sense.…

Analysis of PDEs · Mathematics 2013-08-28 Kiril Datchev , András Vasy

In this paper we give an elementary proof of the Fundamental Theorem of Algebra for polynomials over the rational tropical semi-ring. We prove that, tropically, the rational numbers are algebraically closed. We provide a simple algorithm…

Combinatorics · Mathematics 2007-07-18 Nathan Grigg , Nathan Manwaring

Subgradient and Newton algorithms for nonsmooth optimization require generalized derivatives to satisfy subtle approximation properties: conservativity for the former and semismoothness for the latter. Though these two properties originate…

Optimization and Control · Mathematics 2021-02-18 Damek Davis , Dmitriy Drusvyatskiy

Hoare's logic is an axiomatic system of proving programs correct, which has been extended to be a separation logic to reason about mutable heap structure. We develop the most fundamental logical structure of strongest postcondition of…

Logic in Computer Science · Computer Science 2013-11-20 Zhaowei Xu

It is not surprising that one should expect that the degree of constrained (shape preserving) approximation be worse than the degree of unconstrained approximation. However, it turns out that, in certain cases, these degrees are the same.…

Classical Analysis and ODEs · Mathematics 2019-01-15 K. A. Kopotun , D. Leviatan , I. A. Shevchuk

We present a graded modal type theory, a dependent type theory with grades that can be used to enforce various properties of the code. The theory has $\Pi$-types, weak and strong $\Sigma$-types, natural numbers, an empty type, and a…

Logic in Computer Science · Computer Science 2026-05-01 Andreas Abel , Nils Anders Danielsson , Oskar Eriksson

We characterize conservative median algebras and semilattices by means of forbidden substructures and by providing their representation as chains. Moreover, using a dual equivalence between median algebras and certain topological…

Rings and Algebras · Mathematics 2016-02-15 Miguel Couceiro , Jean-Luc Marichal , Bruno Teheux

We establish the equations which translate a conservation law for the problem of the seismic response of an above-ground structure (e.g., building, hill or mountain) of arbitrary shape and inquire whether both the implicit (formal) and…

Geophysics · Physics 2020-01-22 Armand Wirgin

[Note: Currently the proof is incomplete as we are using the lemma 3.2 which is not true in general]. We offer a complete resolution of a conjecture by Lions-Perthame-Tadmor mentioned in their celebrated work (1994, [34]). We prove the…

Analysis of PDEs · Mathematics 2019-01-03 Shyam Sundar Ghoshal , Animesh Jana

We present a general algorithm constructing a discretization of a classical field theory from a Lagrangian. We prove a new discrete Noether theorem relating symmetries to conservation laws and an energy conservation theorem not based on any…

Mathematical Physics · Physics 2023-09-14 Mikhail Skopenkov

The paper focuses on the development of numerical methods for the compressible Euler equations. It is well-known that if the Mach number is small, the system becomes stiff and hence explicit schemes suffer from severe time-step…

Numerical Analysis · Mathematics 2026-04-30 Alina Chertock , Smadar Karni , Alexander Kurganov , Lorenzo Micalizzi

Lindstr\"om theorems characterize logics in terms of model-theoretic conditions such as Compactness and the L\"owenheim-Skolem property. Most existing characterizations of this kind concern extensions of first-order logic. But on the other…

Logic in Computer Science · Computer Science 2015-07-01 Johan van Benthem , Balder ten Cate , Jouko Vaananen
‹ Prev 1 8 9 10 Next ›