相关论文: Cantor polynomials and the Fueter-Polya theorem
A packing function on a set Omega in R^n is a one-to-one correspondence between the set of lattice points in Omega and the set N_0 of nonnegative integers. It is proved that if r and s are relatively prime positive integers such that r…
We study quadratic polynomials giving bijections from the integer lattice points of sectors of $\mathbb{R}^2$ onto $\mathbb{N}_0$ , called packing polynomials. We determine all quadratic packing polynomials on rational sectors. This…
We prove that every indefinite quadratic form with non-negative integer coefficients is the volume polynomial of a pair of lattice polygons. This solves the discrete version of the Heine-Shephard problem for two bodies in the plane. As an…
The Cantor pairing polynomials are extended to larger 2D sub-domains and more complex mapping, of which the most important property is the bijectivity. If corners are involved inside (but not the borders of) domain, more than one connected…
We present a simple information theoretical proof of the Fueter-P\'olya Conjecture: there is no polynomial pairing function that defines a bijection between the set of natural numbers N and its product set N^2 of degree higher than 2. We…
A polynomial $p(x,y)$ on a region $S$ in the plane is called a packing polynomial if the restriction of $p(x,y)$ to $S\cap \mathbb{Z}^2$ yields a bijection to $\mathbb{N}$. In this paper, we determine all quadratic packing polynomials on…
We show that an integer-valued quadratic polynomial on $\mathbb{R}^2$ can not be injective on the integer lattice points of any affine convex cone if its discriminant is nonzero. A consequence is the non-existence of quadratic packing…
Finite-dimensional representations of Onsager's algebra are characterized by the zeros of truncation polynomials. The Z_N-chiral Potts quantum chain hamiltonians (of which the Ising chain hamiltonian is the N=2 case) are the main known…
A quadrature formula is a formula computing a definite integration by evaluation at finite points. The existence of certain quadrature formulas for orthogonal polynomials is related to interesting problems such as Waring's problem in number…
Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing problem we are given two trees T1 and T2 on n vertices and…
We prove a constant term theorem which is useful for finding weight polynomials for Ballot/Motzkin paths in a strip with a fixed number of arbitrary `decorated' weights as well as an arbitrary `background' weight. Our CT theorem, like…
We present an algorithm for growing the denominator $r$ polygons containing a fixed number of lattice points and enumerate such polygons containing few lattice points for small $r$. We describe the Ehrhart quasi-polynomial of a rational…
In this survey article, we review some results and conjectures related to orthogonal polynomials on Cantor sets. The main purpose of this paper is to emphasize the role of equilibrium measures in order to have a general theory of…
It is an old question how massive polynomial hulls of Cantor sets in $\mathbb{C}^n$ can be. In contrast to expectation e.g. Rudin, Vitushkin and Henkin showed on examples that it can be rather massive. Motivated by problems of holomorphic…
Given a finite set of vectors spanning a lattice and lying in a halfspace of a real vector space, to each vector $a$ in this vector space one can associate a polytope consisting of nonnegative linear combinations of the vectors in the set…
We prove a simple formula for arbitrary cluster variables in the marked surfaces model. As part of the formula, we associate a labeled poset to each tagged arc, such that the associated $F$-polynomial is a weighted sum of order ideals. Each…
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…
The generalized L'vov-Kaplansky conjecture states that for any finite-dimensional simple algebra $A$ the image of a multilinear polynomial on $A$ is a vector space. In this paper we prove it for the algebra of octonions $\mathbb{O}$ over a…
We give an especially simple proof of a theorem in graph theory that forms the key part of the solution to a problem in commutative algebra, on how to characterize the integral closure of a polynomial ring generated by quadratic monomials.
It is proved that for every complex quadratic polynomial $f$ with Cremer's fixed point $z_0$ (or periodic orbit) for every $\delta>0$, there is at most one periodic orbit of minimal period $n$ for all $n$ large enough, entirely in the disc…