English
Related papers

Related papers: On commuting integer matrices

200 papers

Let $w$ be a word in alphabet $\{x,D\}$ with $m$ $x$'s and $n$ $D$'s. Interpreting "$x$" as multiplication by $x$, and "$D$" as differentiation with respect to $x$, the identity $wf(x) = x^{m-n}\sum_k S_w(k) x^k D^k f(x)$, valid for any…

Combinatorics · Mathematics 2014-07-24 John Engbers , David Galvin , Justin Hilyard

Determining the total variation mixing time of Kac's random walk on the special orthogonal group $\mathrm{SO}(n)$ has been a long-standing open problem. In this paper, we construct a novel non-Markovian coupling for bounding this mixing…

Probability · Mathematics 2016-05-27 Natesh S. Pillai , Aaron Smith

Van der Waerden's classical theorem on arithmetic progressions states that for any positive integers k and r, there exists a least positive integer, w(k,r), such that any r-coloring of {1,2,...,w(k,r)} must contain a monochromatic k-term…

Combinatorics · Mathematics 2007-05-23 Bruce Landman , Aaron Robertson

We consider the problem of finding $A_2(n,\{d_1,d_2\})$ defined as the maximal size of a binary (non-linear) code of length $n$ with two distances $d_1$ and $d_2$. Binary codes with distances $d$ and $d+2$ of size…

Combinatorics · Mathematics 2024-02-22 Ivan Landjev , Konstantin Vorob'ev

Let $W_3(n)$ be the set of Waring ranks of reducible cubic forms in $n+1$ variables. We prove that $W_3(n)\subseteq \lbrace 1,..., 2n+1\rbrace$.

Algebraic Geometry · Mathematics 2014-12-18 Emanuele Ventura

For $0\leq k \leq n$, the number $C(n,k)$ represents the number of all lattice paths in the plane from the point $(0,0)$ to the point $(n,k)$, using steps $(1,0)$ and $(0,1)$, that never rise above the main diagonal $y=x$. The Fuss-Catalan…

Combinatorics · Mathematics 2025-03-10 Jovan Mikić

Let $A(n,d)$ (respectively $A(n,d,w)$) be the maximum possible number of codewords in a binary code (respectively binary constant-weight $w$ code) of length $n$ and minimum Hamming distance at least $d$. By adding new linear constraints to…

Information Theory · Computer Science 2012-12-17 Hyun Kwang Kim , Phan Thanh Toan

It is shown that a random $(0,1)$ matrix whose rows are independent random vectors of exactly $n/2$ zero components is non-singular with probability $1-O(n^{-C})$ for any $C>0$. The proof uses a non-standard inverse-type Littlewood-Offord…

Combinatorics · Mathematics 2011-12-06 Hoi H. Nguyen

In order to study $\mathbf{M}(R,C)$, the set of binary matrices with fixed row and column sums $R$ and $C$, we consider sub-matrices of the form $\begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix}$ and $\begin{pmatrix} 0 & 1 \\ 1 & 0…

Combinatorics · Mathematics 2024-01-09 David Ellison , Bertrand Jouve , Lewi Stone

Suppose that $A$ is a $k \times d$ matrix of integers and write $\mathfrak{R}_A:\mathbb{N} \rightarrow \mathbb{N}\cup \{ \infty\}$ for the function taking $r$ to the largest $N$ such that there is an $r$-colouring $\mathcal{C}$ of $[N]$…

Combinatorics · Mathematics 2020-10-14 Tom Sanders

It is shown by Karp reduction that deciding the singularity of $(2^n - 1) \times (2^n - 1)$ sparse circulant matrices (SC problem) is NP-complete. We can write them only implicitly, by indicating values of the $2 + n(n + 1)/2$ eventually…

Computational Complexity · Computer Science 2009-09-16 Ilia Toli

Let c(F) be the number of perfect pairs of F and c(G) be the maximum of c(F) over all (near-) one-factorizations F of G. Wagner showed that for odd n, c(K_{n}) \geq n*phi(n)/2 and for m and n which are odd and co-prime to each other,…

Discrete Mathematics · Computer Science 2014-12-23 V. Ch. Venkaiah , K. Ramanjaneyulu , Neelima Jampala , J. Rajendra Prasad

For $\mathbb N^*:=\mathbb N \setminus \{0\}$, we consider the collection $\mathfrak M(N)$ of all the $N$ rows, for which, for $n=1,\cdots,N$, the $n-th$ row consists of an increasing sequence $(a_j^n)_j$ of real numbers. For $\mathfrak A…

Combinatorics · Mathematics 2019-08-09 B. Helffer , T. Hoffmann-Ostenhof , P. Marquetand

In this paper we study boundedness of conjugation invariant norms on diffeomorphism groups of manifold pairs. For the diffeomorphism group ${\mathcal D} \equiv {\rm Diff}(M,N)_0$ of a closed manifold pair $(M, N)$ with $\dim N \geq 1$,…

Geometric Topology · Mathematics 2025-01-22 Kazuhiko Fukui , Tatsuhiko Yagasaki

In 1998 Kleinbock conjectured that any set of weighted badly approximable $d\times n$ real matrices is a winning subset in the sense of Schmidt's game. In this paper we prove this conjecture in full for vectors in $\mathbf{R}^d$ in…

Number Theory · Mathematics 2020-12-10 Victor Beresnevich , Erez Nesharim , Lei Yang

The Collatz sequence for a given natural number $N$ is generated by repeatedly applying the map $N$ $\rightarrow$ $3N+1$ if $N$ is odd and $N$ $\rightarrow$ $N/2$ if $N$ is even. One elusive open problem in Mathematics is whether all such…

General Mathematics · Mathematics 2019-11-11 Rafael Ruggiero

We study a generalisation of the quality of an ABC triple that we call the weighted average multiplicity (WAM), in which the logarithmic heights of prime factors are raised to a complex exponent s. The WAM is connected to the standard ABC…

Number Theory · Mathematics 2025-10-09 Viktor Mirjanić , Daattavya Aggarwal , Challenger Mishra

We construct commutative algebra spectra that represent the operator $K$-theory of $C^*$-algebras, which are algebras over the commutative ring spectra that represent topological $K$-theory. The spectral multiplicative structure introduces…

Operator Algebras · Mathematics 2022-03-08 R. Vasconcellos , L. C. P. A. M. Müssnich , N. J. B. Aza

Kaplansky conjectured that if two positive-definite real ternary quadratic forms have perfectly identical representations over $\mathbb{Z}$, they are constant multiples of regular forms, or is included in either of two families parametrized…

Number Theory · Mathematics 2019-09-04 Ryoko Oishi-Tomiyasu

Let $X$ be an $n$--element finite set, $0<k\leq n/2$ an integer. Suppose that $\{A_1,A_2\} $ and $\{B_1,B_2\} $ are pairs of disjoint $k$-element subsets of $X$ (that is, $|A_1|=|A_2|=|B_1|=|B_2|=k$, $A_1\cap A_2=\emptyset$, $B_1\cap…

Combinatorics · Mathematics 2015-03-03 Bela Bollobas , Zoltan Furedi , Ida Kantor , G. O. H. Katona , Imre Leader