English
Related papers

Related papers: The kth Upper Bases of Primitive Non-powerful Sign…

200 papers

Let $\mathbb{N}$ denote the set of all nonnegative integers and $A$ be a subset of $\mathbb{N}$. Let $h\geq2$ and let $r_h(A,n)=\sharp \{ (a_1,\ldots,a_h)\in A^{h}: a_1+\cdots+a_h=n\}.$ The set $A$ is called an asymptotic basis of order $h$…

Number Theory · Mathematics 2018-10-29 Min Tang , Deng-Rong Ling

Let $\zeta_K(s)$ denote the Dedekind zeta-function associated to a number field $K$. In this paper, we give an effective upper bound for the height of first non-trivial zero other than $1/2$ of $\zeta_K(s)$ under the generalized Riemann…

Number Theory · Mathematics 2025-07-29 Sushant Kala

Signed graphs are studied since the middle of the last century. Recently, the notion of homomorphism of signed graphs has been introduced since this notion captures a number of well known conjectures which can be reformulated using the…

Discrete Mathematics · Computer Science 2014-01-15 Pascal Ochem , Alexandre Pinlou , Sagnik Sen

In a recent work, A. Berger and C. Defant showed that if $x$ is a fixed point of a binary uniform and primitive morphism, then there exists a constant $C$ such that for all positive integers $i,k,$ beginning in position $n$ in $x$ is a…

Combinatorics · Mathematics 2019-10-08 Mickaël Postic

The unipotent subgroup of a finite group of Lie type over a prime field Z/pZ comes equipped with a natural set of generators; the properties of the Cayley graph associated to this set of generators have been much studied. In the present…

Group Theory · Mathematics 2007-05-23 Jordan S. Ellenberg , Julianna S. Tymoczko

Problem of finding an optimal upper bound for {\chi} of (3 Times K1)-free graphs is still open and pretty hard. It was proved by Choudum et al that upper bound on the {\chi} of {3 Times K1, {2 Times K1 + (K2 UNION K1)}-free graphs is…

Combinatorics · Mathematics 2015-04-28 Medha Dhurandhar

A modified Dirichlet character $f$ is a completely multiplicative function such that for some Dirichlet character $\chi$, $f(p)=\chi(p)$ for all but a finite number of primes $p\in S$, and for those exceptional primes $p\in S$, $|f(p)|\leq…

Number Theory · Mathematics 2025-03-25 Marco Aymone , Ana Paula Chaves , Maria Eduarda Ramos

A pair of orthonormal bases is called mutually unbiased if all mutual overlaps between any element of one basis with an arbitrary element of the other basis coincide. In case the dimension, $d$, of the considered Hilbert space is a power of…

Quantum Physics · Physics 2013-11-27 Christoph Spengler , Barbara Kraus

Following the recent paper which initiated the study of colour isomorphism problems for complete graphs, we obtain upper bounds for $f_2(n,H)$ for a family of graphs $H$ obtained as the $K_0$-th rooted power of a balanced rooted tree for…

Combinatorics · Mathematics 2022-01-05 Xiao-Chuan Liu , Xu Yang

We give upper bounds on the order of the automorphism group of a simple graph

Combinatorics · Mathematics 2007-05-23 Ilia Krasikov , Arie Lev , Bhalchandra D. Thatte

For signed graphs we provide a cubic polynomial upper bound on the multiplicity of its eigenvalues. We show that this bound is sharp by providing examples of signed graphs in which it is attained. We also discuss particular cases in which…

Combinatorics · Mathematics 2019-11-05 Farzaneh Ramezani , Peter Rowlinson , Zoran Stanic

Unitary graphs are arc-transitive graphs with vertices the flags of Hermitian unitals and edges defined by certain elements of the underlying finite fields. They played a significant role in a recent classification of a class of…

Combinatorics · Mathematics 2015-03-25 Sanming Zhou

An improved upper bound is obtained for the density of sequences of positive integers that contain no k-term geometric progression.

Number Theory · Mathematics 2014-01-03 Melvyn B. Nathanson , Kevin O'Bryant

We introduce a lower bound for the independence number of an arbitrary $k$-uniform hypergraph that only depends on the number of vertices and number of edges of the hypergraph.

Combinatorics · Mathematics 2025-02-18 Marco Aldi , Thor Gabrielsen , Daniele Grandini , Joy Harris , Kyle Kelley

We use Maynard's methods to show that there are bounded gaps between primes in the sequence $\{\lfloor n\alpha\rfloor\}$, where $\alpha$ is an irrational number of finite type. In addition, given a superlinear function $f$ satisfying some…

Number Theory · Mathematics 2014-07-08 Lynn Chua , Soohyun Park , Geoffrey D. Smith

We study $G$-vertex-primitive and $(G,s)$-arc-transitive digraphs for almost simple groups $G$ with socle $\mathrm{PSL}_n(q)$. It turns out that $s\leqslant2$ for such digraphs, which provides the first step in determining an upper bound on…

Combinatorics · Mathematics 2019-04-18 Michael Giudici , Cai Heng Li , Binzhou Xia

In this work, we determine a sharp upper bound on the orthogonality defect of HKZ reduced bases up to dimension $3$. Using this result, we determine a general upper bound for the orthogonality defect of HKZ reduced bases of arbitrary rank.…

Number Theory · Mathematics 2022-08-24 Christian Porter , Edmund Dable-Heath , Cong Ling

We introduce a notion of a girth-regular graph as a $k$-regular graph for which there exists a non-descending sequence $(a_1, a_2, \dots, a_k)$ (called the signature) giving, for every vertex $u$ of the graph, the number of girth cycles the…

Combinatorics · Mathematics 2019-11-05 Primož Potočnik , Janoš Vidali

In this paper we introduce primigraph spaces, which are topological spaces together with a sheaf of $C^*$-algebras that can be covered by some Prim A's, that is, by the primitive spectra of some $C^*$-algebras endowed with Jacobson topology…

Operator Algebras · Mathematics 2020-05-18 Manuel Norman

Nonstandard graphs have been defined and examined in prior works. The present work does the same for nonstandard digraphs. Since digraphs have more structure than do graphs, the present discussion requires more complicated definitions and…

Combinatorics · Mathematics 2009-04-28 A. H. Zemanian
‹ Prev 1 4 5 6 7 8 10 Next ›