相关论文: Cantor polynomials and the Fueter-Polya theorem
We use a localisation technique to study orthogonally additive polynomials on Banach lattices. We derive alternative characterisations for orthogonal additivity of polynomials and orthosymmetry of $m$-linear mappings. We prove that an…
Let $\mu$ be a probability measure with an infinite compact support on $\mathbb{R}$. Let us further assume that $(F_n)_{n=1}^\infty$ is a sequence of orthogonal polynomials for $\mu$ where $(f_n)_{n=1}^\infty$ is a sequence of nonlinear…
In this paper, plane polynomial systems having a singular point attracting all orbits in positive time are classified up to topological equivalence. This is done by assigning a combinatorial invariant to the system (a so-called "feasible…
In this paper we prove existence of matings between a large class of renormalizable cubic polynomials with one fixed critical point and another cubic polynomial having two fixed critical points. The resulting mating is a Newton map. Our…
We introduce a new method for showing that the roots of the characteristic polynomial of certain finite lattices are all nonnegative integers. This method is based on the notion of a quotient of a poset which will be developed to explain…
We prove the classical result, which goes back at least to Fourier, that a polynomial with real coefficients has all zeros real and distinct if and only if the polynomial and also all of its nonconstant derivatives have only negative minima…
We prove the discrete analogue of Kakeya conjecture over $\mathbb{R}^n$. This result suggests that a (hypothetically) low dimensional Kakeya set cannot be constructed directly from discrete configurations. We also prove a generalization…
In the intersection of the theories of nonsymmetric Jack polynomials in $N$ variables and representations of the symmetric groups $\mathcal{S}_{N}$ one finds the singular polynomials. For certain values of the parameter $\kappa$ there are…
The linearization coefficients for a set of orthogonal polynomials are given explicitly as a weighted sum of combinatorial objects. Positivity theorems of Askey and Szwarc are corollaries of these expansions.
We give an elementary combinatorial proof of a special case of a result due to Bazlov and Ion concerning the Fourier coefficients of the Cherednik kernel. This can be used to give yet another proof of the classical fact that for a complex…
A cosmological polytope is a lattice polytope introduced by Arkani-Hamed, Benincasa, and Postnikov in their study of the wavefunction of the universe in a class of cosmological models. More concretely, they construct a cosmological polytope…
We formulate and prove a criterion for reducibility of a quadratic polynomial over the integers. The main theorem was suggested by the teaching experience with the concrete material called "the polynomial box". Through the corollaries we…
A nonpolynomial one-dimensional quantum potential representing an oscillator, that can be considered as placed in the middle between the harmonic oscillator and the isotonic oscillator (harmonic oscillator with a centripetal barrier), is…
The aim in packing problems is to decide if a given set of pieces can be placed inside a given container. A packing problem is defined by the types of pieces and containers to be handled, and the motions that are allowed to move the pieces.…
A dichotomy theorem for counting problems due to Creignou and Hermann states that or any nite set S of logical relations, the counting problem #SAT(S) is either in FP, or #P-complete. In the present paper we show a dichotomy theorem for…
We confirm a conjecture of Monical, Tokcan and Yong on a characterization of the lattice points in the Newton polytopes of key polynomials.
"V - E + F = 2", the famous Euler's polyhedral formula, has a natural generalization to convex polytopes in every finite dimension, also known as the Euler-Poincar\'e Formula. We provide another short inductive proof of the general formula.…
The h^*-polynomial of a lattice polytope is the numerator of the generating function of the Ehrhart polynomial. Let P be a lattice polytope with h^*-polynomial of degree d and with linear coefficient h^*_1. We show that P has to be a…
The concept of polynomials in the sense of algebraic analysis, for a single right invertible linear operator, was introduced and studied originally by D. Przeworska-Rolewicz \cite{DPR}. One of the elegant results corresponding with that…
We identify a recursive structure among factorizations of polynomial values into two integer factors. Polynomials for which this recursive structure characterizes all non-trivial representations of integer factorizations of the polynomial…