Related papers: Effective computation of degree bounded minimal mo…
We extend some results on even sets of nodes which have been proved for surfaces up to degree 6 to surfaces up to degree 10. In particular, we give a formula for the minimal cardinality of a nonempty even set of nodes.
Factorial designs have broad applications in agricultural, engineering and scientific studies. In constructing and studying properties of factorial designs, traditional design theory treats all factors as nominal. However, this is not…
We determine some of the derived equivalences of a class of gentle algebras called surface algebras. These algebras are constructed from an unpunctured Riemann surface of genus 0 with boundary and marked points by introducing cuts in…
We make a detailed study of the infinite dimensional Galilean Conformal Algebra (GCA) in the case of two spacetime dimensions. Classically, this algebra is precisely obtained from a contraction of the generators of the relativistic…
The local minimum degree of a graph is the minimum degree reached by means of a series of local complementations. In this paper, we investigate on this quantity which plays an important role in quantum computation and quantum error…
Let R be a complete discrete valuation ring, S=R[[u]] and n a positive integer. The aim of this paper is to explain how to compute efficiently usual operations such as sum and intersection of sub-S-modules of S^d. As S is not principal, it…
We present a convergence rate analysis for biased stochastic gradient descent (SGD), where individual gradient updates are corrupted by computation errors. We develop stochastic quadratic constraints to formulate a small linear matrix…
Let A and B be finite dimensional simple real algebras with division gradings by an abelian group G. In this paper we give necessary and sufficient conditions for the coincidence of the graded identities of A and B. We also prove that every…
In this paper, we address the problem of conditional modality learning, whereby one is interested in generating one modality given the other. While it is straightforward to learn a joint distribution over multiple modalities using a deep…
In this paper, we propose an algebraic approach to upgrade a projective reconstruction to a Euclidean one, and aim at computing the rectifying homography from a minimal number of 9 segments of known length. Constraints are derived from…
We discuss the differential graded Lie algebra (DGLA) of Drinfeld modeled on the tensor algebra of the universal enveloping algebra of a Lie algebra g over any field K of characteristic zero. We explicitly analyze the first obstruction to…
An algorithm to generate a minimal comprehensive Gr\"obner\, basis of a parametric polynomial system from an arbitrary faithful comprehensive Gr\"obner\, system is presented. A basis of a parametric polynomial ideal is a comprehensive…
In previous work, the first author developed an algorithm for the computation of Hilbert modular forms. In this paper, we extend this to all totally real number fields of even degree and nontrivial class group. Using the algorithm over…
For many types of graphs, criteria have been discovered that give necessary and sufficient conditions for an integer sequence to be the degree sequence of such a graph. These criteria tend to take the form of a set of inequalities, and in…
We give a minimal system of 476 generators (resp. 510 generators) for the algebra of SL(2,C)-covariant polynomials on binary forms of degree 9 (resp. degree 10). These results were only known as conjectures so far. The computations rely on…
It is shown that the methods and algorithms, developed in (A. Capani et al., Computing minimal finite free resolutions, {\it Journal of Pure and Applied Algebra}, (117& 118)(1997), 105 -- 117; M. Kreuzer and L. Robbiano, {\it Computational…
In this short note, we give a new sufficient condition for a linear map from a product of copies of a field to endomorphisms of a finite dimensional vector space over the same field to be an algebra homomorphism. We expect that this result…
In this paper we use the Bott residue formula in equivariant cohomology to show a formula for the algebraic degree in semidefinite programming.
Caro, Davila, and Pepper (arXiv:1909.09093) recently proved $\delta(G) \alpha(G)\leq \Delta(G) \mu(G)$ for every graph $G$ with minimum degree $\delta(G)$, maximum degree $\Delta(G)$, independence number $\alpha(G)$, and matching number…
We produce minimal integrity bases for both isotropic and hemitropic invariant algebras (and more generally covariant algebras) of most common bidimensional constitutive tensors and -- possibly coupled -- laws, including piezoelectricity…