Related papers: Conservations of first-order reflections
A set of general physical principles is proposed as the structural basis for the theory of complex systems. First the concept of harmony is analyzed and its different aspects are uncovered. Then the concept of reflection is defined and…
We develop a set of numerical schemes for the Poisson--Nernst--Planck equations. We prove that our schemes are mass conservative, uniquely solvable and keep positivity unconditionally. Furthermore, the first-order scheme is proven to be…
We demonstrate that a pair consisting of a second-order homogeneous Hamiltonian structure in $N$ components and its associated system of conservation laws is in bijective correspondence with an alternating three-form on a $N+2$-dimensional…
The Khintchine recurrence theorem asserts that on a measure preserving system, for every set $A$ and $\varepsilon>0$, we have $\mu(A\cap T^{-n}A)\geq \mu(A)^2-\varepsilon$ for infinitely many $n\in \mathbb{N}$. We show that there are…
Let $(K,\mathcal O,k)$ be a $p$-modular system and assume $k$ is algebraically closed. We show that if $\Lambda$ is an $\mathcal O$-order in a separable $K$-algebra, then $\textrm{Pic}_{\mathcal O}(\Lambda)$ carries the structure of an…
Denote by $M_n$ the set of $n\times n$ complex matrices. Let $f: M_n \rightarrow [0,\infty)$ be a continuous map such that $f(\mu UAU^*)= f(A)$ for any complex unit $\mu$, $A \in M_n$ and unitary $U \in M_n$, $f(X)=0$ if and only if $X=0$…
We investigate $n$-component systems of conservation laws that possess third-order Hamiltonian structures of differential-geometric type. The classification of such systems is reduced to the projective classification of linear congruences…
The main purpose of this paper is to present a new and more uniform model-theoretic/combinatorial proof of the theorem ([5]): The randomization $T^{R}$ of a complete first-order theory $T$ with $NIP$ is a (complete) first-order continuous…
For a class $\Gamma$ of formulas, $\Gamma$ local reflection principle $\mathrm{Rfn}_{\Gamma}(T)$ for a theory $T$ of arithmetic is a scheme formalizing the $\Gamma$-soundness of $T$. Beklemishev proved that for every $\Gamma \in \{\Sigma_n,…
The back-and-forth relations $M\leq_\alpha N$ are central to computable structure theory and countable model theory. It is well-known that the relation $\{(M,N) : M \leq_\alpha N\}$ is (lightface) $\Pi^0_{2\alpha}$. We show that this is…
Schmerl and Beklemishev's work on iterated reflection achieves two aims: It introduces the important notion of $\Pi^0_1$-ordinal, characterizing the $\Pi^0_1$-theorems of a theory in terms of transfinite iterations of consistency; and it…
It is proved that the first-order theory of the structure (N,mod) is undecidable. Here mod denotes the operation of computing the remainder for any division between positive integers; i.e. x mod y is the remainder obtained by the division x…
The kinetic field theory is developed without assumptions of statistical homogeneity and isotropy. In a solvable toy model with short-ranged interactions, we compare first-order perturbation theory to an iterated mean-field approximation…
We study relations between reflections in (positive or negative) points in the complex hyperbolic plane. It is easy to see that the reflections in the points q_1,q_2 obtained from p_1,p_2 by moving p_1,p_2 along the geodesic generated by…
This paper studies the K-theory of categories of partially cancellative monoid sets, which is better behaved than that of all finitely generated monoid sets. A number of foundational results are proved, making use of the formalism of…
We construct the U(N) spinning particle theories, which describe particles moving on Kahler spaces. These particles have the same relation to the N=2 string as usual spinning particles have to the NSR string. We find the restrictions on the…
We prove that all injective maps on positive complex matrices which preserve order and shrink spectrum are implemented by unitary or antiunitary conjugations. We show by counterexamples that all assumptions are indispensable. The result…
In this paper we give an overview of an essential part of a Pi^0_1 ordinal analysis of Peano Arithmetic (PA) as presented by Beklemishev. This analysis is mainly performed within the polymodal provability logic GLP. We reflect on ways of…
This article studies the number of ways of selecting $k$ objects arranged in $p$ circles of sizes $n_1,\ldots,n_p$ such that no two selected ones have less than $s$ objects between them. If $n_i\geq sk+1$ for all $1\leq i \leq p$, this…
We investigate reflection of stationary sets in P_kappa lambda and prove a consistency result for the case when lambda is the successor of kappa.