Related papers: Order-Degree-Height Surfaces for Linear Operators
Computational analysis with the finite element method requires geometrically accurate meshes. It is well known that high-order meshes can accurately capture curved surfaces with fewer degrees of freedom in comparison to low-order meshes.…
Let $V$ be a vector space over a finite field $k$. We give a condition on a subset $A \subset V$ that allows for a local criterion for checking when a function $f:A \to k$ is a restriction of a polynomial function of degree $<m$ on $V$. In…
We describe spaces of essential finite height (measured) laminations in a surface $S$ using a parameter space we call $\mathbb S$, an ordered semi-ring. We show that for every finite height essential lamination $L$ in $S$, there is an…
Higher-order networks effectively represent complex systems with group interactions. Existing methods usually overlook the relative contribution of group interactions (hyperlinks) of different sizes to the overall network structure. Yet,…
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
Several definitions of differential operators on modules over noncommutative rings are discussed.
The theory of operads (May, cyclic, modular, PROPs, etc) is extended to include higher dimensional phenomena, i.e. operations between operations, mimicking the algebraic structure on varieties of arbitrary dimensions, having marked…
Functions with uniform sublevel sets can represent orders, preference relations or other binary relations and thus turn out to be a tool for scalarization that can be used in multicriteria optimization, decision theory, mathematical…
The queue-number of a poset is the queue-number of its cover graph viewed as a directed acyclic graph, i.e., when the vertex order must be a linear extension of the poset. Heath and Pemmaraju conjectured that every poset of width $w$ has…
Let $P$ and $Q$ be polynomials in one variable over an algebraically closed field $k$ of characteristic zero. Let $f$ and $g$ be elements of a function field $\K$ over $k$ such that $P(f)=Q(g).$ We give conditions on $P$ and $Q$ such that…
Multi-degree splines are piecewise polynomial functions having sections of different degrees. For these splines, we discuss the construction of a B-spline basis by means of integral recurrence relations, extending the class of multi-degree…
In this article we explore the relationship between the systole and the diameter of closed hyperbolic orientable surfaces. We show that they satisfy a certain inequality, which can be used to deduce that their ratio has a (genus dependent)…
Border bases can be considered to be the natural extension of Gr\"obner bases that have several advantages. Unfortunately, to date the classical border basis algorithm relies on (degree-compatible) term orderings and implicitly on reduced…
We consider higher symmetries and operator symmetries of linear partial differential equations. The higher symmetries form a Lie algebra, and operator ones form an associative algebra. The relationship between these symmetries is…
The degree sequence of a graph is a numerical method to characterize the properties of graphs. Generalized forms of degree sequences exist for complete graphs and complete graphs. Nikolopolus et al. characterized the number of spanning…
Let $\G$ denote a bipartite distance-regular graph with vertex set $X$ and diameter $D \ge 3$. Fix $x \in X$ and let $L$ (resp. $R$) denote the corresponding lowering (resp. raising) matrix. We show that each $Q$-polynomial structure for…
On contact manifolds we describe a notion of (contact) finite-type for linear partial differential operators satisfying a natural condition on their leading terms. A large class of linear differential operators are of finite-type in this…
The notions of cutwidth and pathwidth of digraphs play a central role in the containment theory for tournaments, or more generally semi-complete digraphs, developed in a recent series of papers by Chudnovsky, Fradkin, Kim, Scott, and…
The problem Level Planarity asks for a crossing-free drawing of a graph in the plane such that vertices are placed at prescribed y-coordinates (called levels) and such that every edge is realized as a y-monotone curve. In the variant…
These are the notes of my lectures at the 1996 European Congress of Mathematicians. {} Polynomials appear in mathematics frequently, and we all know from experience that low degree polynomials are easier to deal with than high degree ones.…