scholarly journals Triangular fully packed loop configurations of excess 2

2015 ◽  
Vol DMTCS Proceedings, 27th... (Proceedings) ◽  
Author(s):  
Sabine Beil

International audience Triangular fully packed loop configurations (TFPLs) came up in the study of fully packed loop configurations on a square (FPLs) corresponding to link patterns with a large number of nested arches. To a TFPL is assigned a triple $(u,v;w)$ of $01$-words encoding its boundary conditions. A necessary condition for the boundary $(u,v;w)$ of a TFPL is $\lvert \lambda(u) \rvert +\lvert \lambda(v) \rvert \leq \lvert \lambda(w) \rvert$, where $\lambda(u)$ denotes the Young diagram associated with the $01$-word $u$. Wieland gyration, on the other hand, was invented to show the rotational invariance of the numbers $A_\pi$ of FPLs corresponding to a given link pattern $\pi$. Later, Wieland drift was defined as the natural adaption of Wieland gyration to TFPLs. The main contribution of this article is a linear expression for the number of TFPLs with boundary $(u,v;w)$ where $\lvert \lambda (w) \rvert - \lvert\lambda (u) \rvert - \lvert \lambda (v)\rvert \leq 2$ in terms of numbers of stable TFPLs that is TFPLs invariant under Wieland drift. These stable TFPLs have boundary $(u^{+},v^{+};w)$ for words $u^{+}$ and $v^{+}$ such that $\lambda (u) \subseteq \lambda (u^{+})$ and $\lambda (v) \subseteq \lambda (v^{+})$. Les configurations de boucles compactes triangulaires (”triangular fully packed loop configurations”, ou TFPLs) sont apparues dans l’étude des configurations de boucles compactes dans un carré (FPLs) correspondant à des motifs de liaison avec un grand nombre d’arcs imbriqués. À chaque TPFL on associe un triplet $(u,v;w)$ de mots sur {0,1}, qui encode ses conditions aux bords. Une condition nécessaire pour le bord $(u,v;w)$ d’un TFPL est $\lvert \lambda(u) \rvert +\lvert \lambda(v) \rvert \leq \lvert \lambda(w) \rvert$, où $\lambda(u)$ désigne le diagramme de Young associé au mot $u$. D’un autre côté, la giration de Wieland a été inventée pour montrer l’invariance par rotation des nombres $A_\pi$ de FPLs correspondant à un motif de liaison donné $\pi$. Plus tard, la déviation de Wieland a été définie pour adapter de manière naturelle la giration de Wieland aux TFPLs. La contribution principale de cet article est une expression linéaire pour le nombre de TFPLs de bord $(u,v;w)$, où $\lvert \lambda (w) \rvert - \lvert\lambda (u) \rvert - \lvert \lambda (v)\rvert \leq 2$, en fonction des nombres de TFPLs stables, <i>i.e</i>., les TFPLs invariants par déviation de Wieland. Ces TFPLs stables ont pour bord $(u^{+},v^{+};w)$, avec $u^{+}$ et $v^{+}$ des mots tels que $\lambda (u) \subseteq \lambda (u^{+})$ et $\lambda (v) \subseteq \lambda (v^{+})$.

10.37236/5536 ◽  
2016 ◽  
Vol 23 (4) ◽  
Author(s):  
Sabine Beil

Triangular fully packed loop configurations (TFPLs) came up in the study of fully packed loop configurations on a square (FPLs) corresponding to link patterns with a large number of nested arches. To a TFPL is assigned a triple $(u,v;w)$ of $01$-words encoding its boundary conditions which must necessarily satisfy that $d(u)+d(v)\leq d(w)$, where $d(u)$ denotes the number of inversions in $u$. Wieland gyration, on the other hand, was invented to show the rotational invariance of the numbers of FPLs having given link patterns. Later, Wieland drift — a map on TFPLs that is based on Wieland gyration — was defined. The main contribution of this article will be a linear expression for the number of TFPLs with boundary $(u,v;w)$ where $d(w)-d(u)-d(v)=2$ in terms of numbers of stable TFPLs, that is, TFPLs invariant under Wieland drift. This linear expression generalises already existing enumeration results for TFPLs with boundary $(u,v;w)$ where $d(w)-d(u)-d(v)=0,1$.


10.37236/4438 ◽  
2015 ◽  
Vol 22 (1) ◽  
Author(s):  
Sabine Beil ◽  
Ilse Fischer ◽  
Philippe Nadeau

Triangular fully packed loop configurations (TFPLs) emerged as auxiliary objects in the study of fully packed loop configurations on a square (FPLs) corresponding to link patterns with a large number of nested arches. Wieland gyration, on the other hand, was invented to show the rotational invariance of the numbers $A_\pi$ of FPLs corresponding to a given link pattern $\pi$. The focus of this article is the definition and study of Wieland drift on TFPLs. We show that the repeated application of this operation eventually leads to a configuration that is left invariant. We also provide a characterization of such stable configurations. Finally we apply Wieland drift to the study of TFPL configurations, in particular giving new and simple proofs of several results.


1969 ◽  
Vol 24 (8) ◽  
pp. 1235-1243 ◽  
Author(s):  
M Dobrowolny ◽  
F Engelmann ◽  
A Sestero

AbstractThe stability of a plasma diode with respect to longitudinal oscillations is investigated. If there are free particles emitted by the electrodes, the perturbations do not have the same dynamics as they would in an infinite plasma, contrary to the case where only particles trapped in the diode are present. This can be interpreted as due to a coupling of plane waves of different wave lengths, introduced by the boundary conditions at the electrodes. The occurrence of resonant-particle effects, on the other hand, is subjected to precisely the same conditions as in an infinite plasma.


2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Xuezhi Wu

LetBn,q(f;x),q∈(0,∞)be theq-Bernstein polynomials of a functionf∈C[0,1]. It has been known that, in general, the sequenceBn,qn(f)withqn→1+is not an approximating sequence forf∈C[0,1], in contrast to the standard caseqn→1-. In this paper, we give the sufficient and necessary condition under which the sequenceBn,qn(f)approximatesffor anyf∈C[0,1]in the caseqn>1. Based on this condition, we get that if1<qn<1+ln⁡2/nfor sufficiently largen, thenBn,qn(f)approximatesffor anyf∈C[0,1]. On the other hand, ifBn,qn(f)can approximateffor anyf∈C[0,1]in the caseqn>1, then the sequence(qn)satisfieslim¯n→∞n(qn-1)≤ln2.


Dialogue ◽  
1994 ◽  
Vol 33 (4) ◽  
pp. 701-724 ◽  
Author(s):  
Murray Miles

InLeibniz: Perception, Apperception, and Thought, Robert McRae alleges a flat “contradiction” (McRae 1976, p. 30) at the heart of Leibniz's doctrine of three grades of monads: bare entelechies characterized by perception; animal souls capable both of perception and of sensation; and rational souls, minds or spirits endowed not only with capacities for perception and sensation but also with consciousness of self or what Leibniz calls (introducing a new term of art into the vocabulary of philosophy) “apperception.” Apperception is a necessary condition of those distinctively human mental processes associated with understanding and with reason. Insofar as it is also a sufficient condition of rationality, it is not ascribable to animals. But apperception is a necessary condition of sensation or feeling as well; and animals are capable of sensation, according to Leibniz, who decisively rejected the Cartesian doctrine that beasts are nothing but material automata. “On the one hand,” writes McRae, “what distinguishes animals from lower forms of life is sensation or feeling, but on the other hand apperception is a necessary condition of sensation, and apperception distinguishes human beings from animals” (McRae 1976, p. 30). “We are thus left with an unresolved inconsistency in Leibniz's account of sensation, so far as sensation is attributable both to men and animals” (ibid., p. 34).


2012 ◽  
Vol 2012 ◽  
pp. 1-6 ◽  
Author(s):  
Ming Li

The contributions in this paper are in two folds. On the one hand, we propose a general approach for approximating ideal filters based on fractional calculus from the point of view of systems of fractional order. On the other hand, we suggest that the Paley and Wiener criterion might not be a necessary condition for designing physically realizable ideal filters. As an application of the present approach, we show a case in designing ideal filters for suppressing 50-Hz interference in electrocardiogram (ECG) signals.


Problemos ◽  
2020 ◽  
pp. 58-68
Author(s):  
Jolanta Saldukaitytė

By distinguishing between space and place, the article situates and analyses the meaning of the closest place – home – in the philosophy of Emmanuel Levinas. The effort to encounter transcendence, to escape, to leave, to not be attached a particular place, and not to be driven by a nostalgia to return, is dominant in Levinas’s philosophy. This article shows that dwelling in a place, as settling in a home, also has a positive meaning for Levinas. This positive meaning comes, however, not from an ontological but from an ethical relationship with a place. The home is shown as chosen place, warm and human, as opposed to a given or natural place. On the one hand, the home is a necessary condition for security, but also the very condition of interiority and activity, of having the place in the world in contrast to thrownness. On the other hand, it is not a place where I is embodied and rooted in like a vegetable, but a place where I welcome the other.


2014 ◽  
Vol DMTCS Proceedings vol. AT,... (Proceedings) ◽  
Author(s):  
Miriam Farber ◽  
Alexander Postnikov

International audience We discuss arrangements of equal minors in totally positive matrices. More precisely, we would like to investigate the structure of possible equalities and inequalities between the minors. We show that arrangements of equals minors of largest value are in bijection with <i>sorted sets</i>, which earlier appeared in the context of <i>alcoved polytopes</i> and Gröbner bases. Maximal arrangements of this form correspond to simplices of the alcoved triangulation of the hypersimplex; and the number of such arrangements equals the <i>Eulerian number</i>. On the other hand, we conjecture and prove in many cases that arrangements of equal minors of smallest value are exactly the <i>weakly separated sets</i>. Weakly separated sets, originally introduced by Leclerc and Zelevinsky, are closely related to the \textitpositive Grassmannian and the associated <i>cluster algebra</i>.


2010 ◽  
Vol DMTCS Proceedings vol. AN,... (Proceedings) ◽  
Author(s):  
Philippe Nadeau

International audience We are interested in Fully Packed Loops in a triangle (TFPLs), as introduced by Caselli at al. and studied by Thapper. We show that for Fully Packed Loops with a fixed link pattern (refined FPL), there exist linear recurrence relations with coefficients computed from TFPL configurations. We then give constraints and enumeration results for certain classes of TFPL configurations. For special boundary conditions, we show that TFPLs are counted by the famous Littlewood Richardson coefficients. Nous nous intéressons aux configurations de "Fully Packed Loops'' dans un triangle (TFPL), introduites par Caselli et al. et étudiées par Thapper. Nous montrons que pour les Fully Packed Loops avec un couplage donné, il existe des relations de récurrence linéaires dont les coefficients sont calculés à partir de certains TFPLs. Nous donnons ensuite des contraintes et des résultats énumératifs pour certaines familles de TFPLs. Pour certaines conditions au bord, nous montrons que le nombre de TFPL est donné par les coefficients de Littlewood Richardson.


2021 ◽  
pp. 297-304
Author(s):  
Guy Elgat

The concluding chapter addresses an apparent aporia: on the one hand, we have the Nietzschean argument that one must be causa sui for guilt to be justified, but on the other hand, we have the Heideggerian argument that not being causa sui is a necessary condition for guilt to be possible. The conclusion explains why this is only an apparent aporia. An alternative conception of guilt is sketched, one that rejects Nietzsche’s view of guilt as a form of self-punishment but retains Heidegger’s view that guilt expresses our normative commitments. This conception shows how guilt might nevertheless be justified.


Sign in / Sign up

Export Citation Format

Share Document