中文
相关论文

相关论文: New families satisfying the Dynamical Uniform Boun…

200 篇论文

In the complexity estimation for an attack that reduces a cryptosystem to solving a system of polynomial equations, the degree of regularity and an upper bound of the first fall degree are often used in cryptanalysis. While the degree of…

符号计算 · 计算机科学 2026-01-22 Shuhei Nakamura

Permutation polynomials over finite fields constitute an active research area and have applications in many areas of science and engineering. In this paper, four classes of monomial complete permutation polynomials and one class of…

信息论 · 计算机科学 2016-06-15 Jingxue Ma , Tao Zhang , Tao Feng , Gennian Ge

A key property of an algebraic variety is whether it is absolutely irreducible, meaning that it remains irreducible over the algebraic closure of its defining field, and determining absolute irreducibility is important in algebraic geometry…

代数几何 · 数学 2026-02-03 Carlos Agrinsoni , Heeralal Janwa , Moises Delgado

Let $U^N$ be a family of $N\times N$ independent Haar unitary random matrices and their adjoints, $Z^N$ a family of deterministic matrices, and $P$ a self-adjoint noncommutative polynomial, i.e. for any $N$, $P(U^N,Z^N)$ is self-adjoint,…

概率论 · 数学 2025-09-26 Félix Parraud

In this article, we study the global dynamics of Halley's method applied to complex polynomials. Specifically, we analyze the structure and connectivity of the Julia set of this method. The convergence behavior, symmetry properties, and…

动力系统 · 数学 2025-08-06 Gang Liu , Soumen Pal , Saminathan Ponnusamy

A real univariate polynomial of degree $n$ is called hyperbolic if all of its $n$ roots are on the real line. Such polynomials appear quite naturally in different applications, for example, in combinatorics and optimization. The focus of…

代数几何 · 数学 2023-03-09 Cordian Riener , Robin Schabert

The parametrization theorem is derived in a flat nD pseudo-complex affine space. The pseudo-complex hyperbolic space accomodates n-number of uncompactified time-like extra dimensions with sugnature (s,r), where s and r are the numbers of…

微分几何 · 数学 2010-03-02 Minh Q. Truong

Let $\mathcal{F}$ be a family of subsets of $[n]$ and $L$ be a subset of $[n]$. We say $\mathcal{F}$ is an $L$-differencing Sperner system if $|A\setminus B|\in L$ for any distinct $A,B\in\mathcal{F}$. Let $p$ be a prime and $q$ be a power…

组合数学 · 数学 2026-04-22 Zixiang Xu , Chi Hoi Yip

This paper presents a pseudo-spectral method for Dynamic Optimization Problems (DOPs) that allows for tight polynomial bounds to be achieved via flexible sub-intervals. The proposed method not only rigorously enforces inequality…

最优化与控制 · 数学 2026-04-08 Eduardo M. G. Vila , Eric C. Kerrigan , Paul Bruce

The structural characterization of high-dimensional mutually unbiased bases (MUBs) by classifying MUBs subsets remains a major open problem. The existing methods not only fail to conclude on the exact classification, but also are severely…

量子物理 · 物理学 2025-12-05 Jianxin Song , Zhen-Peng Xu , Changliang Ren

We formulate and prove a Jakobson-Benedicks-Carleson type theorem on the occurence of nonuniform hyperbolicity (stochastic dynamics) in families of one-dimensional maps, based on "computable starting conditions" and providing "explicit,…

动力系统 · 数学 2012-11-07 Stefano Luzzatto , Hiroki Takahasi

Let $p$ be a prime, let $1 \le t < d < p$ be integers, and let $S$ be a non-empty subset of $\mathbb{F}_p$. We establish that if a polynomial $P:\mathbb{F}_p^n \to \mathbb{F}_p$ with degree $d$ is such that the image $P(S^n)$ does not…

组合数学 · 数学 2026-02-25 Thomas Karam

We give a criterion for maps on ultrametric spaces to be surjective and to preserve spherical completeness. We show how Hensel's Lemma and the multi-dimensional Hensel's Lemma follow from our result. We give an easy proof that the latter…

交换代数 · 数学 2013-04-02 Franz-Viktor Kuhlmann

Optimizing and certifying the positivity of polynomials are fundamental primitives across mathematics and engineering applications, from dynamical systems to operations research. However, solving these problems in practice requires large…

机器学习 · 计算机科学 2023-12-05 Hannah Lawrence , Mitchell Tong Harris

Assuming the Generalised Riemann Hypothesis (GRH), we show that for all k, there exist polynomials with coefficients in $\MA$ having no arithmetic circuits of size O(n^k) over the complex field (allowing any complex constant). We also build…

计算复杂性 · 计算机科学 2013-04-23 Hervé Fournier , Sylvain Perifel , Rémi de Verclos

The nonvanishing problem asks if a coefficient of a polynomial is nonzero. Many families of polynomials in algebraic combinatorics admit combinatorial counting rules and simultaneously enjoy having saturated Newton polytopes (SNP). Thereby,…

组合数学 · 数学 2021-03-09 Anshul Adve , Colleen Robichaux , Alexander Yong

We present two infinite families of APN functions where the degree of the field is divisible by 3 but not 9. Our families contain two already known families as special cases. We also discuss the inequivalence proof (by computation) which…

信息论 · 计算机科学 2008-05-01 Carl Bracken , Eimear Byrne , Nadya Markin , Gary McGuire

Let $G$ denote the unramified quasi-split unitary group $\mathbb{U}(1,1)(F)$ over a $p$-adic field $F$ with residual characteristic $p \neq 2$. In this paper, we first construct a large family of irreducible representations of the maximal…

表示论 · 数学 2025-11-11 Ekta Tiwari

In this paper, we prove the existence of a first-order definition of the polynomial ring over a nonprincipal ultraproduct of finite fields of unbounded cardinalities in its fraction field by a universal-existential formula in the language…

数论 · 数学 2023-10-17 Dong Quan Ngoc Nguyen

We study additive double character sums over two subsets of a finite field. We show that if there is a suitable rational self-map of small degree of a set $D$, then this set contains a large subset $U$ for which the standard bound on the…

数论 · 数学 2020-11-30 Cathy Swaenepoel , Arne Winterhof