Related papers: On two conjectures about the intersection distribu…
This paper demonstrates that, under a particular convention, the convex functions that characterise the phi divergences also generate Archimedean copulas in at least two dimensions. As a special case, we develop the family of Archimedean…
We prove estimates for the level of distribution of the M\"obius function, von Mangoldt function, and divisor functions in squarefree progressions in the ring of polynomials over a finite field. Each level of distribution converges to $1$…
We apply methods of derived and non-commutative algebraic geometry to understand intersection theoretic phenomena on arithmetic schemes. Specifically, we categorify Bloch's intersection number (in the formulation provided by Kato--Saito).…
We introduce a quasisymmetric class function associated with a group acting on a double poset or on a directed graph. The latter is a generalization of the chromatic quasisymmetric function of a digraph introduced by Ellzey, while the…
For a given homogeneous Poisson point process in $\mathbb{R}^d$ two points are connected by an edge if their distance is bounded by a prescribed distance parameter. The behaviour of the resulting random graph, the Gilbert graph or random…
We consider the typical distance between vertices of the giant component of a random intersection graph having a power law (asymptotic) vertex degree distribution with infinite second moment. Given two vertices from the giant component we…
Generalized composite fluxbrane solutions for a wide class of intersection rules are obtained. The solutions are defined on a manifold which contains a product of n Ricci-flat spaces M_1 x ... x M_n with 1-dimensional M_1. They are defined…
A random intersection graph is constructed by assigning independently to each vertex a subset of a given set and drawing an edge between two vertices if and only if their respective subsets intersect. In this paper a model is developed in…
Following the approach by R. K\"otter and F. R. Kschischang, we study network codes as families of k-dimensional linear subspaces of a vector space F_q^n, q being a prime power and F_q the finite field with q elements. In particular,…
A completely new strategy to calculate parton distribution functions on the lattice has recently been proposed. In this method, lattice calculable observables, called quasi distributions, are related to normal distributions. The quasi…
Let $e$ be a positive integer, $p$ be an odd prime, $q=p^{e}$, and $\Bbb F_q$ be the finite field of $q$ elements. Let $f,g \in \Bbb F_q [X,Y]$. The graph $G=G_q(f,g)$ is a bipartite graph with vertex partitions $P=\Bbb F_q^3$ and $L=\Bbb…
Minimum spanning trees are important tools in the analysis and design of networks. Many practical applications require their computation, ranging from biology and linguistics to economy and telecommunications. The set of cycles of a network…
Given two weighted k-uniform hypergraphs G, H of order n, how much (or little) can we make them overlap by placing them on the same vertex set? If we place them at random, how concentrated is the distribution of the intersection? The aim of…
We show that with high probability the random graph $G_{n, 1/2}$ has an induced subgraph of linear size, all of whose degrees are congruent to $r\pmod q$ for any fixed $r$ and $q\geq 2$. More generally, the same is true for any fixed…
We explore the correspondence between geometric function theory (GFT) and quantum field theory (QFT). The crossing symmetric dispersion relation provides the necessary tool to examine the connection between GFT, QFT, and effective field…
Let $q>r\ge1$ be coprime positive integers. We empirically study the maximal gaps $G_{q,r}(x)$ between primes $p=qn+r\le x$, $n\in{\mathbb N}$. Extensive computations suggest that almost always $G_{q,r}(x)<\varphi(q)\log^2x$. More…
The confluent hypergeometric functions (the Kummer functions) defined by ${}_{1}F_{1}(\alpha;\gamma;z):=\sum_{n=0}^{\infty}\frac{(\alpha)_{n}}{n!(\gamma)_{n}}z^{n}\ (\gamma\neq 0,-1,-2,\cdots)$, which are of many properties and great…
The threshold degree of a Boolean function f:{0,1}^n->{-1,+1} is the least degree of a real polynomial p such that f(x)=sgn p(x). We construct two halfspaces on {0,1}^n whose intersection has threshold degree Theta(sqrt n), an exponential…
In this paper we analyze the intersection between the norm-trace curve over $\mathbb{F}_{q^3}$ and the curves of the form $y=ax^3+bx^2+cx+d$, giving a complete characterization of the intersection between the curve and the parabolas, as…
One-ports named "f-circuits", composed of similar conductors described by a monotonic polynomial, or quasi-polynomial (i.e. with positive but not necessarily integer, powers) characteristic i = f(v) are studied, focusing on the algebraic…