中文
相关论文

相关论文: Shortest Distance in Modular Cubic Polynomials

200 篇论文

In this paper we give the bifurcation diagram of the family of cubic vector fields $\dot z=z^3+ \epsilon_1z+\epsilon_0$ for $z\in \mathbb{C}\mathbb{P}^1$, depending on the values of $\epsilon_1,\epsilon_0\in\mathbb{C}$. The bifurcation…

动力系统 · 数学 2015-06-24 Christiane Rousseau

We construct new examples of cubic polynomials with a parabolic fixed point that cannot be approximated by Misiurewicz polynomials. In particular, such parameters admit maximal bifurcations, but do not belong to the support of the…

动力系统 · 数学 2020-09-18 Hiroyuki Inou , Sabyasachi Mukherjee

We consider properties of the box polynomials, a one variable polynomial defined over all integer partitions $\lambda$ whose Young diagrams fit in an $m$ by $n$ box. We show that these polynomials can be expressed by the finite difference…

组合数学 · 数学 2017-09-01 Richard Ehrenborg , Alex Happ , Dustin Hedmark , Cyrus Hettle

We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…

数论 · 数学 2023-01-10 Arnaud Bodin , Pierre Dèbes , Salah Najib

Let $s(n)$ be the side length of the smallest square into which $n$ non-overlapping unit squares can be packed. In 2010, the author showed that $s(13)=4$ and $s(46)=7$. Together with the result $s(6)=3$ by Keaney and Shiu, these results…

组合数学 · 数学 2016-06-14 Wolfram Bentz

We discuss two conjectures. (I) For each x_1,...,x_n \in R (C) there exist y_1,...,y_n \in R (C) such that \forall i \in {1,...,n} |y_i| \leq 2^{2^{n-2}} \forall i \in {1,...,n} (x_i=1 \Rightarrow y_i=1) \forall i,j,k \in {1,...,n}…

交换代数 · 数学 2010-03-30 Apoloniusz Tyszka

This paper considers the minimization problem of relaxed submodular functions. For a positive integer $k$, a set function is called $k$-distant submodular if the submodular inequality holds for every pair whose symmetric difference is at…

组合数学 · 数学 2025-02-06 Ryuhei Mizutani

The classic example of a low-discrepancy sequence in $\mathbb{Z}_p$ is $(x_n) = an+b$ with $a \in \mathbb{Z}_p^x$ and $b \in \mathbb{Z}_p$. Here we address the non-linear case and show that a polynomial $f$ generates a low-discrepancy…

数论 · 数学 2024-06-14 Christian Weiß

Let $p_2(n)$ denote the number of cubic partitions. In this paper, we shall present two new congruences modulo $11$ for $p_2(n)$. We also provide an elementary alternative proof of a congruence established by Chan. Furthermore, we will…

数论 · 数学 2017-02-14 Shane Chern , Manosij Ghosh Dastidar

It is verified that the number of vertices in a $d$-dimensional cubical pseudomanifold is at least $2^{d+1}$. Using Adin's cubical $h$-vector, the generalized lower bound conjecture is established for all cubical 4-spheres, as well as for…

组合数学 · 数学 2011-04-05 Steven Klee

We study the Mahler measures of the polynomial family $Q_k(x,y) = x^3+y^3+1-kxy$ using the method previously developed by the authors. An algorithm is implemented to search for CM points with class numbers $\leqslant 3$, we employ these…

数论 · 数学 2024-03-12 Zhengyu Tao , Xuejun Guo

It's well known that the quadratic residue code over finite fields is an interesting class of cyclic codes for its higher minimum distance. Let $g$ be a positive integer and $p,p_{1},\ldots, p_{g}$ be distinct odd primes, the present paper…

数论 · 数学 2020-01-08 Qunying Liao , Yuanbo Liu

In this paper we study the problem of maximizing the distance to a given point over an intersection of balls. It was already known that this problem can be solved in polynomial time and space if the given point is not in the convex hull of…

最优化与控制 · 数学 2023-10-09 Marius Costandin , Beniamin Costandin

Families of boxes in $\mathbb R^d$ are considered. In the paper an upper bound on the size of a minimum transversal in terms of the space dimension and the independence number of the given family was improved.

组合数学 · 数学 2008-10-21 Arseny Akopyan

Given a lower envelope in the form of an arbitrary sequence $u$, let $LSP(u, d)$ denote the maximum length of any subsequence of $u$ that can be realized as the lower envelope of a set of polynomials of degree at most $d$. Let $sp(m, d)$…

组合数学 · 数学 2016-06-07 Jesse Geneson

We propose a mathematical walk around the gcd of the values $A(n)$ and $B(n)$ of two polynomials evaluated at an integer $n$. This is an opportunity to use a very powerful tool: the resultant.

数论 · 数学 2024-09-04 Arnaud Bodin , Christian Drouin

In the present paper we obtain new upper bound estimates for the number of solutions of the congruence $$ x\equiv y r\pmod p;\quad x,y\in \mathbb{N},\quad x,y\le H,\quad r\in\cU, $$ for certain ranges of $H$ and $|\cU|$, where $\cU$ is a…

数论 · 数学 2016-04-06 J. Cilleruelo , M. Z. Garaev

We construct two infinite families of algebraic minimal cones in $R^{n}$. The first family consists of minimal cubics given explicitly in terms of the Clifford systems. We show that the classes of congruent minimal cubics are in one to one…

微分几何 · 数学 2010-10-12 Vladimir G. Tkachev

It is proved that each of compact linear groups of one special type admits a polynomial factorization map onto a real vector space. More exactly, the group is supposed to be non-commutative one-dimensional and to have two connected…

代数几何 · 数学 2014-11-24 O. G. Styrt

Let $\mathcal{O}_K$ be the ring of integers of an algebraic number field $K$ embedded into $\mathbb{C}$. Let $X$ be a subset of the Euclidean space $\mathbb{R}^d$, and $D(X)$ be the set of the squared distances of two distinct points in…

度量几何 · 数学 2023-05-09 Hiroshi Nozaki
‹ 上一页 1 8 9 10 下一页 ›