Let $p$ be an odd prime and $c$ a fixed integer with $(c, p)=1$. For each integer $a$ with $1\le a \leq p-1$, it is clear that there exists one and only one $b$ with $0\leq b \leq p-1$ such that $ab \equiv c $ (mod $p$). Let $N(c, p)$ denote the number of all solutions of the congruence equation $ab \equiv c$ (mod $p$) for $1 \le a$, $b \leq p-1$ in which $a$ and $\overline {b}$ are of opposite parity, where $\overline {b}$ is defined by the congruence equation $b\overline {b}\equiv 1\pmod p$. The main purpose of this paper is to use the properties of Dedekind sums and the mean value theorem for Dirichlet $L$-functions to study the hybrid mean value problem involving $N(c,p)-\frac {1}{2}\phi (p)$ and the Dedekind sums $S(c,p)$, and to establish a sharp asymptotic formula for it.
This work studies the standard exponential families of probability measures on Euclidean spaces that have finite supports. In such a family parameterized by means, the mean is supposed to move along a segment inside the convex support towards an endpoint on the boundary of the support. Limit behavior of several quantities related to the exponential family is described explicitly. In particular, the variance functions and information divergences are studied around the boundary.
Let $\mathbb {B}_{k}$ be the general Boolean algebra and $T$ a linear operator on $M_{m,n}(\mathbb {B}_{k})$. If for any $A$ in $M_{m,n}(\mathbb {B}_{k})$ ($ M_{n}(\mathbb {B}_{k})$, respectively), $A$ is regular (invertible, respectively) if and only if $T(A)$ is regular (invertible, respectively), then $T$ is said to strongly preserve regular (invertible, respectively) matrices. In this paper, we will give complete characterizations of the linear operators that strongly preserve regular (invertible, respectively) matrices over $\mathbb {B}_{k}$. Meanwhile, noting that a general Boolean algebra $\mathbb {B}_{k}$ is isomorphic to a finite direct product of binary Boolean algebras, we also give some characterizations of linear operators that strongly preserve regular (invertible, respectively) matrices over $\mathbb {B}_{k}$ from another point of view.
Properties of Lipschitz and d.c. surfaces of finite codimension in a Banach space and properties of generated $\sigma $-ideals are studied. These $\sigma $-ideals naturally appear in the differentiation theory and in the abstract approximation theory. Using these properties, we improve an unpublished result of M. Heisler which gives an alternative proof of a result of D. Preiss on singular points of convex functions.
We will give an existence and uniqueness theorem for ordinary differential equations in Fréchet spaces using Lipschitz conditions formulated with a generalized distance and row-finite matrices.
Let $(G,\tau )$ be a commutative Hausdorff locally solid lattice group. In this paper we prove the following: (1) If $(G,\tau )$ has the $A$(iii)-property, then its completion $(\widehat{G},\hat{\tau })$ is an order-complete locally solid lattice group. (2) If $G$ is order-complete and $\tau $ has the Fatou property, then the order intervals of $G$ are $\tau $-complete. (3) If $(G,\tau )$ has the Fatou property, then $G$ is order-dense in $\widehat{G}$ and $(\widehat{G},\hat{\tau })$ has the Fatou property. (4) The order-bound topology on any commutative lattice group is the finest locally solid topology on it. As an application, a version of the Nikodym boundedness theorem for set functions with values in a class of locally solid topological groups is established.
A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise different (consecutive) positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. We characterize magic line graphs of general graphs and describe some class of supermagic line graphs of bipartite graphs.
A graph is called magic (supermagic) if it admits a labeling of the edges by pairwise different (and consecutive) integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we characterize magic joins of graphs and we establish some conditions for magic joins of graphs to be supermagic.
In the article finite-buffer queueing systems of the <span class="tex">M/M/1/N</span> type with queue size controlled by AQM algorithms are considered, separately for single and batch arrivals. In the latter case two different acceptance strategies: WBAS (Whole Batch Acceptance Strategy) and PBAS (Partial Batch Acceptance Strategy) are distinguished. Three essential characteristics of the system are investigated: the stationary queue-size distribution, the number of consecutively dropped packets (batches of packets) and the time between two successive accepted packets (batches of packets). For these characteristics the formulae which can be easily numerically treated are derived. Numerical results obtained for three sample dropping functions are attached as well.