Related papers: Yet another proof of Parikh's Theorem

We obtain an entire Liouville type theorem to the classical semilinear subcritical elliptic equation on Heisenberg group. A pointwise estimate near the isolated singularity was also proved. The soul of the proofs is an a priori integral…

We consider a regularised Fermi projection of the Hamiltonian of the massless Dirac equation at Fermi energy zero. The matrix-valued symbol of the resulting operator is discontinuous in the origin. For this operator, we prove Szeg\H{o}-type…

Realizing free semicircular elements on the full Fock space, we prove an equivalence between rationality of operators obtained from them and finiteness of the rank of their commutators with right annihilation operators. This is an analogue…

This note proposes a probabilistic language-free proof of the famous Croot-Laba-Sisask Lemma. In between, we do the same for the Khintchine and Marcinkiewicz-Zygmund inequalities and explicitate the implied constants.

A series of recent papers has used a parsing algorithm due to Shen et al. (2018) to recover phrase-structure trees based on proxies for "syntactic depth." These proxy depths are obtained from the representations learned by recurrent…

This is a survey and research note on the modified Orlik conjecture derived from the division theorem introduced in [2]. The division theorem is a generalization of classical addition-deletion theorems for free arrangements. The division…

We prove that the Lie algebra of primitive elements of a graded and connected bialgebra, free as an associative algebra, over a eld of characteristic zero, is a free Lie algebra. The main tool is a ltration, which allows to embed the…

Reynold's abstraction theorem is now a well-established result for a large class of type systems. We propose here a definition of relational parametricity and a proof of the abstraction theorem in the Calculus of Inductive Constructions…

We generalize the results for Banach algebras of pseudodifferential operators obtained by Gr\"ochenig and Rzeszotnik in [24] to quasi-algebras of Fourier integral operators. Namely, we introduce quasi-Banach algebras of symbol classes for…

In this paper, homological methods together with the theory of formal languages of theoretical computer science are proved to be effective tools to determine the growth and the Hilbert series of an associative algebra. Namely, we construct…

We give a proof of Fermat's little theorem which does not use nor arithmetic(Euclidean algorithm) neither algebra (group theory), but it rather employs the field of the formal power series Q((x)). The note is an example of a mathematical…

We investigate the descriptional complexity of operations on semilinear sets. Roughly speaking, a semilinear set is the finite union of linear sets, which are built by constant and period vectors. The interesting parameters of a semilinear…

We combine the theory of traces in homotopical algebra with sheaf theory in derived algebraic geometry to deduce general fixed point and character formulas. The formalism of dimension (or Hochschild homology) of a dualizable object in the…

We investigate the duality between algebraic and coalgebraic recognition of languages to derive a generalization of the local version of Eilenberg's theorem. This theorem states that the lattice of all boolean algebras of regular languages…

We prove that there exists no algorithm to decide whether the language generated by a context-free grammar is dense with respect to the lexicographic ordering. As a corollary to this result, we show that it is undecidable whether the…

A slight modification to one of Tarski's axioms of plane Euclidean geometry is proposed. This modification allows another of the axioms to be omitted from the set of axioms and proven as a theorem. This change to the system of axioms…

For a natural class of cohomology theories with support (including \'etale or pro-\'etale cohomology with suitable coefficients), we prove a moving lemma for cohomology classes with support on smooth quasi-projective k-varieties that admit…

The Pathwidth Theorem states that if a class of graphs has unbounded pathwidth, then it contains all trees as graph minors. We prove a similar result for dense graphs. More precisely, we give a finite family of tree-like patterns and prove…

We give a short geometric proof of the Kochen-Specker no-go theorem for non-contextual hidden variables models. Note added to this version: I understand from Jan-Aake Larsson that the construction we give here actually contains the original…

Courcelle's Theorem is an important result in graph theory, proving the existence of linear-time algorithms for many decision problems on graphs whose tree-width is bounded by a constant. The purpose of this text is twofold: to provide an…