English
Related papers

Related papers: Reducing complexity of tail-biting trellises

200 papers

We strengthen the bound on the correlations of two spin-1/2 particles (qubits) in separable (non-entangled) states for locally orthogonal spin directions by much tighter bounds than the well-known Bell inequality. This provides a sharper…

Quantum Physics · Physics 2008-02-22 J. Uffink , M. Seevinck

The purpose of this paper is to give an algorithm for deciding the irreducibility of reduced algebroid curves over an algebraically closed field of arbitrary characteristic. To do this, we introduce a new notion of local tropical variety…

Commutative Algebra · Mathematics 2011-02-16 Takafumi Shibuta

Controllable Automatic Text Simplification (CATS) produces user-tailored outputs, yet controllability is often treated as a decoding problem and evaluated with metrics that are not reflective to the measure of control. We observe that…

Computation and Language · Computer Science 2026-04-03 Hanna Hubarava , Yingqiang Gao

We obtain turnpike results for optimal control problems with lack of stabilizability in the state equation and/or detectability in the state term in the cost functional. We show how, under weakened stabilizability/detectability conditions,…

Optimization and Control · Mathematics 2020-07-29 Dario Pighin , Noboru Sakamoto

We show that failure of local realism can be revealed to observers for whom only extremely coarse-grained measurements are available. In our instances, Bell's inequality is violated even up to the maximum limit while both the local…

Quantum Physics · Physics 2009-11-13 H. Jeong , M. Paternostro , T. C. Ralph

The classical notions of structural controllability and structural observability are receiving increasing attention in Network Science, since they provide a mathematical basis to answer how the network structure of a dynamic system affects…

Systems and Control · Computer Science 2018-12-13 Marco Tulio Angulo , Andrea Aparicio , Claude H. Moog

We consider the problem of supervised dimension reduction with a particular focus on extreme values of the target $Y\in\mathbb{R}$ to be explained by a covariate vector $X \in \mathbb{R}^p$. The general purpose is to define and estimate a…

Statistics Theory · Mathematics 2023-02-27 Anass Aghbalou , François Portier , Anne Sabourin , Chen Zhou

This work addresses controllability properties for some systems of partial differential equations in which the main feature is the coupling through nonlocal integral terms. In the first part, we study a nonlinear parabolic-elliptic system…

Analysis of PDEs · Mathematics 2023-12-07 Kuntal Bhandari , Víctor Hernández-Santamaría

Treatises on vibrations devote large space to study the dynamical behavior of an elastic system subject to known external tractions. In fact, usually a "system" is not an isolated body but it is part of a chain of mechanisms which disturb…

Optimization and Control · Mathematics 2012-06-15 Luciano Pandolfi

Partial Observability -- where agents can only observe partial information about the true underlying state of the system -- is ubiquitous in real-world applications of Reinforcement Learning (RL). Theoretically, learning a near-optimal…

Machine Learning · Computer Science 2022-12-19 Fan Chen , Yu Bai , Song Mei

We use variational convergence to derive a hierarchy of one-dimensional rod theories, starting out from three-dimensional models in nonlinear elasticity subject to local volume-preservation. The densities of the resulting $\Gamma$-limits…

Analysis of PDEs · Mathematics 2020-02-25 Dominik Engl , Carolin Kreisbeck

In this article, we study the irreducibility of representations of the singular braid group on $n$ strands, namely $SB_n$. Our first finding is the determination of the forms of all irreducible representations $\rho : SB_2 \to…

Representation Theory · Mathematics 2025-11-20 Mohamad N. Nasser

By proving a local limit theorem for higher-order transitions, we determine the time required for necklace chains to be close to stationarity. Because necklace chains, built by arranging identical smaller chains around a directed cycle, are…

Probability · Mathematics 2021-11-22 Elizabeth L. Wilmer

We determine necessary and sufficient conditions for unicritical polynomials to be dynamically irreducible over finite fields. This result extends the results of Boston-Jones and Hamblen-Jones-Madhu regarding the dynamical irreducibility of…

Number Theory · Mathematics 2024-09-17 Tori Day , Rebecca DeLand , Jamie Juul , Cigole Thomas , Bianca Thompson , Bella Tobin

In this paper, we consider the problem of computing the nearest uncontrollable (C-uncontrollable) system to a given higher order system. The distance to the nearest uncontrollable system, also termed as the radius of controllability, is a…

Optimization and Control · Mathematics 2019-05-16 Tanay Saha , Swanand Khare , Subashish Datta

This paper considers quasi-reductivity - essentially, the property that an evaluation cannot get "stuck" due to a missing case in pattern matching - in the context of term rewriting with logical constraints.

Logic in Computer Science · Computer Science 2017-02-27 Cynthia Kop

We show that any state which violates the computable cross norm (or realignment) criterion for separability also violates the separability criterion of the local uncertainty relations. The converse is not true. The local uncertainty…

Quantum Physics · Physics 2007-05-23 Otfried Gühne , Matyas Mechler , Geza Toth , Peter Adam

We discuss progress towards the classification of irreducible admissible representations of reductive groups over non-archimedean local fields and the local Langlands correspondence. We also state some (partly conjectural) compatibility…

Representation Theory · Mathematics 2022-02-03 Tasho Kaletha

A counterexample to uniqueness of global minimizers of semilinear optimal control problems is given. The lack of uniqueness occurs for a special choice of the state-target in the cost functional. Our arguments show also that, for some…

Optimization and Control · Mathematics 2020-12-29 Dario Pighin

We prove an accessibility theorem for finite-index splittings of groups. Given a finitely presented group G there is a number n(G) such that, for every reduced locally finite G-tree T with finitely generated stabilizers, T/G has at most…

Group Theory · Mathematics 2024-04-17 Max Forester , Anthony Martino
‹ Prev 1 3 4 5 6 7 10 Next ›