Related papers: Polygon dissections and Euler, Fuss, Kirkman and C…

In this paper, we further develop the theory of circles of partition by introducing the notion of complex circles of partition. This work generalizes the classical framework, extending from subsets of the natural numbers as base sets to…

For any finite partially ordered set $P$, the $P$-Eulerian polynomial is the generating function for the descent number over the set of linear extensions of $P$, and is closely related to the order polynomial of $P$ arising in the theory of…

The Catalan numbers $C_n$ are an extremely well-studied sequence of numbers that appear as the answer to many combinatorial problems. Two generalizations of these numbers that have been studied are the Fuss-Catalan numbers and the…

We generalize the joints problem to sets of varieties and prove almost sharp bound on the number of joints. As a special case, given a set of $N$ $2$-planes in $\mathbb{R}^6$, the number of points at which three $2$-planes intersect and…

Following work of Mazur-Tate and Satoh, we extend the definition of division polynomials to arbitrary isogenies of elliptic curves, including those whose kernels do not sum to the identity. In analogy to the classical case of division…

We prove that the number of dissections of a given polygon into triangles with fixed areas of faces is finite and that an equidissection is algebraic as long as the vertices of the original polygon have algebraic coordinates.

We studies the Newton polygon for the L-function of toric exponential sums attached to a family of two variable generalized hyperkloosterman sum,$f_{t}(x,y)=x^{n}+y+\frac{t}{xy}$ with $t$ the parameter. The explicit Newton polygon is…

We prove that a Poisson-Newton formula, in a broad sense, is associated to each Dirichlet series with a meromorphic extension to the whole complex plane of finite order. These formulas simultaneously generalize the classical Poisson formula…

We introduce an approach based on moving frames for polygon recognition and symmetry detection. We present detailed algorithms for recognition of polygons modulo the special Euclidean, Euclidean, equi-affine, skewed-affine and similarity…

We study a large class of Poisson manifolds, derived from Manin triples, for which we construct explicit partitions into regular Poisson submanifolds by intersecting certain group orbits. Examples include all varieties ${\mathcal L}$ of…

The partial breaking of supersymmetry in flat space can be accomplished using any one of three dual representations for the massive N=1 spin-3/2 multiplet. Each of the representations can be ``unHiggsed'', which gives rise to a set of dual…

Euler's theorem asserts that $A(n)=B(n)$ where $A(n)$ is the number of partitions of $n$ into distinct parts and $B(n)$ is the number of partitions of $n$ into odd parts. In this paper, it is proved that for $n>0$, \begin{align*}…

An attempt is described to extend the notion of Schur functions from Young diagrams to plane partitions. The suggestion is to use the recursion in the partition size, which is easily generalized and deformed. This opens a possibility to…

In this note a bijection is constructed between the set of partitions of n simultaneously s-regular and t-distinct, and those simultaneously t-regular and s-distinct. Some implications of the map are discussed. As a generalized version of…

We compare a traditional and non-traditional view on the subject of P-partitions, leading to formulas counting linear extensions of certain posets.

We discuss a non-computational elementary approach to a well-known criterion of divisibility by 2 in the group of rational points on an elliptic curve.

The excedance number for S_n is known to have an Eulerian distribution. Nevertheless, the classical proof uses descents rather than excedances. We present a direct recursive proof which seems to be folklore and extend it to the colored…

Given nonnegative integers, $s$ and $k$, an $(s,k)$-polar partition of a graph $G$ is a partition $(A,B)$ of $V_G$ such that $G[A]$ and $\overline{G[B]}$ are complete multipartite graphs with at most $s$ and $k$ parts, respectively. If $s$…

This note is about the observation that the various transition formulas between bases of trigonometric polynomials can be expressed in terms binomial coefficients. More specifically, we write the entries of the Chebyshev matrices $ T$ and $…

In this paper, we present some criteria for the $2$-$q$-log-convexity and $3$-$q$-log-convexity of combinatorial sequences, which can be regarded as the first column of certain infinite triangular array $[A_{n,k}(q)]_{n,k\geq0}$ of…