اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدLonely Points in Simplices
117
0
0.0
(
0
)
نشر من قبل
Maximilian Jaroschek
تاريخ النشر
2019
مجال البحث
الهندسة المعلوماتية
والبحث باللغة
English
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Given a lattice L in Z^m and a subset A of R^m, we say that a point in A is lonely if it is not equivalent modulo L to another point of A. We are interested in identifying lonely points for specific choices of L when A is a dilated standard simplex, and in conditions on L which ensure that the number of lonely points is unbounded as the simplex dilation goes to infinity.
قيم البحث
اقرأ أيضاً
Many algorithms for determining properties of real algebraic or semi-algebraic sets rely upon the ability to compute smooth points. Existing methods to compute smooth points on semi-algebraic sets use symbolic quantifier elimination tools. In this pa
per, we present a simple algorithm based on computing the critical points of some well-chosen function that guarantees the computation of smooth points in each connected compact component of a real (semi)-algebraic set. Our technique is intuitive in principal, performs well on previously difficult examples, and is straightforward to implement using existing numerical algebraic geometry software. The practical efficiency of our approach is demonstrated by solving a conjecture on the number of equilibria of the Kuramoto model for the $n=4$ case. We also apply our method to design an efficient algorithm to compute the real dimension of (semi)-algebraic sets, the original motivation for this research.
In this paper, we give new explicit representations of the Hilbert scheme of $mu$ points in $PP^{r}$ as a projective subvariety of a Grassmanniann variety. This new explicit description of the Hilbert scheme is simpler than the previous ones and glob
al. It involves equations of degree $2$. We show how these equations are deduced from the commutation relations characterizing border bases. Next, we consider infinitesimal perturbations of an input system of equations on this Hilbert scheme and describe its tangent space. We propose an effective criterion to test if it is a flat deformation, that is if the perturbed system remains on the Hilbert scheme of the initial equations. This criterion involves in particular formal reduction with respect to border bases.
Borel-fixed ideals play a key role in the study of Hilbert schemes. Indeed each component and each intersection of components of a Hilbert scheme contains at least one Borel-fixed point, i.e. a point corresponding to a subscheme defined by a Borel-fi
xed ideal. Moreover Borel-fixed ideals have good combinatorial properties, which make them very interesting in an algorithmic perspective. In this paper, we propose an implementation of the algorithm computing all the saturated Borel-fixed ideals with number of variables and Hilbert polynomial assigned, introduced from a theoretical point of view in the paper Segment ideals and Hilbert schemes of points, Discrete Mathematics 311 (2011).
We introduce a notion of noncommutative Choquet simplex, or briefly an nc simplex, that generalizes the classical notion of a simplex. While every simplex is an nc simplex, there are many more nc simplices. They arise naturally from C*-algebras and i
n noncommutative dynamics. We characterize nc simplices in terms of their geometry and in terms of structural properties of their corresponding operator systems. There is a natural definition of nc Bauer simplex that generalizes the classical definition of a Bauer simplex. We show that a compact nc convex set is an nc Bauer simplex if and only if it is affinely homeomorphic to the nc state space of a unital C*-algebra, generalizing a classical result of Bauer for unital commutative C*-algebras. We obtain several applications to noncommutative dynamics. We show that the set of nc states of a C*-algebra that are invariant with respect to the action of a discrete group is an nc simplex. From this, we obtain a noncommutative ergodic decomposition theorem with uniqueness. Finally, we establish a new characterization of discrete groups with Kazhdans property (T) that extends a result of Glasner and Weiss. Specifically, we show that a discrete group has property (T) if and only if for every action of the group on a unital C*-algebra, the set of invariant states is affinely homeomorphic to the state space of a unital C*-algebra.
Loneliness (i.e., the distressing feeling that often accompanies the subjective sense of social disconnection) is detrimental to mental and physical health, and deficits in self-reported feelings of being understood by others is a risk factor for lon
eliness. What contributes to these deficits in lonely people? We used functional magnetic resonance imaging (fMRI) to unobtrusively measure the relative alignment of various aspects of peoples mental processing of naturalistic stimuli (specifically, videos) as they unfold over time. We thereby tested whether lonely people actually process the world in idiosyncratic ways, rather than only exaggerating or misperceiving how dissimilar others views are to their own (which could lead them to feel misunderstood, even if they actually see the world similarly to those around them). We found evidence for such idiosyncrasy: lonely individuals neural responses during free viewing of the videos were dissimilar to peers in their communities, particularly in brain regions (e.g., regions of the default-mode network) in which similar responses have been associated with shared psychological perspectives and subjective understanding. Our findings were robust even after controlling for demographic similarities, participants overall levels of objective social isolation, and their friendships with each other. These results suggest that being surrounded predominantly by people who see the world differently from oneself may be a risk factor for loneliness, even if one is friends with them.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
