中文
相关论文

相关论文: A New Hyperbola based Approach to factoring Intege…

200 篇论文

While solving a special case of a question of Erd\H{o}s and Graham Steinerberger asks for all integers $n$ with $\phi(n)=\frac{2}{3} \cdot (n+1)$. He discovered the solutions $n\in\{5, 5 \cdot 7, 5\cdot 7\cdot 37, 5\cdot 7\cdot 37\cdot…

数论 · 数学 2025-04-29 Christian Hercher

A finite point set in $\mathbb{R}^d$ is in general position if no $d + 1$ points lie on a common hyperplane. Let $\alpha_d(N)$ be the largest integer such that any set of $N$ points in $\mathbb{R}^d$, with no $d + 2$ members on a common…

组合数学 · 数学 2026-01-14 Andrew Suk , Ji Zeng

Let $F$ be a family of pseudo-disks in the plane, and $P$ be a finite subset of $F$. Consider the hypergraph $H(P,F)$ whose vertices are the pseudo-disks in $P$ and the edges are all subsets of $P$ of the form $\{D \in P \mid D \cap S \neq…

计算几何 · 计算机科学 2018-02-27 Boris Aronov , Anirudh Donakonda , Esther Ezra , Rom Pinchasi

For any positive integers $n\geq 3, r\geq 1$ we present formulae for the number of irreducible polynomials of degree $n$ over the finite field $\mathbb{F}_{2^r}$ where the coefficients of $x^{n-1}$, $x^{n-2}$ and $x^{n-3}$ are zero. Our…

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

数论 · 数学 2026-05-19 Jitender Singh

By making use of our generalization of Barrucand and Cohn's theory of principal factorizations in pure cubic fields $\mathbb{Q}(\sqrt[3]{D})$ and their Galois closures $\mathbb{Q}(\zeta_3,\sqrt[3]{D})$ with 3 possible types to pure quintic…

数论 · 数学 2018-12-09 Daniel C. Mayer

We study the Generalized Fermat Equation $x^2 + y^3 = z^p$, to be solved in coprime integers, where $p \ge 7$ is prime. Using modularity and level lowering techniques, the problem can be reduced to the determination of the sets of rational…

数论 · 数学 2019-06-17 Nuno Freitas , Bartosz Naskrecki , Michael Stoll

We provide a quasilinear time algorithm for the $p$-center problem with an additive error less than or equal to 3 times the input graph's hyperbolic constant. Specifically, for the graph $G=(V,E)$ with $n$ vertices, $m$ edges and hyperbolic…

数据结构与算法 · 计算机科学 2016-05-03 Katherine Edwards , W. Sean Kennedy , Iraj Saniee

For $p,q\ge2$ the $\{p,q\}$-tiling graph is the (finite or infinite) planar graph $T_{p,q}$ where all faces are cycles of length $p$ and all vertices have degree $q$. We give algorithms for the problem of recognizing (induced) subgraphs of…

计算几何 · 计算机科学 2026-03-09 Eliel Ingervo , Sándor Kisfaludi-Bak

The problems of square root from group element existing in $SL_2(F_p)$, $PSL_2(F_p)$ and $GL_2(F_p)$ were solved. The similar goal of root finding was reached in the GM algorithm adjoining an $n$-th root of a generator results in a discrete…

群论 · 数学 2022-12-06 Skuratovskii Ruslan

We introduce a new method for showing that the roots of the characteristic polynomial of certain finite lattices are all nonnegative integers. This method is based on the notion of a quotient of a poset which will be developed to explain…

组合数学 · 数学 2015-06-25 Joshua Hallam , Bruce E. Sagan

Let $S(n)$ denote the least primary factor in the primary decomposition of the multiplicative group $M_n = (\Bbb Z/n\Bbb Z)^\times$. We give an asymptotic formula, with order of magnitude $x/(\log x)^{1/2}$, for the counting function of…

数论 · 数学 2024-03-06 Greg Martin , Chau Nguyen

If $N \subset P,Q \subset M$ are type II_1 factors with $N' \cap M = C id$ and $[M:N]$ finite we show that restrictions on the standard invariants of the elementary inclusions $N \subset P$, $N \subset Q$, $P \subset M$ and $Q \subset M$…

算子代数 · 数学 2007-05-23 Pinhas Grossman , Vaughan F. R. Jones

Finding roots of equations is at the heart of most computational science. A well-known and widely used iterative algorithm is the Newton's method. However, its convergence depends heavily on the initial guess, with poor choices often…

数值分析 · 数学 2020-04-09 Ankush Aggarwal , Sanjay Pant

We present a quite efficient method to calculate the roots of Bernstein-Sato polynomial for a defining polynomial $f$ of a projective hypersurface $Z\subset{\mathbb P}^{n-1}$ of degree $d$ having only weighted homogeneous isolated…

代数几何 · 数学 2025-11-21 Morihiko Saito

Let $\mathcal{A}$ be the group algebra $\mathbf{k}[S_n]$ of the $n$-th symmetric group $S_n$ over a commutative ring $\mathbf{k}$. For any two subsets $A$ and $B$ of $[n]$, we define the elements \[ \nabla_{B,A}:=\sum_{\substack{w\in…

组合数学 · 数学 2025-07-31 Darij Grinberg

Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, it is proved that for every sufficiently large even integer $N$, the equation \begin{equation*}…

数论 · 数学 2018-01-03 Jinjiang Li , Min Zhang

We show that the homotopy groups of a Moore space $P^n(p^r)$, where $p^r \neq 2$, are $\mathbb{Z}/p^s$-hyperbolic for $s \leq r$. Combined with work of Huang-Wu, Neisendorfer, and Theriault, this completely resolves the question of when…

代数拓扑 · 数学 2021-07-28 Guy Boyde

The question whether there exists an integral solution to the system of linear equations with non-negative constraints, $A\x = \b, \, \x \ge 0$, where $A \in \Z^{m\times n}$ and ${\mathbf b} \in \Z^m$, finds its applications in many areas,…

组合数学 · 数学 2019-03-01 Florian Kohl , Yanxi Li , Johannes Rauh , Ruriko Yoshida

It appears that, along with many of my friends and colleagues, I had been brainwashed by the great and tragic lives of Abel and Galois to believe that no general formulas are possible for roots of equations higher than quartic. This seemed…

经典分析与常微分方程 · 数学 2016-09-06 M. Lawrence Glasser