Related papers: Order-Degree-Height Surfaces for Linear Operators
We characterize all possible relative positions between a hyperboloid of one sheet and a sphere through the roots of a characteristic polynomial associated to these quadrics. The classification is also suitable for a hyperboloid and a…
This article explains the relationship between analytic and algebraic order in case of abstract pseudo-differential operators for a regular spectral triple.
An {\em ordered $r$-graph} is an $r$-uniform hypergraph whose vertex set is linearly ordered. Given $2\leq k\leq r$, an ordered $r$-graph $H$ is {\em interval} $k$-{\em partite} if there exist at least $k$ disjoint intervals in the ordering…
For a hyperelliptic curve of genus $g$, a divisor in general position of degree $g+1$ is given by polynomial equations. There is an action from an algebraic group on the representations of divisors by polynomials which fixes divisor…
In this paper, we study scalar the forth order linear differential operators over an oriented 2-dimensional manifold. We investigate differential invariants of these operators and show their application to the equivalence problem.
If a linear differential operator with rational function coefficients is reducible, its factors may have coefficients with numerators and denominatorsof very high degree. When the base field is $\mathbb C$, we give a completely explicit…
In this paper, we investigate the degree of $h$-polynomials of edge ideals of finite simple graphs. In particular, we provide combinatorial formulas for the degree of the $h$-polynomial for various fundamental classes of graphs such as…
Network data has become widespread, larger, and more complex over the years. Traditional network data is dyadic, capturing the relations among pairs of entities. With the need to model interactions among more than two entities, significant…
In a previous work of the authors, a result to algorithmically compute the topology types of the level curves of an algebraic surface, is given. From this result, here we derive applications based on level curves to determine some…
It is shown how to define difference operators and equations on particular lattices $\{x_n\}$, $2n\in\mathbb{Z}$, such that the divided difference operator $(\mathcal{D}f)(x_{n+1/2})= (f(x_{n+1})-f(x_n))/(x_{n+1}-x_n)$ has the property that…
Given a real finite hyperplane arrangement A and a point p not on any of the hyperplanes, we define an arrangement vo(A,p), called the *valid order arrangement*, whose regions correspond to the different orders in which a line through p can…
It is already known that order polytopes and chain polytopes are always 2-level polytopes. In general, this is not true for marked order and marked chain polytopes. We study the geometry of marked order polytopes, marked chain polytopes,…
The q-difference analog of the classical ladder operators is derived for those orthogonal polynomials arising from a class of indeterminate moments problem.
We investigate the joint distribution of the vertex degrees in three models of random bipartite graphs. Namely, we can choose each edge with a specified probability, choose a specified number of edges, or specify the vertex degrees in one…
The degree matrix of a graph is the diagonal matrix with diagonal entries equal to the degrees of the vertices of $X$. If $X_1$ and $X_2$ are graphs with respective adjacency matrices $A_1$ and $A_2$ and degree matrices $D_1$ and $D_2$, we…
We complete the construction of raising and lowering operators, given in a previous work, for the orthogonal polynomials of hypergeometric type on non-homogeneous lattice, and extend these operators to the generalized orthogonal…
A theory of graded manifolds can be viewed as a generalization of differential geometry of smooth manifolds. It allows one to work with functions which locally depend not only on ordinary real variables, but also on $\mathbb{Z}$-graded…
We define analogues of Boolean operations on not necessarily complete partial orders, they often have as results sets of elements rather than single elements. It proves useful to add to such sets X if they are intended to be sup(X) or…
We consider the concept of rank as a measure of the vertical levels and positions of elements of partially ordered sets (posets). We are motivated by the need for algorithmic measures on large, real-world hierarchically-structured data…
We prove an upper bound of the form $2^{O(d^2 \mathrm{polylog}\,d)}$ on the number of affine (resp. linear) equivalence classes of, by increasing order of generality, 2-level d-polytopes, d-cones and d-configurations. This in particular…