Related papers: Motivated exposition of combinatorial Nullstellens…
The aim of this short note is mainly pedagogical. It summarizes some knowledge about Boolean satisfiability (SAT) and the P=NP? problem in an elementary mathematical language. A convenient scheme to visualize and manipulate CNF formulae is…
We generalize the classical notion of adjoint of a linear operator and the Aron-Schottenloher notion of adjoint of a homogeneous polynomial. The general notion is shown to enjoy several properties enjoyed by the classical ones, nevertheless…
Using the Rabinowitsch trick, we prove a version of Nullstellensatz over quaternions, which generalizes Hilbert's Nullstellensatz over complex numbers.
Let G be a simple algebraic group over the complex numbers containing a Borel subgroup B. Given a B-stable ideal I in the nilradical of the Lie algebra of B, we define natural numbers $m_1, m_2, ..., m_k$ which we call ideal exponents. We…
We use the stabilization functors to study the combinatorial aspects of the $F$-polynomial of a representation of any finite-dimensional basic algebra. We characterize the vertices of their Newton polytopes. We give an explicit formula for…
This article introduces a pedagogical method for {\it solving combinatorial problems} that frequently involve structures that are unfamiliar or less familiar. Indeed, an indirect method has been proposed in order to evade any possible…
The motivation of this work is to define cohomology classes in the space of knots that are both easy to find and to evaluate, by reducing the problem to simple linear algebra. We achieve this goal by defining a combinatorial graded cochain…
We begin by explaining how arguments used by R. Wilson to give an elementary proof of the $\mathbb F_p$ case for the Ax-Katz Theorem can also be used to prove the following generalization of the Chevalley-Warning and Ax-Katz Theorems for…
We present bounds for the degree and the height of the polynomials arising in some central problems in effective algebraic geometry including the implicitation of rational maps and the effective Nullstellensatz over a variety. Our treatment…
This paper presents an alternative proof of the Fundamental Theorem of Algebra that has several distinct advantages. The proof is based on simple ideas involving continuity and differentiation. Visual software demonstrations can be used to…
Combinatorial properties of zeons have been applied to graph enumeration problems, graph colorings, routing problems in communication networks, partition-dependent stochastic integrals, and Boolean satisfiability. Power series of elementary…
We explore a general method based on trees of elementary submodels in order to present highly simplified proofs to numerous results in infinite combinatorics. While countable elementary submodels have been employed in such settings already,…
We give an expository account of Nullstellensatz-like results when the base field is finite. In particular, we discuss the vanishing ideal of the affine space and of the projective space over a finite field. As an application, we include an…
Non-classical generalizations of classical modal logic have been developed in the contexts of constructive mathematics and natural language semantics. In this paper, we discuss a general approach to the semantics of non-classical modal…
We determine the Newton trees of the rational polynomials of simple type, thus filling a gap in the proof of the classification of these polynomials given by Neumann and Norbury.
In this paper we introduce a new algebraic method in tilings. Combining this method with Hilbert's Nullstellensatz we obtain a necessary condition for tiling $n$-space by translates of a cluster of cubes. Further, the polynomial method will…
For linear operators which factor with suitable assumptions concerning commutativity of the factors, we introduce several notions of a decomposition. When any of these hold then questions of null space and range are subordinated to the same…
We give a short proof of the most general version of the Nullstellensatz without using the Axiom of Choice.
In this note, we offer a palatable introduction to the field of arithmetic dynamics. That is, we study the patterns that arise when iterating a polynomial map. This note is accessible to those who have taken an introductory proof based…
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…