English
Related papers

Related papers: Exponents of the primitive Boolean matrices with f…

200 papers

This monograph considers a few topics in the theory of primitive roots g(p) modulo a prime p>=2. A few estimates of the least primitive roots g(p) and the least prime primitive roots g^*(p) modulo p, a large prime, are determined. One of…

General Mathematics · Mathematics 2015-03-13 N. A. Carella

In this paper, we first investigate the relationship between the number of primitive representations of $n$ by quadratic forms and the number of non-primitive ones. We hence obtain a theorem to deal with the Eisenstein series part with…

Number Theory · Mathematics 2024-11-27 Ben Kane , Luhao Xue

If p is a prime, then the numbers 1, 2, ..., p-1 form a group under multiplication modulo p. A number g that generates this group is called a primitive root of p; i.e., g is such that every number between 1 and p-1 can be written as a power…

Logic in Computer Science · Computer Science 2022-05-25 Ruben Gamboa , Woodrow Gamboa

In this paper, we define the $4$-girth-thickness $\theta(4,G)$ of a graph $G$ as the minimum number of planar subgraphs of girth at least $4$ whose union is $G$. We obtain the $4$-girth-thickness of the arbitrary complete graph $K_n$…

Combinatorics · Mathematics 2018-10-03 Christian Rubio-Montiel

An integral quadratic form is called strictly $n$-regular if it primitively represents all quadratic forms in $n$ variables that are primitively represented by its genus. For any $n \geq 2$, it will be shown that there are only finitely…

Number Theory · Mathematics 2017-06-14 Wai Kiu Chan , Alicia Marino

An edge-girth-regular graph $egr(v,k,g,\lambda)$, is a $k$-regular graph of order $v$, girth $g$ and with the property that each of its edges is contained in exactly $\lambda$ distinct $g$-cycles. An $egr(v,k,g,\lambda)$ is called extremal…

Combinatorics · Mathematics 2021-08-17 Araujo-Pardo Gabriela , Leemans Dimitri

The cogirth, $g^\ast(M)$, of a matroid $M$ is the size of a smallest cocircuit of $M$. Finding the cogirth of a graphic matroid can be done in polynomial time, but Vardy showed in 1997 that it is NP-hard to find the cogirth of a binary…

Combinatorics · Mathematics 2021-06-03 Cameron Crenshaw , James Oxley

In 1973 Erdos asked whether there are n-vertex partial Steiner triple systems with arbitrary high girth and quadratically many triples. (Here girth is defined as the smallest integer g \ge 4 for which some g-element vertex-set contains at…

Combinatorics · Mathematics 2019-12-09 Tom Bohman , Lutz Warnke

The border rank of the matrix multiplication operator for n by n matrices is a standard measure of its complexity. Using techniques from algebraic geometry and representation theory, we show the border rank is at least 2n^2-n. Our bounds…

Computational Complexity · Computer Science 2013-06-04 J. M. Landsberg , Giorgio Ottaviani

Multiplicative order of an element $a$ of group $G$ is the least positive integer $n$ such that $a^n=e$, where $e$ is the identity element of $G$. If the order of an element is equal to $|G|$, it is called generator or primitive root. This…

Symbolic Computation · Computer Science 2014-10-07 Shri Prakash Dwivedi

We give an asymptotic expression for the number of nonsingular integer n-by-n-matrices with primitive row vectors, determinant k, and Euclidean matrix norm less than T, for large T. We also investigate the density of matrices with primitive…

Number Theory · Mathematics 2013-09-03 Samuel Holmin

Let $K$ be a proper (i.e., closed, pointed, full convex) cone in ${\Bbb R}^n$. An $n\times n$ matrix $A$ is said to be $K$-primitive if there exists a positive integer $k$ such that $A^k(K \setminus \{0 \}) \subseteq$ int $K$; the least…

Dynamical Systems · Mathematics 2009-02-27 Raphael Loewy , Bit-Shun Tam

We study representations of the central extension of the Lie algebra of differential operators on the circle, the W-infinity algebra. We obtain complete and specialized character formulas for a large class of representations, which we call…

High Energy Physics - Theory · Physics 2009-10-28 E. Frenkel , V. Kac , A. Radul , W. Wang

Let $C$ be a smooth curve with gonality $k\ge 6$ and genus $g\ge 2k^2+5k-6$. We prove that $W^1_d({C})$ has the expected dimension and that the general element of any irreducible component of $W^1_d({C})$ is primitive if either $g-k+4\le…

Algebraic Geometry · Mathematics 2016-01-12 E. Ballico

The $g$-girth-thickness $\theta(g,G)$ of a graph $G$ is the minimum number of planar subgraphs of girth at least $g$ whose union is $G$. In this note, we give the $4$-girth-thickness $\theta(4,L(K_n))$ of the line graph of the complete…

Combinatorics · Mathematics 2022-01-21 Christian Rubio-Montiel

In this paper, we prove: Let A be a nonnegative primitive tensor with order m and dimension n. Then its primitive degree R(A)\leq (n-1)^2+1, and the upper bound is sharp. This confirms a conjecture of Shao [7].

Combinatorics · Mathematics 2016-11-25 Pingzhi Yuany , Zilong He , Lihua You

We develop a new, group-theoretic approach to bounding the exponent of matrix multiplication. There are two components to this approach: (1) identifying groups G that admit a certain type of embedding of matrix multiplication into the group…

Group Theory · Mathematics 2012-03-15 Henry Cohn , Christopher Umans

For a positive integer $m$, a (positive definite integral) quadratic form is called primitively $m$-universal if it primitively represents all quadratic forms of rank $m$. It was proved in arXiv:2202.13573 that there are exactly $107$…

Number Theory · Mathematics 2023-09-06 Byeong-Kweon Oh , Jongheun Yoon

Let $\pi$ be an irreducible, cuspidal automorphic representation of $GL_n(\mathbb{A}_\mathbb{Q})$ ($n\geq 3$), which is tempered only for $n=3$. Let $s$ be a complex number such that $\Re(s)\notin \left[1/n, 1-1/n\right]$ if $n\neq 4$;…

Number Theory · Mathematics 2026-04-28 Sayan Ghosh , Pratim Mitra

A nonempty subset A of {1,2,...,n} is called primitive if gcd(A)=1. Let f(n) and f_k(n) denote, respectively, the number of primitive subsets and the number of primitive subsets of cardinality k of {1,2,...,n}. Recursion formulas and…

Number Theory · Mathematics 2007-09-17 Melvyn B. Nathanson