Related papers: Coloring ordinals by reals

We consider a class of quasi-linear anisotropic elliptic equations, possibly degenerate or singular, which are of interest in several applications such as computer vision and continuum mechanics. We prove a Hopf Lemma as well as local and…

The so called induction functors appear in several areas of Algebra in different forms. Interesting examples are the induction functors in the Theory of Affine Algebraic groups. In this note we investigate the so called Hopf pairings…

We study conditions on automorphisms of Boolean algebras of the form $P(\lambda)/I_\kappa$ (where $\lambda$ is an uncountable cardinal and $I_\kappa$ is the ideal of sets of cardinality less than $\kappa$) which allow one to conclude that a…

We study the $\kappa$-color cyclic particle system on the one-dimensional integer lattice $\mathbb{Z}$, first introduced by Bramson and Griffeath in \cite{bramson1989flux}. In that paper they show that almost surely, every site changes its…

The logic $\mathcal L^1_\kappa$ was introduced by Shelah in [3]. In [4], he proved that for a strongly compact cardinal $\kappa$, it admits the following algebraic characterization: two structures are $\mathcal L^1_\kappa$-equivalent if and…

The purpose of this article is to formulate and prove a global high-order regularity result within the high-contrast framework of elliptic homogenization. In order to achieve this, we also present a version of the high-contrast Caccioppoli…

This paper is concerned with a comparison principle for viscosity solutions to Hamilton-Jacobi (HJ), -Bellman (HJB), and -Isaacs (HJI) equations for general classes of partial integro-differential operators. Our approach innovates in three…

In the original version of this paper, we assume a theory $T$ that the logic $\mathbb L_{\kappa, \aleph_{0}}$ is categorical in a cardinal $\lambda > \kappa$, and $\kappa$ is a measurable cardinal. There we prove that the class of model of…

Kempe equivalence is a classical and important notion on vertex coloring in graph theory. In the present paper, we introduce several ideals associated with graphs and provide a method to determine whether two $k$-colorings are Kempe…

A simple proof of the convergence of the variational regularization, with the regularization parameter, chosen by the discrepancy principle, is given for linear operators under suitable assumptions. It is shown that the discrepancy…

We obtain results on the condensation principle called local club condensation. We prove that in extender models an equivalence between the failure of local club condensation and subcompact cardinals holds. This gives a characterization of…

We study linear $\alpha_p$-actions on affine spaces and the associated quotient singularities, using explicit stacky resolutions. We describe when the quotient singularities are log canonical, canonical or terminal, and we compute their…

We study whether symplectic quandle colorings can reveal causal structure encoded by "sky links" - i.e. links consisting of spheres of all light rays through two points in the space of all light rays of a spacetime. Building on the known…

We define two classes of colorings that have odd or even chirality on hexagonal lattices. This parity is an invariant in the dynamics of all loops, and explains why standard Monte-Carlo algorithms are nonergodic. We argue that adding the…

We show that errors in data transmitted through linear codes can be thought of as codewords of minimum weight of new linear codes. To determine errors we can then use methods specific to finding such special codewords. One of these methods…

One of the key problems in dealing with color in rendering, shading, compositing, or image manipulation is that we do not have algebraic structures that support operations over colors. In this paper, we present an all-encompassing framework…

We provide, for any regular uncountable cardinal $\kappa$, a new argument for Pincus' result on the consistency of $\mathrm{ZF}$ with the higher dependent choice principle $\mathrm{DC}_{<\kappa}$ and the ordering principle in the presence…

I develop in depth the machinery of $(\mathcal L, n)$-models originally introduced by Shelah and, independently in a slightly different form by Kripke. This machinery allows fairly routine constructions of true but unprovable sentences in…

We introduce the notion of a `pure` Abstract Elementary Class to block trivial counterexamples. We study classes of models of bipartite graphs and show: Main Theorem (cf. Theorem 3.5.2 and Corollary 3.5.6): If $(\lambda_i : i \le…

We introduce real induction, a proof technique analogous to mathematical induction but applicable to statements indexed by an interval on the real line. More generally we give an inductive principle applicable in any Dedekind complete…