English
Related papers

Related papers: Combinatorics of reductions between equivalence re…

200 papers

We show that there is a general, informative and reliable procedure for discovering causal relations when, for all the investigator knows, both latent variables and selection bias may be at work. Given information about conditional…

Artificial Intelligence · Computer Science 2013-02-21 Peter L. Spirtes , Christopher Meek , Thomas S. Richardson

The purpose of this talk is to address a couple of simple-sounding questions: what boundary conditions are compatible with (a) Classical integrability? (b) Quantum integrability?

High Energy Physics - Theory · Physics 2016-09-06 E. Corrigan

This article gives necessary and sufficient conditions for a relation to be the containment relation between the facets and vertices of a polytope. Also given here, are a set of matrices parameterizing the linear moduli space and another…

Combinatorics · Mathematics 2014-12-02 Michael Gene Dobbins

We investigate the implementation of reduced-form allocation probabilities in a two-person bargaining problem without side payments, where the agents have to select one alternative from a finite set of social alternatives. We provide a…

Theoretical Economics · Economics 2022-02-23 Xu Lang

This article introduces recursive relations allowing the calculation of the number of partitions with constraints on the minimum and/or on the maximum fragment size.

Nuclear Theory · Physics 2009-11-07 Pierre Desesquelles

Two quantum effects are considered coexistent if they can be measured together. It is known that commutativity and comparability are sufficient but not necessary for the coexistence of two effects. We unify those two conditions to a simple…

Quantum Physics · Physics 2013-04-05 Teiko Heinosaari

There has been some work in the literature on limit theorems for the trace of commutators for compact Lie groups. We revisit this from the perspective of combinatorial representation theory.

Representation Theory · Mathematics 2025-02-14 Jason Fulman

Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…

Combinatorics · Mathematics 2022-10-07 MLE Slone

This article handles in a short manner a few Laplace transform pairs and some extensions to the basic equations are developed. They can be applied to a wide variety of functions in order to find the Laplace transform or its inverse when…

General Mathematics · Mathematics 2014-02-13 Henrik Stenlund

Based on the ranks of reduced density matrices, we derive necessary conditions for the separability of multiparticle arbitrary-dimensional mixed states, which are equivalent to sufficient conditions for entanglement. In a similar way we…

Quantum Physics · Physics 2007-05-23 Bo Chong , Hellmut Keiter , Joachim Stolze

We show that the deletion theorem of a free arrangement is combinatorial, i.e., whether we can delete a hyperplane from a free arrangement keeping freeness depends only on the intersection lattice. In fact, we give an explicit sufficient…

Combinatorics · Mathematics 2017-09-26 Takuro Abe

Ruzsa's equivalence theorem provided a framework for converting certain families of inequalities in additive combinatorics to entropic inequalities (which sometimes did not possess stand-alone entropic proofs). In this work, we first…

Information Theory · Computer Science 2025-02-06 Chin Wa Lau , Chandra Nair

As we go along with a bioinformatic analysis we stumbled over a new combinatorial question. Although the problem is a very special one, there are maybe more applications than only this one we have. This text is mainly about the general…

Combinatorics · Mathematics 2014-11-18 Alexander Platzer

We consider countable linear orders and study the quasi-order of convex embeddability and its induced equivalence relation. We obtain both combinatorial and descriptive set-theoretic results, and further extend our research to the case of…

Logic · Mathematics 2025-05-06 Martina Iannella , Alberto Marcone , Luca Motto Ros , Vadim Weinstein

We study the systems of ordinary differential equations which are implicit with respect to the higher derivatives, appearing in the linear form, and their solutions near the singular points. The invertibility of the higher derivatives…

Mathematical Physics · Physics 2007-05-23 M. V. Pomazanov

We give necessary and sufficient conditions for the Chebyshev inequality to be an equality.

Probability · Mathematics 2020-05-05 Adam Jakubowski

In this paper we investigate the structure of intermediate vertex algebras associated with a maximal conformal embedding of a reductive Lie algebra in a semisimple Lie algebra of classical type.

Representation Theory · Mathematics 2016-02-16 Victor G. Kac , Pierluigi Moseneder Frajria , Paolo Papi , Feng Xu

We consider a large family of equivalence relations on permutations in Sn that generalise those discovered by Knuth in his study of the Robinson-Schensted correspondence. In our most general setting, two permutations are equivalent if one…

Combinatorics · Mathematics 2011-11-17 Steven Linton , James Propp , Tom Roby , Julian West

We attempt to survey the field of combinatorial representation theory, describe the main results and main questions and give an update of its current status. We give a personal viewpoint on the field, while remaining aware that there is…

Representation Theory · Mathematics 2009-09-25 Hélène Barcelo , Arun Ram

We study approximations of compact linear multivariate operators defined over Hilbert spaces. We provide necessary and sufficient conditions on various notions of tractability. These conditions are mainly given in terms of sums of certain…

Numerical Analysis · Mathematics 2018-07-10 Peter Kritzer , Henryk Wozniakowski
‹ Prev 1 4 5 6 7 8 10 Next ›