Related papers: Dedekind-Carlitz Polynomials as Lattice-Point Enum…
A natural question about Dedekind sums is to find conditions on the integers $a_1, a_2$, and $b$ such that $s(a_1,b) = s(a_2, b)$. We prove that if the former equality holds then $ b \ | \ (a_1a_2-1)(a_1-a_2)$. Surprisingly, to the best of…
Motivated by representation theory and geometry, we introduce and develop an equivariant generalization of Ehrhart theory, the study of lattice points in dilations of lattice polytopes. We prove representation-theoretic analogues of…
Dedekind symbols generalize the classical Dedekind sums (symbols). The symbols are determined uniquely by their reciprocity laws up to an additive constant. There is a natural isomorphism between the space of Dedekind symbols with…
Zeckendorf's Theorem states that any positive integer can be written uniquely as a sum of non-adjacent Fibonacci numbers. We consider higher-dimensional lattice analogues, where a legal decomposition of a number $n$ is a collection of…
As a discrete analog to Minkowski's theorem on convex bodies, Wills conjectured that the Ehrhart coefficients of a centrally symmetric lattice polytope with exactly one interior lattice point are maximized by those of the cube of side…
For $A\in\mathbb{Z}^{m\times n}$ we investigate the behaviour of the number of lattice points in $P_A(b)=\{x\in\mathbb{R}^n:Ax\leq b\}$, depending on the varying vector $b$. It is known that this number, restricted to a cone of constant…
The (generalised) Mellin transforms of certain Chebyshev and Gegenbauer functions based upon the Chebyshev and Gegenbauer polynomials, have polynomial factors $p_n(s)$, whose zeros lie all on the `critical line' $\Re\,s=1/2$ or on the real…
The classical Dedekind sums $s(d, c)$ can be represented as sums over the partial quotients of the continued fraction expansion of the rational $\frac{d}{c}$. Hardy sums, the analog integer-valued sums arising in the transformation of the…
The paper [GLZ] "L-functions of Carlitz modules, resultantal varieties and rooted binary trees" is devoted to a description of some resultantal varieties related to L-functions of Carlitz modules. It contains a conjecture that some of these…
In this work, we define a more general family of polynomials in several variables satisfying a linear recurrence relation. Then we provide explicit formulas and determinantal expressions. Finally, we apply these results to recurrent…
We present combinatorial rules (one theorem and two conjectures) concerning three bases of Z[x1,x2,....]. First, we prove a "splitting" rule for the basis of key polynomials [Demazure '74], thereby establishing a new positivity theorem…
The $n$-dimensional lattice polytopes $\mathcal{Q}_{n,k}$ obtained by intersecting the $n$th dilate of the standard $n$-dimensional simplex in $\mathbb{R}^n$ with the half-spaces $x_i \le 1$ for $1 \le i \le k$ form an interesting special…
It is often stated that the Carlitz module is to the ring of univariate polynomials over a finite field what the multiplicative group is to the ring of integers. This analogy extends to the "rank 2" case, where Drinfeld modules play a role…
We develop a marking system for an analog of Hasse diagrams of intervals $[u,v]$ with $u\leq v$ in a Hermitian symmetric pair $W/W_J$, and use this to create a closed form algorithm for computing relative R-polynomials. The uniform nature…
The Toeplitz determinants (of increasing size) associated with the symbols $exp{t(z+z^{-1})}$ or $(1-{\xi}{z})^{\alpha} (1-{\xi}{z^{-1}})^{\beta}$ satisfy recursion relations, thus expressing all the Toeplitz determinants as a rational…
We use Reznick's Theorem for positive homogeneous polynomials to prove an elliptic regularity result for representations of enveloping algebras of Lie algebras. This allows us to relax a technical condition for a sum of squares…
We consider the generating polynomial of the number of rooted trees on the set $\{1,2,\dots,n\}$ counted by the number of descending edges (a parent with a greater label than a child). This polynomial is an extension of the descent…
The Collatz Conjecture (also known as the 3x+1 Problem) proposes that the following algorithm will, after a certain number of iterations, always yield the number 1: given a natural number, multiply by three and add one if the number is odd,…
Let $\mathbb{L}$ be a Dedekind complete unital $f$-algebra. We prove the Riesz-Kantorovich formulas for order bounded $\mathbb{L}$-module homomorphisms from a directed partially ordered $\mathbb{L}$-module with the Riesz Decomposition…
A positroid is a matroid realized by a matrix such that all maximal minors are non-negative. Positroid polytopes are matroid polytopes of positroids. In particular, they are lattice polytopes. The Ehrhart polynomial of a lattice polytope…