Related papers: Desingularization Explains Order-Degree Curves for…
We introduce basic aspects of new operator method, which is very suitable for practical solving differential equations of various types. The main advantage of the method is revealed in opportunity to find compact exact operator solutions of…
An oriented graph is a directed graph which can be obtained from a simple undirected graph by orienting its edges. In this paper we show that any oriented graph G on n vertices with minimum indegree and outdegree at least (1/2-o(1))n…
Given a family of curves $\mathcal{C}$ in the plane, its disjointness graph is the graph whose vertices correspond to the elements of $\mathcal{C}$, and two vertices are joined by an edge if and only if the corresponding sets are disjoint.…
We introduce a notion of left-symmetric Rinehart algebras, which is a generalization of a left-symmetric algebras. The left multiplication gives rise to a representation of the corresponding sub-adjacent Lie-Rinehart algebra. We construct…
In this article we discuss the convergence of first order operators on a thickened graph (a graph-like space) towards a similar operator on the underlying metric graph. On the graph-like space, the first order operator is of the form…
The purpose of this paper is to give a characterisation of divided power algebras over a reduced operad. Such a characterisation is given in terms of polynomial operations, following the classical example of divided power algebras. We…
We study the enumeration of graph orientations under local degree constraints. Given a finite graph $G = (V, E)$ and a family of admissible sets $\{\mathsf P_v \subseteq \mathbb{Z} : v \in V\}$, let $\mathcal N (G; \prod_{v \in V} \mathsf…
The {\sc Directed Maximum Leaf Out-Branching} problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this paper, we improve known parameterized algorithms and…
The aim of this paper is to introduce and study left and right versions of the class of generalized Drazin-Riesz invertible operators, as well as left and right versions of the class of generalized Drazin-meromorphic invertible operators.
An orientation of $G$ is a digraph obtained from $G$ by replacing each edge by exactly one of two possible arcs with the same endpoints. We call an orientation \emph{proper} if neighbouring vertices have different in-degrees. The proper…
Graph orientation is a well-studied area of graph theory. A proper orientation of a graph $G = (V,E)$ is an orientation $D$ of $E(G)$ such that for every two adjacent vertices $ v $ and $ u $, $ d^{-}_{D}(v) \neq d^{-}_{D}(u)$ where…
We obtain better algorithms for computing more balanced orientations and degree splits in LOCAL. Important to our result is a connection to the hypergraph sinkless orientation problem [BMNSU, SODA'25] We design an algorithm of complexity…
In this paper we consider the $f$-orthomorphisms and $f$-linear operators on the order dual of an $f$-algebra. In particular, when the $f$-algebra has the factorization property (not necessarily unital), we prove that the orthomorphisms,…
This paper contains a short and simplified proof of desingularization over fields of characteristic zero, together with various applications to other problems in algebraic geometry (among others, the study of the behavior of…
We establish the equidistribution with respect to the bifurcation measure of post-critically finite maps in any one-dimensional algebraic family of unicritical polynomials. Using this equidistribution result, together with a combinatorial…
The minimum semi-degree of a digraph D is the minimum of its minimum outdegree and its minimum indegree. We show that every sufficiently large digraph D with minimum semi-degree at least n/2 +k-1 is k-linked. The bound on the minimum…
Model Order Reduction is a key technology for industrial applications in the context of digital twins. Key requirements are non-intrusiveness, physics-awareness, as well as robustness and usability. Operator inference based on least-squares…
We consider a variable order differential operator on a graph with a cycle. We study the inverse spectral problem for this operator by the system of spectra. The main results of the paper are the uniqueness theorem and the constructive…
In this work, the divergence and curl operators are obtained using the coordinate free non rigid basis formulation of differential geometry. Although the authors have attempted to keep the presentation self-contained as much as possible,…
We describe degenerations of projective plane curves to curves containing a fixed line $l$ as a component, and show that $H^1({\overline V}_{n,d,m}, {\Cal O} (r))=0, r \in{\Bbb Z}$, where $V_{n,d,m}\subset {\Bbb P}^N (N = n(n+3)/2)$ is the…