English
Related papers

Related papers: Three-term Machin-type formulae

200 papers

A thorough analysis is made of the Fourier coefficients for vector-valued modular forms associated to three-dimensional irreducible representations of the modular group. In particular, the following statement is verified for all but a…

Number Theory · Mathematics 2015-04-01 Christopher Marks

For every number field $\mathbb{K}$, with $[\mathbb{K}:\mathbb{Q}] \geq 3$, we show that the number of non-associates of the same norm in a full module in $\mathbb{K}$ does not depend only on $\mathbb{K}$, but can also depend on the module…

Number Theory · Mathematics 2014-04-24 Paul Voutier

We disprove a conjecture by Ye and Lim, by showing that there are $3 \times 3$ complex matrices which can't be expressed as the product of two Toeplitz matrices of the same size. We also improve previous estimates by Ye and Lim on the…

Commutative Algebra · Mathematics 2025-06-23 Ignacio García-Marco , Irene Márquez-Corbella , Daniel Seco

We give a criterion for the existence of a non-degenerate quasihomogeneous polynomial in a configuration, i.e. in the space of polynomials with a fixed set of weights, and clarify the relation of this criterion to the necessary condition…

High Energy Physics - Theory · Physics 2015-06-26 Maximilian Kreuzer , Harald Skarke

We study a) the limit of the ratio of two consecutive terms in such a sequence and b) the limit of the ratio of two terms in which one has a lag equal to 2. In the general case limit a) does not exist but we have two limiting values…

Combinatorics · Mathematics 2007-05-23 Mario Catalani

In order to verify programs or hybrid systems, one often needs to prove that certain formulas are unsatisfiable. In this paper, we consider conjunctions of polynomial inequalities over the reals. Classical algorithms for deciding these not…

Numerical Analysis · Mathematics 2009-02-02 David Monniaux

In this paper, we show that for a fixed rank $n$, there are only finitely many $m$ for which there is a regular $m$-gonal form of rank $n$ and determine every type of the (generalized) regular $m$-gonal form for every sufficiently large…

Number Theory · Mathematics 2020-11-06 Byeong Moon Kim , Dayoon Park

On the one hand, it is well known that the only subquadratic Dehn function of finitely presented groups is the linear one. On the other hand there is a huge class of Dehn functions $d(n)$ with growth at least $n^4$ (essentially all possible…

Group Theory · Mathematics 2018-11-22 A. Yu Olshanskii

Let d be any number greather than or equal to 3. We show that the intersection of the set mdeg(Aut(C^3))\ mdeg(Tame(C3)) with {(d_1,d_2,d_3) : d=d_1 =< d_2 =< d_3} has infinitely many elements, where mdeg h = (deg h_1,...,deg h_n) denotes…

Algebraic Geometry · Mathematics 2012-09-25 Marek Karaś , Jakub Zygadło

Three formal first-order finite dialectical schemes are investigated. It is shown that schemes 1 and 2 have significantly different finite models. Further, an infinite natural number model for schemes 1, 2, 3 is constructed, and it is shown…

General Mathematics · Mathematics 2008-10-26 Robert A. Herrmann

Using a novel rewriting problem, we show that several natural decision problems about finite automata are undecidable (i.e., recursively unsolvable). In contrast, we also prove three related problems are decidable. We apply one result to…

Formal Languages and Automata Theory · Computer Science 2017-03-01 Jörg Endrullis , Jeffrey Shallit , Tim Smith

In the previous series "Special functions and three term recurrence formula (3TRF)", I generalize the three term recurrence relation in the linear differential equation for the infinite series and polynomial which makes B_n term terminated…

Classical Analysis and ODEs · Mathematics 2014-11-05 Yoon Seok Choun

We prove that a nonsymmetric normal entry pattern of order $n$ ($n\ge 3$) has at most $n(n-3)/2+3$ distinct indeterminates and up to permutation similarity this number is attained by a unique pattern which is explicitly described.

Combinatorics · Mathematics 2015-06-12 Zejun Huang , Xingzhi Zhan

Binet formulae for three versions of third-order Pell polynomials are derived.

Number Theory · Mathematics 2020-12-03 Helmut Prodinger

We prove three theorems on finite real multiple zeta values: the symmetric formula, the sum formula and the height-one duality theorem. These are analogues of their counterparts on finite multiple zeta values.

Number Theory · Mathematics 2016-01-05 Hideki Murahara

We show that there exist an upper bound and a lower bound for the number of non-degenerate central configurations of the n-body problem in the plane with a homogeneous potential. In particular, both bounds are independent of the homogeneous…

Dynamical Systems · Mathematics 2025-02-28 Julius Natrup , Qun Wang , Yuchen Wang

Let $n \geq 2$ be an integer and let $K$ be a number field with ring of integers $\mathcal{O}_K$. We prove that the set of ternary $n$-ic forms with coefficients in $\mathcal{O}_K$ and fixed nonzero discriminant, breaks up into finitely…

Number Theory · Mathematics 2025-08-28 Fatemehzahra Janbazi , Arul Shankar

In this paper, we study the solution structures of Serrin-type overdetermined problems with Kirchhoff-type nonlocal terms. We prove that the exact number of solutions is the same as those of some transcendental equations defined by the…

Analysis of PDEs · Mathematics 2025-12-18 Kazuki Sato , Futoshi Takahashi

Singular limits of a class of evolutionary systems of partial differential equations having two small parameters and hence three time scales are considered. Under appropriate conditions solutions are shown to exist and remain uniformly…

Analysis of PDEs · Mathematics 2019-03-15 Bin Cheng , Qiangchang Ju , Steve Schochet

Model checking properties are often described by means of finite automata. Any particular such automaton divides the set of infinite trees into finitely many classes, according to which state has an infinite run. Building the full type…

Logic in Computer Science · Computer Science 2015-07-01 Klaus Aehlig
‹ Prev 1 4 5 6 7 8 10 Next ›