English
Related papers

Related papers: On limits of betweenness relations

200 papers

The second part of the Birch and Swinnerton-Dyer (BSD) conjecture gives a conjectural formula for the order of the Shafarevich-Tate group of an elliptic curve in terms of other computable invariants of the curve. Cremona and Mazur initiated…

Number Theory · Mathematics 2013-11-28 Amod Agashe , Saikat Biswas

Belief function theory provides a flexible way to combine information provided by different sources. This combination is usually followed by a decision making which can be handled by a range of decision rules. Some rules help to choose the…

Artificial Intelligence · Computer Science 2015-01-29 Amira Essaid , Arnaud Martin , Grégory Smits , Boutheina Ben Yaghlane

If T is a multiplicity-free contraction of class C_0 with minimal function m_T, then it is quasisimilar to the Jordan block S(m_T). In case m_T is a Blaschke product with simple roots forming a Carleson sequence, we show that the relation…

Functional Analysis · Mathematics 2011-10-07 Raphaël Clouâtre

We propose an interpretation for the meets and joins in the lattice of experimental propositions of a physical theory, answering a question of Birkhoff and von Neumann in [1]. When the lattice is atomistic, it is isomorphic to the lattice…

Quantum Physics · Physics 2023-07-26 Pavlos Kazakopoulos , Georgios Regkas

Let $f(x)$ be a monic polynomial over $\mathbb{Q}$ with complex roots $\alpha_1,\dots,\alpha_n$. Linear relations among them and $1$ over $\mathbb{Q}$ play an important role when we study the distribution of roots modulo a prime. We study…

Number Theory · Mathematics 2018-10-17 Yoshiyuki Kitaoka

In this paper, we consider the realization of configuration of limit cycles of piecewise linear systems on the plane. We show that any configuration of Jordan curves can be realized by a discontinuous piecewise linear system with two zones…

Classical Analysis and ODEs · Mathematics 2018-03-21 Shaoqing Wang , Jiazhong Yang

The forcing method is a powerful tool to prove the consistency of set-theoretic assertions relative to the consistency of the axioms of set theory. Laver's theorem and Bukovsk\'y's theorem assert that set-generic extensions of a given…

Logic · Mathematics 2016-07-07 Sy David Friedman , Sakaé Fuchino , Hiroshi Sakai

This thesis (defended 10/07/2019) develops a theory of networks of hybrid open systems and morphisms. It builds upon a framework of networks of continuous-time open systems as product and interconnection. We work out categorical notions for…

Dynamical Systems · Mathematics 2019-12-30 James Schmidt

A hierarchical structure describing the inter-relationships of species has long been a fundamental concept in systematic biology, from Linnean classification through to the more recent quest for a 'Tree of Life.' In this paper we use an…

Populations and Evolution · Quantitative Biology 2009-08-21 Andreas Dress , Vincent Moulton , Mike Steel , Taoyang Wu

Boykin and Jackson recently introduced a property of countable Borel equivalence relations called Borel boundedness, which they showed is closely related to the union problem for hyperfinite equivalence relations. In this paper, we…

Logic · Mathematics 2019-08-16 Samuel Coskey , Scott Schneider

Motivated by conjectures of Demailly, Green-Griffiths, Lang, and Vojta, we show that several notions related to hyperbolicity behave similarly in families. We apply our results to show the persistence of arithmetic hyperbolicity along field…

Algebraic Geometry · Mathematics 2024-03-12 Raymond van Bommel , Ariyan Javanpeykar , Ljudmila Kamenova

Determining the randomized (or distributional) communication complexity of disjointness is a central problem in communication complexity, having roots in the foundational work of Babai, Frankl, and Simon in the 1980s and culminating in the…

Computational Complexity · Computer Science 2026-03-23 Zach Hunter , Aleksa Milojević , Benny Sudakov , Istvan Tomon

We investigate in the paper general (not necessarily definite) canonical systems of differential equation in the framework of extension theory of symmetric linear relations. For this aim we first introduce the new notion of a boundary…

Functional Analysis · Mathematics 2011-09-14 Vadim Mogilevskii

We present a new approach to the following meta-problem: given a quantitative property of trees, design a type system such that the desired property for the tree generated by an infinitary ground lambda-term corresponds to some property of…

Logic in Computer Science · Computer Science 2017-03-31 Paweł Parys

We prove that if $T$ is a complete theory with weak elimination of imaginaries, then there is an explicit bijection between strict independence relations for $T$ and strict independence relations for $T^{\text{eq}}$. We use this observation…

Logic · Mathematics 2018-09-12 Gabriel Conant

A series of nonrepresentable relation algebras is constructed from groups. We use them to prove that there are continuum many subvarieties between the variety of representable relation algebras and the variety of coset relation algebras. We…

Logic · Mathematics 2025-02-12 H. Andréka , S. Givant , I. Németi

In 1878, Jordan showed that a finite subgroup of GL(n,C) contains an abelian normal subgroup whose index is bounded by a function of n alone. Previously, the author has given precise bounds. Here, we consider analogues for finite linear…

Group Theory · Mathematics 2007-09-21 Michael J. Collins

We investigate several topological and combinatorial properties of line arrangements. We associate to a line arrangement a link obtained by intersecting the arrangement with some sphere. Several topics are discussed: (a) some link…

Geometric Topology · Mathematics 2013-01-15 Arnaud Bodin

We give effective proofs of residual finiteness and conjugacy separability for finitely generated nilpotent groups. In particular, we give precise asymptotic bounds for a function introduced by Bou-Rabee that measures how large the…

Group Theory · Mathematics 2017-06-01 Mark Pengitore

Strong external difference family (SEDF) and its generalizations GSEDF, BGSEDF in a finite abelian group $G$ are combinatorial designs raised by Paterson and Stinson [7] in 2016 and have applications in communication theory to construct…

Information Theory · Computer Science 2017-01-10 Jiejing Wen , Minghui Yang , Fangwei Fu , Keqin Feng