scholarly journals On factorizations into coprime parts

2021 ◽  
pp. 1-26
Author(s):  
Matthew Just ◽  
Noah Lebowitz-Lockard
Keyword(s):  
Additional Restriction ◽  
Asymptotic Bounds ◽  
Negative Formula

Let [Formula: see text] and [Formula: see text] be the number of unordered and ordered factorizations of [Formula: see text] into integers larger than one. Let [Formula: see text] and [Formula: see text] have the additional restriction that the factors are coprime. We establish asymptotic bounds for the sums of [Formula: see text] and [Formula: see text] up to [Formula: see text] for all real [Formula: see text] and the asymptotic bounds for [Formula: see text] and [Formula: see text] for all negative [Formula: see text].

scholarly journals Residual dimension of nilpotent groups

2020 ◽  
Vol 23 (5) ◽  
pp. 801-829
Author(s):  
Mark Pengitore
Keyword(s):  
New York ◽  
Nilpotent Group ◽  
Nilpotent Groups ◽  
Finitely Generated ◽  
Nontrivial Element ◽  
Maximum Order ◽  
Asymptotic Bounds ◽  
Group Morphism ◽  
A Finite Group

AbstractThe function {\mathrm{F}_{G}(n)} gives the maximum order of a finite group needed to distinguish a nontrivial element of G from the identity with a surjective group morphism as one varies over nontrivial elements of word length at most n. In previous work [M. Pengitore, Effective separability of finitely generated nilpotent groups, New York J. Math. 24 2018, 83–145], the author claimed a characterization for {\mathrm{F}_{N}(n)} when N is a finitely generated nilpotent group. However, a counterexample to the above claim was communicated to the author, and consequently, the statement of the asymptotic characterization of {\mathrm{F}_{N}(n)} is incorrect. In this article, we introduce new tools to provide lower asymptotic bounds for {\mathrm{F}_{N}(n)} when N is a finitely generated nilpotent group. Moreover, we introduce a class of finitely generated nilpotent groups for which the upper bound of the above article can be improved. Finally, we construct a class of finitely generated nilpotent groups N for which the asymptotic behavior of {\mathrm{F}_{N}(n)} can be fully characterized.

scholarly journals Entropy of systolically extremal surfaces and asymptotic bounds

2005 ◽  
Vol 25 (4) ◽  
pp. 1209-1220 ◽  
Author(s):  
MIKHAIL G. KATZ ◽  
STÉPHANE SABOURAU
Keyword(s):  
Asymptotic Bounds

Asymptotic bounds on overall moduli of cracked bodies

2000 ◽  
Vol 37 (43) ◽  
pp. 6221-6237 ◽  
Author(s):  
J. Wang ◽  
J. Fang ◽  
B.L. Karihaloo
Keyword(s):  
Asymptotic Bounds

scholarly journals Bounds and algorithms for the -Bessel function of imaginary order

2013 ◽  
Vol 16 ◽  
pp. 78-108 ◽  
Author(s):  
Andrew R. Booker ◽  
Andreas Strömbergsson ◽  
Holger Then
Keyword(s):  
Bessel Function ◽  
Convergent Series ◽  
Steepest Descent ◽  
Modified Bessel Function ◽  
Software Library ◽  
Asymptotic Bounds ◽  
Mixed Derivatives ◽  
Rigorous Computation ◽  
Working Out ◽  
Precise Asymptotic

AbstractUsing the paths of steepest descent, we prove precise bounds with numerical implied constants for the modified Bessel function${K}_{ir} (x)$of imaginary order and its first two derivatives with respect to the order. We also prove precise asymptotic bounds on more general (mixed) derivatives without working out numerical implied constants. Moreover, we present an absolutely and rapidly convergent series for the computation of${K}_{ir} (x)$and its derivatives, as well as a formula based on Fourier interpolation for computing with many values of$r$. Finally, we have implemented a subset of these features in a software library for fast and rigorous computation of${K}_{ir} (x)$.

Nonrecursive tilings of the plane. I

1974 ◽  
Vol 39 (2) ◽  
pp. 283-285 ◽  
Author(s):  
William Hanf
Keyword(s):  
Turing Machine ◽  
Recursive Function ◽  
Positive Answer ◽  
Additional Restriction ◽  
Detailed History ◽  
Finite Set

A finite set of tiles (unit squares with colored edges) is said to tile the plane if there exists an arrangement of translated (but not rotated or reflected) copies of the squares which fill the plane in such a way that abutting edges of the squares have the same color. The problem of whether there exists a finite set of tiles which can be used to tile the plane but not in any periodic fashion was proposed by Hao Wang [9] and solved by Robert Berger [1]. Raphael Robinson [7] gives a more detailed history and a very economical solution to this and related problems; we will assume that the reader is familiar with §4 of [7]. In 1971, Dale Myers asked whether there exists a finite set of tiles which can tile the plane but not in any recursive fashion. If we make an additional restriction (called the origin constraint) that a given tile must be used at least once, then the positive answer is given by the main theorem of this paper. Using the Turing machine constructed here and a more complicated version of Berger and Robinson's construction, Myers [5] has recently solved the problem without the origin constraint.Given a finite set of tiles T1, …, Tn, we can describe a tiling of the plane by a function f of two variables ranging over the integers. f(i, j) = k specifies that the tile Tk is to be placed at the position in the plane with coordinates (i, j). The tiling will be said to be recursive if f is a recursive function.

Sign in / Sign up

Export Citation Format

Share Document