English
Related papers

Related papers: A note on Erd\H{o}s matrices and Marcus\unicode{x2…

200 papers

A $0,1$ matrix is said to be regular if all of its rows and columns have the same number of ones. We prove that for infinitely many integers $k$, there exists a square regular $0,1$ matrix with binary rank $k$, such that the Boolean rank of…

Combinatorics · Mathematics 2023-02-06 Ishay Haviv , Michal Parnas

Let $\mathcal{A}$ be a unital complex semisimple Banach algebra, and $M_{\mathcal{A}}$ denote its maximal ideal space. For a matrix $M\in {\mathcal{A}}^{n\times n}$, $\widehat{M}$ denotes the matrix obtained by taking entry-wise Gelfand…

Functional Analysis · Mathematics 2021-08-24 Amol Sasane

We investigate symmetry properties of solutions to equations of the form $$ -\Delta u = \frac{a}{|x|^2} u + f(|x|, u)$$ in R^N for $N \geq 4$, with at most critical nonlinearities. By using geometric arguments, we prove that solutions with…

Analysis of PDEs · Mathematics 2010-07-20 L. Abatangelo , S. Terracini

A graph is called equimatchable if all of its maximal matchings have the same size. Frendrup et al. [8] provided a characterization of equimatchable graphs with girth at least $5$. In this paper, we extend this result by providing a…

Discrete Mathematics · Computer Science 2021-08-31 Yasemin Büyükçolak , Didem Gözüpek , Sibel Özkan

We consider a basic computational task of finding $s$ planted rank-1 $m \times n$ matrices in a linear subspace $\mathcal{U} \subseteq \mathbb{R}^{m \times n}$ where $\dim(\mathcal{U}) = R \ge s$. The work of Johnston-Lovitz-Vijayaraghavan…

Data Structures and Algorithms · Computer Science 2025-04-28 Jeshu Dastidar , Tait Weicht , Alexander S. Wein

We show that only a rather small proportion of linear equations are solvable in elements of a fixed finitely generated subgroup of a multiplicative group of a number field. The argument is based on modular techniques combined with a…

Number Theory · Mathematics 2025-03-07 Alina Ostafe , Carl Pomerance , Igor E. Shparlinski

We study the 'bad science matrix problem': among all matrices $A\in\mathbb{R}^{n\times n}$ whose rows have unit $\ell_2$-norm, determine the maximum of $\beta(A)=\frac{1}{2^n}\sum_{x\in\{\pm1\}^n}\|Ax\|_\infty$. Steinerberger [1]…

Functional Analysis · Mathematics 2025-09-16 Shridhar Sinha

The spectra of recently constructed auxiliary matrices for the six-vertex model respectively the spin s=1/2 Heisenberg chain at roots of unity q^N=1 are investigated. Two conjectures are formulated both of which are proven for N=3 and are…

Mathematical Physics · Physics 2009-11-10 Christian Korff

A folklore result attributed to P\'olya states that there are $(1 + o(1))2^{\binom{n}{2}}/n!$ non-isomorphic graphs on $n$ vertices. Given two graphs $G$ and $H$, we say that $G$ is a unique subgraph of $H$ if $H$ contains exactly one…

Combinatorics · Mathematics 2024-10-22 Domagoj Bradač , Micha Christoph

Let $A,B,C,D$ be rational numbers such that $ABC \neq 0$, and let $n_1>n_2>n_3>0$ be positive integers. We solve the equation $$ Ax^{n_1}+Bx^{n_2}+Cx^{n_3}+D = f(g(x)),$$ in $f,g \in \mathbb{Q}[x]$. In sequel we use Bilu-Tichy method to…

Number Theory · Mathematics 2015-12-10 Maciej Gawron

Consider a linear program of the form $\max\;c^{\top}x:Ax\leq b$, where $A$ is an $m\times n$ integral matrix. In 1986 Cook, Gerards, Schrijver, and Tardos proved that, given an optimal solution $x^{*}$, if an optimal integral solution…

Optimization and Control · Mathematics 2021-11-03 Marcel Celaya , Stefan Kuhlmann , Joseph Paat , Robert Weismantel

Let $X$ be a symmetric random matrix with independent but non-identically distributed centered Gaussian entries. We show that $$ \mathbf{E}\|X\|_{S_p} \asymp \mathbf{E}\Bigg[ \Bigg(\sum_i\Bigg(\sum_j X_{ij}^2\Bigg)^{p/2}\Bigg)^{1/p} \Bigg]…

Probability · Mathematics 2021-06-08 Rafał Latała , Ramon van Handel , Pierre Youssef

Consider the Birkhoff polytope of n by n doubly-stochastic matrices. As the Birkhoff-von Neumann theorem famously states, its vertex set coincides with the set of all n by n permutation matrices. Here we seek a higher-dimensional analog of…

Combinatorics · Mathematics 2012-08-22 Nathan Linial , Zur Luria

We computationally resolve an open problem concerning the expressibility of $4 \times 4$ full-rank matrices as Hadamard products of two rank-2 matrices. Through exhaustive search over $\mathbb{F}_2$, we identify 5,304 counterexamples among…

Rings and Algebras · Mathematics 2025-08-22 Igor Rivin

Consider a square matrix with independent and identically distributed entries of zero mean and unit variance. It is well known that if the entries have a finite fourth moment, then, in high dimension, with high probability, the spectral…

Combinatorics · Mathematics 2018-05-31 Charles Bordenave , Pietro Caputo , Djalil Chafai , Konstantin Tikhomirov

The process of alternately row scaling and column scaling a positive $n \times n$ matrix $A$ converges to a doubly stochastic positive $n \times n$ matrix $S(A)$, called the \emph{Sinkhorn limit} of $A$. Exact formulae for the Sinkhorn…

Number Theory · Mathematics 2019-02-13 Melvyn B. Nathanson

In this paper, we show the existence and multiplicity of solutions for the following fourth-order Kirchhoff type elliptic equations \begin{eqnarray*} \Delta^{2}u-M(\|\nabla u\|_{2}^{2})\Delta u+V(x)u=f(x,u),\ \ \ \ \ x\in \mathbb{R}^{N},…

Dynamical Systems · Mathematics 2019-07-26 Dong-Lun Wu , Fengying Li

Cecotti and Vafa introduced the topological anti-topological fusion (tt*)-equation, whose solutions describe massive deformations of supersymmetric conformal field theories. We provide a rigorous analytic formulation of the $ADE$…

Differential Geometry · Mathematics 2026-03-23 Tadashi Udagawa

In 1975, P. Erd\H{o}s proposed the problem of determining the maximum number $f(n)$ of edges in a graph on $n$ vertices in which any two cycles are of different lengths. Let $f^{\ast}(n)$ be the maximum number of edges in a simple graph on…

Combinatorics · Mathematics 2023-05-11 Chunhui Lai

The main object of this paper is to determine the maximum number of $\{0,\pm 1\}$-vectors subject to the following condition. All vectors have length $n$, exactly $k$ of the coordinates are $+1$ and one is $-1$, $n \geq 2k$. Moreover, there…

Combinatorics · Mathematics 2017-12-01 Peter Frankl , Andrey Kupavskii