中文
相关论文

相关论文: On the Density of the Set of Known Hadamard Orders

200 篇论文

Let $\Gamma$ be a discrete group acting by isometries on a product $X=X_1\times X_2$ of Hadamard spaces. We further require that $X_1$, $X_2$ are locally compact and $\Gamma$ contains two elements projecting to a pair of independent rank…

度量几何 · 数学 2011-07-20 Gabriele Link

Why are materials with specific characteristics more abundant than others? This is a fundamental question in materials science and one that is traditionally difficult to tackle, given the vastness of compositional and configurational space.…

材料科学 · 物理学 2023-07-28 Elena Gazzarrini , Rose K. Cersonsky , Marnik Bercx , Carl S. Adorf , Nicola Marzari

For a fixed rational number g, not equal to -1,0 or 1 and integers a and d we consider the set of primes p for which the order of g(mod p) is congruent to a(mod d). For d=4 and d=3 it is shown that, under the Generalized Riemann Hypothesis,…

数论 · 数学 2016-09-07 Pieter Moree

In our previous work, we introduced the following relaxation of the Hadamard property: a square matrix $H\in M_N(\mathbb R)$ is called "almost Hadamard" if $U=H/\sqrt{N}$ is orthogonal, and locally maximizes the 1-norm on O(N). We review…

组合数学 · 数学 2013-09-17 Teodor Banica , Ion Nechita

We consider a Wigner-type ensemble, i.e. large hermitian $N\times N$ random matrices $H=H^*$ with centered independent entries and with a general matrix of variances $S_{xy}=\mathbb E|H_{xy}|^2$. The norm of $H$ is asymptotically given by…

概率论 · 数学 2018-02-15 László Erdős , Peter Mühlbacher

For $\lambda \in (1/2, 1)$ and $\alpha$, we consider sets of numbers $x$ such that for infinitely many $n$, $x$ is $2^{-\alpha n}$-close to some $\sum_{i=1}^n \omega_i \lambda^i$, where $\omega_i \in \{0,1\}$. These sets are in Falconer's…

数论 · 数学 2014-01-14 Tomas Persson , Henry W. J. Reeve

We consider the set ${\mathscr S}_Q$ of Farey fractions $d/b$ of order $Q$ with the property that there exists a matrix $\left( \begin{smallmatrix} a & b \\ c & d \end{smallmatrix} \right) \in \operatorname{SL}(2,{\mathbb Z})$ of trace at…

We analyze the asymptotic convergence of all infinite products of matrices taken in a given finite set, by looking only at finite or periodic products. It is known that when the matrices of the set have a common nonincreasing polyhedral…

离散数学 · 计算机科学 2016-10-14 Pierre-Yves Chevalier , Julien M. Hendrickx , Raphaël M. Jungers

We introduce a construction that, given a pair (u,v) of complex Hadamard matrices of the same order, generates infinitely many biunitary matrices of varying (and distinct) orders. As a key application, this framework yields nested sequences…

算子代数 · 数学 2026-01-16 Keshab Chandra Bakshi , Satyajit Guin , Guruprasad

Let $\mathbf{S}$ be the set of all finite or infinite increasing sequences of positive integers. For a sequence $S=\{s(n)\}, n\geq1,$ from $\mathbf{S},$ let us call a positive number $N$ an exponentially $S$-number $(N\in E(S)),$ if all…

数论 · 数学 2016-01-21 Vladimir Shevelev

Let $P(n)$ be the number of polyominoes of $n$ cells and $\lambda$ be Klarner's constant, that is, $\lambda=\lim_{n\to\infty} \sqrt[n]{P(n)}$. We show that there exist some positive numbers $A,T$, so that for every $n$ \[ P(n) \ge…

组合数学 · 数学 2025-07-15 Vuong Bui

Considered is the multiplicative semigroup of ratios of products of principal minors bounded over all positive definite matrices. A long history of literature identifies various elements of this semigroup, all of which lie in a…

组合数学 · 数学 2008-06-17 H. Tracy Hall , Charles R. Johnson

Matrix rigidity is a notion put forth by Valiant as a means for proving arithmetic circuit lower bounds. A matrix is rigid if it is far, in Hamming distance, from any low rank matrix. Despite decades of efforts, no explicit matrix rigid…

计算复杂性 · 计算机科学 2017-08-08 Zeev Dvir , Benjamin Edelman

Let S be a polynomial ring in n variables over a field, and let M be a monomial ideal of S. We introduce a new invariant, called the order of dominance of S/M, denoted odom(S/M), which has many similarities with the codimension of S/M. We…

交换代数 · 数学 2019-08-12 Guillermo Alesandroni

We consider the set $\mathcal M_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain upper bounds on the number of matrices from $\mathcal M_n(\mathbb Z; H)$, for which the characteristic polynomial…

数论 · 数学 2026-03-26 Alina Ostafe , Igor E. Shparlinski

We construct many symmetric Hadamard matrices of small order by using the so called propus construction. The necessary difference families are constructed by restricting the search to the families which admit a nontrivial multiplier. Our…

组合数学 · 数学 2024-01-23 N. A. Balonin , D. Z. Djokovic

We study the Pascal determinantal arrays $\PD_k$, whose entries $\PD_k(i,j)$ are the $k\times k$ minors of the lower-triangular Pascal matrix $P=( \binom{a}{b} )_{a,b\ge 0}$. We prove an exact factorization of the row-wise log-concavity…

组合数学 · 数学 2026-01-27 Hossein Teimoori Faal , Hasan Khodakarami

We prove the density of the sets of the form ${{\lambda}_1^m {\mu}_1^n {\xi}_1 +...+{\lambda}_k^m {\mu}_k^n {\xi}_k : m,n \in \mathbb N}$ modulo one, where $\lambda_i$ and $\mu_i$ are multiplicatively independent algebraic numbers…

动力系统 · 数学 2011-09-02 Alexander Gorodnik , Shirali Kadyrov

We introduce the class of partition-balanced families of codes, and show how to exploit their combinatorial invariants to obtain upper and lower bounds on the number of codes that have a prescribed property. In particular, we derive precise…

信息论 · 计算机科学 2018-12-13 Eimear Byrne , Alberto Ravagnani

In this study, the author establish some inequalities of Hadamard like based on convex and s-convexity in the second sense. Some applications to special means of positive real numbers are also given.

经典分析与常微分方程 · 数学 2014-02-03 Mevlut Tunc