English
Related papers

Related papers: Pure patterns of order 2

200 papers

Koplienko \cite{Ko} found a trace formula for perturbations of self-adjoint operators by operators of Hilbert-Schmidt class $\mathcal{B}_2(\mathcal{H})$. Later, Neidhardt introduced a similar formula in the case of pair of unitaries…

Functional Analysis · Mathematics 2024-04-04 Arup Chattopadhyay , Soma Das , Chandan Pradhan

In this paper we consider nonlinear problems with an operator depending only on the deformation tensor. We consider the class of operators derived from a potential and with $(p,\delta)$ structure, for $1<p\leq 2$ and for all $\delta\geq0$.…

Analysis of PDEs · Mathematics 2021-12-24 Luigi C. Berselli , Michael Růžička

The paper deals with two issues: the existence of universal models of a theory T and related properties when cardinal arithmetic does not give this existence offhand. In the first section we prove that simple theories (e.g., theories…

Logic · Mathematics 2008-02-03 Saharon Shelah

We define and study the category $Coh_n(\Pone)$ of normal coherent sheaves on the monoid scheme $\Pone$ (equivalently, the $\mathfrak{M}_0$-scheme $\Pone / \fun$ in the sense of Connes-Consani-Marcolli \cite{CCM}). This category resembles…

Algebraic Geometry · Mathematics 2011-08-01 Matt Szczesny

We show that for $\Pi_2$-properties of second or third order arithmetic as formalized in appropriate natural signatures the apparently weaker notion of forcibility overlaps with the standard notion of consistency (assuming large cardinal…

Logic · Mathematics 2021-01-20 Matteo Viale

We study the signalling structure of higher order quantum maps from an order-theoretic perspective, building on the combinatorial characterization of higher order types by Bisio and Perinotti. We have shown in a previous work…

Quantum Physics · Physics 2026-04-13 Anna Jenčová

This paper explores properties and applications of an ordered subset of the quadratic integer ring $\mathbb{Z}\left[\frac{1+\sqrt{5}}{2}\right]$. The numbers are shown to exhibit a parity triplet, as opposed to the familiar even/odd doublet…

Number Theory · Mathematics 2018-06-06 Scott V. Tezlaf

This paper deals with a proof theory for a theory of $\Pi_{N}$-reflecting ordinals using a system of ordinal diagrams. This is a sequel to the previous one(APAL 129)in which a theory for $\Pi_{3}$-reflection is analysed proof-theoretically.

Logic · Mathematics 2010-07-07 Toshiyasu Arai

This thesis establishes a generalised setting with which to unify the study of finite local complexity (FLC) patterns. The abstract notion of a "pattern" is introduced, which may be seen as an analogue of the space group of isometries…

General Topology · Mathematics 2014-05-26 James J. Walton

We introduce a generalization of semistandard composition tableaux called permuted composition tableaux. These tableaux are intimately related to permuted basement semistandard augmented fillings studied by Haglund, Mason and Remmel. Our…

Combinatorics · Mathematics 2018-09-20 Vasu Tewari , Stephanie van Willigenburg

Let P be the set of the sequence of polynomials of degree n. The aim of this paper is to study the Stirling numbers of the second kind associated with P and of the first kind associated with P, in a unified and systematic way with the help…

Number Theory · Mathematics 2022-02-24 Dae san Kim , taekyun Kim

The call-by-value language RML may be viewed as a canonical restriction of Standard ML to ground-type references, augmented by a "bad variable" construct in the sense of Reynolds. We consider the fragment of (finitary) RML terms of order at…

Programming Languages · Computer Science 2015-01-20 Conrad Cotton-Barratt , David Hopkins , Andrzej S. Murawski , C. -H. Luke Ong

We introduce proof terms for string rewrite systems and, using these, show that various notions of equivalence on reductions known from the literature can be viewed as different perspectives on the notion of causal equivalence. In…

Logic in Computer Science · Computer Science 2023-03-29 Vincent van Oostrom

Schmidt characterised the class of rayless graphs by an ordinal rank function, which makes it possible to prove statements about rayless graphs by transfinite induction. Halin asked whether Schmidt's rank function can be generalised to…

Combinatorics · Mathematics 2021-01-26 Carl Bürger , Jan Kurkofka

We introduce and study a new type of compactness principle for strong logics that, roughly speaking, infers the consistency of a theory from the consistency of its small fragments in certain outer models of the set-theoretic universe. We…

Logic · Mathematics 2025-04-25 Peter Holy , Philipp Lücke , Sandra Müller

An abstract framework of canonical inference is used to explore how different proof orderings induce different variants of saturation and completeness. Notions like completion, paramodulation, saturation, redundancy elimination, and…

Logic in Computer Science · Computer Science 2015-02-11 Maria Paola Bonacina , Nachum Dershowitz

In this note we introduce higher order polar loci as natural generalizations of the classical polar loci, replacing the role of tangent spaces by that of higher order osculating spaces. The close connection between polar loci and dual…

Algebraic Geometry · Mathematics 2020-08-25 Ragni Piene

The theme of the first two sections, is to prepare the framework of how from a "complicated" family of index models I in K_1 we build many and/or complicated structures in a class K_2. The index models are characteristically linear orders,…

Logic · Mathematics 2016-02-09 Saharon Shelah

We isolate here a wide class of well founded orders called tame orders and show that each such order of cardinality at most $\kappa$ can be realized as the Mitchell order on a measurable cardinal $\kappa$, from a consistency assumption…

Logic · Mathematics 2015-08-18 Omer Ben-Neria

This paper discusses the formalization of proofs "by diagram chasing", a standard technique for proving properties in abelian categories. We discuss how the essence of diagram chases can be captured by a simple many-sorted first-order…

Logic in Computer Science · Computer Science 2023-11-29 Assia Mahboubi , Matthieu Piquerez