Related papers: Characteristic Formulas 50 Years Later (An Algebra…
This article aims to make explicit the characteristic projection introduced by Panchishkin in "A new method of constructing p-adic L-functions associated with modular forms" (Moscow Mathematical Journal, 2002) and gives various results on…
We study blocks of category O for the Cherednik algebra having the property that every irreducible module in the block admits a BGG resolution, and as a consequence prove a character formula conjectured by Oblomkov-Yun.
Ontologies formalise how the concepts from a given domain are interrelated. Despite their clear potential as a backbone for explainable AI, existing ontologies tend to be highly incomplete, which acts as a significant barrier to their more…
The method of characteristics has played a very important role in mathematical physics. Preciously, it was used to solve the initial value problem for partial differential equations of first order. In this paper, we propose a fractional…
A prototypical example of categorial grammars are those based on Lambek calculus, i.e. noncommutative intuitionistic linear logic. However, it has been noted that purely noncommutative operations are often not sufficient for modeling even…
In Jurek 1985 and 1988 the random integral representations conjecture was stated. It claims that (some) limit laws can be written as probability distributions of random integrals of the form $\int_{(a,b]}h(t)dY_{\nu}(r(t))$, for some…
In the 1960s, Atkinson introduced an abstract algebraic setting for multiparameter eigenvalue problems. He showed that a nonsingular multiparameter eigenvalue problem is equivalent to the associated system of generalized eigenvalue…
If $G$ is a finite classical group, linear or unitary in any characteristic, and orthogonal in odd characteristic, we give an approximate formula for $\chi(g)$ in which the error term is much smaller than the estimate, when $g\in G$ is an…
Accounting for the epistemic contribution of deduction has been a pervasive problem for logicians interested in deduction, such as, among others, Jakko Hintikka. The problem arises because the conclusion validly deduced from a set of…
Affine variational principle for General Relativity, proposed in 1978 by one of us (J.K.), is a good remedy for the non-universal properties of the standard, metric formulation, arising when the matter Lagrangian depends upon the metric…
Canonical formulas are a powerful tool for studying intuitionistic and modal logics. Actually, they provide a uniform and semantic way to axiomatise all extensions of intuitionistic logic and all modal logics above K4. Although the method…
Convolution is a ubiquitous operation in mathematics and computing. The Kripke semantics for substructural and interval logics motivates its study for quantale-valued functions relative to ternary relations. The resulting notion of…
In 1917, Huntington and Kline, followed by Huntington in 1924, studied systems of axioms for ternary relations aiming to capture the concepts of linear order (called betwenness) and cycle order, respectively. Among many other properties,…
If a higher derivative theory arises from a transformation of variables that involves time derivatives, a tailor-made Hamiltonian formulation is shown to exist. The details and advantages of this elegant Hamiltonian formulation, which…
Traditional treatments of formal logic provide: 1. A syntax for formulas. 2. An inference relation between sets of formulas. 3. A rule for assigning meaning to formulas (semantics) that is sound with respect to the inference relation. First…
Within classical propositional logic, assigning probabilities to formulas is shown to be equivalent to assigning probabilities to valuations. A novel notion of probabilistic entailment enjoying desirable properties of logical consequence is…
We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions and iterated connectives ranging over intervals parameterized by arithmetic variables. The satisfiability problem is shown…
Given a class C of finite Kripke frames, we consider the uniform distribution on the frames from C with n states. A formula is almost surely valid in C if the probability that it is valid in a random C-frame with n states tends to 1 as n…
We present some new methods for logical deduction, based on ideas from ground theory. Roughly speaking, in our calculi a typical deduction will proceed as follows: we first analyse the premiss down to its ultimate grounds; then we discard…
Various algebraic properties of Heilbronn's exponential sum can be deduced through the use of supercharacter theory, a novel extension of classical character theory due to Diaconis-Isaacs and Andre. This perspective yields a variety of…