English
Related papers

Related papers: Davenport constant with weights

200 papers

We characterize all fixed equilibrium point singularity distributions in the plane of logarithmic type, allowing for real, imaginary, or complex singularity strengths \Gamma . The dynamical system follows from the assumption that each of…

Dynamical Systems · Mathematics 2010-06-04 Paul K. Newton , Vitalii Ostrovskyi

Let ${\cal G}=(G,w)$ be a weighted simple finite connected graph, that is, let $G$ be a simple finite connected graph endowed with a function $w$ from the set of the edges of $G$ to the set of real numbers. For any subgraph $G'$ of $G$, we…

Combinatorics · Mathematics 2014-12-18 Elena Rubei

Let A be a finite nonempty subset of an additive abelian group G, and let \Sigma(A) denote the set of all group elements representable as a sum of some subset of A. We prove that |\Sigma(A)| >= |H| + 1/64 |A H|^2 where H is the stabilizer…

Number Theory · Mathematics 2015-06-26 Matt DeVos , Luis Goddyn , Bojan Mohar , Robert Samal

\textit{{\small We aim to get an algebraic generalization of Alladi-Johnson's (A-J) work on Duality between Prime Factors and the Prime Number Theorem for Arithmetic Progressions - II, using the Chebotarev Density Theorem (CDT). It has been…

Number Theory · Mathematics 2024-10-30 Sroyon Sengupta

Let $k$ be a field of characteristic zero, and let $i$ and $n$ be positive integers with $i\geq 2$ and $n>i$. Consider a non-invertible $k$-derivation $d_i$ of the polynomial ring $k[x_1,\ldots,x_i]$. Let $d_n$ be an extension of $d_i$ to a…

Commutative Algebra · Mathematics 2025-07-22 Sumit Chandra Mishra , Dibyendu Mondal , Pankaj Shukla

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot...\cdot(n_lg)$ where $g\in G$ and $n_1,\cdots,n_l\in[1,{\hbox{\rm ord}}(g)]$, and the index $\ind S$ of $S$ is defined to be the minimum…

Number Theory · Mathematics 2014-01-31 Caixia Shen , Li-meng Xia

For linear non-uniform cellular automata (NUCA) which are local perturbations of linear CA over a group universe $G$ and a finite-dimensional vector space alphabet $V$ over an arbitrary field $k$, we investigate their Dedekind finiteness…

Dynamical Systems · Mathematics 2024-11-20 Xuan Kien Phung

The sequence of derangements is given by the formula $D_0 = 1, D_n = nD_{n-1} + (-1)^n, n>0$. It is a classical object appearing in combinatorics and number theory. In this paper we consider two classes of sequences: first class is given by…

Number Theory · Mathematics 2015-08-11 Piotr Miska

In this paper, we establish a new mean value theorem of Bombieri-Vinogradov type over Piatetski-Shapiro sequence. Namely, it is proved that for any given constant $A>0$ and any sufficiently small $\varepsilon>0$, there holds…

Number Theory · Mathematics 2023-05-08 Jinjiang Li , Fei Xue , Min Zhang

A theory of gravity with a generic action functional and minimally coupled to N matter fields has a nontrivial fixed point in the leading large N approximation. At this fixed point, the cosmological constant and Newton's constant are…

High Energy Physics - Theory · Physics 2009-11-11 R. Percacci

Let $M$ be a complete Riemannian manifold and $G$ a Lie subgroup of the isometry group of $M$ acting freely and properly on $M.$ We study the Dirichlet Problem \begin{align*} \operatorname{div}\left( \frac{a\left( \left\Vert \nabla…

Differential Geometry · Mathematics 2021-09-21 Jaime Ripoll , Friedrich Tomi

Call a compact, connected, simple Lie group $G$ {\emph{adjoint simple}} if it has trivial center. Let $C\subset G$ be a nontrivial conjugacy class, $e\in G$ the identity element of $G$. We prove the existence of an $N\in\mathbb{N}$,…

Representation Theory · Mathematics 2013-12-03 Corey Manack

In this paper we present a superspace formulation of $N = 1, D = 6$ supergravity with one tensor-multiplet and an arbitrary number of vector- and hypermultiplets, in which the bosonic abelian superforms of the theory, the dilaton, the…

High Energy Physics - Theory · Physics 2009-10-30 Gianguido Dall'Agata , Kurt Lechner

Let G be a graph with set of vertices 1,...,n and adjacency matrix A of size nxn. Let d(i,j)=d, we say that f_d:N->N is a d-function on G if for every pair of vertices i,j and k>=d, we have a_ij^(k)=f_d(k). If this function f_d exists on G…

Combinatorics · Mathematics 2013-04-02 Ernesto Estrada , Jose A. de la Pena

We apply a method of Davenport to improve several estimates for slim exceptional sets associated with the asymptotic formula in Waring's problem. In particular, we show that the anticipated asymptotic formula in Waring's problem for sums of…

Number Theory · Mathematics 2015-06-08 Koichi Kawada , Trevor D. Wooley

For a directed graph $G$ without loops or parallel edges, let $\beta(G)$ denote the size of the smallest feedback arc set, i.e., the smallest subset $X \subset E(G)$ such that $G \sm X$ has no directed cycles. Let $\gamma(G)$ be the number…

Combinatorics · Mathematics 2008-09-29 Jacob Fox , Peter Keevash , Benny Sudakov

It is believed that gravity will be explained in the framework of the existing quantum theory when one succeeds in eliminating divergencies at large momenta or small distances (although the phenomenon of gravity has been observed only at…

General Relativity and Quantum Cosmology · Physics 2008-07-28 Felix Lev

Consider a_1,a_2,...,a_n, arbitrary elements of R. We characterize those real functions f that decompose into the sum of a_j-periodic functions, i.e., f=f_1+...+f_n with D_{a_j}f(x):=f(x+a_j)-f(x)=0. We show that f has such a decomposition…

Classical Analysis and ODEs · Mathematics 2007-05-25 Bálint Farkas , Viktor Harangi , Tamás Keleti , Szilárd Gy. Révész

A subset $\{g_1, \ldots , g_d\}$ of a finite group $G$ is said to invariably generate $G$ if the set $\{g_1^{x_1}, \ldots, g_d^{x_d}\}$ generates $G$ for every choice of $x_i \in G$. The Chebotarev invariant $C(G)$ of $G$ is the expected…

Group Theory · Mathematics 2018-11-28 Andrea Lucchini , Gareth Tracey

For an oriented graph $D$, the inversion of $X\subseteq V(D)$ in $D$ is the graph obtained by reversing the orientation of all arcs with both ends in $X$. The inversion number $\mathrm{inv}(D)$ is the minimum number of inversions needed to…

Combinatorics · Mathematics 2025-09-15 Natalie Behague , Patrick Gaudart-Wifling
‹ Prev 1 8 9 10 Next ›