English
Related papers

Related papers: Constructing Even Order Magic Squares By Consecuti…

200 papers

Our goal is to present, in what we believe is the most efficient way possible, a construction of four mutually tangent circles.

History and Overview · Mathematics 2017-05-01 Arthur Baragar , Alex Kontorovich

We give a new method to construct isolated left orderings of groups whose positive cones are finitely generated. Our construction uses an amalgamated free product of two groups having an isolated ordering. We construct a lot of new examples…

Group Theory · Mathematics 2013-02-21 Tetsuya Ito

We show that a generalised sparse grid combination technique which combines multi-variate extrapolation of finite difference solutions with the standard combination formula lifts a second order accurate scheme on regular meshes to a fourth…

Numerical Analysis · Mathematics 2026-01-08 Julia Muñoz-Echániz , Christoph Reisinger

We explore some of the properties of consecutive, equally-summed arithmetic progressions of odd numbers, particularly their offsets and sums, before using them to prove that no $3\times3$ magic squares of distinct square integers exist.

General Mathematics · Mathematics 2026-04-08 Oscar Hill

We present a novel, perspicuous framework for building iterated ultrapowers. Furthermore, our framework naturally lends itself to the construction of a certain type of order indiscernibles, here dubbed tight indiscernibles, which are shown…

Logic · Mathematics 2017-08-01 Ali Enayat , Matt Kaufmann , Zachiri McKenzie

A method based on order completion for solving general equations is presented. In particular, this method can be used for solving large classes of nonlinear systems of PDEs, with possibly associated initial and/or boundary value problems.

General Mathematics · Mathematics 2007-09-28 Elemer E Rosinger

We look for elliptic curves featuring rational points whose coordinates form two arithmetic progressions, one for each coordinate. A constructive method for creating such curves is shown, for lengths up to 5.

Number Theory · Mathematics 2010-05-31 Irene Garcia-Selfa , Jose M. Tornero

We construct, for every even dimensional sphere $S^n$, $n >1$, and every odd integer $k$, a homogeneous polynomial map $f: S^{n}\to S^{n}$ of Brouwer degree $k$ and algebraic degree $2|k|-1$.

Algebraic Topology · Mathematics 2007-05-23 Javier Turiel

A general method for constructing essential uniform algebras with prescribed properties is presented. Using the method, the following examples are constructed: an essential, natural, regular uniform algebra on the closed unit disc; an…

Functional Analysis · Mathematics 2018-03-06 J. F. Feinstein , Alexander J. Izzo

We find that with uniform mesh, the numerical schemes derived from finite element method can keep a preserved symplectic structure in one-dimensional case and a preserved multisymplectic structure in two-dimentional case in certain discrete…

High Energy Physics - Theory · Physics 2018-01-17 Han-Ying Guo , Xiao-mei Ji , Yu-Qi Li , Ke Wu

We study the problem of perfect tiling in the plane and exploring the possibility of tiling a rectangle using integral distinct squares. Assume a set of distinguishable squares (or equivalently a set of distinct natural numbers) is given,…

Computational Geometry · Computer Science 2025-03-14 Bahram Sadeghi Bigham , Mansoor Davoodi , Samaneh Mazaheri , Jalal Kheyrabadi

In this paper we describe a novel a procedure to build a linear order from an arbitrary poset which (i) preserves the original ordering and (ii) allows to extend monotonic and antitonic mappings defined over the original poset to monotonic…

Discrete Mathematics · Computer Science 2010-06-15 Nicolas Madrid Labrador , Umberto Straccia

We describe a new way to construct finite geometric objects. For every k we obtain a symmetric configuration E(k-1) with k points on a line. In particular, we have a constructive existence proof for such configurations. The method is very…

Combinatorics · Mathematics 2012-11-09 Christoph Hering , Andreas Krebs , Thomas Edgar

A fast algorithm for counting intersections of two normal curves on a triangulated surface is proposed. It yields a convenient way for treating mapping class groups of punctured surfaces by presenting mapping classes by matrices, and the…

Geometric Topology · Mathematics 2021-10-12 Ivan Dynnikov

In this work we present a new simple but efficient scheme - Subsquares approach - for development of algorithms for enclosing the solution set of overdetermined interval linear systems. We are going to show two algorithms based on this…

Numerical Analysis · Computer Science 2013-05-07 Jaroslav Horáček , Milan Hladík

I found a novel class of magic square analogue, magic 24-cell. The problem is to assign the consecutive numbers 1 through 24 to the vertices in a graph, which is composed of 24 octahedra and 24 vertices, to make the sum of the numbers of…

General Mathematics · Mathematics 2020-02-27 Donghwi Park

We introduce consecutive equi-$n$-squares, a variant of equi-$n$-squares in which at least one row or column forms a fixed permutation of $\{1,\dots,n\}$, taken for concreteness to be $(1,\dots,n)$. More generally, the enumeration and…

Combinatorics · Mathematics 2026-01-19 Andrew Pendleton

This article explores the limits of geometric construction using various tools, both classical and modern. Starting with ruler and compass constructions, we examine how adding methods such as origami, marked rulers (neusis), conic sections,…

History and Overview · Mathematics 2025-10-20 MohammadJavad Maarefvand

Using the method of equivariant moving frames, we present a procedure for constructing symmetry-preserving finite element methods for second-order ordinary differential equations. Using the method of lines, we then indicate how our…

Numerical Analysis · Mathematics 2018-03-28 Alexander Bihlo , Francis Valiquette

A proof that there is no $3 \times 3$ magic square constructed with nine distinct square numbers is given.

General Mathematics · Mathematics 2015-06-29 Jailton C. Ferreira