Related papers: Generalized Dissections and Monsky's Theorem

In this paper, a new general decomposition theory inspired from modular graph decomposition is presented. Our main result shows that, within this general theory, most of the nice algorithmic tools developed for modular decomposition are…

We prove that any finite collection of polygons of equal area has a common hinged dissection. That is, for any such collection of polygons there exists a chain of polygons hinged at vertices that can be folded in the plane continuously…

This chapter describes modal decompositions in the framework of matrix factorizations. We highlight the differences between classic space-time decompositions and 2D discrete transforms and discuss the general architecture underpinning…

This paper investigates equivalence of square multivariate polynomial matrices with the determinant being some power of a univariate irreducible polynomial. We first generalized a global-local theorem of Vaserstein. Then we proved these…

Zeckendorf's theorem states that every positive integer can be uniquely decomposed as a sum of nonconsecutive Fibonacci numbers. The distribution of the number of summands converges to a Gaussian, and the individual measures on gaps between…

In this paper we study dually flat spaces arising from Delzant polytopes equipped with a symplectic potential together with their corresponding toric K\"ahler manifolds as their torifications.We introduce a dually flat structure and the…

In this article we study the deformation of finite maps and show how to use this deformation theory to construct varieties with given invariants in a projective space. Among other things, we prove a criterion that determines when a finite…

The prime divisors of a polynomial $P$ with integer coefficients are those primes $p$ for which $P(x) \equiv 0 \pmod{p}$ is solvable. Our main result is that the common prime divisors of any several polynomials are exactly the prime…

Two theorems of J. F. Ritt on decompositions of polynomials maps are generalized to a more general situation: for, so-called, reduction monoids ($(K[x], \circ)$ and $(K[x^2]x, \circ)$ are examples of reduction monoids). In particular,…

We prove a uniform generalized gaussian bound for the powers of a discrete convolution operator in one space dimension. Our bound is derived under the assumption that the Fourier transform of the coefficients of the convolution operator is…

For univariate polynomials over arbitrary field the degree gives an upper bound on the number of roots (factor theorem) and as a related result for any finite point-set one can construct a polynomial of degree equal to the cardinality…

A univariate polynomial f over a field is decomposable if f = g o h = g(h) for nonlinear polynomials g and h. In order to count the decomposables, one wants to know, under a suitable normalization, the number of equal-degree collisions of…

Many high-dimensional uncertainty quantification problems are solved by polynomial dimensional decomposition (PDD), which represents Fourier-like series expansion in terms of random orthonormal polynomials with increasing dimensions. This…

We introduce the generalized equidistant Chebyshev polynomials T(k,h) of kind k of hyperkind h, where k,h are positive integers. They are obtained by a generalization of standard and monic Chebyshev polynomials of the first and second…

We consider the issue of when the L-polynomial of one curve over $\F_q$ divides the L-polynomial of another curve. We prove a theorem which shows that divisibility follows from a hypothesis that two curves have the same number of points…

Motivated by a question of Venkataramana, we consider the greatest common divisor of $\phi(f(n))$ where $f$ is a primitive polynomial with integer coefficients, and $n$ ranges over all natural numbers. Assuming Schinzel's hypothesis, we…

Let $f(x) \in \mathbb{C}[x]$ of degree $n$. We attach to $f$ a $\mathbb{C}$-vector space $W(f)$ which consists of complex polynomials $p(x)$ of degree at most $n - 2$ such that $f(x)$ divides $f"(x)p(x) - f'(x) p'(x)$. The space $W(f)$…

The notion of a descent polynomial, a function in enumerative combinatorics that counts permutations with specific properties, enjoys a revived recent research interest due to its connection with other important notions in combinatorics,…

This work introduces ``generalized meshes", a type of meshes suited for the discretization of partial differential equations in non-regular geometries. Generalized meshes extend regular simplicial meshes by allowing for overlapping elements…

Given a separable nonconstant polynomial $f(x)$ with integer coefficients, we consider the set $S$ consisting of the squarefree parts of all the rational values of $f(x)$, and study its behavior modulo primes. Fixing a prime $p$, we…