English
Related papers

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

200 papers

In this paper, we give a series of couterexamples to negate a conjecture and hence answer an open question on the $k$-power domination of regular graphs (see [P. Dorbec et al., SIAM J. Discrete Math., 27 (2013), pp. 1559-1574]).…

Combinatorics · Mathematics 2020-10-26 Hangdi Chen , Changhong Lu , Qingjie Ye

A long-standing conjecture by Heath, Pemmaraju, and Trenk states that the upward book thickness of outerplanar DAGs is bounded above by a constant. In this paper, we show that the conjecture holds for subfamilies of upward outerplanar…

Discrete Mathematics · Computer Science 2021-08-30 Sujoy Bhore , Giordano Da Lozzo , Fabrizio Montecchiani , Martin Nöllenburg

The Erd\H{o}s-Rogers function $f_{s,t}$ measures how large a $K_s$-free induced subgraph there must be in a $K_t$-free graph on $n$ vertices. While good estimates for $f_{s,t}$ are known for some pairs $(s,t)$, notably when $t=s+1$, in…

Combinatorics · Mathematics 2020-02-28 W. T. Gowers , O. Janzer

It is a well-known fact that for any natural number $n$, there always exists a prime in $[n, 2n]$. Our aim in this note is to generalize this result to $[n, kn]$. A lower as well as an upper bound on the number of primes in $[n, kn]$ were…

Number Theory · Mathematics 2019-08-21 Madhuparna Das , Goutam Paul

In this paper we consider the structure of $\omega$-limit sets in subshifts of Baire space. We consider both subshifts of finite type and subshifts of bounded type and we demonstrate that many classical structure theorems for $\omega$-limit…

Dynamical Systems · Mathematics 2020-06-23 Jonathan Meddaugh , Brian Raines

The set D of distinct signed degrees of the vertices in a signed graph G is called its signed degree set. In this paper, we prove that every non-empty set of positive (negative) integers is the signed degree set of some connected signed…

Combinatorics · Mathematics 2007-05-23 S. Pirzada , T. A. Naikoo , F. A. Dar

We give the lower bound for the growth of the maximum value for a solution to the minimal surface equation with 0 boundary values over an unbounded simply connected domain.

Differential Geometry · Mathematics 2023-05-22 Allen Weitsman

Let $p$ and $q$ be distinct odd primes. Let $\Gamma=(V(\Gamma), E(\Gamma))$ be a non-Cayley vertex-transitive graph of order $pq.$ Let $G\leq \Aut(\Gamma)$ acts primitively on the vertex set $V(\Gamma)$. In this paper, we show that $G$ is…

Group Theory · Mathematics 2014-07-18 Mohammad A. Iranmanesh

The main aim of this paper is to obtain the sharp upper and lower bounds for the growth and distortion of the analytic part $h$ of sense-preserving convex $K$-quasiconformal harmonic mappings.

Complex Variables · Mathematics 2025-05-26 Peijin Li , Saminathan Ponnusamy

The minimal degree of a permutation group $G$ is the minimum number of points not fixed by non-identity elements of $G$. Lower bounds on the minimal degree have strong structural consequences on $G$. Babai conjectured that if a primitive…

Combinatorics · Mathematics 2021-10-27 Bohdan Kivva

We obtain optimal lower bounds for moments of theta functions. On the other hand, we also get new upper bounds on individual theta values and moments of theta functions on average over primes. The upper bounds are based on bounds of…

Number Theory · Mathematics 2015-06-08 Marc Munsch , Igor E. Shparlinski

We obtain (conditional and unconditional) results on large values of $L$-functions $L(s,\chi)$ in the critical strip $1/2 \leq \Re s \leq 1$ when the character $\chi$ runs through a thin subgroup of all characters modulo an integer $q$.…

Number Theory · Mathematics 2026-04-06 Pranendu Darbar , Bryce Kerr , Marc Munsch , Igor Shparlinski

Let $k$ be a positive integer and $G=(V,E)$ be a graph of minimum degree at least $k-1$. A function $f:V\rightarrow \{-1,1\}$ is called a \emph{signed $k$-dominating function} of $G$ if $\sum_{u\in N_G[v]}f(u)\geq k$ for all $v\in V$. The…

Discrete Mathematics · Computer Science 2012-04-24 Hongyu Liang

We define what appears to be a new construction. Given a graph $G$ and a positive integer $k$, the reduced $k$th power of $G$, denoted $G^{(k)}$, is the configuration space in which $k$ indistinguishable tokens are placed on the vertices of…

Combinatorics · Mathematics 2016-09-13 Richard H. Hammack , Gregory D. Smith

In this paper, we explore the concept of Mutually Unbiased Bases (MUBs) in discrete quantum systems. It is known that for dimensions $d$ that are powers of prime numbers, there exists a set of up to $d+1$ bases that form an MUB set.…

Let $G$ be a graph of order $n$. A classical upper bound for the domination number of a graph $G$ having no isolated vertices is $\lfloor\frac{n}{2}\rfloor$. However, for several families of graphs, we have $\gamma(G) \le…

Combinatorics · Mathematics 2025-12-09 Subramanian Arumugam , Suresh Manjanath Hegde , Shashanka Kulamarva

A few elementary estimates of a basic character sum over the prime numbers are derived here. These estimates are nontrivial for character sums modulo large q. In addition, an omega result for character sums over the primes is also included.

General Mathematics · Mathematics 2012-05-25 N. A. Carella

Let $K$ be a number field of degree $d$ so that $K/\mathbb Q$ is a Galois extension. The {\it normal basis theorem} states that $K$ has a $\mathbb Q$-basis consisting of algebraic conjugates, in fact $K$ contains infinitely many such bases.…

Number Theory · Mathematics 2026-02-11 Lenny Fukshansky , Sehun Jeong

Mutually unbiased bases which is also maximally entangled bases is called mutually unbiased maximally entangled bases (MUMEBs). We study the construction of MUMEBs in bipartite system. In detail, we construct 2(p^a-1) MUMEBs in C^d\otimes…

Quantum Physics · Physics 2018-06-11 Xiaoya Cheng , Yun Shang

Let $G$ be a group and let $V$ be an algebraic variety over an algebraically closed field $K$. Let $A$ denote the set of $K$-points of $V$. We introduce algebraic sofic subshifts $\Sigma \subset A^G$ and study endomorphisms $\tau \colon…

Dynamical Systems · Mathematics 2024-11-20 Tullio Ceccherini-Silberstein , Michel Coornaert , Xuan Kien Phung