中文
相关论文

相关论文: Shortest Distance in Modular Cubic Polynomials

200 篇论文

The `full' edge isoperimetric inequality for the discrete cube (due to Harper, Bernstein, Lindsay and Hart) specifies the minimum size of the edge boundary $\partial A$ of a set $A \subset \{0,1\}^n$, as a function of $|A|$. A weaker (but…

组合数学 · 数学 2018-03-05 David Ellis , Nathan Keller , Noam Lifshitz

A polynomial of the form $x^\alpha - p(x)$, where the degree of $p$ is less than the total degree of $x^\alpha$, is said to be least deviation from zero if it has the smallest uniform norm among all such polynomials. We study polynomials of…

经典分析与常微分方程 · 数学 2007-05-23 Yuan Xu

Let $x,h$ and $Q$ be three parameters. We show that, for most moduli $q\le Q$ and for most positive real numbers $y\le x$, every reduced arithmetic progression $a\mod q$ has approximately the expected number of primes $p$ from the interval…

数论 · 数学 2017-06-12 Dimitris Koukoulopoulos

In the moduli space of complex cubic polynomials with a marked critical point, given any p>=1, we prove that the loci formed by polynomials with the marked critical point periodic of period p is an irreducible curve. Thus answering a…

动力系统 · 数学 2021-03-09 Matthieu Arfeux , Jan Kiwi

Let K be a real algebraic number field and let P be the set of Pisot numbers generating K. We show that the elements of P-P are the algebraic integers of K whose images under the action of all embeddings of K into C, other than the identity…

数论 · 数学 2025-03-28 M. J. Bertin , T. Zaïmi

Let K be an algebraically closed field of characteristic zero. Given a polynomial f(x,y) in K[x,y] with one place at infinity, we prove that either f is equivalent to a coordinate, or the family (f+c) has at most two rational elements. When…

代数几何 · 数学 2013-10-22 Abdallah Assi

A point $p$ is said to be an area center of a polygon if all of the triangles composed of $p$ and its edges have one and the same area. We construct a moduli space $AC_n$ of such $n$-gons and study its geometry and arithmetic. For every…

代数几何 · 数学 2013-10-03 Fumio Hazama

In this paper we evaluate Chebyshev polynomials of the second-kind on a class of symmetric integer matrices, namely on adjacency matrices of simply laced Dynkin and extended Dynkin diagrams. As an application of these results we explicitly…

表示论 · 数学 2010-10-20 Karin Erdmann , Sibylle Schroll

The calculation of Euclidean distance between points is generalized to one-dimensional objects such as strings or polymers. Necessary and sufficient conditions for the minimal transformation between two polymer configurations are derived.…

软凝聚态物质 · 物理学 2009-11-13 Ali R. Mohazab , Steven S. Plotkin

We study the minimum number of distinct distances between point sets on two curves in $R^3$. Assume that one curve contains $m$ points and the other $n$ points. Our main results: (a) When the curves are conic sections, we characterize all…

组合数学 · 数学 2023-03-21 Toby Aldape , Jingyi Liu , Gregory Pylypovych , Adam Sheffer , Minh-Quan Vo

We give a complete description of all solutions to the equation $f_1^3 + f_2^3 = f_3^3 + f_4^3$ for quadratic forms $f_j \in \mathbb C[x,y]$ and show how Ramanujan's example can be extended to three equal sums of pairs of cubes. We also…

数论 · 数学 2020-02-04 Bruce Reznick

This paper presents a counterexample for the approximation algorithm proposed by Durocher and Mehrabi [1] for the general problem of finding a rectangular partition of a rectilinear polygon with minimum stabbing number.

计算几何 · 计算机科学 2015-06-15 Breno Piva , Cid C. de Souza

The $p$-widths are a nonlinear analogue of the spectrum of the Laplacian. We prove that each $p$-width of a polygon in $\mathbb{R}^2$ is achieved by a union of billiard trajectories. We also compute the $p$-widths of the equilateral…

微分几何 · 数学 2025-05-07 Otis Chodosh , Sithipont Cholsaipant

We show that a square-tiling of a $p\times q$ rectangle, where $p$ and $q$ are relatively prime integers, has at least $\log_2p$ squares. If $q>p$ we construct a square-tiling with less than $q/p+C\log p$ squares of integer size, for some…

组合数学 · 数学 2016-09-06 Richard Kenyon

Consider the optimization problem $p_{\min, Q} := \min_{\mathbf{x} \in Q} p(\mathbf{x})$, where $p$ is a degree $m$ multivariate polynomial and $Q := [0, 1]^n$ is the hypercube. We provide explicit degree and error bounds for the sums of…

最优化与控制 · 数学 2014-04-25 Victor Magron

A new polynomial sieve is presented and used to show that almost all integers have at most one representation as a sum of two values of a given polynomial of degree at least 3.

数论 · 数学 2013-07-01 T. D. Browning

The isolation intervals of the real roots of the real symbolic monic cubic polynomial $p(x) = x^3 + a x^2 + b x + c\,\,$ are found in terms of simple functions of the coefficients of the polynomial (such as: $-a$, $-a/3$, $-c/b$, $\pm…

综合数学 · 数学 2022-06-15 Emil M. Prodanov

The positive semidefinite (psd) rank of a polytope is the smallest $k$ for which the cone of $k \times k$ real symmetric psd matrices admits an affine slice that projects onto the polytope. In this paper we show that the psd rank of a…

最优化与控制 · 数学 2013-08-01 João Gouveia , Richard Z. Robinson , Rekha R. Thomas

Our main result is that any real cubic algebraic number has a continued fraction expansion with polynomial coefficients. Some generalizations are mentioned.

数论 · 数学 2025-02-28 Henri Cohen

We use character sum estimates to give a bound on the least square-full primitive root modulo a prime. Specifically, we show that there is a square-full primitive root mod $p$ less than $p^{2/3 + 3/(4 \sqrt{e})+ \epsilon}$, and we give some…

数论 · 数学 2017-03-16 Marc Munsch , Tim Trudgian