相关论文: Algebraic Geometry of Error Amplification: the Pro…
In classification and forecasting with tabular data, one often utilizes tree-based models. Those can be competitive with deep neural networks on tabular data and, under some conditions, explainable. The explainability depends on the depth…
Given a completely positive map, we introduce a set of algebras that we refer to as its generalized multiplicative domains. These algebras are generalizations of the traditional multiplicative domain of a completely positive map and we…
In this investigation the boundary value problem of light propagation in the gravitational field of one arbitrarily moving body with monopole structure is considered in the second post-Newtonian approximation. The solution of the boundary…
Irreducible isoparametric foliations of arbitrary codimension q on complex projective spaces CP^n are classified, except if n=15 and q=1. Remarkably, there are noncongruent examples that pull back under the Hopf map to congruent foliations…
A rigorous geometric proof of the Lie's Theorem on nonlinear superposition rules for solutions of non-autonomous ordinary differential equations is given filling in all the gaps present in the existing literature. The proof is based on an…
We present an auxiliary space theory that provides a unified framework for analyzing various iterative methods for solving linear systems that may be semidefinite. By interpreting a given iterative method for the original system as an…
We extend the deformation theory algorithm of matrix factorizations to systems with more than one D-brane. The obstructions to the deformations are F-term equations which can be integrated to an effective superpotential. We demonstrate the…
It is given a canonical representation of prime ends in regular spatial domains and, on this basis, it is studied the boundary behavior of the so-called lower Q-homeomorphisms that are the natural generalization of the quasiconformal…
We obtain new parameterized algorithms for the classical problem of determining whether a directed acyclic graph admits an upward planar drawing. Our results include a new fixed-parameter algorithm parameterized by the number of sources, an…
We study the classical problem of computing geometric thickness, i.e., finding a straight-line drawing of an input graph and a partition of its edges into as few parts as possible so that each part is crossing-free. Since the problem is…
Covering Algebras of extended affine Lie algebras(EALA's) relative to finite order automorphisms are studied. Conditions are given for when the resulting algebra is again an EALA. This paper deals with affinizations of EALA's relative to…
We investigate the optimization of neural networks on symmetric data, and compare the strategy of constraining the architecture to be equivariant to that of using data augmentation. Our analysis reveals that that the relative geometry of…
Aim of this paper is to define a new type of cohomology for multiplicative Hom-Leibniz algebras which controls deformations of Hom-Leibniz algebra structure. The cohomology and the associated deformation theory for Hom-Leibniz algebras as…
Recommender Systems (RSs) are used to provide users with personalized item recommendations and help them overcome the problem of information overload. Currently, recommendation methods based on deep learning are gaining ground over…
Consider genus $g$ curves that admit degree $d$ covers to elliptic curves only branched at one point with a fixed ramification type. The locus of such covers forms a one parameter family $Y$ that naturally maps into the moduli space of…
In this paper we consider various notions of positivity for distributions on complex projective manifolds. We start by analyzing distributions having big slope with respect to curve classes, obtaining characterizations of generic projective…
When solving optimization problems under uncertainty with contextual data, utilizing machine learning to predict the uncertain parameters' values is a popular and effective approach. Decision-focused learning (DFL) aims at learning a…
We survey results in algebraic complexity theory, focusing on matrix multiplication. Our goals are (i.) to show how open questions in algebraic complexity theory are naturally posed as questions in geometry and representation theory, (ii.)…
The perimeter and area generating functions of exactly solvable polygon models satisfy q-functional equations, where q is the area variable. The behaviour in the vicinity of the point where the perimeter generating function diverges can…
We study plane algebraic curves defined over a field k of arbitrary characteristic as coverings of the the projective line and the problem of enumerating branched coverings of $\mathbb{P}^{1}$ by using combinatorial methods.