نتایج جستجو برای: inclusion exclusion principle

تعداد نتایج: 350920  

2001
G KANIADAKIS

We introduce a nonlinear and noncanonical gauge transformation which allows the reduction of a complex nonlinearity, contained in a Schrödinger equation, into a real one. This Schrödinger equation describes a canonical system, whose kinetics is governed by a generalized Exclusion-Inclusion Principle. The transformation can be easily generalized and used in order to reduce complex nonlinearities...

2012
Mohamed Benaddy Mohamed Wakrim

Chang, Y. -R. , Lin, H. -Y. , Chen, I. -Y. & Kuo, S. -Y. , A Cut-Based Algorithm for Reliability Analysis of Terminal-Pair Network Using OBDD, Proceedings of the 27th Annual International Conference on Computer Software and Applications, 2003. Fard, N. S. & Lee, T. -H. , Cutset enumeration of network systems with link and node failures, Reliability Engineering and System Safety 1999, pp. 141 14...

Journal: :Eur. J. Comb. 2009
Wei Gao Qing-Hu Hou Guoce Xin

Using the inclusion–exclusion principle, we derive a formula of generating functions for P-partitions related to ordinal sums of posets. This formula simplifies computations for many variations of plane partitions, such as plane partition polygons and plane partitions with diagonals or double diagonals. We illustrate our method by several examples, some of which are new variations of plane part...

2007
Robert W. Robinson

The principle of inclusion-exclusion is specialized in order to count labeled digraphs with separately speciied out-components, in-components, and isolated components. Applications include counting digraphs with no in-nodes or out-nodes, digraphs with a source and a sink, and digraphs with a unique source and a unique sink.

2002
PAOLO ALUFFI Steven Kleiman

We propose a variation of the notion of Segre class, by forcing a naive `inclusion-exclusion' principle to hold. The resulting class is computationally tractable, and is closely related to Chern-Schwartz-MacPherson classes. We deduce several general properties of the new class from this relation, and obtain an expression for the Milnor class of an arbitrary scheme in terms of this class.

2008
ROBERT SHWARTZ

We define the excedence set and the excedance word on Gr,n, generalizing a work of Ehrenborg and Steingrimsson and use the inclusion-exclusion principle to calculate the number of colored permutations having a prescribed excedance word. We show some symmetric properties as Log concavity and unimodality of a specific sequence of excedance words.

2011
H S Harutyunyan V K Ohanyan

Department of Mathematics and Mechanics, Yerevan State University, Alex Manoogian, 1 0025 Yerevan, Armenia. [email protected]. Using the inclusion-exclusion principle and the Pleijel identity, an algorithm for calculation chord length distribution function for a bounded convex polygon is obtained. In the particular case an expression for the chord length distribution function for a rhombus is obta...

1996
J. Schwieger F. Šimkovic Amand Faessler

The Pauli principle, QRPA and the two-neutrino double beta decay * Abstract We examine the violation of the Pauli exclusion principle in the Quasipar-ticle Random Phase Approximation (QRPA) calculation of the two-neutrino double beta decay matrix elements, which has its origin in the quasi-boson approximation. For that purpose we propose a new renormalized QRPA with proton-neutron pairing metho...

Journal: :British journal for the history of mathematics 2022

The inclusion–exclusion principle is a simple, intuitive, and extremely versatile result. It one of the most useful methods for counting it can be used in different areas mathematics. In eighteenth century, first uses this result that appear literature are related to study problems games chance. However, formulations appear, independently by several authors, only nineteenth century. article, we...

Journal: :Theoretical Computer Science 2009

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید