Related papers: On Braid Words and Irreflexivity

We give a new and intrinsic proof of the transitivity of the braid group action on the set of full exceptional sequences of coherent sheaves on a weighted projective line. We do not use here the corresponding result of Crawley-Boevey for…

We show that the first-order logical theory of the binary overlap-free words (and, more generally, the ${\alpha}$-free words for rational ${\alpha}$, $2 < {\alpha} \leq 7/3$), is decidable. As a consequence, many results previously obtained…

The aim of this note is a combinatorial description of a category of $D$-modules over an affine space, smooth along the stratification defined by an arrangement of hyperplanes. These $D$-modules are assumed to satisfy certain non-resonance…

Existing technology can parse arbitrary context-free grammars, but only a single, static grammar per input. In order to support more powerful syntax-extension systems, we propose reflective grammars, which can modify their own syntax during…

This paper deals with the problem of describing the vector spaces of divergence-free, natural tensors on a pseudo-Riemannian manifold that are second-order; i.e., that are defined using only second derivatives of the metric. The main result…

We prove that the pure braid groups on closed, orientable surfaces are bi-orderable, and that the pure braid groups on closed, non-orientable surfaces have generalized torsion, thus they are not bi-orderable.

This paper deals with an improvement of the "a-priori stability bounds" on the variation of the action variables and on the stability time obtained from a given Birkhoff normal form around the elliptic equilibrium point of an Hamiltonian…

We prove norm estimates for multilinear fractional integrals acting on weighted and variable Hardy spaces. In the weighted case we develop ideas we used for multilinear singular integrals [7]. For the variable exponent case, a key element…

A model of a shear band as a zero-thickness nonlinear interface is proposed and tested using finite element simulations. An imperfection approach is used in this model where a shear band, that is assumed to lie in a ductile matrix material…

This article shows that there exist two particular linear orders such that first-order logic with these two linear orders has the same expressive power as first-order logic with the Bit-predicate FO(Bit). As a corollary we obtain that there…

This unpublished note is an alternate, shorter (and hopefully more readable) proof of the decidability of all minimal models. The decidability follows from a proof of the existence of a cellular term in each observational equivalence class…

Let Y be a compact reduced subspace of a complex manifold X, and let F be a subsheaf of the tangent bundle T_X which is closed under the Lie bracket. This paper discusses criteria to guarantee that infinitesimal deformations of the…

The purpose of this note is to advertise an elegant algorithmic proof for the Jordan--Chevalley decomposition of a matrix, following and (slightly) revising the discussion of Couty, Esterle und Zarouf (2011). The basic idea of that method…

Either fibered knots supporting the tight contact structure are unique in their smooth concordance class or there exists a fibered counterexample to the Slice-Ribbon Conjecture.

We use the technique of "classical realizability" to build new models of ZF + DC in which R is not well ordered. This gives new relative consistency results, probably not obtainable by forcing. This gives also a new method to get programs…

Descriptions of hadrons and glueballs can be constructed using strings to preserve gauge invariance. We show how this string dependence may be removed to all orders in perturbation theory.

This paper presents a new system of logic, LF, that is intended to be used as the foundation of the formalization of science. That is, deductive validity according to LF is to be used as the criterion for assessing what follows from the…

We investigate non-wellfounded proof systems based on parsimonious logic, a weaker variant of linear logic where the exponential modality ! is interpreted as a constructor for streams over finite data. Logical consistency is maintained at a…

A recent body of work has demonstrated that Transformer embeddings can be linearly decomposed into well-defined sums of factors, that can in turn be related to specific network inputs or components. There is however still a dearth of work…

Proving linearizability of concurrent data structures is crucial for ensuring their correctness, but is challenging especially for implementations that employ sophisticated synchronization techniques. In this paper, we propose a new proof…