Related papers: Chasing Silver
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…
Finding a cycle of lowest weight that represents a homology class in a simplicial complex is known as homology localization (HL). Here we address this NP-complete problem using parameterized complexity theory. We show that it is W[1]-hard…
We give arguments for and prove the consistency of some internal forcing axioms.
Verifying a conjecture of Petkov{\v{s}}ec, we prove that the lettericity of an n-vertex path is precisely $\left\lfloor \frac{n+4}{3}\right\rfloor$.
Consider a stochastic process $\mathfrak{X}$, regenerative at a state $x$ which is instantaneous and regular. Let $L$ be a regenerative local time for $\mathfrak{X}$ at $x$. Suppose furthermore that $\mathfrak{X}$ can be approximated by…
This paper is concerned with the inverse scattering and the transmission eigenvalues for anisotropic periodic layers. For the inverse scattering problem, we study the Factorization method for shape reconstruction of the periodic layers from…
Let $X$ be a random variable with distribution function $F,$ and $X_{1},X_{2},...,X_{n}$ are independent copies of $X.$ Consider the order statistics $X_{i:n},$ $i=1,2,...,n$ and denote $F_{i:n}(x)=P\{X_{i:n}\leq x\}.$ Using majorization…
The chase procedure for existential rules is an indispensable tool for several database applications, where its termination guarantees the decidability of these tasks. Most previous studies have focused on the skolem chase variant and its…
In (Mennle and Seuken, 2017), we have introduced partial strategyproofness, a new, relaxed notion of strategyproofness, to study the incentive properties of non-strategyproof assignment mechanisms. In this paper, we present results…
We consider the O(n) theory in the $n \to 0$ limit. We show that the theory is described by logarithmic conformal field theory, and that the correlation functions have logarithmic singularities. The explicit forms of the two-, three- and…
In this paper we obtain the central limit theorems, moderate deviations and the laws of the iterated logarithm for the energy \[H_n=\sum_{1\le j<k\le n}\omega_j\omega_k1_{\{S_j=S_k\}}\] of the polymer $\{S_1,...,S_n\}$ equipped with random…
We introduce more properties of forcing notions which imply that their lambda-support iterations are lambda-proper, where lambda is an inaccessible cardinal. This paper is a direct continuation of section A.2 of math.LO/0210205. As an…
Theory of $n$-complements with applications is presented.
We examine many-body localization properties for the eigenstates that lie in the droplet sector of the random-field spin-$\frac 1 2$ XXZ chain. These states satisfy a basic single cluster localization property (SCLP), derived in \cite{EKS}.…
I give a simple proof of a tight communication lower bound for pointer chasing.
We give a sufficient condition for the local limit theorem. To construct it, we employ infinite times of convolutions of probability density functions.
We investigate dynamical aspects of the discrete nonlinear Schr\"{o}dinger equation (DNLS) in finite lattices. Starting from a periodic chain with nearest neighbor interactions, we insert randomly links connecting distant pairs of sites…
We establish two general theorems on the local properties of the absolute summability of factored Fourier series by applying a recently defined absolute summability, $\left\vert A,\alpha_{n}\right\vert _{k}$ summability, and the class…
In this paper we prove that the inductive cocategory of a nilpotent $CW$-complex of finite type $X$, $\indcocat X$, is bounded above by an expression involving the inductive cocategory of the $p$-localisations of $X$. Our arguments can be…
The aim of this article is to introduce Vogel's localization theorem for classes of D-complexes: this generalization of Waldhausen's localization theorem is especially useful and powerful in that it gives an explicit and computable…