Related papers: Combinatorial Nullstellensatz Techniques
We give an introduction to the theory of 2-Segal sets, and two of the main applications of them: Hall algebras and a discrete version of Waldhausen's $S_\bullet$-construction. We present several combinatorial examples and how these…
The 6th problem of the 50th International Mathematical Olympiad (IMO), held in Germany, 2009, is called 'the grasshopper problem'. To this problem Kos developed theory from unique viewpoints by reference of Noga Alon's combinatorial…
Additive combinatorics asks for lower bounds on sumsets and restricted sumsets over finite fields. Central examples are the Cauchy-Davenport theorem and the Erd\H{o}s-Heilbronn conjecture. In this note, we develop Das's linear algebraic…
This paper is a short introduction to orthogonal polynomials, both the general theory and some special classes. It ends with some remarks about the usage of computer algebra for this theory.
Using the fact that the maximal ideals in the polydisk algebra are given by the kernels of point evaluations, we derive a simple formula that gives a solution to the B\'ezout equation in the space of all entire functions of several complex…
The great innovation of the Generalized Theorem is that it gives us the philosophy to work out the knowledge that the number of roots of an equation depends on the subfields of the functional terms of the equation they generate. Thus, the…
We study nominal anti-unification, which is concerned with computing least general generalizations for given terms-in-context. In general, the problem does not have a least general solution, but if the set of atoms permitted in…
We present a method to obtain soliton solutions to relativistic system of coupled scalar fields. This is done by examining the energy associated to static field configurations. In this case we derive a set of first-order differential…
The polynomial method has been used recently to obtain many striking results in combinatorial geometry. In this paper, we use affine Hilbert functions to obtain an estimation theorem in finite field geometry. The most natural way to state…
In this paper we introduce the additive analogue of the index of a polynomial over finite fields. We study several problems in the theory of polynomials over finite fields in terms of their additive indices, such as value set sizes, bounds…
Here the polynomial interpolation approach is used to introduce the main results on multivariate normal algebraic systems. Next we bring a construction which shows that any standard algebraic system, with finite set of solutions, can be…
We propose and discuss how basic notions (quadratic modules, positive elements, semialgebraic sets, Archimedean orderings) and results (Positivstellensaetze) from real algebraic geometry can be generalized to noncommutative $*$-algebras. A…
We give a number of theoretical and practical methods related to the computation of L-functions, both in the local case (counting points on varieties over finite fields, involving in particular a detailed study of Gauss and Jacobi sums),…
We use the theory of resultants of polynomials to study the stability of an arbitrary polynomial over a finite field, that is, the property of having all its iterates irreducible. This result partially generalises the quadratic polynomial…
This paper presents an alternative approach to simplify the proofs of some important results related to polynomial mappings in Computational Algebraic Geometry such as Polynomial Implicitization, Image Closure and some properties of the…
We discuss the noncommutative generalizations of polynomial algebras which after appropriate completions can be used as coordinate algebras in various noncommutative settings, (noncommutative differential geometry, noncommutative algebraic…
Hilbert's Nullstellensatz is a fundamental result in algebraic geometry that gives a necessary and sufficient condition for a finite collection of multivariate polynomials to have a common zero in an algebraically closed field. Associated…
We prove the extended Hilbert's Nullstellensatz in the context of Hu-Liu polynomial trirings.
In this article, a formulation of a point-collocation method in which the unknown function is approximated using global expansion in tensor product Bernstein polynomial basis is presented. Bernstein polynomials used in this study are…
This manuscript presents a generalization of the structure of the null space of the Bezout matrix in the monomial basis, see [G. Heinig and K. Rost, Algebraic methods for toeplitz-like matrices and operators, 1984], to an arbitrary basis.…