Related papers: Polynomial partitioning for several sets of variet…

In this paper, we tackle the parametric complete multiplicity problem for a univariate polynomial. Our approach to the parametric complete multiplicity problem has a significant difference from the classical method, which relies on repeated…

Let $U$ be a set of polynomials of degree at most $k$ over $\mathbb{F}_q$, the finite field of $q$ elements. Assume that $U$ is an intersecting family, that is, the graphs of any two of the polynomials in $U$ share a common point.…

Assume that $V_h$ is a space of piecewise polynomials of degree less than $r\geq 1$ on a family of quasi-uniform triangulation of size $h$. Then the following well-known upper bound holds for a sufficiently smooth function $u$ and $p\in [1,…

Given $D$ and $\gamma>0$, whenever $c>0$ is sufficiently small and $n$ sufficiently large, if $\mathcal{G}$ is a family of $D$-degenerate graphs of individual orders at most $n$, maximum degrees at most $\tfrac{cn}{\log n}$, and total…

We give short elementary expositions of combinatorial proofs of some variants of Euler's partitition problem that were first addressed analytically by George Andrews, and later combinatorially by others. Our methods, based on ideas from a…

Let $p$ be a prime and let $S$ be a non-empty subset of $\mathbb{F}_p$. Generalizing a result of Green and Tao on the equidistribution of high-rank polynomials over finite fields, we show that if $P: \mathbb{F}_p^n \rightarrow \mathbb{F}_p$…

The chromatic polynomial is characterized as the unique polynomial invariant of graphs, compatible with two interacting bialgebras structures: the first coproduct is given by partitions of vertices into two parts, the second one by a…

In this paper, we show that the difference between the number of parts in the odd partitions of $n$ and the number of parts in the distinct partitions of $n$ satisfies Euler's recurrence relation for the partition function $p(n)$ when $n$…

By generalizing Frobenius' polynomial method to good partition algebra, we will develop new character theories for a finite group $G$. A uniform defining equations are derived for these kinds of character theories. The new character…

Let $G$ be a finite group, and let ${\rm{cd}}(G)$ denote the set of degrees of the irreducible complex characters of $G$. The degree graph $\Delta(G)$ of $G$ is defined as the simple undirected graph whose vertex set ${\rm{V}}(G)$ consists…

If A is a graded connected algebra then we define a new invariant, polydepth A, which is finite if $Ext_A^*(M,A) \neq 0$ for some A-module M of at most polynomial growth. Theorem 1: If f : X \to Y is a continuous map of finite category, and…

It is proved that the universal degree bound for separating polynomial invariants of a finite abelian group (in non-modular characteristic) is strictly smaller than the universal degree bound for generators of polynomial invariants, unless…

The class $\mathcal{UP}$ of `ultimate polynomial time' problems over $\mathbb C$ is introduced; it contains the class $\mathcal P$ of polynomial time problems over $\mathbb C$. The $\tau$-Conjecture for polynomials implies that…

The variety of bicommutative algebras is the class of all nonassociative algebras satisfying the polynomial identities $(x_1x_2)x_3=(x_1x_3)x_2$ and $x_1(x_2x_3)=x_2(x_1x_3)$. In this paper we provide a complete description of varieties of…

Let $A$ be an associative algebra graded by a finite group $G$ over a field ${F}$ of characteristic zero. One associates to $A$ the sequence of $G$-graded codimensions $c_n^G(A)$, $n=1,2,\ldots$, which measures the growth of the polynomial…

The complexity of computing the solutions of a system of multivariate polynomial equations by means of Groebner bases computations is upper bounded by a function of the solving degree. In this paper, we discuss how to rigorously estimate…

A question at the intersection of Barnette's Hamiltonicity and Neumann-Lara's dicoloring conjecture is: Can every Eulerian oriented planar graph be vertex-partitioned into two acyclic sets? A CAI-partition of an undirected/oriented graph is…

Let $A$ be a Poisson Hopf algebra over an algebraically closed field of characteristic zero. If $A$ is finitely generated and connected graded as an algebra and its Poisson bracket is homogeneous of degree $d \geq 0$, then $A$ is…

The assignments of a set of $m$ items into $n$ clusters of prescribed sizes $k_1,\dots,k_n$ can be encoded as the vertices of the partition polytope $\mathrm{PP}(k_1,\dots,k_n)$. We prove that, if $K = \max\{k_1,\dots,k_n\}$, then the…

When we consider the action of a finite group on a polynomial ring, a polynomial unchanged by the action is called an invariant polynomial. A famous result of Noether states that in characteristic zero the maximal degree of a minimal…