Related papers: Deducibility in the full Lambek calculus with weak…
We derive the discrete version of the classical Helmholtz condition. Precisely, we state a theorem characterizing second order finite differences equations admitting a Lagrangian formulation. Moreover, in the affirmative case, we provide…
In this paper, a question due to Heckenberger, Shareshian and Welker on racks in [7] is positively answered. A rack is a set together with a selfdistributive bijective binary operation. We show that the lattice of subracks of every finite…
We show that the decision problem for the basic system of interpretability logic IL is PSPACE-complete. For this purpose we present an algorithm which uses polynomial space with respect to the complexity of a given formula. The existence of…
Motivated by description logics, we investigate what happens to the complexity of modal satisfiability problems if we only allow formulas built from literals, $\wedge$, $\Diamond$, and $\Box$. Previously, the only known result was that the…
We address the problem of complementing higher-order patterns without repetitions of existential variables. Differently from the first-order case, the complement of a pattern cannot, in general, be described by a pattern, or even by a…
We introduce graded Hecke algebras H based on a (possibly disconnected) complex reductive group G and a cuspidal local system L on a unipotent orbit of a Levi subgroup M of G. These generalize the graded Hecke algebras defined and…
The A-model for finite rank singular perturbations of class $\mathfrak{H}_{-m-2}\smallsetminus\mathfrak{H}_{-m-1}$, $m\in\mathbb{N}$, is considered from the perspective of boundary relations. Assuming further that the Hilbert spaces…
A given subset $A$ of natural numbers is said to be complete if every element of $\mathbb{N}$ is the sum of distinct terms taken from $A$. This topic is strongly connected to the knapsack problem which is known to be NP complete.…
We lower substantially the strength of the assumptions needed for the validity of certain results in category theory and homotopy theory which were known to follow from Vopenka's principle. We prove that the necessary large-cardinal…
A Henkin-style proof of completeness of first-order classical logic is given with respect to a very small set (notably missing cut rule) of Genzten deduction rules for intuitionistic sequents. Insisting on sparing on derivation rules,…
We verify a confluence result for the rewriting calculus of the linear category introduced in our previous paper. Together with the termination result proved therein, the generalized coherence theorem for linear category is established.…
In arXiv:1811.04649, we extended the Dong-Mason theorem on irreducibility of modules for cyclic orbifold vertex algebras to the entire category weak modules and applied this result to Whittaker modules. In this paper we present further…
Let G denote a connected, quasi-split reductive group over a field F that is complete with respect to a discrete valuation and that has a perfect residue field. Under mild hypotheses, we produce a subset of the Lie algebra g(F) that picks…
The predicate complementary to the well-known Godel's provability predicate is defined. From its recursiveness new consequences concerning the incompleteness argumentation are drawn and extended to new results of consistency, completeness…
Kazhdan and Lusztig identified the affine Hecke algebra $\mathcal{H}$ with an equivariant $K$-group of the Steinberg variety, and applied this to prove the Deligne-Langlands conjecture, i.e., the local Langlands parametrization of…
We establish the geometric ergodicity of the preconditioned Hamiltonian Monte Carlo (HMC) algorithm defined on an infinite-dimensional Hilbert space, as developed in [Beskos et al., Stochastic Process. Appl., 2011]. This algorithm can be…
We show the Harris--Viehmann conjecture under some Hodge--Newton reducibility condition for a generalization of the diamond of a non-basic Rapoport--Zink space at infinite level, which appears as a cover of the non-semi-stable locus in the…
We show that the emptiness (unsatisfiability) problem is undecidable and $\mathrm{\Pi}^{0}_{1}$-complete for deterministic propositional while programs with (graph) loop. To this end, we introduce a hypothesis elimination using loops. Using…
Rademacher complexity is often used to characterize the learnability of a hypothesis class and is known to be related to the class size. We leverage this observation and introduce a new technique for estimating the size of an arbitrary…
For any increasing function $f: {\Bbb N} \rightarrow {\Bbb N}_{\ge 2}$ which takes only finitely many distinct values, a connected finite dimensional algebra $\Lambda$ is constructed, with the property that $\text{fin.dim}_n\, \Lambda =…