相关论文: Pre-filtrations, Pre-stable Canonical Rules, and t…
Explicit high-order non-canonical symplectic particle-in-cell algorithms for classical particle-field systems governed by the Vlasov-Maxwell equations are developed. The algorithm conserves a discrete non-canonical symplectic structure…
Let A be a C*-algebra and I a closed two-sided ideal of A. We use the Hilbert C*-modules picture of the Cuntz semigroup to investigate the relations between the Cuntz semigroups of I, A and A/I. We obtain a relation on two elements of the…
Let $Q$ be an acyclic quiver and $\Lambda$ be the complete preprojective algebra of $Q$ over an algebraically closed field $k$. To any element $w$ in the Coxeter group of $Q$, Buan, Iyama, Reiten and Scott have introduced and studied in…
In many practical applications, signals and environments are time- varying, which makes fixed filters unreliable. Adaptive filtering, on the other hand, updates in real time to suppress noise, track nonstationary signals, and identify…
We prove a canonical Kunneth decomposition for the motive of a commutative group scheme over a field. Moreover, we show that this decomposition behaves under the group law just as in cohomology. We also deduce applications of the…
The properties of discrete nonlinear symmetries of integrable equations are investigated. These symmetries are shown to be canonical transformations. On the basis of the considered examples, it is concluded, that the densities of the…
The solution of systems of linear(ized) equations lies at the heart of many problems in Scientific Computing. In particular for systems of large dimension, iterative methods are a primary approach. Stationary iterative methods are generally…
We study canonical filtrations of finite-dimensional associative algebras and Lie algebras. These filtrations are defined via optimal destabilizing one-parameter subgroups in the sense of geometric invariant theory (GIT), and appear to be a…
In this paper we provide two new semantics for proofs in the constructive modal logics CK and CD. The first semantics is given by extending the syntax of combinatorial proofs for propositional intuitionistic logic, in which proofs are…
In this chapter, we present six different proofs of Craig interpolation for the modal logic K, each using a different set of techniques (model-theoretic, proof-theoretic, syntactic, automata-theoretic, using quasi-models, and algebraic). We…
This paper presents a proof-theoretic analysis of the modal $\mu$-calculus. More precisely, we prove a syntactic cut-elimination for the non-wellfounded modal $\mu$-calculus, using methods from linear logic and its exponential modalities.…
In this paper we study a filtered "K-theoretical" analog of a graded algebra associated to any loopless graph G which was introduced in \cite{PS}. We show that two such filtered algebras are isomorphic if and only if their graphs are…
This paper studies the solution of nonsymmetric linear systems by preconditioned Krylov methods based on the normal equations, LSQR in particular. On some examples, preconditioned LSQR is seen to produce errors many orders of magnitude…
Normal modal logics extending the logic K4.3 of linear transitive frames are known to lack the Craig interpolation property, except some logics of bounded depth such as S5. We turn this `negative' fact into a research question and pursue a…
We propose and study a novel stochastic inertial primal-dual approach to solve composite optimization problems. These latter problems arise naturally when learning with penalized regularization schemes. Our analysis provide convergence…
A consistent framework has been put forward to quantize the isentropic, compressible and inviscid fluid model in the Hamiltonian framework, using the Clebsch parameterization. The naive quantization is hampered by the non-canonical (in…
Answering a question of Dobrinen and Todorcevic, we prove that below any stable ordered-union ultrafilter $\mathcal{U}$, there are exactly four nonprincipal Tukey classes: $[\mathcal{U}], [\mathcal{U}_{\operatorname{min}}],…
This partly expository paper first supplies the details of a method of factoring a stable C*-algebra A as B \otimes K in a canonical way. Then it is shown that this method can be put into a categorical framework, much like the…
Kolmogorov introduced an informal calculus of problems in an attempt to provide a classical semantics for intuitionistic logic. This was later formalised by Medvedev and Muchnik as what has come to be called the Medvedev and Muchnik…
We define a fragment of propositional logic where isomorphic propositions, such as $A\land B$ and $B\land A$, or $A\Rightarrow (B\land C)$ and $(A\Rightarrow B)\land(A\Rightarrow C)$ are identified. We define System I, a proof language for…