English
Related papers

Related papers: A disturbing supertask

200 papers

This paper studies the underlying combinatorial structure of a class of object rearrangement problems, which appear frequently in applications. The problems involve multiple, similar-geometry objects placed on a flat, horizontal surface,…

Robotics · Computer Science 2017-06-22 Shuai D. Han , Nicholas M. Stiffler , Athansios Krontiris , Kostas E. Bekris , Jingjin Yu

The central conjecture of parameterized complexity states that FPT is not equal to W[1], and is generally regarded as the parameterized counterpart to P != NP. We revisit the issue of the plausibility of FPT != W[1], focusing on two…

Computational Complexity · Computer Science 2018-07-20 Ralph C. Bottesch

In this paper, we introduce a new function related to the sum of element orders of finite groups. It is used to give some criteria for a finite group to be cyclic, abelian, nilpotent, supersolvable and solvable, respectively.

Group Theory · Mathematics 2019-04-09 Marius Tărnăuceanu

Let $w$ be a word in the free group of rank $n \in \mathbb{N}$ and let $\mathcal{V}(w)$ be the variety of groups defined by the law $w=1$. Define $\mathcal{V}(w^*)$ to be the class of all groups $G$ in which for any infinite subsets $X_1,…

Group Theory · Mathematics 2007-05-23 Alireza Abdollahi

Complementarity is a phenomenon explaining several core features of quantum theory, such as the well-known uncertainty principle. Roughly speaking, two objects are said to be complementary if being certain about one of them necessarily…

Quantum Physics · Physics 2023-09-22 Chung-Yun Hsieh , Roope Uola , Paul Skrzypczyk

We propose the {\alpha}-suboptimal covering number to characterize multi-task control problems where the set of dynamical systems and/or cost functions is infinite, analogous to the cardinality of finite task sets. This notion may help…

Optimization and Control · Mathematics 2021-04-27 James A. Preiss , Gaurav S. Sukhatme

In this paper, we present an approach for guaranteeing the completion of complex tasks with cyber-physical systems (CPS). Specifically, we leverage temporal logic trees constructed using Hamilton-Jacobi reachability analysis to (1) check…

Systems and Control · Electrical Eng. & Systems 2024-04-15 Frank J. Jiang , Kaj Munhoz Arfvidsson , Chong He , Mo Chen , Karl H. Johansson

Recently developed supersymmetric perturbation theory has been successfully employed to make a complete mathematical analysis the reason behind exact solvability of some non-central potentials. This investigation clarifies once more the…

Quantum Physics · Physics 2009-11-10 Bulent Gonul , Mehmet Kocak

The purpose of these notes is to collect in one place some facts on the category of finite totally ordered sets and some related categories. More specifically, we collect some results on them which will be useful for the study of iteratedly…

Category Theory · Mathematics 2025-12-29 Takuo Matsuoka

This paper describes the celebrated aperiodic hat tiling by Smith et al. [Comb. Theory 8 (2024), 6] as generated by an overlapping iterated function system. We briefly introduce and study infinite sequences of iterated function systems that…

Dynamical Systems · Mathematics 2025-10-02 Corey de Wit

We prove that the problem of deciding the consequence relation of the full Lambek calculus with weakening is complete for the class HAck of hyper-Ackermannian problems (i.e., level F_{\omega}^{\omega} of the ordinal-indexed hierarchy of…

Logic in Computer Science · Computer Science 2024-06-25 Vitor Greati , Revantha Ramanayake

We show relative to strong hypotheses that patterns of compact cardinals in the universe, where a compact cardinal is one which is either strongly compact or supercompact, can be virtually arbitrary. Specifically, we prove if V is a model…

Logic · Mathematics 2007-05-23 Arthur W. Apter

We study an order relation on the fibers of a continuous map and its application to the study of the structure of compact spaces of uncountable weight.

General Topology · Mathematics 2010-01-26 Antonio Avilés , Ondrej F. K. Kalenda

It is shown that the finite satisfiability problem for two-variable logic over structures with one total preorder relation, its induced successor relation, one linear order relation and some further unary relations is EXPSPACE-complete.…

Logic in Computer Science · Computer Science 2015-07-01 Thomas Schwentick , Thomas Zeume

We study elementary modal logics, i.e. modal logic considered over first-order definable classes of frames. The classical semantics of modal logic allows infinite structures, but often practical applications require to restrict our…

Logic in Computer Science · Computer Science 2012-10-10 Jakub Michaliszyn , Jan Otop , Piotr Witkowski

Completion is one of the most studied techniques in term rewriting and fundamental to automated reasoning with equalities. In this paper we present new correctness proofs of abstract completion, both for finite and infinite runs. For the…

Logic in Computer Science · Computer Science 2023-06-22 Nao Hirokawa , Aart Middeldorp , Christian Sternagel , Sarah Winkler

We prove singularity of some distributions of random continued fractions that correspond to iterated function systems with overlap and a parabolic point. These arose while studying the conductance of Galton-Watson trees.

Probability · Mathematics 2007-05-23 Russell Lyons

This is the second in a series of articles aimed at exploring the relationship between the complexity classes of P and NP. The research in this article aims to find conditions of an algorithmic nature that are necessary and sufficient to…

Computational Complexity · Computer Science 2023-11-07 Stepan G. Margaryan

New singularity theorems are derived for generic warped-product spacetimes of any dimension. The main purpose is to analyze the stability of (compact or large) extra dimensions against dynamical perturbations. To that end, the base of the…

General Relativity and Quantum Cosmology · Physics 2019-05-22 Nastassja Cipriani , José M. M. Senovilla

Instruction sequence is a key concept in practice, but it has as yet not come prominently into the picture in theoretical circles. This paper concerns instruction sequences, the behaviours produced by them under execution, the interaction…

Logic in Computer Science · Computer Science 2012-05-07 J. A. Bergstra , C. A. Middelburg
‹ Prev 1 8 9 10 Next ›