English
Related papers

Related papers: Hadamard matrices modulo p and small modular Hadam…

200 papers

It is well known that for any prime $p\equiv 3$ (mod $4$), the class numbers of the quadratic fields $\mathbb{Q}(\sqrt{p})$ and $\mathbb{Q}(\sqrt{-p})$, $h(p)$ and $h(-p)$ respectively, are odd. It is natural to ask whether there is a…

Number Theory · Mathematics 2014-12-02 Lynn Chua , Benjamin Gunby , Soohyun Park , Allen Yuan

In this paper we will consider new bounds on the smallest primitive root modulo a prime. We will make more judicious use of the P\`olya--Vinogradov and Burgess inequalities, and use them to prove that the smallest primitive root is smaller…

Number Theory · Mathematics 2018-03-30 Jana Pretorius

Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also give applications and connections to polynomial identity…

Computational Complexity · Computer Science 2009-07-24 V. Arvind , Pushkar S. Joglekar , Srikanth Srinivasan

We propose a novel constructive framework for approaching the Hodge Conjecture via explicit degenerations. Building on limiting mixed Hodge structures (LMHS), we formulate a criterion under which a rational class of type (p, p) on a smooth…

Algebraic Geometry · Mathematics 2025-07-22 Badre Mounda

We study self-adjoint matrix polynomial equations in a single variable and prove existence of self-adjoint solutions under some assumptions on the leading form. Our main result is that any self-adjoint matrix polynomial equation of odd…

Rings and Algebras · Mathematics 2016-08-16 Tim Netzer , Andreas Thom

In this paper, if prime $p\equiv 3\pmod 4$ is sufficiently large then we prove an upper bound on the number of occurences of any arbitrary pattern of quadratic residues and nonresidues of length $k$ as $k$ tends to $\lceil \log_2 p\rceil$.…

Number Theory · Mathematics 2022-01-25 Shivarajkumar

Let $Q(x,y)$ be a quadratic form with discriminant $D\neq 0$. We obtain non trivial upper bound estimates for the number of solutions of the congruence $Q(x,y)\equiv\lambda \pmod{p}$, where $p$ is a prime and $x,y$ lie in certain intervals…

Number Theory · Mathematics 2011-02-08 Ana Zumalacárregui

In this paper, we mainly study structure of multiplicative simple Hom-Jordan algebras. We talk about equivalent conditions for multiplicative Hom-Jordan algebras being solvable, simple and semi-simple. As an application, we give a theorem…

Rings and Algebras · Mathematics 2020-03-09 Chenrui Yao , Yao Ma , Liangyun Chen

A multivariate polynomial is stable if it is non-vanishing whenever all variables have positive imaginary parts. A matroid has the weak half-plane property (WHPP) if there exists a stable polynomial with support equal to the set of bases of…

Combinatorics · Mathematics 2012-04-18 Petter Brändén , Rafael S. González D'León

We consider the problem of determining which matrices are permutable to be supmodular. We show that for small dimensions any matrix is permutable by a universal permutation or by a pair of permutations, while for higher dimensions no…

Combinatorics · Mathematics 2024-09-13 Shmuel Onn

We will show that in a space of dimension $m$, any family of $2^{m-1}$ distinct Hadamard vectors (where you can choose x or -x but not both) can be partitioned into Hadamard matrices if and only if $m=2^n$ for some n. We will solve this…

Combinatorics · Mathematics 2016-03-02 Peter G. Casazza , Janet C. Tremain

We study reducing invariants of modules related to certain homological properties. For modules of finite reducing projective dimension, we establish grade inequalities. We prove that if $\mathbb{P}$ is the (uniform) Auslander condition, or…

Commutative Algebra · Mathematics 2026-04-15 Tokuji Araya , Naoya Hiramatsu , Ryo Takahashi

We establish the $\#P$-hardness of computing a broad class of immanants, even when restricted to specific categories of matrices. Concretely, we prove that computing $\lambda$-immanants of $0$-$1$ matrices is $\#P$-hard whenever the…

Computational Complexity · Computer Science 2025-11-21 Istvan Miklos , Cordian Riener

A Hurwitz stable polynomial of degree $n\geq1$ has a Hadamard factorization if it is a Hadamard product (i.e. element-wise multiplication) of two Hurwitz stable polynomials of degree $n$. It is known that Hurwitz stable polynomials of…

Classical Analysis and ODEs · Mathematics 2020-01-10 Stanisław Białas , Michał Góra

A classical problem in analytic number theory is to study the distribution of $\alpha p$ modulo 1, where $\alpha$ is irrational and $p$ runs over the set of primes. We consider the subsequence generated by the primes $p$ such that $p+2$ is…

Number Theory · Mathematics 2007-11-07 T. L. Todorova , D. I. Tolev

Let ${{\overline{p}}_{3}}(n)$ be the number of overpartition triples of $n$. By elementary series manipulations, we establish some congruences for ${\overline{p}}_{3}(n)$ modulo small powers of 2, such as…

Number Theory · Mathematics 2015-05-13 Liuquan Wang

We give a method for producing explicit bounds on $g(p)$, the least primitive root modulo $p$. Using our method we show that $g(p)<2r\,2^{r\omega(p-1)}\,p^{\frac{1}{4}+\frac{1}{4r}}$ for $p>10^{56}$ where $r\geq 2$ is an integer parameter.…

Number Theory · Mathematics 2019-04-30 Kevin J. McGown , Tim Trudgian

In this paper, we consider sums of class numbers of the type $\sum_{m\equiv a\pmod{p}} H(4n-m^2)$, where $p$ is an odd prime, $n\in \mathbb{N},$ and $a\in \mathbb{Z}$. By showing that these are coefficients of mixed mock modular forms, we…

Number Theory · Mathematics 2019-08-15 Kathrin Bringmann , Ben Kane

Let $p$ be a prime such that the multiplicative order $m$ of $2$ modulo $p$ is even. We prove that the integral group ring $\mathbb{Z}[Q_8 \times C_p]$ has the multiplicative Jordan decomposition property when $m$ is congruent to $2$ modulo…

Rings and Algebras · Mathematics 2020-03-03 Wentang Kuo , Wei-Liang Sun

The rigidity of a matrix describes the minimal number of entries one has to change to reduce matrix's rank to r. We give very simple combinatorial proof of the lower bound for the rigidity of Sylvester (special case of Hadamard) matrix that…

Computational Complexity · Computer Science 2007-05-23 Gatis Midrijanis
‹ Prev 1 8 9 10 Next ›