Related papers: Desingularization Explains Order-Degree Curves for…
Training of deep models for classification tasks is hindered by local minima problems and vanishing gradients, while unsupervised layer-wise pretraining does not exploit information from class labels. Here, we propose a new regularization…
We investigate an operator ordering problem in two-dimensional N=1 supersymmetric model which consists of n real superfields. There arises an operator ordering problem when the target space is curved. We have to fix the ordering in quantum…
After briefly recalling some computational aspects of blowing up and of representation of resolution data common to a wide range of desingularization algorithms (in the general case as well as in special cases like surfaces or binomial…
Ordered matchings, defined as graphs with linearly ordered vertices, where each vertex is connected to exactly one edge, play a crucial role in the area of ordered graphs and their homomorphisms. Therefore, we consider related problems from…
Given a digraph D, the minimum semi-degree of D is the minimum of its minimum indegree and its minimum outdegree. D is k-ordered Hamiltonian if for every ordered sequence of k distinct vertices there is a directed Hamilton cycle which…
For a smooth algebraic variety $X$, we study the category of finitely generated modules over the ring of function of $X$ that has a compatible action of the Lie algebra $\mathcal{V}$ of polynomials vector fields on $X$. We show that the…
Root separation bounds play an important role as a complexity measure in understanding the behaviour of various algorithms in computational algebra, e.g., root isolation algorithms. A classic result in the univariate setting is the…
The degree of a curve $C$ in a polarized abelian variety $(X,\lambda)$ is the integer $d=C\cdot\lambda$. When $C$ generates $X$, we find a lower bound on $d$ which depends on $n$ and the degree of the polarization $\lambda$. The smallest…
A vertex with neighbours of degrees $d_1 \geq ... \geq d_r$ has {\em vertex type} $(d_1, ..., d_r)$. A graph is {\em vertex-oblique} if each vertex has a distinct vertex-type. While no graph can have distinct degrees, Schreyer, Walther and…
We describe symmetries of the braid monodromy decomposition for a class of plane curves defined over reals including the real curves with no real points and proving new divisibility relations for Alexander invariants of such curves.
In this work we consider arc criticality in colourings of oriented graphs. We study deeply critical oriented graphs, those graphs for which the removal of any arc results in a decrease of the oriented chromatic number by $2$. We prove the…
While every matrix admits a singular value decomposition, in which the terms are pairwise orthogonal in a strong sense, higher-order tensors typically do not admit such an orthogonal decomposition. Those that do have attracted attention…
We construct a modular desingularisation of $\overline{\mathcal{M}}_{2,n}(\mathbb{P}^r,d)^{\text{main}}$. The geometry of Gorenstein singularities of genus two leads us to consider maps from prestable admissible covers: with this enhanced…
The operad of moulds is realized in terms of an operational calculus of formal integrals (continuous formal power series). This leads to many simplifications and to the discovery of various suboperads. In particular, we prove a conjecture…
A well-known theorem factors a scalar coefficient differential operator given a linearly independent set of functions in its kernel. The goal of this paper is to generalize this useful result to other types of operators. In place of the…
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching for integers d>2 is the problem of finding a matching of size…
Moore digraphs, that is digraphs with out-degree $d$, diameter $k$ and order equal to the Moore bound $M(d,k) = 1 + d + d^2 + \dots +d^k$, arise in the study of optimal network topologies. In an attempt to find digraphs with a `Moore-like'…
In 2023 in (3), Uwe finds the explicit form of the map which is which is settled in ZN of finite functional degree and14 discusses how to compute its usual degree w.r.t to the derivative in the linear form, i.e. the product of ones formed…
We prove a sharp Ore-type criterion for hamiltonicity of balanced bipartite digraphs: A bipartite digraph D, with colour classes of cardinality N, is hamiltonian if, for every pair of vertices u and v from opposite colour classes of D such…
V.I. Arnold [Russian Math. Surveys, 26 (no. 2), 1971, pp. 29-43] gave a miniversal deformation of matrices of linear operators; that is, a simple canonical form, to which not only a given square matrix A, but also the family of all matrices…