中文
相关论文

相关论文: Finding Almost Squares II

200 篇论文

In this note we formulate some questions in the study of approximations of reals by rationals of the form a/b^2 arising in theory of Shr"odinger equations. We hope to attract attention of specialists to this natural subject of number…

数论 · 数学 2007-05-23 Oleg Karpenkov

In this paper, we obtain a lower bound for the number of primes $p\leq x$ such that $p-1$ is a sum of two squares and $p+2$ has a bounded number of prime factors. The proof uses the vector sieve framework, involving a semi-linear sieve and…

数论 · 数学 2025-02-28 Kunjakanan Nath , Likun Xie

We investigate integer numbers which possess at the same time the properties to be triangulars and squares, that are, numbers $a$ for which do exist integers $m$ and $n$ such that $ a = n^2 = \frac{m \cdot (m+1)}{2} $. In particular, we are…

数论 · 数学 2017-03-21 Fabio Roman

In this paper, we will first summarize known results concerning continued fractions. Then we will limit our consideration to continued fractions of quadratic numbers. The second author described periods and sometimes precise form of…

组合数学 · 数学 2023-08-17 Lubomíra Balková , Aranka Hrušková

The aim of this paper is to present the main constructions of the substructures of an almost groupoid and to discuss their basic properties. The definitions and properties concerning these new algebraic constructions extend to almost…

群论 · 数学 2026-02-06 Mihai Ivan

Rational approximations to a square root $\sqrt{k}$ can be produced by iterating the transformation $f(x) = (dx+k)/(x+d)$ starting from $\infty$ for any positive integer $d$. We show that these approximations coincide infinitely often with…

数论 · 数学 2022-09-22 Evan O'Dorney

We establish formulas for the constant factor in several asymptotic estimates related to the distribution of integer and polynomial divisors. The formulas are then used to approximate these factors numerically.

数论 · 数学 2018-09-19 Andreas Weingartner

We consider the problem of simultaneous approximation to a number and to its square in a general framework that encompasses imaginary quadratic number fields and fields of rational functions in one variable. In this context, we construct…

数论 · 数学 2022-02-02 Samuel Pilon , Damien Roy

This article shows that on a closed interval $[a,b]$ a continuous function may be approximated to an arbitrary degree of accuracy using scattered translates of the general multiquadric $(x^2+c^2)^{k-1/2}$.

泛函分析 · 数学 2013-06-28 Jeff Ledford

We consider so-called squaring the square-puzzles where a given square (or rectangle) should be dissected into smaller squares. For a specific instance of such problems we demonstrate that a mathematically rigorous solution can be quite…

最优化与控制 · 数学 2014-01-27 Sascha Kurz

A (positive definite integral) quadratic form is called almost 2-universal if it represents all (positive definite integral) binary quadratic forms except those in only finitely many equivalence classes. Oh [7] determined all almost…

数论 · 数学 2019-01-25 Myeong Jae Kim

An abelian square is the concatenation of two words that are anagrams of one another. A word of length $n$ can contain $\Theta(n^2)$ distinct factors that are abelian squares. We study infinite words such that the number of abelian square…

离散数学 · 计算机科学 2015-06-12 Gabriele Fici , Filippo Mignosi

In this paper we propose a new approach to least squares approximation problems. This approach is based on partitioning and Schur function. The nature of this approach is combinatorial, while most existing approaches are based on algebra…

数值分析 · 数学 2018-05-31 Nadezda Sukhorukova , Julien Ugon

A traditional "Farmer Ted" calculus problem is to minimize the perimeter of a rectangular chicken coop given the area N, so that as little as possible will be spent on the fencing. But what if N is an integer, and we are only allowed to…

数论 · 数学 2009-09-25 Greg Martin

This paper is concerned with the problem of finding two sets of integers, $\{a_1, a_2, \ldots$, $a_m\}$ and $\{b_1, b_2, \ldots, b_n\}$, such that all the $mn$ sums $a_i+b_j, i=1, \ldots, m, j=1, \ldots, n$, are perfect squares. A method is…

数论 · 数学 2025-08-12 Ajai Choudhry

We give a geometric approach to integer factorization. This approach is based on special approximations of segments of the curve that is represented by $y=n/x$, where $n$ is the integer whose factorization we need.

数论 · 数学 2018-02-13 Dmitry I. Khomovsky

We show how to compute the edit distance between two strings of length n up to a factor of 2^{\~O(sqrt(log n))} in n^(1+o(1)) time. This is the first sub-polynomial approximation algorithm for this problem that runs in near-linear time,…

数据结构与算法 · 计算机科学 2011-09-27 Alexandr Andoni , Krzysztof Onak

In this paper, we study the variance of the number of squarefull numbers in short intervals. As a result, we are able to prove that, for any $0 < \theta < 1/2$, almost all short intervals $(x, x + x^{1/2 + \theta}]$ contain about…

数论 · 数学 2023-09-21 Tsz Ho Chan

In this paper we propose a variant of the linear least squares model allowing practitioners to partition the input features into groups of variables that they require to contribute similarly to the final result. The output allows…

机器学习 · 计算机科学 2024-07-17 Roberto Esposito , Mattia Cerrato , Marco Locatelli

We study a general class of multiplicative functions by relating "short averages" to its "long average". More precisely, we estimate asymptotically the variance of such a class of functions in short intervals using Fourier analysis and…

数论 · 数学 2022-08-30 Pranendu Darbar , Mithun Kumar Das