English
Related papers

Related papers: Pseudo-loop conditions

200 papers

We define a new class of pseudo effect algebras, called kite pseudo effect algebras, which is connected not necessarily with partially ordered groups, but rather with generalized pseudo effect algebras where the greatest element is not…

Rings and Algebras · Mathematics 2014-03-11 Anatolij Dvurečenskij

This paper identifies a new class of shape invariant models. These models are based on extensions of conventional quantum mechanics that satisfy a string-motivated minimal length uncertainty relation. An important feature of our…

Quantum Physics · Physics 2009-11-13 Donald Spector

We consider the preservation of properties of being finitely generated, being finitely presented and being residually finite under direct products in the context of different types of algebraic structures. The structures considered include…

Rings and Algebras · Mathematics 2017-09-26 Peter Mayr , Nik Ruskuc

We introduce a new algebraic proof system, which has tight connections to (algebraic) circuit complexity. In particular, we show that any super-polynomial lower bound on any Boolean tautology in our proof system implies that the permanent…

Computational Complexity · Computer Science 2014-04-16 Joshua A. Grochow , Toniann Pitassi

Classical conditions for ensuring the robust stability of a linear system in feedback with a sector-bounded nonlinearity include small gain, circle, passivity, and conicity theorems. In this work, we present a similar stability condition,…

Optimization and Control · Mathematics 2019-09-18 Saman Cyrus , Laurent Lessard

We study rigidity questions for pairs of Lie algebras $(\mathfrak{g},\mathfrak{n})$ admitting a post-Lie algebra structure. We show that if $\mathfrak{g}$ is semisimple and $\mathfrak{n}$ is arbitrary, then we have rigidity in the sense…

Rings and Algebras · Mathematics 2022-05-10 Dietrich Burde , Karel Dekimpe , Mina Monadjem

The constraint satisfaction problem (CSP) on a relational structure B is to decide, given a set of constraints on variables where the relations come from B, whether or not there is a assignment to the variables satisfying all of the…

Logic in Computer Science · Computer Science 2014-06-03 Hubie Chen

This paper deals with the finite-time stabilization of a class of nonlinear infinite-dimensional systems. First, we consider a bounded matched perturbation in its linear form. It is shown that by using a set-valued function, both the…

Systems and Control · Electrical Eng. & Systems 2025-09-03 Kamal Fenza , Moussa Labbadi , Mohamed Ouzahra

We present a new proof rule for verifying lower bounds on quantities of probabilistic programs. Our proof rule is not confined to almost-surely terminating programs -- as is the case for existing rules -- and can be used to establish…

Logic in Computer Science · Computer Science 2023-02-14 Shenghua Feng , Mingshuai Chen , Han Su , Benjamin Lucien Kaminski , Joost-Pieter Katoen , Naijun Zhan

We establish existence, uniqueness and optimal regularity results for very weak solutions to certain nonlinear elliptic boundary value problems. We introduce structural asymptotic assumptions of Uhlenbeck type on the nonlinearity, which are…

Analysis of PDEs · Mathematics 2016-08-03 Miroslav Bulíček , Lars Diening , Sebastian Schwarzacher

The aim of the paper is to introduce a new systematic method that can produce lower bounds for eigenvalues. The main idea is to use nonconforming finite element methods. The general conclusion herein is that if local approximation…

Numerical Analysis · Mathematics 2013-04-22 Jun Hu , Yunqing Huang , Qun Lin

We study the existence and regularity of minimizers of the neo-Hookean energy in the closure of classes of deformations without cavitation. The exclusion of cavitation is imposed in the form of the divergence identities, which is equivalent…

Analysis of PDEs · Mathematics 2025-04-14 Panas Kalayanamit

During the last years, asymptotic (or sequential) constraint qualifications, which postulate upper semicontinuity of certain set-valued mappings and provide a natural companion of asymptotic stationarity conditions, have been shown to be…

Optimization and Control · Mathematics 2023-02-10 Matúš Benko , Patrick Mehlitz

The Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale data processing frameworks, and has been receiving increasingly more attention over the past few years, especially in the context of…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-01-08 Danupon Nanongkai , Michele Scquizzato

It is well known that an exponentially localized Hamiltonian must be gapless if its ground state has algebraic correlations. We show that even certain exponentially decaying correlations can imply gaplessness. This is exemplified by the…

Strongly Correlated Electrons · Physics 2025-04-29 Rahul Sahay , Curt von Keyserlingk , Ruben Verresen , Carolyn Zhang

We show that pseudovarieties of finitely generated algebras, i.e., classes $C$ of finitely generated algebras closed under finite products, homomorphic images, and subalgebras, can be described via a uniform structure $U$ on the free…

Logic · Mathematics 2020-12-09 Mai Gehrke , Michael Pinsker

The topological interpretation of modal logics provides descriptive languages and proof systems for reasoning about points of topological spaces. Recent work has been devoted to model checking of spatial logics on discrete spatial…

Logic in Computer Science · Computer Science 2020-05-13 Vincenzo Ciancia , Diego Latella , Mieke Massink , Erik de Vink

We compute the graded polynomial identities of the infinite dimensional upper triangular matrix algebra over an arbitrary field. If the grading group is finite, we prove that the set of graded polynomial identities admits a finite basis. We…

Rings and Algebras · Mathematics 2024-02-19 Micael Said Garcia , Felipe Yukihide Yasumura

For a closure space (P,f) with f(\emptyset)=\emptyset, the closures of open subsets of P, called the regular closed subsets, form an ortholattice Reg(P,f), extending the poset Clop(P,f) of all clopen subsets. If (P,f) is a finite convex…

Combinatorics · Mathematics 2013-07-08 Luigi Santocanale , Friedrich Wehrung

We give by simple arguments sufficient conditions, so called Lyapunov conditions, for Talagrand's transportation information inequality and for the logarithmic Sobolev inequality. Those sufficient conditions work even in the case where the…

Probability · Mathematics 2008-10-31 Patrick Cattiaux , Arnaud Guillin , Liming Wu
‹ Prev 1 4 5 6 7 8 10 Next ›