中文
相关论文

相关论文: The number of "magic" squares and hypercubes

200 篇论文

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…

综合数学 · 数学 2020-02-27 Donghwi Park

A nonzero rational number is called a cube sum if it is of form $a^3+b^3$ with $a,b\in \mathbb{Q}^\times$. In this paper, we prove that for any odd integer $k\geq 1$, there exist infinitely many cube-free odd integers $n$ with exactly $k$…

数论 · 数学 2014-12-08 Li Cai , Jie Shu , Ye Tian

Let X be a finite set of points in R^n. A polynomial p nonnegative on X can be written as a sum of squares of rational functions modulo the vanishing ideal I(X). From the point of view of applications, such as polynomial optimization, we…

代数几何 · 数学 2014-02-19 Grigoriy Blekherman , João Gouveia , James Pfeiffer

We give a computer-based proof of the following fact: If a square is divided into seven or nine convex polygons, congruent among themselves, then the tiles are rectangles.

计算几何 · 计算机科学 2021-11-24 Gerardo L. Maldonado , Edgardo Roldán-Pensado

The problem of writing a totally positive element as a sum of squares has a long history in mathematics, going back to Bachet and Lagrange. While for some specific rings (like integers or polynomials over the rationals), there are known…

数论 · 数学 2021-11-17 Przemysław Koprowski

We construct infinite cubefree binary words containing exponentially many distinct squares of length n. We also show that for every positive integer n, there is a cubefree binary square of length 2n.

组合数学 · 数学 2009-04-14 James Currie , Narad Rampersad

A square matrix of order n with $n\geq 2$ is called permutative matrix when all its rows (up to the frst one) are permutations of precisely its frst row. In this paper recalling spectral results for partitioned into $2$-by-$2$ symmetric…

谱理论 · 数学 2017-08-29 Cristina B. Manzaneda , Enide Andrade , María Robbiano

A square is the concatenation of a nonempty word with itself. A word has period p if its letters at distance p match. The exponent of a nonempty word is the quotient of its length over its smallest period. In this article we give a proof of…

离散数学 · 计算机科学 2012-07-25 Golnaz Badkobeh , Maxime Crochemore

One presents many Concatenated and Operation Sequences, P-Q Relationships, Digital Sequences, Magic Squares, Prime Conjectures, k-Divisibility and Strong Divisibility Sequences, Geometric Conjectures, Proposed problems.

综合数学 · 数学 2007-05-23 Florentin Smarandache

We define a new combinatorial object, which we call a labeled hypergraph, uniquely associated to any square-free monomial ideal. We prove several upper bounds on the regularity of a square-free monomial ideal in terms of simple…

交换代数 · 数学 2013-04-02 Kuei-Nuan Lin , Jason McCullough

Nontransitive dice are dice beating one another in a cyclic way: die A wins die B, B wins C, and C wins A (like in a rock-paper-scissors game). In this article, it has been shown that a structure of mutual wins of 3 nontransitive dice (with…

综合数学 · 数学 2023-11-23 Alexander Poddiakov

We show that the maximal number of (real) lines in a (real) nonsingular spatial quartic surface is 64 (respectively, 56). We also give a complete projective classification of all quartics containing more than 52 lines: all such quartics are…

代数几何 · 数学 2017-06-20 Alex Degtyarev , Ilia Itenberg , Ali Sinan Sertöz

A defining set of a Latin square is a partially filled-in Latin square which completes to no other Latin square of the same order. We introduce the concept of a $k$-strong defining set, in which if less than $k$ entries are deleted, the…

组合数学 · 数学 2026-05-28 Richard Bean , Nicholas Cavenagh

On the math-fun mailing list (7 May 2013), Neil Sloane asked to calculate the number of $n \times n$ matrices with entries in $\{0,1\}$ which are squares of other such matrices. In this paper we analyze the case that the arithmetic is in…

群论 · 数学 2016-07-01 Victor S. Miller

We introduce and study arithmetic polygons. We show that these arithmetic polygons are connected to triples of square pyramidal numbers. For every odd $N\geq3$, we prove that there is at least one arithmetic polygon with $N$ sides. We also…

数论 · 数学 2026-02-16 Jack Anderson , Amy Woodall , Alexandru Zaharescu

We develop several methods, based on the geometric relationship between the eigenspaces of a matrix and its adjoint, for determining whether a square matrix having distinct eigenvalues is unitarily equivalent to a complex symmetric matrix.…

泛函分析 · 数学 2010-03-16 Stephan Ramon Garcia , Levon Balayan

A square is a factor $S = (S_1; S_2)$ where $S_1$ and $S_2$ have the same pattern, and a permutation is said to be square-free if it contains no non-trivial squares. The permutation is further said to be bicrucial if every extension to the…

组合数学 · 数学 2022-01-31 Carla Groenland , Tom Johnston

For $n\ge 5$, we prove that every $n\times n$ matrix $M=(a_{i,j})$ with entries in $\{-1,1\}$ and absolute discrepancy $|\mathrm{disc}(M)|=|\sum a_{i,j}|\le n$ contains a zero-sum square except for the split matrix (up to symmetries). Here,…

组合数学 · 数学 2021-06-09 Alma R. Arévalo , Amanda Montejano , Edgardo Roldán-Pensado

We define recursive harmonic numbers as a generalization of harmonic numbers. The table of recursive harmonic numbers, which is like Pascal's triangle, is constructed. A formula for recursive harmonic numbers containing binomial…

组合数学 · 数学 2017-11-30 Aung Phone Maw , Aung Kyaw

In this paper we are constructing integer lattice squares, cubes or hypercubes in $\mathbb R^d$ with $d\in \{2,3,4\}$. For squares and cubes we find a complete description of their Ehrhart polynomial. For hypercubes, we compute one of the…

数论 · 数学 2016-03-18 Eugen J. Ionascu
‹ 上一页 1 8 9 10 下一页 ›