English
Related papers

Related papers: A degree bound for planar functions

200 papers

We prove an analogue of the classical Bateman-Horn conjecture on prime values of polynomials for the ring of polynomials over a large finite field. Namely, given non-associate, irreducible, separable and monic (in the variable $x$)…

Number Theory · Mathematics 2019-02-20 Alexei Entin

We consider straight line drawings of a planar graph $G$ with possible edge crossings. The \emph{untangling problem} is to eliminate all edge crossings by moving as few vertices as possible to new positions. Let $fix(G)$ denote the maximum…

Computational Geometry · Computer Science 2011-11-14 Alexander Ravsky , Oleg Verbitsky

We prove the following statement about any Siegel modular form $F$ of degree $n$ and arbitrary odd level $N$ on the group $\Gamma_{0}^{(n)}(N)$. Let $A(F,T)$ denote the Fourier coefficients of $F$ and write $T=(T(i,j))$. Suppose that $F$…

Number Theory · Mathematics 2026-02-10 Pramath Anamby , Soumya Das

Given a polynomial $f$ and a semi-algebraic set $S$, we provide a symbolic algorithm to find the equations and inequalities defining a semi-algebraic set $Q$ which is identical to the closure of the image of $S$ under $f$, i.e.,…

Algebraic Geometry · Mathematics 2022-10-26 Ngoc Hoang Anh Mai

Given any non-polynomial $G$-function $F(z)=\sum\_{k=0}^\infty A\_k z^k$ of radius of convergence $R$, we consider the $G$-functions $F\_n^{[s]}(z)=\sum\_{k=0}^\infty \frac{A\_k}{(k+n)^s}z^k$ for any integers $s\geq 0$ and $n\geq 1$. For…

Number Theory · Mathematics 2017-02-01 Stéphane Fischler , Tanguy Rivoal

We consider the Rosenfeld-Groebner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials…

Commutative Algebra · Mathematics 2009-02-25 Oleg Golubitsky , Marina Kondratieva , Marc Moreno Maza , Alexey Ovchinnikov

Let $K$ be a field, $A$ a standard graded $K$-algebra and $M$ a finitely generated graded $A$-module. Inspired by our previous works, we study the Hilbert depth of $h_M$, that is $$\operatorname{hdepth}(h_M)=\max\{d\;:\; \sum\limits_{j\leq…

Commutative Algebra · Mathematics 2024-02-20 Silviu Balanescu , Mircea Cimpoeas

Let $q=p^r$ be the power of a prime $p$ and $(\beta_1,\ldots ,\beta_r)$ be an ordered basis of $\mathbb{F}_q$ over $\mathbb{F}_p$. For $$ \xi=\sum\limits_{j=1}^r x_j\beta_j\in \mathbb{F}_q \quad \mbox{with digits }x_j\in\mathbb{F}_p, $$ we…

Number Theory · Mathematics 2021-01-22 Cécile Dartyge , László Mérai , Arne Winterhof

We give an explicit upper bound for the algebraic degree and an explicit lower bound for the absolute value of the minimum of a polynomial function on a compact connected component of a basic closed semialgebraic set when this minimum is…

Algebraic Geometry · Mathematics 2011-12-05 Gabriela Jeronimo , Daniel Perrucci , Elias Tsigaridas

For a finite group $G$ acting faithfully on a finite dimensional $F$-vector space $V$, we show that in the modular case, the top degree of the vector coinvariants grows unboundedly: $\lim_{m\to\infty} \topdeg F[V^{m}]_{G}=\infty$. In…

Commutative Algebra · Mathematics 2015-12-29 Martin Kohls , Müfit Sezer

A multiple Gauss sum is a complete multiple exponential sum twisted by Dirichlet characters. We prove a new bound for multiple Gauss sums and, as an application, improve previous results in the Birch--Goldbach problem. Let $F_1, \ldots, F_R…

Number Theory · Mathematics 2026-05-19 Jianya Liu , Sizhe Xie

Let $R$ be a finite-dimensional algebra over an algebraically closed field $F$ graded by an arbitrary group $G$. We prove that $R$ is a graded division algebra if and only if it is isomorphic to a twisted group algebra of some finite…

Rings and Algebras · Mathematics 2007-05-23 Y. A. Bahturin , S. K. Sehgal , M. V. Zaicev

We show that a weakly holomorphic modular function can be written as a sum of modular units of higher level. We further find a necessary and sufficient condition for a Siegel modular function of degree $g$ to have neither zero nor pole on…

Number Theory · Mathematics 2012-08-07 Ick Sun Eum , Ja Kyung Koo , Dong Hwa Shin

Let $F_{q}$ be a finite field of cardinality $q$. A polynomial over finite field $F_{q}$ of the form $\sum_{i,j}a_{ij}x^{p^{i}+p^{j}}$ is called a Dembowski-Ostrom (DO) polynomial. The Dembowski-Ostrom conjecture says that a planar…

Number Theory · Mathematics 2021-04-07 Rajesh P. Singh

We investigate degree bounds for fields of rational invariants of representations of finite groups. We prove many cases of a bound for $\mathbb{Z}/p\mathbb{Z}$ conjectured by Blum-Smith, Garcia, Hidalgo, and Rodriguez. For arbitrary groups,…

Commutative Algebra · Mathematics 2026-04-22 Ben Blum-Smith , Sylvan Crane , Karla Guzman , Alexis Menenses , Maxine Song-Hurewitz

Fix a nonzero level $\mathfrak{n} \in \mathbb{F}_q[T]$. In this paper, we first establish a function field analogue of Ligozat's theorem, which serves as our main result and provides a criterion for Drinfeld modular units on the Drinfeld…

Number Theory · Mathematics 2026-02-23 Sheng-Yang Kevin Ho

We define Jones's planar algebra as a map of multicategories and constuct a planar algebra starting from a 1-cell in a pivotal strict 2-category. We prove finiteness results for the affine representations of finite depth planar algebras. We…

Quantum Algebra · Mathematics 2010-04-07 Shamindra Kumar Ghosh

In these short notes, we will show the following. Let F_q be a finite field and let E/\F_q be an elliptic curve. Let S_r be the rth summation/Semaev polynomial for E. Under an assumption, we show that it is NP-complete to check if S_r…

Number Theory · Mathematics 2015-06-09 Michiel Kosters , Sze Ling Yeo

Submodular and fractionally subadditive (or equivalently XOS) functions play a fundamental role in combinatorial optimization, algorithmic game theory and machine learning. Motivated by learnability of these classes of functions from random…

Data Structures and Algorithms · Computer Science 2015-08-04 Vitaly Feldman , Jan Vondrak

Product structure theorems are a collection of recent results that have been used to resolve a number of longstanding open problems on planar graphs and related graph classes. One particularly useful version states that every planar graph…

Combinatorics · Mathematics 2024-06-17 Vida Dujmović , Gwenaël Joret , Piotr Micek , Pat Morin , David R. Wood