相关论文: A dynamical pairing between two rational maps

For a strongly inacessible cardinal $\kappa$, we investigate the relationships between the following ideals: - the ideal of meager sets in the ${<}\kappa$-box product topology - the ideal of "null" sets in the sense of [Sh:1004]…

We aim to create the highest possible quality of treatment-control matches for categorical data in the potential outcomes framework. Matching methods are heavily used in the social sciences due to their interpretability, but most matching…

Private set intersection (PSI) allows two mutually untrusting parties to compute an intersection of their sets, without revealing information about items that are not in the intersection. This work introduces a PSI variant called…

We give a mathematical structure on an arithmetic surface, that has algebraic meanings over finite places and can estimate the canonical norm for a relative differential form on the arithmetic surface. This will give a lower bound for the…

An asymptotic formula is established for the number of rational points of bounded anticanonical height which lie on a certain Zariski dense subset of the biprojective hypersurface $x_1y_1^2+\dots+x_4y_4^2=0$ in…

Let $X$ and $Y$ be proper metric spaces. We show that a coarsely $n$-to-$1$ map $f\colon X\to Y$ induces an $n$-to-$1$ map of Higson coronas. This viewpoint turns out to be successful in showing that the classical dimension raising theorems…

Arguments inspired by algorithmic information theory predict an inverse relation between the probability and complexity of output patterns in a wide range of input-output maps. This phenomenon is known as \emph{simplicity bias}. By viewing…

This paper is concerned with configurations of points in a plane lattice which determine angles that are rational multiples of $\pi$. We shall study how many such angles may appear in a given lattice and in which positions, allowing the…

A staircase is the set of points in Z^2 below a given rational line in the plane that have Manhattan Distance less than 1 to the line. Staircases are closely related to Beatty and Sturmian sequences of rational numbers. Connecting the…

This paper presents a solution to the following open problem in Number Theory and Geometry: How many points can you find on the (half) parabola $y=x^2$, $x>0$, so that the distance between any pair of them is rational? This problem sounds…

We derive a sufficient condition for topological horseshoe and uniform hyperbolicity of a 4-dimensional symplectic map, which is introduced by coupling the two 2-dimensional H\'enon maps via linear terms. The coupled H\'enon map thus…

In this paper, we consider polynomial correspondences $f (x, y)$ in $\mathbb{C}[x, y]$ of degree $d \ge 2$ in both the variables and obtain necessary and sufficient conditions in order that the equation $f (x, y) = 0$ can be expressed as…

This paper studies the maximum cardinality matching problem in stochastically evolving graphs. We formally define the arrival-departure model with stochastic departures. There, a graph is sampled from a specific probability distribution and…

A new scaling and recovering algorithm is proposed for simultaneously computing the matrix $\varphi$-functions that arise in exponential integrator methods for the numerical solution of certain first-order systems of ordinary differential…

This paper addresses the problem of determining the symmetries of a plane or space curve defined by a rational parametrization. We provide effective methods to compute the involution and rotation symmetries for the planar case. As for space…

Let $\psi : \mathbb{R}_{>0}\rightarrow \mathbb{R}_{>0}$ be a non-increasing function. Denote by $W(\psi)$ the set of $\psi$-well-approximable points and by $E(\psi)$ the set of points $x\in[0,1]$ such that for any $0 < \epsilon < 1$ there…

A Formal Orthogonal Pair is a pair $(A,B)$ of symbolic rectangular matrices such that $AB^T=0$. It can be applied for the construction of Hadamard and Weighing matrices. In this paper we introduce a systematic way for constructing such…

Two vertices u,v of connected graph G are doubly resolved by x,y\in V(G)if d(v; x)-d(u; x)\neq d(v; y)-d(u; y): A set W of vertices of the graph G is a doubly resolving set for G if every two distinct vertices of G are doubly resolved by…

In this paper, we remark that any optimal coupling for the quadratic Wasserstein distance $W^2_2(\mu,\nu)$ between two probability measures $\mu$ and $\nu$ with finite second order moments on $\mathbb{R}^d$ is the composition of a…

We consider a model of a two-dimensional interface of the SOS type, with finite-range, even, strictly convex, twice continuously differentiable interactions. We prove that, under an arbitrarily weak potential favouring zero-height, the…