English
Related papers

Related papers: Not Every Osborn Loop Is Universal

200 papers

In this paper we devote to spaces that are not homotopically hausdorff and study their covering spaces. We introduce the notion of small covering and prove that every small covering of $X$ is the universal covering in categorical sense.…

Algebraic Topology · Mathematics 2011-03-29 Ali Pakdaman , Hamid Torabi , Behrooz Mashayekhy

Simon in his FOCS'94 paper was the first to show an exponential gap between classical and quantum computation. The problem he dealt with is now part of a well-studied class of problems, the hidden subgroup problems. We study Simon's problem…

Quantum Physics · Physics 2007-05-23 Pascal Koiran , Vincent Nesme , Natacha Portier

Nonuniformity is a central concept in computational complexity with powerful connections to circuit complexity and randomness. Nonuniform reductions have been used to study the isomorphism conjecture for NP and completeness for larger…

Computational Complexity · Computer Science 2018-01-19 John M. Hitchcock , Hadi Shafei

In 1895, Cantor showed that between every two countable dense real sets, there is an order isomorphism. In fact, there is always such an order isomorphism, which is the restriction of a universal entire function.

Complex Variables · Mathematics 2018-12-27 Paul M. Gauthier

We study a general class of supersymmetric Wilson loops operator in N = 4 super Yang-Mills theory, obtained as orbits of conformal transformations. These loops are the natural generalization of the familiar circular Wilson-Maldacena…

High Energy Physics - Theory · Physics 2015-06-04 Valentina Cardinali , Luca Griguolo , Domenico Seminara

This work considers special types of interval linear systems - overdetermined systems. Simply said these systems have more equations than variables. The solution set of an interval linear system is a collection of all solutions of all…

Numerical Analysis · Computer Science 2013-04-18 Jaroslav Horáček , Milan Hladík

The aim of this paper is to give a short overview on error bounds and to provide the first bricks of a unified theory. Inspired by the works of [8, 15, 13, 16, 10], we show indeed the centrality of the Lojasiewicz gradient inequality. For…

Optimization and Control · Mathematics 2017-05-02 Trong Phong Nguyen

In this paper we develop a Hamilton-Jacobi theory in the setting of almost Poisson manifolds. The theory extends the classical Hamilton-Jacobi theory and can be also applied to very general situations including nonholonomic mechanical…

Mathematical Physics · Physics 2012-09-25 Manuel de León , David Martín de Diego , Miguel Vaquero

We show that a non-universal Polish group can induce a complete orbit equivalence relation, which answers a question of Sabok from \cite{OPENPROBLEMS}.

Logic · Mathematics 2026-04-22 Longyun Ding , Ruiwen Li , Bo Peng

In 2000, A. Koldobsky asked whether two types of generalizations of the notion of an intersection-body, are in fact equivalent. The structures of these two types of generalized intersection-bodies have been studied by the author in…

Functional Analysis · Mathematics 2007-05-23 Emanuel Milman

Universal cycle for $k$-permutations is a cyclic arrangement in which each $k$-permutation appears exactly once as $k$ consecutive elements. Enumeration problem of universal cycles for $k$-permutations is discussed and one new enumerating…

Combinatorics · Mathematics 2021-11-30 Zuling Chang , Jie Xue

A linear constraint loop is specified by a system of linear inequalities that define the relation between the values of the program variables before and after a single execution of the loop body. In this paper we consider the problem of…

Logic in Computer Science · Computer Science 2024-05-24 Quentin Guilmant , Engel Lefaucheux , Joël Ouaknine , James Worrell

Orbit-finite sets are a generalisation of finite sets, and as such support many operations allowed for finite sets, such as pairing, quotienting, or taking subsets. However, they do not support function spaces, i.e. if X and Y are…

Logic in Computer Science · Computer Science 2024-04-09 Mikołaj Bojańczyk , Lê Thành Dũng Nguyên , Rafał Stefański

In this paper, we consider universal sums of generalized polygonal numbers. Fixing $m\in\mathbb{N}_{\geq 3}$, we show two finiteness theorems for universal sums of generalized polygonal numbers whose inputs have a restricted number $L$ of…

Number Theory · Mathematics 2026-04-10 Soumyarup Banerjee , Ben Kane , Kwan To Ng

In the author's PhD thesis (2019) universal envelopes were introduced as a tool for studying the continuously obtainable information on discontinuous functions. To any function $f \colon X \to Y$ between $\operatorname{qcb}_0$-spaces one…

Logic in Computer Science · Computer Science 2023-06-22 Eike Neumann

It is well known that Universal Cycles of $k$-letter words on an $n$-letter alphabet exist for all $k$ and $n$. In this paper, we prove that Universal Cycles exist for restricted classes of words, including: non-bijections, equitable words…

Combinatorics · Mathematics 2012-04-12 Arielle Leitner , Anant Godbole

A solution is given to a conjecture proposed by Y. Wigderson and A. Wigderson concerning a "Heisenberg-like" uncertainty principle. This is an old article already published in 2022.

Functional Analysis · Mathematics 2023-04-27 Yiyu Tang

Several results concerning pairs of polynomially convex sets whose union is not even rationally convex are given. It is shown that there is no restriction on how two spaces can be embedded in some $\C^N$ so as to be polynomially convex but…

Complex Variables · Mathematics 2021-08-23 Alexander J. Izzo

The global attraction is established for all finite energy solutions to a model $\mathbf{U}(1)$-invariant nonlinear Klein-Gordon equation in one dimension coupled to a finite number of nonlinear oscillators: We prove that {\it each finite…

Analysis of PDEs · Mathematics 2007-11-10 Alexander Komech , Andrew Komech

This paper is devoted to study the limit cycle problem of a cubic reversible system with an isochronous center, when it is perturbed inside a class of polynomials. An upper bound of the number of limit cycles is obtained using the Abelian…

Dynamical Systems · Mathematics 2025-03-13 Jihua Yang , Qipeng Zhang
‹ Prev 1 8 9 10 Next ›