Related papers: Notes on the Leonard system classification

We propose a categorical framework to reason about scientific explanations: descriptions of a phenomenon meant to translate it into simpler terms, or into a context that has been already understood. Our motivating examples come from systems…

In this note, we give short proofs of three theorems about intersection problems. The first one is a determination of the maximum size of a nontrivial $k$-uniform, $d$-wise intersecting family for $n\ge \left(1+\frac{d}{2}\right)(k-d+2)$,…

This paper shows how internal models for polymorphic lambda calculi arise in any 2-category with a notion of discreteness. We generalise to a 2-categorical setting the famous theorem of Peter Freyd saying that there are no sufficiently…

Let X and Y be curves over a finite field. In this article we explore methods to determine whether there is a rational map from Y to X by considering L-functions of certain covers of X and Y and propose a specific family of covers to…

The concept of coreflexive set is introduced to study the structure of digraphs. New characterizations of line digraphs and nth-order line digraphs are given. Coreflexive sets also lead to another natural way of forming an intersection…

The use of complex networks as a modern approach to understanding the world and its dynamics is well-established in literature. The adjacency matrix, which provides a one-to-one representation of a complex network, can also yield several…

We give a new characterization of elementary and deterministic polynomial time computation in linear logic through the proofs-as-programs correspondence. Girard's seminal results, concerning elementary and light linear logic, achieve this…

Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence in terms of relatively simple invariants. Where…

A recurrence relation is said to have the Laurent property if all of its iterates are Laurent polynomials in the initial values with integer coefficients. We consider a family of nonlinear recurrences with the Laurent property, which were…

We study intersection cohomology of character varieties for punctured Riemann surfaces with prescribed monodromies around the punctures. Relying on previous result from Mellit for semisimple monodromies we compute the intersection…

Let $K$ denote a field and let $V$ denote a vector space over $K$ with finite positive dimension. We consider a pair of linear transformations $A:V\to V$ and $A^*:V\to V$ that satisfy both conditions below: (i) There exists a basis for $V$…

The purpose of this note is to advertise an elegant algorithmic proof for the Jordan--Chevalley decomposition of a matrix, following and (slightly) revising the discussion of Couty, Esterle und Zarouf (2011). The basic idea of that method…

In context of efforts of composing category-theoretic and logical methods in the area of knowledge representation we propose the notion of conceptory. We consider intersection/union and other constructions in conceptories as expressive…

Planar piecewise linear systems with two linearity zones separated by a straight line and with a periodic orbit at infinity are considered. By using some changes of variables and parameters, a reduced canonical form with five parameters is…

We consider the moduli spaces $\mathcal{M}_d(\ell)$ of a closed linkage with n links and prescribed lengths in d-dimensional Euclidean space. For d>3 these spaces are no longer manifolds generically, but they have the structure of a…

In this letter, we propose high order layered complex networks. The synchronization is discussed in detail. The relations of synchronization, individual coupling matrices and the intrinsic function of the uncoupled system are given. As…

Every countable structure has a sentence of the infinitary logic $\mathcal{L}_{\omega_1 \omega}$ which characterizes that structure up to isomorphism among countable structures. Such a sentence is called a Scott sentence, and can be thought…

We consider systems of simple closed curves on surfaces and their total number of intersection points, their so-called crossing number. For a fixed number of curves, we aim to minimise the crossing number. We determine the minimal crossing…

We investigate the definability (reducts) lattice of the order of integers and describe a sublattice generated by relations 'between', 'cycle', 'separation', 'neighbor', '1-codirection', 'order' and equality'. Some open questions are…

In this paper we investigate the problem of linearizability for a family of cubic complex planar systems of ordinary differential equations. We give a classification of linearizable systems in the family obtaining conditions for…