Stravinsky Fest, September 21, 1988

This is the concert program of the Stravinsky Fest performance on Wednesday, September 21, 1988 at 8:30 p.m., at the Boston University Concert Hall, 855 Commonwealth Avenue, Boston, Massachusetts. Works performed were eighth note equals 160 from Three Pieces for Clarinet Solo, Duet for Two Bassoons, Epitaphium für das Grabmal des Prinzen Max Egon zu Fürstenberg, and Pastorale by Igor Stravinsky; Canon for 3 in Memoriam of Igor Stravinsky by Elliott Carter; and Octet for Wind Instruments and The Soldier's Tale by Igor Stravinsky. Digitization for Boston University Concert Programs was supported by the Boston University Humanities Library Endowed Fund

Multiplicative Congruences with Variables from Short Intervals

Recently, several bounds have been obtained on the number of solutions to congruences of the type $$(x_1+s)...(x_{\nu}+s)\equiv (y_1+s)...(y_{\nu}+s)\not\equiv0 \pmod p$$ modulo a prime $p$ with variables from some short intervals. Here, for almost all $p$ and all $s$ and also for a fixed $p$ and almost all $s$, we derive stronger bounds. We also use similar ideas to show that for almost all primes, one can always find an element of a large order in any rather short interval

Institutional Underpinnings of the Minimum Wage Fixing Machinery: The Role of Social Dialogue

none2mixedGuardiancich, Igor; Artale, Wilko MattiaGuardiancich, Igor; Artale, Wilko Matti

Products in Residue Classes

We consider a problem of P. Erdos, A. M. Odlyzko and A. Sarkozy about the representation of residue classes modulo m by products of two not too large primes. While it seems that even the Extended Riemann Hypothesis is not powerful enough to achieve the expected results, here we obtain some unconditional results ``on average'' over moduli m and residue classes modulo m and somewhat stronger results when the average is restricted to prime moduli m = p. We also consider the analogous question wherein the primes are replaced by easier sequences so, quite naturally, we obtain much stronger results.Comment: 18 page

Counting Additive Decompositions of Quadratic Residues in Finite Fields

We say that a set $S$ is additively decomposed into two sets $A$ and $B$ if $S = \{a+b : a\in A, \ b \in B\}$. A. S\'ark\"ozy has recently conjectured that the set $Q$ of quadratic residues modulo a prime $p$ does not have nontrivial decompositions. Although various partial results towards this conjecture have been obtained, it is still open. Here we obtain a nontrivial upper bound on the number of such decompositions

Character Sums and Deterministic Polynomial Root Finding in Finite Fields

We obtain a new bound of certain double multiplicative character sums. We use this bound together with some other previously obtained results to obtain new algorithms for finding roots of polynomials modulo a prime $p$

On Congruences with Products of Variables from Short Intervals and Applications

We obtain upper bounds on the number of solutions to congruences of the type $$(x_1+s)...(x_{\nu}+s)\equiv (y_1+s)...(y_{\nu}+s)\not\equiv0 \pmod p$$ modulo a prime $p$ with variables from some short intervals. We give some applications of our results and in particular improve several recent estimates of J. Cilleruelo and M. Z. Garaev on exponential congruences and on cardinalities of products of short intervals, some double character sum estimates of J. B. Friedlander and H. Iwaniec and some results of M.-C. Chang and A. A. Karatsuba on character sums twisted with the divisor function