English
Related papers

Related papers: Signed magic rectangles with three filled cells in…

200 papers

A set of $m$ distinct nonzero rationals $\{a_1,a_2,\ldots,a_m\}$ such that $a_ia_j+1$ is a perfect square for all $1\leq i<j\leq m$, is called a rational Diophantine $m$-tuple. It is proved recently that there are infinitely many rational…

Number Theory · Mathematics 2021-01-29 Andrej Dujella , Matija Kazalicki , Vinko Petričević

In an $n \times n$ array filled with symbols, a transversal is a collection of entries with distinct rows, columns and symbols. In this note we show that if no symbol appears more than $\beta n$ times, the array contains a transversal of…

Combinatorics · Mathematics 2024-12-10 Michael Anastos , Patrick Morris

It is known that every complex square matrix with nonnegative determinant is the product of positive semi-definite matrices. There are characterizations of matrices that require two or five positive semi-definite matrices in the product.…

Functional Analysis · Mathematics 2015-09-29 Jianlian Cui , Chi-Kwong Li , Nung-Sing Sze

Let A={a_s+n_sZ}_{s=1}^k be a finite system of arithmetic sequences which forms an m-cover of Z (i.e., every integer belongs at least to m members of A). In this paper we show the following sharp result: For any positive integers…

Number Theory · Mathematics 2007-05-23 Hao Pan , Zhi-Wei Sun

An explicit expression for the numbers $A(n,r;3)$ describing the refined 3-enumeration of alternating sign matrices is given. The derivation is based on the recent results of Stroganov for the corresponding generating function. As a result,…

Mathematical Physics · Physics 2007-05-23 F. Colomo , A. G. Pronko

We introduce a variant of PCPs, that we refer to as rectangular PCPs, wherein proofs are thought of as square matrices, and the random coins used by the verifier can be partitioned into two disjoint sets, one determining the row of each…

Computational Complexity · Computer Science 2022-11-24 Amey Bhangale , Prahladh Harsha , Orr Paradise , Avishay Tal

Generally, in any human field, a Smarandache Structure on a set A means a weak structure W on A such that there exists a proper subset B which is embedded with a stronger structure S. By proper subset one understands a set included in A,…

General Mathematics · Mathematics 2007-05-23 W. B. Vasantha Kandasamy

It is well known that the full matrix ring over a skew-field is a simple ring. We generalize this theorem to the case of semirings. We characterize the case when the matrix semiring $\mathbf{M}_n(S)$, of all $n\times n$ matrices over a…

Rings and Algebras · Mathematics 2024-05-29 Vítězslav Kala , Tomáš Kepka , Miroslav Korbelář

We study Hamiltonian circles in the doubly signed complete graph $\Sigma_n = (K_n, \sigma, \mathbb{F}_2^2)$. A circle's double sign is defined as the sum of its edge labels. I establish conditions under which Hamiltonian circles realize all…

Combinatorics · Mathematics 2025-09-23 Xiyong Yan

Fullerenes are an allotrope of carbon having hollow, cage-like structure. Atoms in the molecule are arranged in pentagonal and hexagonal rings, such that each atom is connected to three other atoms. Simple polyhedra having only pentagonal…

Combinatorics · Mathematics 2025-11-25 Djordje Baralic , Adam Farhat

For an integer $n>2$, a rank-$n$ matroid is called an $n$-spike if it consists of $n$ three-point lines through a common point such that, for all $k\in\{1, 2, ..., n - 1\}$, the union of every set of $k$ of these lines has rank $k+1$.…

Combinatorics · Mathematics 2007-05-23 Zhaoyang Wu , Zhi-Wei Sun

Let $n$ be a positive integer and $\mathcal M$ a set of rational $n \times n$-matrices such that $\mathcal M$ generates a finite multiplicative semigroup. We show that any matrix in the semigroup is a product of matrices in $\mathcal M$…

Group Theory · Mathematics 2020-04-28 Georgina Bumpus , Christoph Haase , Stefan Kiefer , Paul-Ioan Stoienescu , Jonathan Tanner

In this paper we propose a new, more appropriate definition of regular and indeterminate strings. A regular string is one that is "isomorphic" to a string whose entries all consist of a single letter, but which nevertheless may itself…

Data Structures and Algorithms · Computer Science 2020-12-16 Felipe A. Louza , Neerja Mhaskar , W. F. Smyth

We provide exact and asymptotic formulae for the number of unrestricted, respectively indecomposable, $d$-dimensional matrices where the sum of all matrix entries with one coordinate fixed equals 2.

Combinatorics · Mathematics 2011-04-27 Peter J. Cameron , Christian Krattenthaler , Thomas W. Müller

A ring $R$ is (strongly) 2-nil-clean if every element in $R$ is the sum of two idempotents and a nilpotent (that commute). Fundamental properties of such rings are discussed. Let $R$ be a 2-primal ring. If $R$ is strongly 2-nil-clean, we…

Rings and Algebras · Mathematics 2016-11-03 H. Chen , M. Sheibani

For every $n \in \mathbb{N}$ and every field $K$, let $A(n,K)$ be the vector space of the antisymmetric $(n \times n)$-matrices over $K$. We say that an affine subspace $S$ of $A(n,K)$ has constant rank $r$ if every matrix of $S$ has rank…

Rings and Algebras · Mathematics 2024-12-03 Elena Rubei

Sums-of-squares formulas over the integers have been studied extensively using their equivalence to consistently signed intercalate matrices. This representation, combined with combinatorial arguments, has been used to produce…

Data Structures and Algorithms · Computer Science 2018-10-15 Melissa Lynn

A Heron triangle is one that has all integer side lengths and integer area, which takes its name from Heron of Alexandria's area formula. From a more relaxed point of view, if rescaling is allowed, then one can define a Heron triangle to be…

Number Theory · Mathematics 2024-01-31 Andrew N. W. Hone

For $m \geq 3$ and $n \geq 1$, the $m$-cycle book graph $B(m,n)$ consists of $n$ copies of the cycle $C_m$ with one common edge. In this paper, we prove that (a) the number of switching non-isomorphic signed $B(m,n)$ is $n+1$, and (b) the…

Combinatorics · Mathematics 2022-06-20 Deepak Sehrawat , Bikash Bhattacharjya

In this paper, we investigate the existence of self-dual MRD codes $C\subset L^n$, where $L/F$ is an arbitrary field extension of degree $m\geq n$. We then apply our results to the case of finite fields, and prove that if $m=n$ and…

Information Theory · Computer Science 2024-01-31 Grégory Berhuy
‹ Prev 1 8 9 10 Next ›