English
Related papers

Related papers: On a question of Schmidt and Summerer concerning $…

200 papers

We consider the construction of a polygon $P$ with $n$ vertices whose turning angles at the vertices are given by a sequence $A=(\alpha_0,\ldots, \alpha_{n-1})$, $\alpha_i\in (-\pi,\pi)$, for $i\in\{0,\ldots, n-1\}$. The problem of…

Computational Geometry · Computer Science 2020-11-03 Alon Efrat , Radoslav Fulek , Stephen Kobourov , Csaba D. Tóth

For most (and possibly all) non-associative finite simple Moufang loops, three generators of order 3 can be chosen so that each two of them generate a group isomorphic to $(3, 3 | 3, p)$. The subgroup structure of $(3, 3 | 3, p)$ depends on…

Group Theory · Mathematics 2007-05-23 Petr Vojtěchovský

By using computers to do experimental manipulations on Fourier series, we construct additional series with interesting properties. We construct several series whose sums remain unchanged when the $n^{th}$ term is multiplied by $\sin(n)/n$.…

Classical Analysis and ODEs · Mathematics 2026-04-29 Robert Baillie

Andrews introduced the partition function $\overline{C}_{k, i}(n)$, called singular overpartition, which counts the number of overpartitions of $n$ in which no part is divisible by $k$ and only parts $\equiv \pm i\pmod{k}$ may be overlined.…

Number Theory · Mathematics 2019-06-13 Rupam Barman , Chiranjit Ray

This paper provides a survey of spherical designs and their applications, with a particular emphasis on the perspective of ``numerical analysis''. A set \(X_N\) of \(N\) points on the unit sphere \(\mathbb{S}^d\) is called a…

Numerical Analysis · Mathematics 2026-01-21 Congpei An , Xiaosheng Zhuang

This paper presents a methodology for constructing iterative schemes of any order of convergence for solving nonlinear systems of equations. It also provides formulas for the order of convergence of any iterative schemes constructed using…

Numerical Analysis · Mathematics 2018-06-12 Stefan Hothazie , Munteanu Camelia Elena , Mihaela Nastase

Graph transformation theory relies upon the composition of rules to express the effects of sequences of rules. In practice, graphs are often subject to constraints, ruling out many candidates for composed rules. Focusing on the case of…

Logic in Computer Science · Computer Science 2020-12-04 Nicolas Behr , Reiko Heckel , Maryam Ghaffari Saadat

In this note, we describe a procedure to construct generalized complex structures with an arbitrarily large number of type change loci on products of the circle with a connected sum of closed 3-manifolds. The loci need not be isotopic.

Differential Geometry · Mathematics 2015-06-16 Rafael Torres , Jonathan Yazinski

We classify and construct all line graphs that are $3$-polytopes (planar and $3$-connected). Apart from a few special cases, they are all obtained starting from the medial graphs of cubic (i.e., $3$-regular) $3$-polytopes, by applying two…

Combinatorics · Mathematics 2024-04-12 Phoebe Hollowbread-Smith , Riccardo W. Maffucci

The method of constructing spline classes in the form of trigonometric Fourier series whose coefficients have a certain decreasing order are considered. in turn, this decrement determines the number of continuous derivatives of sum of this…

Numerical Analysis · Mathematics 2019-02-22 V. Denysiuk

We study the basic question of characterizing which boundary homeomorphisms of the unit sphere can be extended to a Sobolev homeomorphism of the interior in 3D space. While the planar variants of this problem are well-understood, completely…

Classical Analysis and ODEs · Mathematics 2022-01-03 Stanislav Hencl , Aleksis Koski , Jani Onninen

This is the third in a series of papers in which we study the n-Selmer group of an elliptic curve, with the aim of representing its elements as curves of degree n in P^{n-1}. The methods we describe are practical in the case n=3 for…

Number Theory · Mathematics 2016-08-03 John Cremona , Tom Fisher , Cathy O'Neil , Denis Simon , Michael Stoll

Consider a set $A$ with no $p$-term arithmetic progressions for $p$ prime. The $p$-Stanley sequence of a set $A$ is generated by greedily adding successive integers that do not create a $p$-term arithmetic progression. For $p>3$ prime, we…

Combinatorics · Mathematics 2017-07-07 Mehtaab Sawhney , Jonathan Tidor

The Schwinger oscillator operator representation of SU(3) is analysed with particular reference to the problem of multiplicity of irreducible representations. It is shown that with the use of an $Sp(2,R)$ unitary representation commuting…

Quantum Physics · Physics 2009-11-07 S. Chaturvedi , N. Mukunda

We provide an upper bound on the uniform exponent of approximation to a triple (xi, xi^2, xi^3) by rational numbers with the same denominator, valid for any transcendental real number xi. This upper bound refines a previous result of…

Number Theory · Mathematics 2015-05-13 Damien Roy

In this paper we present a new mathematical conception based on a new method for ordering the integers. The method relies on the assumption that negative numbers are beyond infinity, which goes back to Wallis and Euler. We also present a…

General Mathematics · Mathematics 2009-09-09 Rom Varshamov , Armen Bagdasaryan

The present paper constructs three new systems of clarithmetic (arithmetic based on computability logic --- see http://www.cis.upenn.edu/~giorgi/cl.html): CLA8, CLA9 and CLA10. System CLA8 is shown to be sound and extensionally complete…

Logic in Computer Science · Computer Science 2012-11-21 Giorgi Japaridze

We extend the work of An, Guan and Kleinbock on bounded orbits of diagonalizable flows on $\mathrm{SL}_3(\mathbb{R})/\mathrm{SL}_3(\mathbb{Z})$ to $\mathrm{SL}_3(\mathbb{C})/\mathrm{SL}_3(\mathcal{O}_{\mathbb{K}})$, where $\mathbb{K}$ is an…

Dynamical Systems · Mathematics 2024-07-23 Gaurav Sawant

We construct K3 surfaces over number fields that have good reduction everywhere. These do not exists over the rational numbers, by results of Abrashkin and Fontaine. Our surfaces exist for three quadratic number fields, and an infinite…

Algebraic Geometry · Mathematics 2025-06-18 Stefan Schröer

Coding theory and combinatorial $t$-designs have close connections and interesting interplay. One of the major approaches to the construction of combinatorial t-designs is the employment of error-correcting codes. As we all known, some…

Information Theory · Computer Science 2021-10-11 Can Xiang , Chunming Tang , Qi Liu
‹ Prev 1 4 5 6 7 8 10 Next ›