English
Related papers

Related papers: Primitive Euler brick generator

200 papers

Let S be a smooth cubic surface defined over a field K. As observed by Segre and Manin, there is a secant and tangent process on S that generates new K-rational points from old. It is natural to ask for the size of a minimal generating set…

Number Theory · Mathematics 2013-12-23 Jenny Cooley

Several specific Franklin squares and magic squares are decomposed into their quotient and remainder squares. The results support the conjecture that Franklin used the Eulerian composition method to construct many of his squares. This…

Number Theory · Mathematics 2018-03-05 Ronald P. Nordgren

The problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an {\em opaque set} or a {\em barrier} for that region. We consider the…

Computational Geometry · Computer Science 2015-03-17 Adrian Dumitrescu , Minghui Jiang , János Pach

We consider a classial case of irrational integrals containing a square root of a quadratic polynomial. It is well known that they can be expressed in terms of elementary functions by one of three Euler's substitutions. It is less known…

History and Overview · Mathematics 2023-10-20 Jan L. Cieśliński , Maciej Jurgielewicz

We present an economical theory of natural electroweak symmetry breaking, generalizing an approach based on deconstruction. This theory is the smallest extension of the Standard Model to date that stabilizes the electroweak scale with a…

High Energy Physics - Phenomenology · Physics 2011-01-13 N. Arkani-Hamed , A. G. Cohen , E. Katz , A. E. Nelson

Fifty years ago Erd\H{o}s asked to determine the minimum number of $k$-cliques in a graph on $n$ vertices with independence number less than l. He conjectured that this minimum is achieved by the disjoint union of $l-1$ complete graphs of…

Combinatorics · Mathematics 2012-03-14 Shagnik Das , Hao Huang , Jie Ma , Humberto Naves , Benny Sudakov

Three graphs related to the \EGC\, are presented. The graphs are derived from the Buckyball, the Petersen graph, and the Tutte-Coxeter graph. The first graph is a partial answer to a question posed by Heckman and Krakovski \cite{planar} in…

Combinatorics · Mathematics 2014-03-25 Geoffrey Exoo

Let n points be placed on a closed convex domain on the plane, no three points on a straight line. A conjecture by H. A. Heilbronn (before 1950) stated that on the convex domain of unit area the smallest triangle defined by these points has…

Metric Geometry · Mathematics 2025-11-13 Gabor Ellmann

It is well known that a triangle with side lengths 3, 4 and 5 is right-angled. Euclid was the first to give a formula for generating other right-angled triangles with integer side lengths. In this text, I present a novel algorithm to…

Number Theory · Mathematics 2022-08-05 Jan Pieter Zwart

We investigate the differentiability of minimal average energy associated to the functionals $S_\ep (u) = \int_{\mathbb{R}^d} (1/2)|\nabla u|^2 + \ep V(x,u)\, dx$, using numerical and perturbative methods. We use the Sobolev gradient…

Analysis of PDEs · Mathematics 2011-10-11 Timothy Blass , Rafael de la Llave

A primitive Heron triangle is a triangle with integral sides and integral area where the greatest common divisor of the lengths of its sides is $1$. By utilizing the theory of elliptic curves, we prove that there exist infinitely many…

Number Theory · Mathematics 2026-01-27 Yangcheng Li

The problem of counting ramified covers of a Riemann surface up to homeomorphism was proposed by Hurwitz in the late 1800's. This problem translates combinatorially into factoring a permutation of specified cycle type, with certain…

Combinatorics · Mathematics 2007-05-23 I. P. Goulden , Luis G. Serrano

In this paper we have studied the problem of scalar particles pair creation by an electric field in the presence of a minimal length. Two sets of exact solutions for the Klein Gordon equation are given in momentum space. Then the canonical…

High Energy Physics - Theory · Physics 2014-06-11 S. Haouat , K. Nouicer

A quadrangular embedding of a graph in a surface $\Sigma$, also known as a quadrangulation of $\Sigma$, is a cellular embedding in which every face is bounded by a $4$-cycle. A quadrangulation of $\Sigma$ is minimal if there is no…

Combinatorics · Mathematics 2021-06-28 Wenzhong Liu , M. N. Ellingham , Dong Ye

A quadrilateral is said to be rational if its four sides, the two diagonals and the area are all expressible by rational numbers. The problem of constructing rational quadrilaterals dates back to the seventh century when Brahmagupta gave an…

Number Theory · Mathematics 2022-08-16 Ajai Choudhry

We consider random topologies of surfaces generated by cubic interactions. Such surfaces arise in various contexts in 2-dimensional quantum gravity and as world-sheets in string theory. Our results are most conveniently expressed in terms…

General Relativity and Quantum Cosmology · Physics 2007-05-23 Nicholas Pippenger , Kristin Schleich

The primitive equations in a 3D infinite layer domain are considered with linearly growing initial data in the horizontal direction, which illustrates the global atmospheric rotating or straining flows. On the boundaries, Dirichlet, Neumann…

Analysis of PDEs · Mathematics 2021-03-29 Amru Hussein , Martin Saal , Okihiro Sawada

Let $E/\mathbb{Q}$ be an elliptic curve without complex multiplication. A well-known theorem of Serre asserts that the $\ell$-adic Galois representation $\rho_{E,\ell^\infty}$ is surjective for all but finitely many prime numbers $\ell$.…

Number Theory · Mathematics 2025-02-06 Tyler Genao , Jacob Mayle , Jeremy Rouse

In STOC'95 \cite{ADMSS95} Arya et al.\ showed that for any set of $n$ points in $\mathbb R^d$, a $(1+\epsilon)$-spanner with diameter at most 2 (respectively, 3) and $O(n \log n)$ edges (resp., $O(n \log \log n)$ edges) can be built in $O(n…

Computational Geometry · Computer Science 2011-08-31 Shay Solomon

We estimate the minimum number of vertices of a cubic graph with given oddness and cyclic connectivity. We prove that a bridgeless cubic graph $G$ with oddness $\omega(G)$ other than the Petersen graph has at least $5.41\cdot\omega(G)$…

Discrete Mathematics · Computer Science 2012-12-18 Robert Lukotka , Edita Macajova , Jan Mazak , Martin Skoviera
‹ Prev 1 3 4 5 6 7 10 Next ›