Related papers: When is a trigonometric polynomial not a trigonome…

In classical invariant theory, the Gr\"obner base of the ideal of syzygies and the normal forms of polynomials of invariants are two core contents. To improve the performance of invariant theory in symbolic computing of classical geometry,…

We define a convolution operation on the set of polyominoes and use it to obtain a criterion for a given polyomino not to tile the plane (rotations and translations allowed). We apply the criterion to several families of polyominoes, and…

We classify the polynomials $f(x,y) \in \mathbb R[x,y]$ such that given any finite set $A \subset \mathbb R$ if $|A+A|$ is small, then $|f(A,A)|$ is large. In particular, the following bound holds : $|A+A||f(A,A)| \gtrsim |A|^{5/2}.$ The…

We consider the Bernoulli polynomials of the second kind, which can be related to the generalised Bernoulli polynomials $B_n^{(n)}(z)$. The asymptotic expansions of the scaled polynomials $B_n^{(n)}(nz)$ are obtained as $n\to\infty$ when…

Polynomials which afford nonnegative, real-rooted symmetric decompositions have been investigated recently in algebraic, enumerative and geometric combinatorics. Br\"and\'en and Solus have given sufficient conditions under which the image…

Using recent results of Agol, Przytycki-Wise and Wise we show that twisted Alexander polynomials detect the Thurston norm of any irreducible 3-manifold which is not a closed graph manifold.

The notions of convexity and convex polytopes are introduced in the setting of tropical geometry. Combinatorial types of tropical polytopes are shown to be in bijection with regular triangulations of products of two simplices. Applications…

Cais, Ellenberg and Zureick-Brown recently observed that over finite fields of characteristic two, all sufficiently general smooth plane projective curves of a given odd degree admit a non-trivial rational 2-torsion point on their Jacobian.…

In this research, by applying the extended Sturm-Liouville theorem for symmetric functions, a basic class of symmetric orthogonal polynomials (BCSOP) with four free parameters is introduced and all its standard properties, such as a generic…

Let $P: \F \times \F \to \F$ be a polynomial of bounded degree over a finite field $\F$ of large characteristic. In this paper we establish the following dichotomy: either $P$ is a moderate asymmetric expander in the sense that $|P(A,B)|…

Dedicated to Professor Gromoll: The aim of our article is to generalize the Toponogov comparison theorem to a complete Riemannian manifold with smooth convex boundary. A geodesic triangle will be replaced by an open (geodesic) triangle…

We establish necessary and sufficient conditions for an arbitrary polynomial of degree $n$, especially with only real roots, to be trivial, i.e. to have the form a(x-b)^n. To do this, we derive new properties of polynomials and their roots.…

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…

For two properly intersecting effective cycles in projective space X,Y, and their intersection product Z, the metric Bezout Theorem relates the degrees, heights of X,Y, and Z, as well as their distances and algebraic distances to a given…

We present an example of a result in graph theory that is used to obtain a result in another branch of mathematics. More precisely, we show that the isomorphism of certain directed graphs implies that some trinomials over finite fields have…

The Hermite polynomials are ubiquitous but can be difficult to work with due to their unwieldy definition in terms of derivatives. To remedy this, we showcase an underappreciated Gaussian integral formula for the Hermite polynomials, which…

The Collatz conjecture is explored using polynomials based on a binary numeral system. It is shown that the degree of the polynomials, on average, decreases after a finite number of steps of the Collatz operation, which provides a weak…

The Concepts of poly-Bernoulli numbers $B_n^{(k)}$, poly-Bernoulli polynomials $B_n^{k}{(t)}$ and the generalized poly-bernoulli numbers $B_{n}^{(k)}(a,b)$ are generalized to $B_{n}^{(k)}(t,a,b,c)$ which is called the generalized…

The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…

We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…