English
Related papers

Related papers: Classifying (almost)-Belyi maps with Five Exceptio…

200 papers

To minimize or upper-bound the value of a function "robustly", we might instead minimize or upper-bound the "epsilon-robust regularization", defined as the map from a point to the maximum value of the function within an epsilon-radius. This…

Optimization and Control · Mathematics 2010-06-10 Adrian S. Lewis , C. H. Jeffrey Pang

This article consists in two independent parts. In the first one, we investigate the geometric properties of almost periodicity of model sets (or cut-and-project sets, defined under the weakest hypotheses); in particular we show that they…

Dynamical Systems · Mathematics 2015-12-03 Pierre-Antoine Guihéneuf

Let $n>m>k$ be positive integers and let $a,b,c$ be nonzero rational numbers. We consider the reducibility of some special quadrinomials $x^n+ax^m+bx^k+c$ with $n=4$ and 5, which related to the study of rational points on certain elliptic…

Number Theory · Mathematics 2016-05-24 Yong Zhang , Huilin Zhu

Recently Lima and Campello de Souza introduced a new class of rational functions over odd-order finite fields, and explained their potential usefulness in cryptography. We show that these new functions are conjugate to the classical family…

Cryptography and Security · Computer Science 2021-03-16 Zhiguo Ding , Michael E. Zieve

This paper has two parts. We first survey recent efforts on the Bloom conjecture which still remains open in the case of complex dimension at least 4. Bloom's conjecture concerns the equivalence of three regular types. There is a more…

Complex Variables · Mathematics 2023-09-19 Xiaojun Huang , Wanke Yin

Let $\mathbb K$ be a perfect field of characterstic $p\ge 0$ and let $R\in \mathbb K(x)$ be a rational function. This paper studies the number $\Delta_{\alpha, R}(n)$ of distinct solutions of $R^{(n)}(x)=\alpha$ over the algebraic closure…

Number Theory · Mathematics 2020-08-07 José Alves Oliveira , Daniela Oliveira , Lucas Reis

We consider two decision problems for linear recurrence sequences (LRS) over the integers, namely the Positivity Problem (are all terms of a given LRS positive?) and the Ultimate Positivity Problem} (are all but finitely many terms of a…

Discrete Mathematics · Computer Science 2013-10-11 Joel Ouaknine , James Worrell

We consider the structure of rational points on elliptic curves in Weierstrass form. Let x(P)=A_P/B_P^2 denote the $x$-coordinate of the rational point P then we consider when B_P can be a prime power. Using Faltings' Theorem we show that…

Number Theory · Mathematics 2007-05-23 Graham Everest , Jonathan Reynolds , Shaun Stevens

We consider a class of first-order partial differential operators, acting on the space of ultradifferentiable periodic functions, and we describe their range by using the following conditions on the coefficients of the operators: the…

Analysis of PDEs · Mathematics 2023-12-08 Rafael B. Gonzalez

Inspired by a recent work of Mesnager, we present several new infinite families of quadratic ternary bent, near-bent and 2-plateaued functions from some known quadratic ternary bent functions. Meanwhile, the distribution of the Walsh…

Information Theory · Computer Science 2015-08-17 Guangkui Xu , Xiwang Cao

Ideals of continuous functions which satisfy an off diagonality condition proved to be important connected with the solution of large classes of nonlinear PDEs, and more recently, in General Relativity and Quantum Gravity. Maximal ideals…

General Mathematics · Mathematics 2007-05-23 Elemer E Rosinger

We establish new exponential in dimension lower bounds for the Maximum Halfspace Discrepancy problem, which models linear classification. Both are fundamental problems in computational geometry and machine learning in their exact and…

Computational Geometry · Computer Science 2026-03-20 Alexander Munteanu , Simon Omlor , Jeff M. Phillips

The families of smooth rational surfaces in $\PP^4$ have been classified in degree $\le 10$. All known rational surfaces in $\PP^4$ can be represented as blow-ups of the plane $\PP^2$. The fine classification of these surfaces consists of…

alg-geom · Mathematics 2008-02-03 Fabrizio Catanese , Klaus Hulek

Our work proposes a unified approach to three different topics in a general Riemannian setting: splitting theorems, symmetry results and overdetermined elliptic problems. By the existence of a stable solution to the semilinear equation…

Analysis of PDEs · Mathematics 2012-10-23 Alberto Farina , Luciano Mari , Enrico Valdinoci

Let $F(x_1,...,x_n)$ be a form of degree $d\geq 2$, which produces a geometrically irreducible hypersurface in $\mathbb{P}^{n-1}$. This paper is concerned with the number of rational points on F=0 which have height at most $B$. Whenever…

Number Theory · Mathematics 2007-05-23 T. D. Browning , D. R. Heath-Brown

We derive a priori second order estimates for solutions of a class of fully nonlinear elliptic equations on Riemannian manifolds under some very general structure conditions. We treat both equations on closed manifolds, and the Dirichlet…

Analysis of PDEs · Mathematics 2015-01-14 Bo Guan

Building on work of Doyle and Hyde on polynomial maps in one variable, we produce for each odd integer $d \geq 2$ a H\'enon map of degree $d$ defined over $\mathbb{Q}$ with at least $(d-4)^2$ integral periodic points. This provides a…

Dynamical Systems · Mathematics 2025-07-09 Hyeonggeun Kim , Holly Krieger , Mara-Ioana Postolache , Vivian Szeto

Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…

Symbolic Computation · Computer Science 2026-01-14 Louis Gaillard

Discontinuity with respect to data perturbations is common in algebraic computation where solutions are often highly sensitive. Such problems can be modeled as solving systems of equations at given data parameters. By appending auxiliary…

Numerical Analysis · Mathematics 2021-02-17 Zhonggang Zeng

A computable structure $\mathcal{A}$ has degree of categoricity $\mathbf{d}$ if $\mathbf{d}$ is exactly the degree of difficulty of computing isomorphisms between isomorphic computable copies of $\mathcal{A}$. Fokina, Kalimullin, and Miller…

‹ Prev 1 8 9 10 Next ›