中文
相关论文

相关论文: The Redheffer matrix of a partially ordered set

200 篇论文

Say that A is a Hadamard factorization of the identity I_n of size n if the entrywise product of A and the transpose of A is I_n. It can be easily seen that the rank of any Hadamard factorization of the identity must be at least sqrt{n}.…

计算复杂性 · 计算机科学 2013-10-29 Aya Hamed , Troy Lee

Let $X$ be a reduced complex space of pure dimension. We consider divergent integrals of certain forms on $X$ that are singular along a subvariety defined by the zero set of a holomorphic section of some holomorphic vector bundle $E…

复变函数 · 数学 2024-04-26 Ludvig Svensson

We formulate the problem of finding the probability that the determinant of a matrix undergoes the least change upon perturbation of one of its elements, provided that most or all of the elements of the matrix are chosen at random and that…

离散数学 · 计算机科学 2008-05-15 Genta Ito

Let $f$ be a normalized Hecke eigenform with rational integer Fourier coefficients. It is an interesting question to know how often an integer $n$ has a factor common with the $n$-th Fourier coefficient of $f$. The second author…

数论 · 数学 2014-03-20 Sanoli Gun , V. Kumar Murty

We consider partial symmetric Toeplitz matrices where a positive definite completion exists. We characterize those patterns where the maximum determinant completion is itself Toeplitz. We then extend these results with positive definite…

最优化与控制 · 数学 2018-02-05 Stefan Sremac , Hugo J. Woerdeman , Henry Wolkowicz

This paper investigates the relationship between the Riemann hypothesis and the statement $\forall n, ~g(n) \le e^{\sqrt{p_n}}$, where $g(n)$ is the maximum order of an element of $S_n$, the symmetric group on $n$ elements, and $p_n$ is the…

数论 · 数学 2024-08-27 Will Cavendish , Jacob Tsimerman

Denote by $A_n$ the set of square $(0,1)$ matrices of order $n$. The set $A_n$, $n\le8$, is partitioned into row/column permutation equivalence classes enabling derivation of various facts by simple counting. For example, the number of…

组合数学 · 数学 2007-05-23 Miodrag Živković

We present a new approach to obtaining the lower order terms for $n$-correlation of the zeros of the Riemann zeta function. Our approach is based on the `ratios conjecture' of Conrey, Farmer, and Zirnbauer. Assuming the ratios conjecture we…

数论 · 数学 2008-03-20 J. B. Conrey , N. C. Snaith

We define a family {$\gamma(P)$} of generalized Euler constants indexed by finite sets of primes $P$ and study their distribution. These arise from partial sums of reciprocals of integers not divisible by any prime in $P$. An apparent…

数论 · 数学 2019-05-01 Harold G. Diamond , Kevin Ford

We show that a matrix is a Hermitian positive semidefinite matrix whose nonzero entries have modulus 1 if and only if it similar to a direct sum of all $1's$ matrices and a 0 matrix via a unitary monomial similarity. In particular, the only…

环与代数 · 数学 2007-05-23 Daniel Hershkowitz , Michael Neumann , Hans Schneider

We define a sequence of positive integers recursively, where each term is determined as follows: starting with a given positive integer, if the term is odd, the next is the sum of its positive divisors; if the term is even, the subsequent…

数论 · 数学 2025-06-04 Ritesh Dwivedi , Rohit Yadav

This paper is divided into two independent parts. The first part presents new integral and series representations of the Riemaan zeta function. An equivalent formulation of the Riemann hypothesis is given and few results on this formulation…

综合数学 · 数学 2015-03-14 Lazhar Fekih-Ahmed

In this paper we explore a family of congruences over $\N^\ast$ from which one builds a sequence of symmetric matrices related to the Mertens function. From the results of numerical experiments, we formulate a conjecture about the growth of…

数论 · 数学 2009-03-09 Jean-Paul Cardinal

Consider a semi-algebraic set A in R^d constructed from the sets which are determined by inequalities p_i(x)>0, p_i(x)\ge 0, or p_i(x)=0 for a given list of polynomials p_1,...,p_m. We prove several statements that fit into the following…

代数几何 · 数学 2008-05-06 Gennadiy Averkov

In this paper, we present an improvement for the problem of deterministically finding an element of large multiplicative order modulo some integer $N$. This problem arises as a key subroutine in current deterministic factoring algorithms,…

数据结构与算法 · 计算机科学 2026-05-12 Itamar Nir

Let $D(n)$ be the maximal determinant for $n \times n$ $\{\pm 1\}$-matrices, and ${\mathcal R}(n) = D(n)/n^{n/2}$ be the ratio of $D(n)$ to the Hadamard upper bound. We give several new lower bounds on ${\mathcal R}(n)$ in terms of $d$,…

组合数学 · 数学 2016-10-26 Richard P. Brent , Judy-anne H. Osborn , Warren D. Smith

We establish a bijection between the set of finite topological $T_0$-spaces (or partially ordered sets) and equivalence classes of square matrices. The absolute value of the determinant or the rank of these matrices serve as simple homotopy…

代数拓扑 · 数学 2025-12-03 Pedro J. Chocano

Let H be a positive semidefinite matrix partitioned into Hermitian blocks. Then, up to a direct sum operation, H is the average of matrices isometrically congruent to its partial trace. A few corollaries are given, related to important…

泛函分析 · 数学 2012-10-12 Jean-Christophe Bourin , Eun-Young Lee

We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…

In this paper we report on new results relating to a conjecture regarding properties of $n\times n$, $n\leq 6$, positive definite matrices. The conjecture has been proven for $n\leq 4$ using computer-assisted sum of squares (SoS) methods…

符号计算 · 计算机科学 2023-09-06 Jeffrey Uhlmann