相关论文: The geometry of polynomial diagrams

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…

Given a combinatorial triangulation of an $n$-gon, we study (a) the space of all possible drawings in the plane such the edges are straight line segments and the boundary has a fixed shape, and (b) the algebraic variety of possibilities for…

Graph polynomials are polynomials assigned to graphs. Interestingly, they also arise in many areas outside graph theory as well. Many properties of graph polynomials have been widely studied. In this paper, we survey some results on the…

We discuss various aspects of representation of a polynomial as a sum of monomials (for example, uniqueness of such representation and related estimations).

In this paper we use Euler-Seidel matrices method to find out some properties of exponential and geometric polynomials and numbers. Some known results are reproved and some new results are obtained.

Consider the Poincare disc model for hyperbolic geometry. In this paper, a convenient computational formula is developed along with an aesthetic geometric interpretation. Two proofs, one geometric and one analytical, of each result are…

We discuss some geometric invariants of polynomial identities of algebras deduced from Kemer's theory and deduce some quantitative information on codimension and co--length

The formula for the area of a rhumb polygon, a polygon whose edges are rhumb lines on an ellipsoid of revolution, is derived and a method is given for computing the area accurately. This paper also points out that standard methods for…

In this survey of graph polynomials, we emphasize the Tutte polynomial and a selection of closely related graph polynomials. We explore some of the Tutte polynomial's many properties and applications and we use the Tutte polynomial to…

This is a short note that explains a problem on polynomial maps over finite fields for non-experts. The problem is: Do there exist odd polynomial automorphisms over the finite fields with 4,8,16,32,64,... elements? The explanation is very,…

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…

We give a new proof of the formula expressing the area of the triangle whose vertices are the projections of an arbitrary point in the plane onto the sides of a given triangle, in terms of the geometry of the given triangle and the location…

An infinite family of Boolean polynomials which correspond to the discrete average maps, defined in [2], is constructed and their algebraic and combinatorial properties are investigated. They turn out to be balanced, and some recurrence…

We investigate the zonal polynomials, a family of symmetric polynomials that appear in many mathematical contexts, such as multivariate statistics, differential geometry, representation theory, and combinatorics. We present two computer…

The study of the graph diameter of polytopes is a classical open problem in polyhedral geometry and the theory of linear optimization. In this paper we continue the investigation initiated in [4] by introducing a vast hierarchy of…

We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in…

We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…

This is a short review article on invariants of spatial graphs, written for "A Concise Encyclopedia of Knot Theory" (ed. Adams et. al.). The emphasis is on combinatorial and polynomial invariants of spatial graphs, including the Alexander…

In this paper we would like to introduce some new methods for studying magic type-colorings of graphs or domination of graphs, based on combinatorial spectrum on polynomial rings. We hope that this concept will be potentially useful for the…

For a graph embedded into a surface, we relate many combinatorial parameters of the cycle matroid of the graph and the bond matroid of the dual graph with the topological parameters of the embedding. This will give an expression of the…