相关论文: Quasi-copulas as linear combinations of copulas

Colored multiple zeta values are special values of multiple polylogarithms evaluated at Nth roots of unity. In this paper, we define both the finite and the symmetrized versions of these values and show that they both satisfy the double…

We develop a theory of quasisymmetries for finitely ramified fractals, with applications to finitely ramified Julia sets. We prove that certain finitely ramified fractals admit a naturally defined class of "undistorted metrics" that are all…

Many generating series of combinatorially interesting numbers have the property that the sum of the terms of order $<p$ at some suitable point is congruent to a zero of a zeta-function modulo infinitely many primes $p$. Surprisingly, very…

We prove that N\'eron models of jacobians of generically-smooth nodal curves over bases of arbitrary dimension are quasi-compact (hence of finite type) whenever they exist. We give a simple application to the orders of torsion subgroups of…

Here in particular, we give a characterization of Quasi-line Graphs in terms of forbidden induced subgraphs. In general, we prove a necessary and sufficient condition for a graph to be a union of two cliques.

A quandle will be called quasi-affine, if it embeds into an affine quandle. Our main result is a characterization of quasi-affine quandles, by group-theoretic properties of their displacement group, by a universal algebraic condition coming…

A (Hasse) diagram of a finite partially ordered set (poset) P will be called quasiplanar if for any two incomparable elements u and v, either v is on the left of all maximal chains containing u, or v is on the right of all these chains.…

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…

We discuss a universal algebraic approach to quasi-exactly solvable models which allows us to interpret them as constrained Hamiltonian systems with a finite number of physical states. Using this approach we reproduce well-known…

In this paper we define a family of theories, quasi-theories, motivated by quasi-elliptic cohomology. They can be defined from constant loop spaces. With them, the constructions on certain theories can be made in a neat way, such as those…

A perfect graph is a graph which every induced subgraph has clique number equal to chromatic number. In this paper, I will introduce a new family of graphs, the quasiperfect graphs which generalizes the perfect graphs.

We define and study the interpolated finite multiple harmonic $q$-series. A generating function of the sums of the interpolated finite multiple harmonic $q$-series with fixed weight, depth and $i$-height is computed. Some Ohno-Zagier type…

In this paper, we use subword complexes to provide a uniform approach to finite type cluster complexes and multi-associahedra. We introduce, for any finite Coxeter group and any nonnegative integer k, a spherical subword complex called…

In a recent article, Apagodu and Zeilberger (http://arxiv.org/abs/1606.03351)discuss some applications of an algorithm for finding and proving congruence identities (modulo primes) of indefinite sums of many combinatorial sequence. At the…

It is shown that every 2-planar graph is quasiplanar, that is, if a simple graph admits a drawing in the plane such that every edge is crossed at most twice, then it also admits a drawing in which no three edges pairwise cross. We further…

We extend the definition of quasi-finite complexes by considering not necessarily countable complexes. We provide a characterization of quasi-finite complexes in terms of L-invertible maps and dimensional properties of compactifications.…

We introduce the concept of an almost prime number generalizing a prime number. It turns out that a composite almost prime number must be a Carmichael number, in case it exists. We prove several properties of almost prime numbers and…

Explicit expression for quasi-triviality of scalar non-linear PDE is under consideration.

The category of all monads over many-sorted sets (and over other "set-like" categories) is proved to have coequalizers and strong cointersections. And a general diagram has a colimit whenever all the monads involved preserve monomorphisms…

We prove explicit bounds for the number of sums of consecutive prime squares below a given magnitude.