Related papers: Notes on the Leonard system classification
Let (A,B) and (C,D) denote Leonard pairs on V. We say these pairs are adjacent whenever each basis for V which is standard for (A,B) (resp. (C,D)) is split for (C,D) (resp. (A,B)). Our main results are as follows: Theorem 1. There exists at…
We give a canonical partition of shifted intersecting set systems, from which one can obtain unified and elementary proofs of the Erd\H{o}s-Ko-Rado and Hilton-Milner Theorem, as well as a characterization of maximal shifted $k$-uniform…
In recent papers we have introduced a method for the study of limit cycles of the Lienard system: dot{x}=y-F(x), dot{y}=-x, where F(x) is an odd polynomial. The method gives a sequence of polynomials R_n(x), whose roots are related to the…
Present article deals with trajectorial intersections in linear fractional systems ('systems'). We propose a classification of intersections of trajectories in three classes viz. trajectories intersecting at same time(EIST), trajectories…
We characterize those intersection-type theories which yield complete intersection-type assignment systems for lambda-calculi, with respect to the three canonical set-theoretical semantics for intersection-types: the inference semantics,…
Lienard systems are very important mathematical models describing oscillatory processes arising in applied sciences. In this paper, we study polynomial Lienard systems of arbitrary degree on the plane, and develop a new method to obtain a…
In this short note, we simply collect some known results about representing algebraic cycles by various kind of "nice" (e.g. smooth, local complete intersection, products of local complete intersection) algebraic cycles, up to rational…
Fix an algebraically closed field $\mathbb{F}$ and an integer $d \geq 3$. Let $V$ be a vector space over $\mathbb{F}$ with dimension $d+1$. A Leonard pair on $V$ is an ordered pair of diagonalizable linear transformations $A: V \to V$ and…
We present order reduction results for linear time invariant descriptor systems. Results are given for both forced and unforced systems as well methods for constructing the reduced order systems. Our results establish a precise connection…
Proofs of coherence in category theory, starting from Mac Lane's original proof of coherence for monoidal categories, are sometimes based on confluence techniques analogous to what one finds in the lambda calculus, or in term-rewriting…
Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…
Intersection types are an essential tool in the analysis of operational and denotational properties of lambda-terms and functional programs. Among them, non-idempotent intersection types provide precise quantitative information about the…
The intersection type assignment system has been designed directly as deductive system for assigning formulae of the implicative and conjunctive fragment of the intuitionistic logic to terms of lambda-calculus. But its relation with the…
In this paper, we define an ordering relation for a set of complex numbers, and research the properties and theorems of the ordering, solve some simple complex inequalities with the ordering.
Networks are important representations in computer science to communicate structural aspects of a given system of interacting components. The evolution of a network has several topological properties that can provide us information on the…
In this work, we introduce a method based on piecewise polynomial interpolation to enclose rigorously solutions of nonlinear ODEs. Using a technique which we call a priori bootstrap, we transform the problem of solving the ODE into one of…
This paper gives a detailed account of the relationship between (a variant of) the call-by-value lambda calculus and linear logic proof nets. The presentation is carefully tuned in order to realize a strong bisimulation between the two…
A new proof for adjoint systems of linear equations is presented. The argument is built on the principles of Algorithmic Differentiation. Application to scalar multiplication sets the base line. Generalization yields adjoint inner vector,…
For any simple digraph $D$ we offer a new proof for the intersection number of its middle digraph, $M(D)$; while doing so we also solve for the intersection number when $D$ has loops. In addition, a new transformation, the union of $D$ and…
This is a survey on propositional proof complexity aimed at introducing the basics of the field with a particular focus on a method known as feasible interpolation. This method is used to construct "hard theorems" for several proof systems…