Related papers: Exact upper bound for copulas with a given diagona…
We derive a procedure for computing an upper bound on the number of equiangular lines in various Euclidean vector spaces by generalizing the classical pillar decomposition developed by (Lemmens and Seidel, 1973); namely, we use linear…
We derive a new upper bound on the diameter of a polyhedron P = {x \in R^n : Ax <= b}, where A \in Z^{m\timesn}. The bound is polynomial in n and the largest absolute value of a sub-determinant of A, denoted by \Delta. More precisely, we…
In this paper we provide asymptotic upper bounds on the complexity in two (closely related) situations. We confirm for the total doubling coverings and not only for the chains the expected bounds of the form $$ \kappa({\mathcal U}) \le…
We give explicit upper bounds for the entropy in the cusp for one-parameter diagonal flows on $SL_d(\mathbb{R})/SL_{d}(\mathbb{Z})$. These results include bounds for the entropy of the cusp as a whole, as well as for the cusp regions…
Spectral graph bisections are a popular heuristic aimed at approximating the solution of the NP-complete graph bisection problem. This technique, however, does not always provide a robust tool for graph partitioning. Using a special class…
We consider systems of "pinned balls," i.e., balls that have fixed positions and pseudo-velocities. Pseudo-velocities change according to the same rules as those for velocities of totally elastic collisions between moving balls. The times…
Normal copula with a correlation coefficient between $-1$ and $1$ is tail independent and so it severely underestimates extreme probabilities. By letting the correlation coefficient in a normal copula depend on the sample size, H\"usler and…
For extreme value copulas with a known upper tail dependence coefficient we find pointwise upper and lower bounds, which are used to establish upper and lower bounds of the Spearman and Kendall correlation coefficients. We shown that in all…
Modeling of high order multivariate probability distribution is a difficult problem which occurs in many fields. Copula approach is a good choice for this purpose, but the curse of dimensionality still remains a problem. In this paper we…
Building upon earlier work in which axioms were formulated for multivariate measures of concordance, we examine properties of such measures. In particular, we examine the relations between the measure of concordance of an $n$-copula and the…
In the paper we partially solved the problem of the distribution of the discriminants of integral polynomials in the cubic case. We proved the asymptotic formula for the number of integral cubic polynomials having bounded height and bounded…
The Maximum Balanced Biclique Problem (MBBP) is a prominent model with numerous applications. Yet, the problem is NP-hard and thus computationally challenging. We propose novel ideas for designing effective exact algorithms for MBBP.…
We propose a new bivariate symmetric copula with positive and negative dependence properties. The main features of the proposed copula are its simple mathematical structure, wider dependence range compared to FGM copula and its…
Maximum Variance Unfolding is one of the main methods for (nonlinear) dimensionality reduction. We study its large sample limit, providing specific rates of convergence under standard assumptions. We find that it is consistent when the…
We obtain lower and upper bounds for the maximum weight of a directed cut in the classes of weighted digraphs and weighted acyclic digraphs as well as in some of their subclasses. We compare our results with those obtained for the maximum…
In this paper, we present a family of bivariate copulas by transforming a given copula function with two increasing functions, named as transformed copula. One distinctive characteristic of the transformed copula is its singular component…
The solving degree is an important parameter for estimating the complexity of solving a system of polynomial equations. In this paper, we provide an upper bound for the solving degree in terms of the degree of regularity. We also show that…
In this work, we consider the problem of bounding the values of a covariance function corresponding to a continuous-time stationary stochastic process or signal. Specifically, for two signals whose covariance functions agree on a finite…
The relation between equiangular sets of lines in the real space and distance-regular double covers of the complete graph is well known and studied since the work of Seidel and others in the 70's. The main topic of this paper is to continue…
We obtain a sharp upper bound for the length of arbitrary non-associative algebra and present an example demonstrating the sharpness of our bound. To show this we introduce a new method of characteristic sequences based on linear algebra…