English
Related papers

Related papers: Notes on Symmetric Bases

200 papers

The Bollob\'as set pairs inequality is a fundamental result in extremal set theory with many applications. In this paper, for $n \geq k \geq t \geq 2$, we consider a collection of $k$ families $\mathcal{A}_i: 1 \leq i \leq k$ where…

Combinatorics · Mathematics 2020-06-09 Jason O'Neill , Jacques Verstraete

Let $f$ be a symmetric norm on ${\mathbb R}^n$ and let ${\mathcal B}({\mathcal H})$ be the set of all bounded linear operators on a Hilbert space ${\mathcal H}$ of dimension at least $n$. Define a norm on ${\mathcal B}({\mathcal H})$ by…

Functional Analysis · Mathematics 2022-02-11 Jor-Ting Chan , Chi-Kwong Li

We find an asymptotic formula for the number of pairs of positive integers $x_1, x_2 \le H$ such that the product $x_1 x_2$ is a $k$-th power.

Number Theory · Mathematics 2010-01-05 Doychin Tolev

This work is devoted to the study of the boundary value problem \begin{eqnarray}\nonumber (-1)^\alpha \Delta^\alpha u = (-1)^k S_k[u] + \lambda f, \qquad x &\in& \Omega \subset \mathbb{R}^N, \\ \nonumber u = \partial_n u = \partial_n^2 u =…

Analysis of PDEs · Mathematics 2015-07-21 Carlos Escudero

In a quantum system having a finite number $N$ of orthogonal states, two orthonormal bases $\{a_i\}$ and $\{b_j\}$ are called mutually unbiased if all inner products $<a_i|b_j>$ have the same modulus $1/\sqrt{N}$. This concept appears in…

Quantum Physics · Physics 2007-05-23 Claude archer

Asymmetric statistical errors arise for experimental results obtained by Maximum Likelihood estimation, in cases where the number of results is finite and the log likelihood function is not a symmetric parabola. This note discusses how…

Data Analysis, Statistics and Probability · Physics 2007-05-23 Roger Barlow

For any two-dimensional nearest neighbor shift of finite type X and any integer n > 0, one can define the horizontal strip shift H_n(X) to be the set of configurations on Z x {1,...,n} which do not contain any forbidden transitions for X.…

Dynamical Systems · Mathematics 2010-11-10 Ronnie Pavlov

The harmonic numbers are those $H_n=\sum_{0<k\le n}\frac1k\ (n=0,1,2,\ldots)$. In this paper we confirm over ten conjectural series identities with summands involving the binomial coefficient $\binom{4k}k$ and harmonic numbers. For example,…

Number Theory · Mathematics 2026-01-27 Bo Jiang , Zhi-Wei Sun

For a family $\mathcal{H} \subseteq \binom{[n]}{k}$, a subset $\{A_1, A_2, \ldots, A_m\} \subseteq \mathcal{H}$ is called a \textit{matching} of size~$m$ if the sets $A_1, A_2, \ldots, A_m$ are pairwise disjoint. The \textit{matching…

Combinatorics · Mathematics 2026-04-24 Haixiang Zhang , Mengyu Cao , Mei Lu

A graph H is a square root of a graph G if G can be obtained from H by the addition of edges between any two vertices in H that are of distance 2 from each other. The Square Root problem is that of deciding whether a given graph admits a…

Data Structures and Algorithms · Computer Science 2016-08-23 Petr A. Golovach , Dieter Kratsch , Daniël Paulusma , Anthony Stewart

A well supported conjecture states that SIC-POVMs -- maximal sets of complex equiangular lines -- with anti-unitary symmetry give rise to an identity expressing some of its overlaps as squares of the (rescaled) components of a suitably…

Quantum Physics · Physics 2025-12-16 Ingemar Bengtsson , Markus Grassl

A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…

Optimization and Control · Mathematics 2016-10-27 Sander Gribling , David de Laat , Monique Laurent

Consider a graph G = G(k,d,s) with vertex set the set of all k-letter words over an alphabet of size d. An edge e = vw is in E iff v is distinct from w and the last(first) k-s letters of v are identical to the first(last) k-s letters of w.…

Combinatorics · Mathematics 2007-05-23 Anant Godbole , Debra Knisley , Rick Norwood

Let $G$ be a complete edge-weighted graph on $n$ vertices. To each subset of vertices of $G$ assign the cost of the minimum spanning tree of the subset as its weight. Suppose that $n$ is a multiple of some fixed positive integer $k$. The…

We investigate the number of symmetric matrices of non-negative integers with zero diagonal such that each row sum is the same. Equivalently, these are zero diagonal symmetric contingency tables with uniform margins, or loop-free regular…

Combinatorics · Mathematics 2013-01-22 Brendan D. McKay , Jeanette C. McLeod

The harmonic numbers $H_n=\sum_{0<k\le n}1/k\ (n=0,1,2,\ldots)$ play important roles in mathematics. Let $p>3$ be a prime. With helps of some combinatorial identities, we establish the following two new congruences:…

Number Theory · Mathematics 2016-02-25 Guo-Shuai Mao , Zhi-Wei Sun

Writing for a general mathematical audience, we provide elementary upper and lower bounds on the growth (as a function of N) of the sum \sum_{n=1}^N (-1)^{\floor{n x}} for various fixed x. For example, if x is a quadratic irrational, then…

Number Theory · Mathematics 2007-05-23 Kevin O'Bryant , Bruce Reznick , Monika Serbinowska

Suppose that the edges of a complete graph are assigned weights independently at random and we ask for the weight of the minimal-weight spanning tree, or perfect matching, or Hamiltonian cycle. For these and several other common…

Combinatorics · Mathematics 2025-01-28 Yun Cheng , Yixue Liu , Tomasz Tkocz , Albert Xu

Let $A=\oplus_{i\in \mathbb{Z}}A_i$ be a finite dimensional graded symmetric cellular algebra with a homogeneous symmetrizing trace of degree $d$. We prove that $A_{-d}$ contains the Higman ideal $H(A)$ of the center of $A$ and $\dim…

Rings and Algebras · Mathematics 2017-12-19 Yanbo Li , Deke Zhao

Let $H$ be a fixed graph. A {\em fractional $H$-decomposition} of a graph $G$ is an assignment of nonnegative real weights to the copies of $H$ in $G$ such that for each $e \in E(G)$, the sum of the weights of copies of $H$ containing $e$…

Combinatorics · Mathematics 2007-05-23 Raphael Yuster