Related papers: On the number of two-dimensional threshold functio…
The six-vertex model with domain wall boundary conditions (DWBC) on an N x N square lattice is considered. The two-point correlation function describing the probability of having two vertices in a given state at opposite (top and bottom)…
A $2$-distance $k$-coloring of a graph is a proper $k$-coloring of the vertices where vertices at distance at most 2 cannot share the same color. We prove the existence of a $2$-distance ($\Delta+2$)-coloring for graphs with maximum average…
In this paper, some classes of discrete functions of $k$-valued logic are considered, that depend on sets of their variables in a particular way. Obtained results allow to "construct" these functions and to present them in their tabular,…
In this article, we provide a comprehensive analysis of the asymptotic behavior of Bell numbers, enhancing and unifying various results previously dispersed in the literature. We establish several explicit lower and upper bounds. The main…
We define the independence ratio and the chromatic number for bounded, self-adjoint operators on an L^2-space by extending the definitions for the adjacency matrix of finite graphs. In analogy to the Hoffman bounds for finite graphs, we…
Consider the graph $\mathbb{H}(d)$ whose vertex set is the hyperbolic plane, where two points are connected with an edge when their distance is equal to some $d>0$. Asking for the chromatic number of this graph is the hyperbolic analogue to…
Two--sided bounds are constructed for a probability density function of a weighted sum of chi-square variables. Both cases of central and non-central chi-square variables are considered. The upper and lower bounds have the same dependence…
We consider the extension of two variable logic with quantifiers that state that the number of elements where a formula holds should belong to a given ultimately periodic set. We show that both satisfiability and finite satisfiability of…
Given a graph $G$ and a list assignment $L(v)$ for each vertex of $v$ of $G$. A proper $L$-list-coloring of $G$ is a function that maps every vertex to a color in $L(v)$ such that no pair of adjacent vertices have the same color. We say…
This paper studies the second moment boundedness of solutions of linear stochastic delay differential equations. First, we give a framework, for general $\mathrm{N}$-dimensional linear stochastic differential equations with a single…
In this paper, we obtain two spectral upper bounds for the $k$-independence number of a graph which is is the maximum size of a set of vertices at pairwise distance greater than $k$. We construct graphs that attain equality for our first…
The chromatic threshold of a graph $H$ is the minimum-degree density above which every $H$-free graph has bounded chromatic number. We study a two-color Ramsey analogue: for graphs $H_1$ and $H_2$, we ask for the minimum-degree density…
Asymptotics are given for the number of rational points in the domain of a morphism of weighted projective stacks whose images have bounded height and satisfy a (possibly infinite) set of local conditions. As a consequence we obtain results…
We establish unconditional sharp upper bounds of the $k$-th moments of the family of quadratic Dirichlet $L$-functions at the central point for $0 \leq k \leq 2$.
We consider the six-vertex model with the rational weights on an $s\times N$ square lattice, $s\leq N$, with partial domain wall boundary conditions. We study the one-point function at the boundary where the free boundary conditions are…
The arithmetic function of two variables is defined. Some properties of the function are given along with the formula that is an analog of the so-called Mobius' inversion formula. A heuristic statement is suggested.
We present a new way of organizing the few mathematical statements which form introduction to Calculus: the epsilon-delta characterization of the limit is now d e r i v e d from four simple, intuitive and frequently used statements, which…
In this work we study the asymptotic distribution of eigenvalues in one-dimensional open sets. The method of proof is rather elementary, based on the Dirichlet lattice points problem, which enable us to consider sets with infinite measure.…
This paper provides an abstract definition of some kinds of logics, called diagrammatic logics, together with a definition of morphisms and of 2-morphisms between diagrammatic logics. The definition of the 2-category of diagrammatic logics…
In this paper, under certain restrictions on linear factors of the denominator of a rational function of two variables, the leading term of the asymptotic expansion of the coefficients is found.