English
Related papers

Related papers: Sequencing Partial Steiner Triple Systems

200 papers

Two vertex-labelled polygons are \emph{compatible} if they have the same clockwise cyclic ordering of vertices. The definition extends to polygonal regions (polygons with holes) and to triangulations---for every face, the clockwise cyclic…

Computational Geometry · Computer Science 2017-06-29 Anna Lubiw , Debajyoti Mondal

In this note we introduce and define half Cauchy sequences. We prove that a sequence of real numbers is convergent if and only if it is bounded and half Cauchy. We also provide an example of how the concept may be used.

Classical Analysis and ODEs · Mathematics 2011-02-24 Frank J. Palladino

Via computer search, we found seven non-isomorphic $1$-rotational Steiner systems $S(2,6,226)$ and six point-transitive Steiner systems $S(2,6,441)$, resolving two of $29$ previously undecided cases for $S(2,6,v)$.

Combinatorics · Mathematics 2026-05-20 Taras Banakh , Ivan Hetman , Alex Ravsky

In this paper we study the maximum number $N$ of limit cycles that can exhibit a planar piecewise linear differential system formed by two pieces separated by a straight line. More precisely, we prove that this maximum number satisfies…

Dynamical Systems · Mathematics 2021-01-29 Rodrigo D. Euzébio , Jaume Llibre

An $N$-dimensional parallelepiped will be called a bar if and only if there are no more than $k$ different numbers among the lengths of its sides (the definition of bar depends on $k$). We prove that a parallelepiped can be dissected into…

Combinatorics · Mathematics 2008-09-12 Ivan Feshchenko , Danylo Radchenko , Lev Radzivilovsky , Maksym Tantsiura

We consider the problem of sequencing a set of positive numbers. We try to find the optimal sequence to maximize the variance of its partial sums. The optimal sequence is shown to have a beautiful structure. It is interesting to note that…

Combinatorics · Mathematics 2012-02-14 Li Wei , Wangdong Qi , Dingxing Chen , Peng Liu , En Yuan

Tverberg's theorem says that a set with sufficiently many points in $\mathbb{R}^d$ can always be partitioned into $m$ parts so that the $(m-1)$-simplex is the (nerve) intersection pattern of the convex hulls of the parts. The main results…

Metric Geometry · Mathematics 2018-08-03 Jesús A. De Loera , Thomas A. Hogan , Deborah Oliveros , Dominic Yang

A three-point iterative method for solving scalar non-linear equations was selected and then adapted to solve systems of non-linear equations. Subsequently, by applying Taylor's theorem to functions of $\R^{n}$ in $\R^{n}$, it is shown that…

General Mathematics · Mathematics 2026-01-23 Carlos E. Cadenas R. , Yorman J. Mendoza N

A partition of $n$ is $l$-regular if none of its parts is divisible by $l$. Let $b_l(n)$ denote the number of $l$-regular partitions of $n$. In this paper, using the theory of Hecke eigenforms explored by J.-P. Serre, we establish exact…

Number Theory · Mathematics 2020-06-30 Sarma Abinash

We investigate the following surprisingly widespread phenomenon which we call The Rule of Three: in order for a particular kind of commutation relation to hold for subsequences of elements of a ring labeled by any subset of indices, it is…

Rings and Algebras · Mathematics 2016-12-06 Jonah Blasiak , Sergey Fomin

Linearizing two partial orders to maximize the number of adjacencies and minimize the number of breakpoints is APX-hard. This holds even if one of the two partial orders is already a linear order and the other is an interval order, or if…

Computational Complexity · Computer Science 2021-10-07 Rain Jiang , Kai Jiang , Minghui Jiang

In this paper we present a graph theoretic construction of Steiner quadruple systems (SQS) admitting abelian groups as point-regular automorphism groups. The resulting SQS has an extra property which we call A-reversibility, where A is the…

Combinatorics · Mathematics 2017-10-20 Akihiro Munemasa , Masanori Sawa

We discuss a model comprised of a chain of three Kerr-like nonlinear oscillators pumped by two modes of external coherent field. We show that the system can be treated as nonlinear quantum scissors and behave as a three-qubit model. For…

Quantum Physics · Physics 2016-11-07 J. K. Kalaga , A. Kowalewska-Kudłaszyk , W. Leoński , A. Barasiński

We describe two families of statistical tests to detect partial correlation in vectorial timeseries. The tests measure whether an observed timeseries Y can be predicted from a second series X, even after accounting for a third series Z…

Methodology · Statistics 2024-04-25 Kenneth D. Harris , Alex E. Yuan

We consider two algorithms which can be used for proving positivity of sequences that are defined by a linear recurrence equation with polynomial coefficients (P-finite sequences). Both algorithms have in common that while they do succeed…

Symbolic Computation · Computer Science 2010-05-05 Manuel Kauers , Veronika Pillwein

An ordered triple $(s,p,n)$ is called admissible if there exist two different multisets $X=\{x_1,x_2,\dotsc,x_n\}$ and $Y=\{y_1,y_2,\dotsc,y_n\}$ such that $X$ and $Y$ share the same sum $s$, the same product $p$, and the same size $n$. We…

Two planar sets are circularly separable if there exists a circle enclosing one of the sets and whose open interior disk does not intersect the other set. This paper studies two problems related to circular separability. A linear-time…

Computational Geometry · Computer Science 2016-08-31 Jean-Daniel Boissonnat , Jurek Czyzowicz , Olivier Devillers , Mariette Yvinec

We classify finite posets with a particular sorting property, generalizing a result for rectangular arrays. Each poset is covered by two sets of disjoint saturated chains such that, for any original labeling, after sorting the labels along…

Combinatorics · Mathematics 2007-05-23 Bridget Eileen Tenner

Applied to a nonnegative $m\times n$ matrix with a nonzero $\sigma$-diagonal, the sequence of matrices constructed by alternate row and column scaling conveges to a doubly stochastic matrix. It is proved that if this sequence converges…

Combinatorics · Mathematics 2020-09-17 Alex Cohen , Melvyn B. Nathanson

Given a set of integers with no three in arithmetic progression, we construct a Stanley sequence by adding integers greedily so that no arithmetic progression is formed. This paper offers two main contributions to the theory of Stanley…

Combinatorics · Mathematics 2017-07-11 Richard A. Moy , David Rolnick