English
Related papers

Related papers: Pseudo Magic Squares

200 papers

Observed neutrino mixing can be described by a tribimaximal MNS matrix. The resulting neutrino mass matrix in the basis of a diagonal charged lepton mass matrix is both 2-3 symmetric and magic. By a magic matrix, I mean one whose row sums…

High Energy Physics - Phenomenology · Physics 2009-11-11 C. S. Lam

We begin by introducing an extension of the traditional abundancy index to imaginary quadratic rings with unique factorization. After showing that many of the properties of the traditional abundancy index continue to hold in our extended…

Number Theory · Mathematics 2015-06-18 Colin Defant

In the chapter "Magic with a Matrix" in \emph{Hexaflexagons and Other Mathematical Diversions} (1988), Martin Gardner describes a delightful "party trick" to fill the squares of a $d$-by-$d$ chessboard with nonnegative integers such that…

Combinatorics · Mathematics 2019-09-11 Kristin Fritsch , Janin Heuer , Raman Sanyal , Nicole Schulz

A graph is distance magic if it admits a bijective labeling of its vertices by integers from $1$ up to the order of the graph in such a way that the sum of the labels of all the neighbors of a vertex is independent of a given vertex. We…

Combinatorics · Mathematics 2026-03-10 Petr Kovář , Ksenija Rozman , Primož Šparl

P. J. Federico used the term low-order for perfect squared squares with at most 28 squares in their dissection. In 2010 low-order compound perfect squared squares (CPSSs) were completely enumerated. Up to symmetries of the square and its…

Combinatorics · Mathematics 2015-03-13 Stuart E. Anderson

Using an extension of the abundancy index to imaginary quadratic rings with unique factorization, we define what we call $n$-powerfully perfect numbers in these rings. This definition serves to extend the concept of perfect numbers that…

Number Theory · Mathematics 2014-12-12 Colin Defant

Our purpose is to determine the complete set of mutually orthogonal squares of order $d$, which are not necessary Latin. In this article, we introduce the concept of supersquare of order $d$, which is defined with the help of its generating…

Mathematical Physics · Physics 2014-01-06 Cristian Ghiu , Iulia Ghiu

A Latin square of order $n$ is an $n\times n$ matrix in which each row and column contains each of $n$ symbols exactly once. For $\epsilon>0$, we show that with high probability a uniformly random Latin square of order $n$ has no proper…

Combinatorics · Mathematics 2024-05-08 Michael J. Gill , Adam Mammoliti , Ian M. Wanless

Here a novel idea to handle imprecise or vague set viz. Pseudo fuzzy set has been proposed. Pseudo fuzzy set is a triplet of element and its two membership functions. Both the membership functions may or may not be dependent. The hypothesis…

Artificial Intelligence · Computer Science 2015-02-23 Sukanta Nayak , Snehashish Chakraverty

A Smarandache multi-space is a union of $n$ different spaces equipped with some different structures for an integer $n\geq 2$, which can be both used for discrete or connected spaces, particularly for geometries and spacetimes in…

General Mathematics · Mathematics 2009-09-29 Linfan Mao

XOR-magic graph labelings form a special subclass of group distance magic labelings. A simple connected graph of order $2^n$ is called an open (respectively, closed) XOR-magic graph of power $n$ if its vertices can be labeled bijectively…

Combinatorics · Mathematics 2025-12-23 Sylwia Cichacz , Hubert Grochowski , Rita Zuazua

We examine the representation of numbers as the sum of two squares in $\mathbb{Z}_n$ for a general positive integer $n$. Using this information we make some comments about the density of positive integers which can be represented as the sum…

Number Theory · Mathematics 2017-09-26 Rob Burns

A transversal in an $n \times n$ latin square is a collection of $n$ entries not repeating any row, column, or symbol. Kwan showed that almost every $n \times n$ latin square has $\bigl((1 + o(1)) n / e^2\bigr)^n$ transversals as $n \to…

Combinatorics · Mathematics 2023-05-24 Sean Eberhard , Freddie Manners , Rudi Mrazović

Circulant matrices are an important tool widely used in coding theory and cryptography. A circulant matrix is a square matrix whose rows are the cyclic shifts of the first row. Such a matrix can be efficiently stored in memory because it is…

Information Theory · Computer Science 2022-08-09 Henry Chimal-Dzul , Niklas Gassner , Joachim Rosenthal , Reto Schnyder

A graph of order $n$ is distance magic if it admits a bijective labeling of its vertices with integers from $1$ to $n$ such that each vertex has the same sum of the labels of its neighbors. In this paper we classify all distance magic…

Combinatorics · Mathematics 2024-06-21 Ksenija Rozman , Primož Šparl

A square matrix is called Hessenberg whenever each entry below the subdiagonal is zero and each entry on the subdiagonal is nonzero. Let $M$ denote a Hessenberg matrix. Then $M$ is called circular whenever the upper-right corner entry of…

Combinatorics · Mathematics 2024-05-08 Jae-Ho Lee

This article describes a new family of cryptographically secure pseudorandom number generators, based on coupled chaotic maps, that will serve as keystream in a stream cipher. The maps are a modification of a piecewise linear map, by…

Cryptography and Security · Computer Science 2010-08-18 A. B. Orue , G. Alvarez , A. Guerra , G. Pastor , M. Romera , F. Montoya

The relationship between nonnegative polynomials and sums of squares is one of the central questions in real algebraic geometry. A modern approach is to look at nonnegative polynomials and sums of squares on a real variety. We survey the…

Algebraic Geometry · Mathematics 2021-04-16 Grigoriy Blekherman , Rainer Sinn , Gregory G. Smith , Mauricio Velasco

This paper introduces and studies the higher-order group inverse in a ring. We extend known properties of the higher-order group inverse from complex matrices to elements of a ring and, in the process, derive new results. We further…

Rings and Algebras · Mathematics 2026-02-17 Liu Dayong , Chen Huanyin

We are interested in ordering the elements of a subset A of the non-zero integers modulo n in such a way that all the partial sums are distinct. We conjecture that this can always be done and we prove various partial results about this…

Combinatorics · Mathematics 2015-01-28 D. S. Archdeacon , J. H. Dinitz , A. Mattern , D. R. Stinson