Related papers: Combinatorial Dyson-Schwinger equations and induct…
We present a type system that combines, in a controlled way, first-order polymorphism with intersectiontypes, union types, and subtyping, and prove its safety. We then define a type reconstruction algorithm that issound and terminating.…
A combinatorial theory for type $R_I$ orthogonal polynomials is given. The ingredients include weighted generalized Motzkin paths, moments, continued fractions, determinants, and histories. Several explicit examples in the Askey scheme are…
Consider a regression or some regression-type model for a certain response variable where the linear predictor includes an ordered factor among the explanatory variables. The inclusion of a factor of this type can take place is a few…
The proper time path integral representation is derived explicitly for an arbitrary $n$-point amplitude in QCD. In the standard perturbation theory the formalism allows to sum up the leading subseries, e.g. yielding double-logarithm Sudakov…
Algebraic lambda-calculi have been studied in various ways, but their semantics remain mostly untouched. In this paper we propose a semantic analysis of a general simply-typed lambda-calculus endowed with a structure of vector space. We…
To ensure decidability and consistency of its type theory, a proof assistant should only accept terminating recursive functions and productive corecursive functions. Most proof assistants enforce this through syntactic conditions, which can…
Dimensional analysis provides many simple and useful tools for various situations in science. The objective of this paper is to investigate its relations to functions, i.e., the dimensions for functions that yield physical quantities and…
In this note we present a combinatorial link invariant that underlies some recent stable homotopy refinements of Khovanov homology of links. The invariant takes the form of a functor between two combinatorial 2-categories, modulo a notion…
The proof of Brouwer's fixed-point theorem based on Sperner's lemma is often presented as an elementary combinatorial alternative to advanced proofs based on algebraic topology. The goal of this note is to show that: (i) the combinatorial…
Recently, Andrews and Paule studied Schmidt type partitions using MacMahon's Partition Analysis and obtained various interesting results. In this paper, we focus on the combinatorics of Schmidt type partition theorems and characterize them…
We illustrate the use of intersection types as a semantic tool for showing properties of the lattice of lambda theories. Relying on the notion of easy intersection type theory we successfully build a filter model in which the interpretation…
We introduce pseudocubical objects with pseudoconnections in an arbitrary category, obtained from the Brown-Higgins structure of a cubical object with connections by suitably relaxing their identities, and construct a cubical analog of the…
In this paper we will prove that there exists a covariant functor from the category of schemes to the category of graphs. This functor provides a combination between algebraic varieties and combinatorial graphs so that the invariants…
We investigate Schwinger-Dyson equations for correlators of Wilson line operators in non-commutative gauge theories. We point out that, unlike what happens for closed Wilson loops, the joining term survives in the planar equations. This…
Bidirectional typing is a discipline in which the typing judgment is decomposed explicitly into inference and checking modes, allowing to control the flow of type information in typing rules and to specify algorithmically how they should be…
We give a quick survey of the various fixed point theorems in computability theory, partial combinatory algebra, and the theory of numberings, as well as generalizations based on those. We also point out several open problems connected to…
We continue our investigation on denominator conjecture of Fomin and Zelevinsky for cluster algebras via geometric models initialed in \cite{FG22}. In this paper, we confirm the denominator conjecture for cluster algebras of finite type.…
The ability to cast values between related types is a leitmotiv of many flavors of dependent type theory, such as observational type theories, subtyping, or cast calculi for gradual typing. These casts all exhibit a common structural…
We give a category theoretic approach to several known equivalences from (classic) tilting theory and commutative algebra. Furthermore, we apply our main results to establish a duality theory for relative Cohen-Macaulay modules in the sense…
We present a combinatorial method of constructing solutions to the normal ordering of boson operators. Generalizations of standard combinatorial notions - the Stirling and Bell numbers, Bell polynomials and Dobinski relations - lead to…