Related papers: Line Multiview Ideals
The brain processes information about the environment via neural codes. The neural ideal was introduced recently as an algebraic object that can be used to better understand the combinatorial structure of neural codes. Every neural ideal…
To compute difference Groebner bases of ideals generated by linear polynomials we adopt to difference polynomial rings the involutive algorithm based on Janet-like division. The algorithm has been implemented in Maple in the form of the…
Linear systems are the bedrock of virtually all numerical computation. Machine learning poses specific challenges for the solution of such systems due to their scale, characteristic structure, stochasticity and the central role of…
There are several efficient methods to solve linear interval polynomial systems in the context of interval computations, however, the general case of interval polynomial systems is not yet covered as well. In this paper we introduce a new…
In this paper we state and prove the analogous of the principal ideal theorem of algebraic number theory for the case of 3-manifolds from the point of view of arithmetic topology.
In modeling physical systems it is sometimes useful to construct border bases of 0-dimensional polynomial ideals which are contained in the ideal generated by a given set of polynomials. We define and construct such subideal border bases,…
We will explore some properties of minimal graded free resolutions of $R/I$, where $R$ is a trivariate polynomial ring over a field and $I$ is a monomial ideal. Our focus will be to consider a specific form of the resolutions when $I$ is…
In computer vision, image datasets used for classification are naturally associated with multiple labels and comprised of multiple views, because each image may contain several objects (e.g. pedestrian, bicycle and tree) and is properly…
In this paper we describe the equations defining the multi-Rees algebra $k[x_1,\dots,x_n][I_1^{a_1}t_1,\dots,I_r^{a_r}t_r]$, where the ideals are generated by subsets of $x_1,\dots,x_n$. We also show that a family of binomials whose leading…
The vanishing ideal I of a subspace arrangement is an intersection of linear ideals. We give a formula for the Hilbert polynomial of I if the subspaces meet transversally. We also give a formula for the Hilbert series of a product J of the…
Let $R = k[x_1, \dotsc , x_n]$ denote the standard graded polynomial ring over a field $k$. We study certain classes of equigenerated monomial ideals with the property that the so-called complementary ideal has no linear relations on the…
It is shown that, given any finite dimensional, split basic algebra $\Lambda = K\Gamma/I$ (where $\Gamma$ is a quiver and $I$ an admissible ideal in the path algebra $K \Gamma$), there is a finite list of affine algebraic varieties, the…
The ideal of a Segre variety is generated by the 2-minors of a generic hypermatrix of indeterminates. We extend this result to the case of Segre-Veronese varieties. The main tool is the concept of weak generic hypermatrix which allows us to…
We study the problem of shape generation in 3D mesh representation from a few color images with known camera poses. While many previous works learn to hallucinate the shape directly from priors, we resort to further improving the shape…
We study the equations of abelian surfaces embedded in P^{n-1} with a line bundle of polarization of type (1,n). For n>9, we show that the ideal of a general abelian surface with this polarization is generated by quadrics, and if the…
Generating accurate 3D models is a challenging problem that traditionally requires explicit learning from 3D datasets using supervised learning. Although recent advances have shown promise in learning 3D models from 2D images, these methods…
Let $(R,\mathfrak{m},\Bbbk)$ be a regular local ring of dimension 3. Let $I$ be a Gorenstein ideal of $R$ of grade 3. Buchsbaum and Eisenbud proved that there is a skew-symmetric matrix of odd size such that $I$ is generated by the…
In this paper we introduce a working generalization of the theory of Gr\"obner bases for algebras of partial difference polynomials with constant coefficients. One obtains symbolic (formal) computation for systems of linear or non-linear…
In this paper we study identities and images of polynomials on null-filiform Leibniz algebras. If $L_n$ is an $n$-dimensional null-filiform Leibniz algebra, we exhibit a finite minimal basis for $\mbox{Id}(L_n)$, the polynomial identities…
In the field of algebraic systems biology, the number of minimal polynomial models constructed using discretized data from an underlying system is related to the number of distinct reduced Gr\"obner bases for the ideal of the data points.…