Related papers: $ S $-unit values of $ G_n + G_m $ in function fie…

We describe the higher weights of the Grassmann codes $G(2,m)$ over finite fields ${\mathbb F}_q$ in terms of properties of Schubert unions, and in each case we determine the weight as the minimum of two explicit polynomial expressions in…

We comment on recent results of a possible finite theory of Super Gravity from both Feynman graph and global E(7,7) symmetry arguments. The four point amplitude can be written as a series in the gravitational coupling and energy squared,…

We give lower bounds on the number of effective divisors of degree $\leq g-1$ with respect to the number of places of certain degrees of an algebraic function field of genus $g$ defined over a finite field. We deduce lower bounds and…

Let [t] be the integral part of the real number t and let 1 P be the characteristic function of the primes. Denote by $\pi$ G (x) the number of primes in the floor function set G(x) := {[ x n ] : 1 n x} and by S 1 P (x) the number of primes…

The aim of this note is to provide a Master Theorem for some discrete divide and conquer recurrences: $$X_{n}=a_n+\sum_{j=1}^m b_j X_{\lfloor{\frac{n}{m_j}}\rfloor},$$ where the $m_i$'s are integers with $m_i\ge 2$. The main novelty of this…

Given a graph G of order n and size m, let s(G)= sum|d(u)-2m/n|, where the sum is taken over all vertices u of G. We investigate upper and lower bounds on eigenvalues of G in terms of s(G).

In this work, we prove the existence of linear recurrences of order M with a non-trivial solution vanishing exactly on the set of gaps (or a subset) of a numerical semigroup S finitely generated by a1 < a2 <...< aN and M = aN. Keywords:…

Let $X$ be a first countable Hausdorff topological group. The limit of a sequence in $X$ defines a function denoted by $lim$ from the set of all convergence sequences to $X$. This definition was modified by Connor and Grosse-Erdmann for…

We investigate the descriptional complexity of operations on semilinear sets. Roughly speaking, a semilinear set is the finite union of linear sets, which are built by constant and period vectors. The interesting parameters of a semilinear…

We consider the function $G(n)=\frac{\sigma(n)}{n\log\log n}$ (where $\sigma(n)=\sum_{d|n}d$) and set an imposed condition on its argument $n$, the fulfillment of which is sufficient for the existence of a prime $p$, at which $G(np)>G(n)$.…

By relating the number of images of a function with finite domain to a certain parameter, we obtain both an upper and lower bound for the image set. Even though the arguments are elementary, the bounds are, in some sense, best possible. The…

For rings R with identity, we define a class of nonlinear higher order recurrences on unitary left R-modules that include linear recurrences as special cases. We obtain conditions under which a recurrence of order k+1 in this class is…

Constant-recursive sequences are those which satisfy a linear recurrence, so that later terms can be obtained as a linear combination of the previous ones. The rank of a constant-recursive sequence is the minimal number of previous terms…

Given a polynomial $f$ defined over a number field $K$, we make effective certain special cases of a conjecture of S. Ih, on the finiteness of $f$-preperiodic points which are $S$-integral with respect to a fixed non-preperiodic point…

In this paper we improve upon in terms of S the best known effective upper bounds for the solutions of S-unit equations and decomposable form equations.

Let $\mathfrak g$ be an infinite-dimensional Lie algebra and $G$ be the algebraic completion of its module. Using a geometric interpretation in terms of sewing two Riemann spheres with a number of marked points, we introduce a…

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

We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…

If $G$ is an abelian group, we say $S\subset G$ is a set of recurrence if for every probability measure preserving $G$-system $(X,\mu,T)$ and every $D\subset X$ having $\mu(D)>0$, there is a $g\in S$ such that $\mu(D\cap T^{g}D)>0$. We say…

We study the sums $$ S_f(x) = \sum_{n\leq x} f\left(\left\lfloor\frac{x}{n}\right\rfloor\right) $$ when $f$ is supported on $r$th powers with $r\geq 2$. This restriction allows us to give nontrivial estimates for one of the error terms in…