English
Related papers

Related papers: Renitent lines

200 papers

A nearly linear recurrence sequence (nlrs) is a complex sequence $(a_n)$ with the property that there exist complex numbers $A_0$,$\ldots$, $A_{d-1}$ such that the sequence $\big(a_{n+d}+A_{d-1}a_{n+d-1}+\cdots +A_0a_n\big)_{n=0}^{\infty}$…

Number Theory · Mathematics 2016-08-02 Shigeki Akiyama , Jan-Hendrik Evertse , Attila Pethő

Say that a subset S of the plane is a "circle-center set" if S is not a subset of a line, and whenever we choose three noncollinear points from S, the center of the unique circle through those three points is also an element of S. A problem…

Metric Geometry · Mathematics 2007-05-23 Greg Martin

Dessins d'enfants are combinatorial structures on compact Riemann surfaces defined over algebraic number fields, and regular dessins are the most symmetric of them. If G is a finite group, there are only finitely many regular dessins with…

Group Theory · Mathematics 2013-09-23 Gareth A. Jones

In this paper, we study arrangements of orthogonal circles, that is, arrangements of circles where every pair of circles must either be disjoint or intersect at a right angle. Using geometric arguments, we show that such arrangements have…

Computational Geometry · Computer Science 2019-08-27 Steven Chaplick , Henry Förster , Myroslav Kryven , Alexander Wolff

Let $S$ be a set of $n$ points in the plane in general position. Two line segments connecting pairs of points of $S$ cross if they have an interior point in common. Two vertex disjoint geometric graphs with vertices in $S$ cross if there…

Let $\F$ be a family of $n$ pairwise intersecting circles in the plane. We show that the number of lenses, that is convex digons, in the arrangement induced by $\F$ is at most $2n-2$. This bound is tight. Furthermore, if no two circles in…

Combinatorics · Mathematics 2024-03-11 Rom Pinchasi

We study over a number field, the iterates of automorphisms of the affine space. More precisely, we are interested in the periodic and non-periodic points; for the former the questions are similar to the ones about torsion points on abelian…

Number Theory · Mathematics 2009-09-29 Sandra Marcello

The notion of almost periodicity nontrivially generalizes the notion of periodicity. Strongly almost periodic sequences (=uniformly recurrent infinite words) first appeared in the field of symbolic dynamics, but then turned out to be…

Discrete Mathematics · Computer Science 2007-05-23 Yuri Pritykin

In this paper we look for the existence of large linear and algebraic structures of sequences of measurable functions with different modes of convergence. Concretely, the algebraic size of the family of sequences that are convergent in…

Functional Analysis · Mathematics 2019-12-19 M. Carmen Calderón-Moreno , Pablo J. Gerlach-Mena , José A. Prado-Bassas

We prove that a topologically generic network (an open and dense set of networks) of three or more inhibitory neurons have periodic behavior with a finite number of limit cycles that persist under small perturbations of the structure of the…

Dynamical Systems · Mathematics 2011-01-12 E. Catsigeras , A. Rovella , R. Budelli

The main goal of this thesis is to study $\mathbb{K}$-uniruled sets that appear in affine geometry. At the beginning we discuss the property of $\mathbb{K}$-uniruledness and its equivalent conditions. Then we bound from above the degree of…

Algebraic Geometry · Mathematics 2015-01-05 Michał Lasoń

We completely describe a new domain for abstract interpretation of numerical programs. Fixpoint iteration in this domain is proved to converge to finite precise invariants for (at least) the class of stable linear recursive filters of any…

Logic in Computer Science · Computer Science 2008-07-21 Eric Goubault , Sylvie Putot

The Delaunay triangulation (DT) is one of the most common and useful triangulations of point sets $P$ in the plane. DT is not unique when $P$ is degenerate, specifically when it contains quadruples of co-circular points. One way to achieve…

Computational Geometry · Computer Science 2015-10-16 Michael Khanimov , Micha Sharir

We study linear systems of surfaces in $\mathbb{P}^3$ singular along general lines. Our purpose is to identify and classify special systems of such surfaces, i.e., those nonempty systems where the conditions imposed by the multiple lines…

Algebraic Geometry · Mathematics 2019-01-15 M. Dumnicki , B. Harbourne , J. Roé , T. Szemberg , H. Tutaj-Gasińska

Set systems with strongly restricted intersections, called $\alpha$-intersecting families for a vector $\alpha$, were introduced recently as a generalization of several well-studied intersecting families including the classical oddtown and…

Combinatorics · Mathematics 2024-04-15 Xin Wei , Xiande Zhang , Gennian Ge

On an affine variety $X$ defined by homogeneous polynomials, every line in the tangent cone of $X$ is a subvariety of $X$. However there are many other germs of analytic varieties which are not of cone type but contain ``lines'' passing…

Algebraic Geometry · Mathematics 2007-05-23 Guangfeng Jiang , Mutsuo Oka

Let $(x_n)_{n\geq0}$ be a linear recurrence of order $k\geq2$ satisfying $$x_n=a_1x_{n-1}+a_2x_{n-2}+\dots+a_kx_{n-k}$$ for all integers $n\geq k$, where $a_1,\dots,a_k,x_0,\dots, x_{k-1}\in \mathbb{Z},$ with $a_k\neq0$. In [`The quotient…

Number Theory · Mathematics 2022-11-22 Deepa Antony , Rupam Barman

We study the probability for a random line to intersect a given plane curve, defined over a finite field, in a given number of points defined over the same field. In particular, we focus on the limits of these probabilities under successive…

Combinatorics · Mathematics 2021-04-30 Mehdi Makhul , Josef Schicho , Matteo Gallet

The concept of coreflexive set is introduced to study the structure of digraphs. New characterizations of line digraphs and nth-order line digraphs are given. Coreflexive sets also lead to another natural way of forming an intersection…

Combinatorics · Mathematics 2007-05-23 Xinming Liu , Douglas B. West

Given a set of objects $O$ in the plane, the corresponding intersection graph is defined as follows. Each object defines a vertex and an edge joins two vertices whenever the corresponding objects intersect. We study here the case of unit…

Computational Geometry · Computer Science 2025-12-09 Michael Hoffmann , Tillmann Miltzow , Simon Weber , Lasse Wulf