Related papers: On Achievability of an $(r,l)$ Fractional Linear N…

For any complex vector bundle $E^k$ of rank $k$ over a manifold $M^m$ with Chern classes $c_i \in H^{2i}(M^m,\Z)$ and any non-negative integers $l_1, >..., l_k$ we show the existence of a positive number $N(k,m)$ and the existence of a…

The Wireless Network Design Problem (WND) consists in choosing values of radio-electrical parameters of transmitters of a wireless network, to maximize network coverage. We present a pure 0-1 Linear Programming formulation for the WND that…

We investigate the ratio $\rho_{n,L}$ of prefix codes to all uniquely decodable codes over an $n$-letter alphabet and with length distribution $L$. For any integers $n\geq 2$ and $m\geq 1$, we construct a lower bound and an upper bound for…

Linear codes for error detection on a q-ary symmetric channel are studied. It is shown that for given dimension k and minimum distance d, there exists a value \mu(d,k) such that if C is a code of length n >= \mu(d,k), then neither C nor its…

Wide neural networks with linear output layer have been shown to be near-linear, and to have near-constant neural tangent kernel (NTK), in a region containing the optimization path of gradient descent. These findings seem counter-intuitive…

Currently, much interest is drawn to the analysis of optical and matter-wave modes supported by the fractional diffraction in nonlinear media. We predict a new type of such states, in the form of domain walls (DWs) in the two-component…

We study infinite paths of Markoff $m$-triples, that is, solutions to the generalised Markoff equation \[ x^2+y^2+z^2=3xyz+m, \] with $m>0$, with at least two $k$-Fibonacci components. First, we obtain a complete classification of Markoff…

The Fast Fourier Transform is extended to functions on finite graphs whose edges are identified with intervals of finite length. Spectral and pseudospectral methods are developed to solve a wide variety of time dependent partial…

It is well known that for every $f\in C^m$ there exists a polynomial $p_n$ such that $p^{(k)}_n\rightarrow f^{(k)}$, $k=0,\ldots,m$. Here we prove such a result for fractional (non-integer) derivatives. Moreover, a numerical method is…

We investigate the problem of pointwise convergence of the family of non-linear integral operators: \begin{equation} L_\lambda(f,x) = \int_a^b \sum_{m=1}^N f^m(t) K_{\lambda ,m}(x,t) dt, \end{equation} where $\lambda $ is a real parameters,…

Wireless Mesh Networks (WMNs) consist of radio nodes organized in a mesh topology for serving wireless mesh clients to communicate with one another or to connect to the Internet. Nodes in a mesh network can communicate with each other…

Let $V$ denote an $r$-dimensional $\mathbb{F}_{q^n}$-vector space. For an $m$-dimensional $\mathbb{F}_q$-subspace $U$ of $V$ assume that $\dim_q \left(\langle {\bf v}\rangle_{\mathbb{F}_{q^n}} \cap U\right) \geq 2$ for each non zero vector…

Let $n>1$ and $k>0$ be fixed integers. A matrix is said to be level if all its column sums are equal. A level matrix with $m$ rows is called reducible if we can delete $j$ rows, $0<j<m$, so that the remaining matrix is level. We ask if…

In the paper the solution of KZ system (n=4, m=2) is constructed in the explicit form in terms of the hypergeometric functions. We proved that the corresponding solution is rational when the parameter $\rho$ is integer. We show that in the…

Real networks can be classified into two categories: fractal networks and non-fractal networks. Here we introduce a unifying model for the two types of networks. Our model network is governed by a parameter $q$. We obtain the topological…

In this paper we propose a new non-linear classifier based on a combination of locally linear classifiers. A well known optimization formulation is given as we cast the problem in a $\ell_1$ Multiple Kernel Learning (MKL) problem using many…

We represent an algorithm reducing the $(M+1)$-dimensional nonlinear partial differential equation (PDE) representable in the form of one-dimensional flow $u_t + w_{x_1}(u,u_{x},u_{xx},\dots)=0$, (where $w$ is an arbitrary local function of…

Let A(n) be a $k\times s$ matrix and $m(n)$ be a $k$ dimensional vector, where all entries of A(n) and $m(n)$ are integer-valued polynomials in $n$. Suppose that $$t(m(n)|A(n))=#\{x\in\mathbb{Z}_{+}^{s}\mid A(n)x=m(n)\}$$ is finite for each…

We study a new class of networks, generated by sequences of letters taken from a finite alphabet consisting of $m$ letters (corresponding to $m$ types of nodes) and a fixed set of connectivity rules. Recently, it was shown how a binary…

A {\it krausz $(k,m)$-partition} of a graph $G$ is the partition of $G$ into cliques, such that any vertex belongs to at most $k$ cliques and any two cliques have at most $m$ vertices in common. The {\it $m$-krausz} dimension $kdim_m(G)$ of…