Related papers: Effective computation of degree bounded minimal mo…
The degree of a projective subscheme has an upper bound in term of the codimension and the reduction number. If a projective variety has an almost maximal degree, that is, the degree equals to the upper bound minus one, then its Betti table…
The numerical analysis of gradient inclusions in a compact subset of $2\times 2$ diagonal matrices is studied. Assuming that the boundary conditions are reached after a finite number of laminations and using piecewise linear finite…
The "bisimulation problem" for equational graphs of finite out-degree is shown to be decidable. We reduce this problem to the bisimulation problem for deterministic rational (vectors of) boolean series on the alphabet of a dpda M. We then…
A generalized numerical semigroup is a submonoid $S$ of $\mathbb{N}^d$ with finite complement in it. We characterize isomorphisms between these monoids in terms of permutation of coordinates. Considering the equivalence relation that…
We construct least squares formulations of PDEs with inhomogeneous essential boundary conditions, where boundary residuals are not measured in unpractical fractional Sobolev norms, but which formulations nevertheless are shown to yield a…
As in various fields like scientific research and industrial application, the computation time optimization is becoming a task that is of increasing importance because of its highly parallel architecture. The graphics processing unit is…
We build a differential calculus for subalgebras of the Moyal algebra on R^4 starting from a redundant differential calculus on the Moyal algebra, which is suitable for reduction. In some cases we find a frame of 1-forms which allows to…
We propose a novel variational method for solving the sub-graph isomorphism problem on a gate-based quantum computer. The method relies (1) on a new representation of the adjacency matrices of the underlying graphs, which requires a number…
We study the problem of approximating orthogonal matrices so that their application is numerically fast and yet accurate. We find an approximation by solving an optimization problem over a set of structured matrices, that we call extended…
Divided into three parts, the first marks out enormous geometric issues with the notion of quasi-freenss of an algebra and seeks to replace this notion of formal smoothness with an approximation by means of a minimal unital commutative…
An algorithm is presented that generates sets of size equal to the degree of a given variety defined by a homogeneous ideal. This algorithm suggests a versatile framework to study various problems in combinatorial algebraic geometry and…
For an ideal $I\subseteq\mathbb{R}[x]$ given by a set of generators, a new semidefinite characterization of its real radical $I(V_\mathbb{R}(I))$ is presented, provided it is zero-dimensional (even if $I$ is not). Moreover we propose an…
Let k be a field. A finite dimensional k-algebra is said to be minimal representation-infinite provided it is representation-infinite and all its proper factor algebras are representation-finite. Our aim is to classify the special biserial…
The aim of this paper is to propose a strategy to implement the Minimal Model Program in modern computer algebra systems.
A differential graded (DG for short) free algebra $\mathcal{A}$ is a connected cochain DG algebra such that its underlying graded algebra is $$\mathcal{A}^{\#}=\k\langle x_1,x_2,\cdots, x_n\rangle,\,\, \text{with}\,\, |x_i|=1,\,\, \forall…
We present a method for computing the number of epimorphisms from a finitely-presented group G to a finite solvable group \Gamma, which generalizes a formula of G\"aschutz. Key to this approach are the degree 1 and 2 cohomology groups of G,…
Let I be an ideal of height two in R=k[x_0,x_1] generated by forms of the same degree, and let K be the ideal of defining equations of the Rees algebra of I. Suppose that the second largest column degree in the syzygy matrix of I is e. We…
In this paper, we introduce discrete approximate circle bundles, a class of objects designed to serve as the data science analog of circle bundles from algebraic topology. We show that, under appropriate conditions, one can meaningfully and…
We define degree two cohomological invariants for G-Galois algebras over fields of characteristic not 2, and use them to give necessary conditions for the existence of a self--dual normal basis. In some cases, we show that these conditions…
Future e-mobility calls for efficient electrical machines. For different areas of operation, these machines have to satisfy certain desired properties that often depend on their design. Here we investigate the use of multipatch Isogeometric…