Related papers: A new shift operator-based polynomial method in ad…
We present different techniques for applying Combinatorial Nullstellensatz to polynomials over finite fields. For examples, we generalize theorems from Noga Alon's paper on the subject, and present a few of our own.
We discuss here some computational aspects of the Combinatorial Nullstellensatz argument. Our main result shows that the order of magnitude of the symmetry group associated with permutations of the variables in algebraic constraints,…
We present an extension of a previously developed method employing the formalism of the fractional derivatives to solve new classes of integral equations. This method uses different forms of integral operators that generalizes the…
This paper does not contain any new results, it is just an attempt to present, in a systematic way, one construction which establishes an interesting relationship between some ideas and notions well-known in the theory of integrable systems…
Unlike the classical polynomial case there has not been invented up to very recently a tool similar to the Bernstein-Bezier representation which would allow us to control the behavior of the exponential polynomials. The exponential analog…
In this expository note we show how combinatorial Nullstellensatz by N. Alon naturally appears in solutions of elementary problems. Simple ideas gradually and naturally appear in such solutions, thus bringing a reader to generalizations.…
Applying techniques similar to Combinatorial Nullstellensatz we prove a lower estimate of $|f(A,B)|$ for finite subsets $A$, $B$ of a field, and polynomial $f(x,y)$ of the form $f(x,y)=g(x)+yh(x)$, where degree of $g$ is greater then degree…
This paper presents a new formula for the q-shift operator, building on the techniques by Liu and Sears. This formula provides fresh proof of the Carlitz formula and extends it naturally. As applications, we derive an equivalent form of the…
The purpose of this article is to present, in a simple way, an analytic approach to special numbers and polynomials. The approach is based on the derivative polynomials. The paper is, to some extent, a review article, although it contains…
We put together the ingredients for an efficient operator calculus based on Krawtchouk polynomials, including Krawtchouk transforms and corresponding convolution structure which provide an inherently discrete alternative to Fourier…
The point-splitting regularization technique for composite operators is discussed in connection with anomaly calculation. We present a pedagogical and self-contained review of the topic with an emphasis on the technical details. We also…
We revisit and further explore the celebrated Combinatorial Nullstellens\"atze of N. Alon in several different directions.
We use linear algebraic methods to obtain general results about linear operators on a space of polynomials that we apply to the operators associated with a polynomial sequence by the monomiality property. We show that all such operators are…
We give a representation--theoretic interpretation of recent discovered coupled soliton equations using vertex operators construction of affinization of not simple but quadratic Lie algebras. In this setup we are able to obtain new…
We classify the shift operators for the symmetric Askey-Wilson polynomials and construct shift operators for the non-symmetric Askey-Wilson polynomials using two decompositions of non-symmetric Askey-Wilson polynomials in terms of symmetric…
We prove an inequality for polynomials applied in a symmetric way to non-commuting operators.
We collect and organise known results and add some new ones of the following nature: if A is a bounded operator in a Hilbert or Banach space, does there exist a nonconstant polynomial p(z) such that p(A) is "simpler", "nicer" than A. The…
It is often the case in mathematical analysis that solving an open problem can be facilitated by finding a new set of coordinates which may illumniate the known difficulties. In this article, we illustrate how to derive an assortment…
Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of…
We provide a brief survey of a certain algebra of operators on symmetric polynomials, and collect a number of previously known results in the field.