English
Related papers

Related papers: Constructing orientable and negative orientable se…

200 papers

Cyclic codes, as a crucial subclass of linear codes, exhibit broad applications in communication systems, data storage systems, and consumer electronics, primarily attributed to their well-structured algebraic properties. Let $p$ denote an…

Information Theory · Computer Science 2025-09-15 Mengen Fang , Lanqiang Li , Fuyin Tian , Li Liu

It is shown that pairs of maximal linear recursive sequences (m-sequences) typically have mean square aperiodic crosscorrelation on par with that of random sequences, but that if one takes a pair of m-sequences where one is the reverse of…

Information Theory · Computer Science 2016-07-07 Daniel J. Katz

A Bernoulli random walk is a random trajectory starting from 0 and having i.i.d. increments, each of them being $+1$ or -1, equally likely. The other families cited in the title are Bernoulli random walks under various conditionings. A peak…

Probability · Mathematics 2007-05-23 Jean-Maxime Labarbe , Jean-François Marckert

In STOC'95 \cite{ADMSS95} Arya et al.\ showed that for any set of $n$ points in $\mathbb R^d$, a $(1+\epsilon)$-spanner with diameter at most 2 (respectively, 3) and $O(n \log n)$ edges (resp., $O(n \log \log n)$ edges) can be built in $O(n…

Computational Geometry · Computer Science 2011-08-31 Shay Solomon

In a purely Keplerian picture, the anomalistic, draconitic and sidereal orbital periods of a test particle orbiting a massive body coincide with each other. Such a degeneracy is removed when a post-Keplerian perturbing acceleration enters…

General Relativity and Quantum Cosmology · Physics 2024-07-08 Lorenzo Iorio

This paper combines two important directions of research in temporal resoning: that of finding maximal tractable subclasses of Allen's interval algebra, and that of reasoning with metric temporal information. Eight new maximal tractable…

Artificial Intelligence · Computer Science 2008-02-03 T. Drakengren , P. Jonsson

Inverse problems are in many cases solved with optimization techniques. When the underlying model is linear, first-order gradient methods are usually sufficient. With nonlinear models, due to nonconvexity, one must often resort to…

Numerical Analysis · Mathematics 2023-05-15 Arttu Arjas , Mikko J. Sillanpää , Andreas Hauptmann

The Consecutive Ones Property is an important notion for binary matrices, both from a theoretical and applied point of view. Tucker gave in 1972 a characterization of matrices that do not satisfy the Consecutive Ones Property in terms of…

Data Structures and Algorithms · Computer Science 2012-07-03 Cedric Chauve , Tamon Stephen , Maria Tamayo

We characterize inverse limits of nilsystems in topological dynamics, via a structure theorem for topological dynamical systems that is an analog of the structure theorem for measure preserving systems. We provide two applications of the…

Dynamical Systems · Mathematics 2009-05-20 Bernard Host , Bryna Kra , Alejandro Maass

Let PCS_p^N denote a set of p binary sequences of length N such that the sum of their periodic auto-correlation functions is a delta-function. In the 1990, Boemer and Antweiler addressed the problem of constructing such sequences. They…

Information Theory · Computer Science 2009-09-01 Dragomir Z. Djokovic

Non-linear recurrences which generate integers in a surprising way have been studied by many people. Typically people study recurrences that are linear in the highest order term. In this paper I consider what happens when the recurrence is…

Combinatorics · Mathematics 2009-09-03 Emilie Hogan

Suppose one has a collection of parameters indexed by a (possibly infinite dimensional) set. Given data generated from some distribution, the objective is to estimate the maximal parameter in this collection evaluated at this distribution.…

Methodology · Statistics 2016-05-26 Alexander R. Luedtke , Mark J. van der Laan

Afshani, Barbay and Chan (2017) introduced the notion of instance-optimal algorithm in the order-oblivious setting. An algorithm A is instance-optimal in the order-oblivious setting for a certain class of algorithms A* if the following…

Computational Geometry · Computer Science 2023-07-28 Jean Cardinal , Justin Dallant , John Iacono

Modern N-body techniques for planetary dynamics are generally based on symplectic algorithms specially adapted to the Kepler problem. These methods have proven very useful in studying planet formation, but typically require the timestep for…

Astrophysics · Physics 2009-11-13 D. S. McNeil , R. P. Nelson

In this paper, we present a computational search for best-known merit factors of longer binary sequences with an odd length. Finding low autocorrelation binary sequences with optimal or suboptimal merit factors is a very difficult…

Information Theory · Computer Science 2023-01-13 Janez Brest , Borko Bošković

We revisit occurrence typing, a technique to refine the type of variables occurring in type-cases and, thus, capturesome programming patterns used in untyped languages. Although occurrence typing was tied from its inceptionto set-theoretic…

Programming Languages · Computer Science 2022-02-25 Giuseppe Castagna , Victor Lanvin , Mickaël Laurent , Kim Nguyen

In the past decade, the use of ordinal patterns in the analysis of time series and dynamical systems has become an important and rich tool. Ordinal patterns (otherwise known as a permutation patterns) are found in time series by taking $n$…

Combinatorics · Mathematics 2014-12-03 Sergi Elizalde , Megan Martinez

An important result of H. Weyl states that for every sequence $\left(a_{n}\right)_{n\geq 1}$ of distinct positive integers the sequence of fractional parts of $\left(a_{n} \alpha \right)_{n \geq1}$ is uniformly distributed modulo one for…

Number Theory · Mathematics 2015-07-24 Christoph Aistleitner , Gerhard Larcher

Let $\mathcal{A}$ be a finite subset of $\mathbb{N}$ including $0$ and $f_\mathcal{A}(n)$ be the number of ways to write $n=\sum_{i=0}^{\infty}\epsilon_i2^i$, where $\epsilon_i\in\mathcal{A}$. The sequence $\left(f_\mathcal{A}(n)\right)…

Number Theory · Mathematics 2014-11-10 Katherine Alexander Anders

Let $\mathscr{R}_{e,m}$ denote a finite commutative chain ring of even characteristic with maximal ideal $\langle u \rangle$ of nilpotency index $e \geq 3,$ Teichm$\ddot{u}$ller set $\mathcal{T}_{m},$ and residue field…

Information Theory · Computer Science 2026-01-16 Monika Yadav , Anuradha Sharma
‹ Prev 1 4 5 6 7 8 10 Next ›