Related papers: On two conjectures about the intersection distribu…

We carry out an arithmetical study of analytic functions $f: [0,1] \to [0,1]$ that by restriction induce a bijection $\mathbb{Q} \cap [0,1] \to \mathbb{Q} \cap [0,1]$. The existence of such functions shows that, unless $f(x)$ has some…

Tverberg-type theory aims to establish sufficient conditions for a simplicial complex $\Sigma$ such that every continuous map $f\colon \Sigma \to \mathbb{R}^d$ maps $q$ points from pairwise disjoint faces to the same point in…

We present some elementary ideas to prove the following Sylvester-Gallai type theorems involving incidences between points and lines in the planes over the complex numbers and quaternions. (1) Let A and B be finite sets of at least two…

Correlations of active and passive random intersection graphs are studied in this letter. We present the joint probability generating function for degrees of $G^{active}(n,m,p)$ and $G^{passive}(n,m,p)$, which are generated by a random…

We show that the points of a global function field, whose classes are 2-divisible in the Picard group, form a connected graph, with the incidence relation generalizing the well known quadratic reciprocity law. We prove that for every global…

We study the structures of Pfaffian equations and contiguity relations of the hypergeometric function of type $(k+1,k+n+2)$ by using twisted cohomology groups and the intersection form on them. We apply our results to algebraic statistics;…

Quadrance between two points A_1 = [x_1,y_1] and A_2 = [x_2,y_2] is the number Q (A_1, A_2) := (x_2 - x_1)^2 + (y_2 - y_1)^2. In this paper, we present some interesting results arise from this notation. In Section 1, we will study geometry…

A classical enumerative result states that, given a graph $G$ and a vertex $u$, the number of connected subgraphs of $G$ is equal to the number of orientations of $G$ such that every vertex can reach $u$ by a directed path. We show that…

Inspired by Feynman integral computations in quantum field theory, Kontsevich conjectured in 1997 that the number of points of graph hypersurfaces over a finite field $\F_q$ is a (quasi-) polynomial in $q$. Stembridge verified this for all…

Linear codes with few weights have applications in secret sharing, authentication codes, association schemes and strongly regular graphs. In this paper, several classes of $t$-weight linear codes over ${\mathbb F}_{q}$ are presented with…

Let $\mathcal A=\{A_1,\ldots,A_n\}$ be a family of sets in the plane. For $0 \leq i < n$, denote by $f_i$ the number of subsets $\sigma$ of $\{1,\ldots,n\}$ of cardinality $i+1$ that satisfy $\bigcap_{i \in \sigma} A_i \neq \emptyset$. Let…

Let $P$ and $Q$ be finite posets and $R$ a commutative unital ring. In the case where $R$ is indecomposable, we prove that the $R$-linear isomorphisms between partial flag incidence algebras $I^3(P,R)$ and $I^3(Q,R)$ are exactly those…

Let I and J be homogeneous ideals in a standard graded polynomial ring. We study upper bounds of the Hilbert function of the intersection of I and g(J), where g is a general change of coordinates. Our main result gives a generalization of…

We prove an equidistribution result for iterated preimages of curves by a large class of rational maps $f:\mathbb{CP}^2\dashrightarrow\mathbb{CP}^2$ that cannot be birationally conjugated to algebraically stable maps. The maps, which…

We provide a graph formula which describes an arbitrary monomial in {\omega} classes (also referred to as stable {\psi} classes) in terms of a simple family of dual graphs (pinwheel graphs) with edges decorated by rational functions in…

Divided symmetrization of a function $f(x_1,\dots,x_n)$ is symmetrization of the ratio $$DS_G(f)=\frac{f(x_1,\dots,x_n)}{\prod (x_i-x_j)},$$ where the product is taken over the set of edges of some graph $G$. We concentrate on the case when…

We present a simplification of the recursive algorithm for the evaluation of intersection numbers for differential $n$-forms, by combining the advantages emerging from the choice of delta-forms as generators of relative twisted cohomology…

We translate the results of Yansong Xu into the language of~\cite{GGV1}, obtaining nearly the same formulas for the intersection number of Jacobian pairs, but with an inequality instead of an equality.

We derive sharp upper and lower bounds on the number of intersection points and closed regions that can occur in sets of line segments with certain structure, in terms of the number of segments. We consider sets of segments whose underlying…

Let $p$ and $q$ be two imprecise points, given as probability density functions on $\mathbb R^2$, and let $\cal R$ be a set of $n$ line segments (obstacles) in $\mathbb R^2$. We study the problem of approximating the probability that $p$…