Related papers: On discriminants of polylinear forms
In this paper we consider the classical problem of computing linear extensions of a given poset which is well known to be a difficult problem. However, in our setting the elements of the poset are multivariate polynomials, and only a small…
In this paper we present an algorithm for computing Groebner bases of linear ideals in a difference polynomial ring over a ground difference field. The input difference polynomials generating the ideal are also assumed to be linear. The…
We develop a method to construct algebraic invariants for hypermatrices. We then construct hyperdeterminants and exhibit a generalization of the Cayley-Hamilton theorem for hypermatrices.
We present a new topological method to study the discriminantal loci of an algebraic variety defined in a product of projective spaces. Our approach relies on an efficient use of groupoid to describe the monodromy. As an example, we treat…
The polysymplectic $(n+1)$-form is introduced as an analogue of the symplectic form for the De Donder-Weyl polymomentum Hamiltonian formulation of field theory. The corresponding Poisson brackets on differential forms are constructed. The…
The purpose of this article is to investigate triangularization and simultaneous triangularization of matrices over max algebras using graph theoretic methods. We establish a connection between commutators and commutants with simultaneous…
This work pioneers the systematic study and classification (up to Lie algebra automorphisms) of finite-dimensional coboundary Lie bialgebras through Grassmann algebras. Several mathematical structures on Lie algebras, e.g. Killing forms or…
The aim of this paper is to develop a constraint algorithm for singular classical field theories in the framework of $k$-cosymplectic geometry. Since these field theories are singular, we need to introduce the notion of $k$-precosymplectic…
We describe an algorithm for computing certain characteristic numbers of surface scrolls using degenerations. As a corollary we obtain a method for computing the corresponding Gromov-Witten invariants of Grassmannians.
We show that several orbital equations and orbital clusters of the quadratic (logistic) map coincide surprisingly with cyclotomic {\it period equations}, polynomials whose roots are Gaussian periods. An analytical expression for the field…
A long-term research proposal on the algebraic structure, the representations and the possible applications of paraparticle algebras is structured in three modules: The first part stems from an attempt to classify the inequivalent gradings…
The possibility of defining sesquilinear forms starting from one or two sequences of elements of a Hilbert space is investigated. One can associate operators to these forms and in particular look for conditions to apply representation…
This paper presents a discriminative classifier for compositional data. This classifier is based on the posterior distribution of the Generalized Dirichlet which is the discriminative counterpart of Generalized Dirichlet mixture model.…
We develop a theory of sesquilinear forms over finite fields, investigating their representations via polynomials and coefficient matrices, along with classification results for these forms. Through their connection to quadratic forms, we…
The main goal of the paper is the discussion of a deeper interaction between matrix theory over polynomial rings over a field and typical methods of commutative algebra and related algebraic geometry. This is intended in the sense of…
We first prove an identity involving symmetric polynomials. This identity leads us into exploring the geometry of Lagrangian Grassmannians. As an insight applications, we obtain a formula for the integral over the Lagrangian Grassmannian of…
In this paper, we present an algorithm to compute a basis of the space of algebraic modular forms on the maximal order of the definite quaternion algebra of discriminant $2$, and provide a database of such bases. One of our motivations is…
We present a deterministic algorithm which computes the multilinear factors of multivariate lacunary polynomials over number fields. Its complexity is polynomial in $\ell^n$ where $\ell$ is the lacunary size of the input polynomial and $n$…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
We consider the problem of optimizing the discriminator in generative adversarial networks (GANs) subject to higher-order gradient regularization. We show analytically, via the least-squares (LSGAN) and Wasserstein (WGAN) GAN variants, that…