Related papers: Connection Matrices in Macaulay2
This is a self-contained tour of the Conley index and connection matrices. The starting point is Conley's fundamental theorem of dynamical systems. There is a short stop at the necessary topological background, before we proceed to the…
We consider adaptive finite element methods for second-order elliptic PDEs, where the arising discrete systems are not solved exactly. For contractive iterative solvers, we formulate an adaptive algorithm which monitors and steers the…
The main goal of our paper is to establish a connection between the Weyl modules of the current Lie superalgebras (twisted and untwisted) attached to $\mathfrak{osp}(1,2)$ and the nonsymmetric Macdonald polynomials of types $A_2^{(2)}$ and…
Here is discussed application of the Weyl pair to construction of universal set of quantum gates for high-dimensional quantum system. An application of Lie algebras (Hamiltonians) for construction of universal gates is revisited first. It…
We introduce a connectivity function for infinite matroids with properties similar to the connectivity function of a finite matroid, such as submodularity and invariance under duality. As an application we use it to extend Tutte's linking…
We develop the basic theory of matrix-valued Weyl-Titchmarsh M-functions and the associated Green's matrices for whole-line and half-line self-adjoint Hamiltonian finite difference systems with separated boundary conditions.
The so-called Weyl transform is a linear map from a commutative algebra of functions to a noncommutative algebra of linear operators, characterized by an action on Cartesian coordinate functions of the form $(x, y) \mapsto (X, Y)$ such that…
This paper studies the properties of two kinds of matroids: (a) algebraic matroids and (b) finite and infinite matroids whose ground set have some canonical symmetry, for example row and column symmetry and transposition symmetry. For (a)…
In the first part of the paper we propose a different viewpoint on the theory of higher Airy structures (or Airy ideals) which may shed light on its origin. We define Airy ideals in the $\hbar$-adic completion of the Rees Weyl algebra, and…
Error-correcting codes have an important role in data storage and transmission and in cryptography, particularly in the post-quantum era. Hermitian matrices over finite fields and equipped with the rank metric have the potential to offer…
We present an easily accessible, object oriented code (written exclusively in Matlab) for adaptive finite element simulations in 2D. It features various refinement routines for triangular meshes as well as fully vectorized FEM ansatz spaces…
In this article we apply the duality technique of R. Howe to study the structure of the Weyl algebra. We introduce a one-parameter family of ``ordering maps'', where by an ordering map we understand a vector space isomorphism of the…
Rough sets were proposed to deal with the vagueness and incompleteness of knowledge in information systems. There are may optimization issues in this field such as attribute reduction. Matroids generalized from matrices are widely used in…
The conformal structure of second order in $m$-dimensions together with the so-called (normal) conformal Cartan connection, is considered as a framework for gauge theories. The dressing field scheme presented in a previous work amounts to a…
We use the recently introduced factorization of motion polynomials for constructing overconstrained spatial linkages with a straight line trajectory. Unlike previous examples, the end-effector motion is not translational and the link graph…
In this note we provide an algorithm for translating relational structures into "proper" relational structures, i.e., those such that there is no pair of worlds w and u such that w is accessible from u for every agent. In particular, our…
The main purpose of this review paper is to give systematically all the known results on phase diagrams corresponding to lattice models (Ising and Potts) on Cayley tree (or Bethe lattice) and chandelier networks. A detailed survey of…
We consider all 16 unary operations that, given a homogeneous binary relation R, define a new one by a boolean combination of xRy and yRx. Operations can be composed, and connected by pointwise-defined logical junctors. We consider the…
In this work we characterize a full Kostant-Toda system in terms of a family of matrix polynomials orthogonal with respect to a complex matrix measure. In order to study the solution of this dynamical system we give explicit expressions for…
We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify polynomial runtime complexity of term rewrite systems and the polytime computability of the…