English
Related papers

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

200 papers

Let $G$ be a finite permutation group on $\Omega$. An ordered sequence of elements of $\Omega$, $(\omega_1,\dots, \omega_t)$, is an irredundant base for $G$ if the pointwise stabilizer $G_{(\omega_1,\dots, \omega_t)}$ is trivial and no…

Group Theory · Mathematics 2021-02-26 Andrea Lucchini , Marta Morigi , Mariapia Moscatiello

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 paper, we determine the $6$-girth-thickness $\theta(6,K_n)$ of the complete graph $K_n$ in…

It is shown that if $G$ is a primitive permutation group on a set of size $n$, then any nilpotent quotient of $G$ has order at most $n^{\beta}$ and any solvable quotient of $G$ has order at most $n^{\alpha+1}$ where $\beta=\log 32/ \log 9$…

Group Theory · Mathematics 2013-11-19 Thomas Michael Keller , Yong Yang

The 2-girth of a 2-dimensional simplicial complex $X$ is the minimum size of a non-zero 2-cycle in $H_2(X, \mathbb{Z}/2)$. We consider the maximum possible girth of a complex with $n$ vertices and $m$ 2-faces. If $m = n^{2 + \alpha}$ for…

Algebraic Topology · Mathematics 2017-07-11 Dominic Dotterrer , Larry Guth , Matthew Kahle

Let $G$ be a permutation group on a finite set $\Omega$. The base size of $G$ is the minimal size of a subset of $\Omega$ with trivial pointwise stabiliser in $G$. In this paper, we extend earlier work of Fawcett by determining the precise…

Group Theory · Mathematics 2023-11-14 Hong Yi Huang

The primitive curves are the multiple curves that can be locally embedded in smooth surfaces (we will always suppose that the associated reduced curves are smooth). These curves have been defined and studied by C. Banica and O.Forster in…

Algebraic Geometry · Mathematics 2015-06-03 Jean-Marc Drézet

A famous conjecture of Artin states that there are infinitely many prime numbers for which a fixed integer $g$ is a primitive root, provided $g \neq -1$ and $g$ is not a perfect square. Thanks to work of Hooley, we know that this conjecture…

Number Theory · Mathematics 2015-04-16 Lee Troupe

In Communication theory and Coding, it is expected that certain circulant matrices having $k$ ones and $k+1$ zeros in the first row are nonsingular. We prove that such matrices are always nonsingular when $2k+1$ is either a power of a…

Commutative Algebra · Mathematics 2020-12-21 Zhangchi Chen

A $k$-regular graph of girth $g$ is called edge-girth-regular graph, shortly egr-graph, if each of its edges is contained in exactly $\lambda$ distinct $g-$cycles. An egr-graph is called extremal for the triple $(k, g, \lambda)$ if has the…

Combinatorics · Mathematics 2024-01-30 Gabriela Araujo-Pardo , György Kiss , István Porupsánszki

We say a natural number~$n$ is abundant if $\sigma(n)>2n$, where $\sigma(n)$ denotes the sum of the divisors of~$n$. The aliquot parts of~$n$ are those divisors less than~$n$, and we say that an abundant number~$n$ is pseudoperfect if there…

Number Theory · Mathematics 2015-04-13 Douglas E. Iannucci

We provide an explicit construction of finite 4-regular graphs $(\Gamma_k)_{k\in \mathbb N}$ with ${girth \Gamma_k\to\infty}$ as $k\to\infty$ and $\frac{diam \Gamma_k}{girth \Gamma_k}\leqslant D$ for some $D>0$ and all $k\in\mathbb{N}$. For…

Group Theory · Mathematics 2022-08-25 Goulnara Arzhantseva , Arindam Biswas

A subset of $\{1,2,\ldots,2n\}$ is said to be primitive if it does not contain any pair of elements $(u,v)$ such that $u$ is a divisor of $v$. Let $D(n)$ denote the number of primitive subsets of $\{1,2,\ldots,2n\}$ with $n$ elements.…

Combinatorics · Mathematics 2018-04-06 Sujith Vijay

A 2-structure on a set $S$ is given by an equivalence relation on the set of ordered pairs of distinct elements of $S$. A subset $C$ of $S$, any two elements of which appear the same from the perspective of each element of the complement of…

Combinatorics · Mathematics 2014-01-28 Abderrahim Boussaïri , Pierre Ille , Robert E. Woodrow

We look at Bohemian matrices, specifically those with entries from $\{-1, 0, {+1}\}$. More, we specialize the matrices to be upper Hessenberg, with subdiagonal entries $1$. Even more, we consider Toeplitz matrices of this kind. Many…

Symbolic Computation · Computer Science 2018-10-01 Eunice Y. S. Chan , Robert M. Corless , Laureano Gonzalez-Vega , J. Rafael Sendra , Juana Sendra , Steven E. Thornton

We describe the pronilpotent quotients of a class of projective profinite groups, that we call $\omega$-presented groups, defined using a special type of presentations. The pronilpotent quotients of an $\omega$-presented group are…

Group Theory · Mathematics 2022-12-20 Herman Goulet-Ouellet

Following the Perron-Frobenius theorem, the spectral radius of a primitive matrix is a simple eigenvalue. It is shown that for a primitive matrix $A$, there is a positive rank one matrix $X$ such that $B = A \circ X$, where $\circ$ denotes…

Numerical Analysis · Mathematics 2020-07-21 Doulaye Dembélé

Let $\Gamma=(G,\sigma)$ be a signed graph and $A(G,\sigma)$ be its adjacency matrix. Denote by $gr(G)$ the girth of $G$, which is the length of the shortest cycle in $G$. Let $r(G,\sigma)$ be the rank of $(G,\sigma)$. In this paper, we will…

Combinatorics · Mathematics 2021-09-08 Yong Lu , Qi Wu

We consider a modification of the classical number theoretic question about the gaps between consecutive primitive roots modulo a prime $p$, which by the well-known result of Burgess are known to be at most $p^{1/4+o(1)}$. Here we measure…

Number Theory · Mathematics 2012-07-05 Rainer Dietmann , Christian Elsholtz , Igor E. Shparlinski

We show that the abelian girth of a graph is at least three times its girth. We prove an analogue of the Moore bound for the abelian girth of regular graphs, where the degree of the graph is fixed and the number of vertices is large. We…

Combinatorics · Mathematics 2015-11-13 Joel Friedman , Alice Izsak , Lior Silberman

A set of integers is \emph{primitive} if it does not contain an element dividing another. Denote by $f(n)$ the number of maximum-size primitive subsets of $\{1,\ldots, 2n\}$. We prove that the limit $\alpha=\lim_{n\rightarrow…

Combinatorics · Mathematics 2023-06-22 Hong Liu , Péter Pál Pach , Richárd Palincza
‹ Prev 1 3 4 5 6 7 10 Next ›