Related papers: Notes on the Leonard system classification

This paper investigates type isomorphism in a lambda-calculus with intersection and union types. It is known that in lambda-calculus, the isomorphism between two types is realised by a pair of terms inverse one each other. Notably,…

Two finite Alexander quandles with the same number of elements are isomorphic iff their Z[t,t^-1]-submodules Im(1-t) are isomorphic as modules. This yields specific conditions on when Alexander quandles of the form Z_n[t,t^-1]/(t-a) where…

Proof nets provide permutation-independent representations of proofs and are used to investigate coherence problems for monoidal categories. We investigate a coherence problem concerning Second Order Multiplicative Linear Logic (MLL2), that…

This article describes a method for constructing approximations to periodic solutions of dynamic Lorenz system with classical values of the system parameters. The author obtained a system of nonlinear algebraic equations in general form…

We describe the homology intersection form associated to regular holonomic GKZ systems in terms of the combinatorics of regular triangulations. Combining this result with the twisted period relation, we obtain a formula of cohomology…

Using a new technique, we prove a rich family of special cases of the matroid intersection conjecture. Roughly, we prove the conjecture for pairs of tame matroids which have a common decomposition by 2-separations into finite parts.

In this paper, we study the bifurcation of limit cycles in Lienard systems of the form dot(x)=y-F(x), dot(y)=-x, where F(x) is an odd polynomial that contains, in general, several free parameters. By using a method introduced in a previous…

We consider a class of systems of difference equations defined on an elementary quadrilateral of the ${\mathbb{Z}}^2$ lattice, define their eliminable and dynamical variables, and demonstrate their use. Using the existence of infinite…

We consider systems of Laurent polynomials with support on a fixed point configuration. In the non-defective case, the closure of the locus of coefficients giving a non-degenerate multiple root of the system is defined by a polynomial…

We offer a simple graphical representation for proofs of intuitionistic logic, which is inspired by proof nets and interaction nets (two formalisms originating in linear logic). This graphical calculus of proofs inherits good features from…

We introduce the Orchard crossing number, which is defined in a similar way to the well-known rectilinear crossing number. We compute the Orchard crossing number for some simple families of graphs. We also prove some properties of this…

We describe a constructive procedure to separate overlapping infrared divergences in multi-loop integrals. Working with a parametric representation in D=4-2*epsilon dimensions, adequate subtractions lead to a Laurent series in epsilon,…

This two-parts paper offers a survey of linear logic and ludics, which were introduced by Girard in 1986 and 2001, respectively. Both theories revisit mathematical logic from first principles, with inspiration from and applications to…

We introduce the notion of an approximation system as a generalization of Taylor approximation, and we give some first examples. Next we develop the general theory, including error bounds and a sufficient criterion for convergence. More…

The subtyping rules for intersection types traditionally employ a transitivity rule (Barendregt et al. 1983), which means that subtyping does not satisfy the subformula property, making it more difficult to use in filter models for compiler…

One of the possible variants of the classification of trigonometric interpolation splines is considered, depending on the chosen convergence factors, the distribution of signs of the basis functions and the interpolation factors. The…

We show that determining the crossing number of a link is NP-hard. For some weaker notions of link equivalence, we also show NP-completeness.

A polarized version of Girard, Scedrov and Scott's Bounded Linear Logic is introduced and its normalization properties studied. Following Laurent, the logic naturally gives rise to a type system for the lambda-mu-calculus, whose derivations…

In 1990 Lazard proposed an improved projection operation for cylindrical algebraic decomposition (CAD). For the proof he introduced a certain notion of valuation of a multivariate Puiseux series at a point. However a gap in one of the key…

Non-idempotent intersection types provide quantitative information about typed programs, and have been used to obtain time and space complexity measures. Intersection type systems characterize termination, so restrictions need to be made in…