Related papers: Strong limit theorems in the multi-color generaliz…
We classify the trees on $n$ vertices with the maximum and the minimum number of certain generalized colorings, including conflict-free, odd, non-monochromatic, star, and star rainbow vertex colorings. We also extend a result of Cutler and…
We consider a general class of round-robin tournament models of equally strong players. In these models, each of the $n$ players competes against every other player exactly once. For each match between two players, the outcome is a value…
Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…
A graph is called to be uniquely list colorable, if it admits a list assignment which induces a unique list coloring. We study uniquely list colorable graphs with a restriction on the number of colors used. In this way we generalize a…
Given $n$ independent random marked $d$-vectors (points) $X_i$ distributed with a common density, define the measure $\nu_n=\sum_i\xi_i$, where $\xi_i$ is a measure (not necessarily a point measure) which stabilizes; this means that $\xi_i$…
We prove limit theorems for sums of randomly chosen random variables conditioned on the summands. We consider several versions of the corner growth setting, including specific cases of dependence amongst the summands and summands with heavy…
We extend a law of the single logarithm for delayed sums by Lai to delayed sums of random fields. A law for subsequences, which also includes the one-dimensional case, is obtained in passing.
This paper explores the distribution of indistinguishable balls into distinct urns with varying capacity constraints, a foundational issue in combinatorial mathematics with applications across various disciplines. We present a comprehensive…
We prove upper and lower bounds on the effective content and logical strength for a variety of natural restrictions of Hindman's Finite Sums Theorem. For example, we show that Hindman's Theorem for sums of length at most 2 and 4 colors…
We provide the law of large numbers for roots of finite free multiplicative convolution of polynomials which have only non-negative real roots. Moreover, we study the empirical root distributions of limit polynomials obtained through the…
Under some mild regularity on the normalizing sequence, we obtain necessary and sufficient conditions for the Strong Law of Large Numbers for (symmetrized) U-statistics. We also obtain nasc's for the a.s. convergence of series of an…
The goal of the classic football-pool problem is to determine how many lottery tickets are to be bought in order to guarantee at least $n-r$ correct guesses out of a sequence of $n$ games played. We study a generalized (second-order)…
This paper deals with strong structural controllability of linear structured systems in which the system matrices are given by zero/nonzero/arbitrary pattern matrices. Instead of assuming that the nonzero and arbitrary entries of the system…
The Law of the Iterated Logarithm for some Markov operators, which converge exponentially to the invariant measure, is established. The operators correspond to iterated function systems which, for example, may be used to generalize the cell…
We investigate the concept of strong equivalence within the extended framework of Answer Set Programming with constraints. Two groups of rules are considered strongly equivalent if, informally speaking, they have the same meaning in any…
Graph colorings have been of interest to mathematicians for a long time, but relatively recently, social scientists have also found them to be interesting tools for studying group behavior. In the last 20 years, scientists have begun to…
We show a Marcinkiewicz-Zygmund law of large numbers for jointly, dissociated exchangeable arrays, in $L^r$ ($r\in (0,2)$) and almost surely. Then, we obtain a law of iterated logarithm for such arrays under a weaker moment condition than…
Some important properties of the chromatic polynomial also hold for any polynomial set map satisfying p_S(x+y)=\sum_{T\uplus U=S}p_T(x)p_U(y). Using umbral calculus, we give a formula for the expansion of such a set map in terms of any…
Stochastic Master equations or quantum filtering equations for mixed states are well known objects in quantum physics. Building a mathematically rigorous theory of these equations in infinite-dimensional spaces is a long standing open…
The game-theoretic version of Kolmogorov's strong law of large numbers says that Skeptic has a strategy forcing the statement of the law in a game of prediction involving Reality, Forecaster, and Skeptic. This note describes a simple…