id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,803.03067 | Compositional Attention Networks for Machine Reasoning | We present the MAC network, a novel fully differentiable neural network
architecture, designed to facilitate explicit and expressive reasoning. MAC
moves away from monolithic black-box neural architectures towards a design that
encourages both transparency and versatility. The model approaches problems by
decomposing them into a series of attention-based reasoning steps, each
performed by a novel recurrent Memory, Attention, and Composition (MAC) cell
that maintains a separation between control and memory. By stringing the cells
together and imposing structural constraints that regulate their interaction,
MAC effectively learns to perform iterative reasoning processes that are
directly inferred from the data in an end-to-end approach. We demonstrate the
model's strength, robustness and interpretability on the challenging CLEVR
dataset for visual reasoning, achieving a new state-of-the-art 98.9% accuracy,
halving the error rate of the previous best model. More importantly, we show
that the model is computationally-efficient and data-efficient, in particular
requiring 5x less data than existing models to achieve strong results.
| cs.AI | we present the mac network a novel fully differentiable neural network architecture designed to facilitate explicit and expressive reasoning mac moves away from monolithic blackbox neural architectures towards a design that encourages both transparency and versatility the model approaches problems by decomposing them into a series of attentionbased reasoning steps each performed by a novel recurrent memory attention and composition mac cell that maintains a separation between control and memory by stringing the cells together and imposing structural constraints that regulate their interaction mac effectively learns to perform iterative reasoning processes that are directly inferred from the data in an endtoend approach we demonstrate the models strength robustness and interpretability on the challenging clevr dataset for visual reasoning achieving a new stateoftheart 989 accuracy halving the error rate of the previous best model more importantly we show that the model is computationallyefficient and dataefficient in particular requiring 5x less data than existing models to achieve strong results | [['we', 'present', 'the', 'mac', 'network', 'a', 'novel', 'fully', 'differentiable', 'neural', 'network', 'architecture', 'designed', 'to', 'facilitate', 'explicit', 'and', 'expressive', 'reasoning', 'mac', 'moves', 'away', 'from', 'monolithic', 'blackbox', 'neural', 'architectures', 'towards', 'a', 'design', 'that', 'encourages', 'both', 'transparency', 'and', 'versatility', 'the', 'model', 'approaches', 'problems', 'by', 'decomposing', 'them', 'into', 'a', 'series', 'of', 'attentionbased', 'reasoning', 'steps', 'each', 'performed', 'by', 'a', 'novel', 'recurrent', 'memory', 'attention', 'and', 'composition', 'mac', 'cell', 'that', 'maintains', 'a', 'separation', 'between', 'control', 'and', 'memory', 'by', 'stringing', 'the', 'cells', 'together', 'and', 'imposing', 'structural', 'constraints', 'that', 'regulate', 'their', 'interaction', 'mac', 'effectively', 'learns', 'to', 'perform', 'iterative', 'reasoning', 'processes', 'that', 'are', 'directly', 'inferred', 'from', 'the', 'data', 'in', 'an', 'endtoend', 'approach', 'we', 'demonstrate', 'the', 'models', 'strength', 'robustness', 'and', 'interpretability', 'on', 'the', 'challenging', 'clevr', 'dataset', 'for', 'visual', 'reasoning', 'achieving', 'a', 'new', 'stateoftheart', '989', 'accuracy', 'halving', 'the', 'error', 'rate', 'of', 'the', 'previous', 'best', 'model', 'more', 'importantly', 'we', 'show', 'that', 'the', 'model', 'is', 'computationallyefficient', 'and', 'dataefficient', 'in', 'particular', 'requiring', '5x', 'less', 'data', 'than', 'existing', 'models', 'to', 'achieve', 'strong', 'results']] | [-0.09119896231305186, -0.013467315773410682, -0.04649090348108179, 0.04890158592803392, -0.13132300192288532, -0.223511096979877, 0.10211896058394437, 0.4780112098261809, -0.28388739932791157, -0.3338196161351386, 0.03566357266353621, -0.2103221589991538, -0.18776302352906532, 0.1733304371146758, -0.11298547999797899, 0.09755946453482767, 0.10491454516219384, 0.0007745262834534144, -0.07505557091556679, -0.25381158849159197, 0.2634061396382986, 0.07896878021609062, 0.32851192479134556, 0.014254983871949801, 0.1470587426502922, -0.043294249067252065, 0.0038393738436376212, -0.031679949881864865, -0.058671706345773546, 0.18894706436160028, 0.2583601163297682, 0.20276370821194425, 0.3347335686331769, -0.4654088015523502, -0.2640140148326102, 0.011412152582367994, 0.14230328216662358, 0.07567837462125784, -0.01789358371965495, -0.3168453432495, 0.09925670911718136, -0.20297727435323035, 0.013916588634561012, -0.15303750825707746, -0.04406251712067492, -0.0072341998749869355, -0.32901705447625174, 0.01973622379777063, 0.1322986209634573, 0.03781507629011372, -0.05963332827386868, -0.09271621108529673, 0.006475515734807701, 0.15270229025631193, -0.020996782662507124, 0.059516387683143664, 0.15588451607062356, -0.17154480235437583, -0.16648077899234215, 0.3234276129585353, -0.03963161696530478, -0.2032514628138583, 0.2002824252355654, -0.0031168333130182735, -0.13194272638399415, 0.12821936468552253, 0.22088711105500627, 0.0936209076428252, -0.17889828167286267, 0.006215696216035919, -0.006472928578532331, 0.24415821173068158, 0.029276594295682516, 0.019455957270945144, 0.1533797361478684, 0.28196279289183107, 0.051410326853195784, 0.14178181881719762, -0.0777551658471207, -0.10913898523156916, -0.20003849575978222, -0.08783439539111913, -0.11707322157705856, -0.04449091869803846, -0.11423994229958544, -0.10214052384165538, 0.38870548523197274, 0.2542986090170445, 0.22234791443107804, 0.18899233691441786, 0.39886663151700286, 0.025704560866638734, 0.13781167390002946, 0.11538756343648787, 0.1883281531126778, 0.04031639140111151, 0.13494258241395757, -0.18654636840875835, 0.11219070994467208, 0.04046895413564601] |
1,803.03068 | Weyl Anomaly Induced Current in Boundary Quantum Field Theories | We show that when an external magnetic field parallel to the boundary is
applied, the Weyl anomaly gives rises to a new anomalous current in the
vicinity of the boundary. The induced current is a magnetization current in
origin: the movement of the virtual charges near the boundary give rise to a
nonuniform magnetization of the vacuum and hence a magnetization current.
Unlike other previously studied anomalous current phenomena such as the chiral
magnetic effect or the chiral vortical effect, this induced current does not
rely on the presence of a material system and can occur in vacuum. Similar to
the Casimir effect, our discovered phenomenon arises from the effect of the
boundary on the quantum fluctuations of the vacuum. However this induced
current is purely quantum mechanical and has no classical limit. We briefly
comment on how this induced current may be observed experimentally.
| hep-th cond-mat.other gr-qc | we show that when an external magnetic field parallel to the boundary is applied the weyl anomaly gives rises to a new anomalous current in the vicinity of the boundary the induced current is a magnetization current in origin the movement of the virtual charges near the boundary give rise to a nonuniform magnetization of the vacuum and hence a magnetization current unlike other previously studied anomalous current phenomena such as the chiral magnetic effect or the chiral vortical effect this induced current does not rely on the presence of a material system and can occur in vacuum similar to the casimir effect our discovered phenomenon arises from the effect of the boundary on the quantum fluctuations of the vacuum however this induced current is purely quantum mechanical and has no classical limit we briefly comment on how this induced current may be observed experimentally | [['we', 'show', 'that', 'when', 'an', 'external', 'magnetic', 'field', 'parallel', 'to', 'the', 'boundary', 'is', 'applied', 'the', 'weyl', 'anomaly', 'gives', 'rises', 'to', 'a', 'new', 'anomalous', 'current', 'in', 'the', 'vicinity', 'of', 'the', 'boundary', 'the', 'induced', 'current', 'is', 'a', 'magnetization', 'current', 'in', 'origin', 'the', 'movement', 'of', 'the', 'virtual', 'charges', 'near', 'the', 'boundary', 'give', 'rise', 'to', 'a', 'nonuniform', 'magnetization', 'of', 'the', 'vacuum', 'and', 'hence', 'a', 'magnetization', 'current', 'unlike', 'other', 'previously', 'studied', 'anomalous', 'current', 'phenomena', 'such', 'as', 'the', 'chiral', 'magnetic', 'effect', 'or', 'the', 'chiral', 'vortical', 'effect', 'this', 'induced', 'current', 'does', 'not', 'rely', 'on', 'the', 'presence', 'of', 'a', 'material', 'system', 'and', 'can', 'occur', 'in', 'vacuum', 'similar', 'to', 'the', 'casimir', 'effect', 'our', 'discovered', 'phenomenon', 'arises', 'from', 'the', 'effect', 'of', 'the', 'boundary', 'on', 'the', 'quantum', 'fluctuations', 'of', 'the', 'vacuum', 'however', 'this', 'induced', 'current', 'is', 'purely', 'quantum', 'mechanical', 'and', 'has', 'no', 'classical', 'limit', 'we', 'briefly', 'comment', 'on', 'how', 'this', 'induced', 'current', 'may', 'be', 'observed', 'experimentally']] | [-0.19597330684291905, 0.2101329157748139, -0.061808340514383824, 0.03988684363149363, -0.12226547876308705, -0.05865797803512421, 0.024577001626763878, 0.31821702147095365, -0.2657233988416606, -0.28082829921923835, 0.08036734613204567, -0.2501073697453429, -0.15278700396322228, 0.2026509258880055, -0.043000490266572815, -0.007608743086617825, -0.027693234050068363, 0.0919846771011964, -0.05945315206953292, -0.17920249958105128, 0.3246961534633462, 0.012101494337247427, 0.32923882461698917, 0.14278202917555283, 0.06988994395360351, -0.028885506840165835, 0.04038875150686965, 0.09240612490423794, -0.10280516330852245, 0.041707013386847645, 0.14458869289414122, -0.029175821184341248, 0.17238125050890035, -0.4847362509703842, -0.2086098550561944, 0.1130189454439899, 0.11062979738324366, 0.18527017775923013, -0.07105038321721528, -0.2909197816882154, 0.06361067663107453, -0.12278883411260001, -0.16020156835559113, -0.040763908682455274, -0.011911374705458253, -0.05002141655181888, -0.23491924736199193, 0.09771000519716021, 0.10299773818395774, 0.053085690914203634, -0.06983882988690687, -0.09812585055298204, -0.03107879944627398, 0.10282907388433975, 0.0862169622812934, 0.07466196416202804, 0.19880605746574442, -0.18399452073338987, -0.1595851486356094, 0.3580817659706648, -0.07636522839552369, -0.1707438139440612, 0.19171897968245222, -0.18999171953584099, -0.07090920643752505, 0.10599449722674387, 0.11567858822065695, 0.08781858719564203, -0.12147688088378596, 0.10387204287710182, -0.010086370262734849, 0.09393662539439211, 0.03515093907681775, 0.03211619688181913, 0.27452507776304563, 0.13731748599655413, 0.057471663919116914, 0.16334862168195882, -0.12047567412674684, -0.07979322651336933, -0.3141375145007824, -0.14975347783544968, -0.18004702370099981, 0.10141834495117455, -0.02605182329034192, -0.22757045644945625, 0.39544780639417726, 0.21852892029203538, 0.20236959798293638, -0.08268171673608495, 0.30812274823928704, 0.15578437991568755, 0.08850939538458298, 0.052805754173033195, 0.31639641754586123, 0.12424667446777739, 0.150531727695388, -0.32433689700535917, 0.07765033668356723, 0.020367895635166045] |
1,803.03069 | Fractional maximal function and its commutators on Orlicz spaces | In this paper, we find necessary and sufficient conditions for the
boundedness of fractional maximal operator $M_{\alpha}$ on Orlicz spaces. As an
application of this results we consider the boundedness of fractional maximal
commutator $M_{b,\alpha}$ and nonlinear commutator of fractional maximal
operator $[b,M_{\alpha}]$ on Orlicz spaces, when $b$ belongs to the Lipschitz
space, by which some new characterizations of the Lipschitz spaces are given.
| math.FA | in this paper we find necessary and sufficient conditions for the boundedness of fractional maximal operator m_alpha on orlicz spaces as an application of this results we consider the boundedness of fractional maximal commutator m_balpha and nonlinear commutator of fractional maximal operator bm_alpha on orlicz spaces when b belongs to the lipschitz space by which some new characterizations of the lipschitz spaces are given | [['in', 'this', 'paper', 'we', 'find', 'necessary', 'and', 'sufficient', 'conditions', 'for', 'the', 'boundedness', 'of', 'fractional', 'maximal', 'operator', 'm_alpha', 'on', 'orlicz', 'spaces', 'as', 'an', 'application', 'of', 'this', 'results', 'we', 'consider', 'the', 'boundedness', 'of', 'fractional', 'maximal', 'commutator', 'm_balpha', 'and', 'nonlinear', 'commutator', 'of', 'fractional', 'maximal', 'operator', 'bm_alpha', 'on', 'orlicz', 'spaces', 'when', 'b', 'belongs', 'to', 'the', 'lipschitz', 'space', 'by', 'which', 'some', 'new', 'characterizations', 'of', 'the', 'lipschitz', 'spaces', 'are', 'given']] | [-0.10846621101160371, 0.13156681735690365, -0.015758020071578876, 0.1229942873829887, -0.11510057677514851, -0.0766215922517909, -0.03005467350262084, 0.3478348891413401, -0.3449075511168866, -0.13819878223159957, 0.20077174977909418, -0.24383690011584097, -0.13800834276018634, 0.2269888650773773, -0.21246193817979286, 0.10011208626545137, -0.008725492239353202, 0.061095827645326534, -0.16806238752952407, -0.2700712468571192, 0.48130785472809323, -0.09979053839508976, 0.15529752689753734, 0.0655560607001895, 0.10044521492506776, -0.013803133933198831, -0.056424405569920226, -0.05384940889872803, -0.2807566032759727, 0.15462258647358607, 0.19955103631530488, 0.07549303246750719, 0.35186197478619835, -0.3621892051120836, -0.1207289837803396, 0.24053896488326174, 0.10544971602466253, -0.11110876550314032, -0.03878707748039493, -0.3231680007681014, 0.07702508273475345, -0.0945859043045886, -0.15595379321732455, -0.11000083635250728, 0.07407137136610728, 0.07570308715193755, -0.37014444373429767, 0.093440489008254, 0.1549002987199596, 0.0481702455925563, -0.2066322586680245, -0.0895924973523333, -0.028316073326600924, 0.04101591885306074, -0.010851321706829209, 0.04722498810207028, 0.03296508127823472, -0.06506121731437152, -0.12353862622486693, 0.31119041203979464, -0.06328634806125173, -0.29023074116262176, 0.07647503675922515, -0.22574484630188504, -0.13221526789730267, -0.005525014533232602, 0.13510407652291986, 0.16467929290725836, -0.1169017565721694, 0.18477456927824293, -0.11869360600405979, 0.056992131521895764, 0.07747040765123471, 0.16835220056098132, 0.0034043928275683095, 0.09866472167731632, 0.2729606652883665, 0.19152982350039696, 0.030895335355862266, -0.01569662823448963, -0.44004960263532306, -0.20826915831911186, -0.15831725796063742, 0.08177411251716198, -0.1438760333837727, -0.19688033850656617, 0.3553156907049318, 0.10498465494149262, 0.12613296774881227, 0.11638111095055051, 0.1663878501378118, 0.1482149160565025, 0.03385748909804822, 0.04383797624281475, 0.1437468315231695, 0.20845642641911077, 0.09142842477867527, -0.1952057316574076, 0.01905520729691027, 0.22387143007169166] |
1,803.0307 | Reflection length in the general linear and affine groups | We give an intrinsic criterion to tell whether a reflection factorization in
the general linear group is reduced, and give a formula for computing
reflection length in the general affine group.
| math.GR math.CO | we give an intrinsic criterion to tell whether a reflection factorization in the general linear group is reduced and give a formula for computing reflection length in the general affine group | [['we', 'give', 'an', 'intrinsic', 'criterion', 'to', 'tell', 'whether', 'a', 'reflection', 'factorization', 'in', 'the', 'general', 'linear', 'group', 'is', 'reduced', 'and', 'give', 'a', 'formula', 'for', 'computing', 'reflection', 'length', 'in', 'the', 'general', 'affine', 'group']] | [-0.13962586909051863, 0.05069960703774761, -0.17029781585499162, 0.11290710709703665, -0.18241932261134347, -0.1963240061135542, 0.03032026174027593, 0.3577127168856321, -0.3354660743667233, -0.23162424197841075, 0.1061153037909178, -0.1592855269630109, -0.14610703627488786, 0.20031652930042437, -0.10951966786336514, -0.03938174632287795, -0.03728017330379976, 0.10255587749904202, -0.14567261072055948, -0.23467910908643277, 0.33548068880073484, 0.021280285812193347, 0.26372329073567546, 0.0707202984560882, 0.09556857290684298, 0.1159425683379654, -0.04885183094489959, 0.002127296952230315, -0.15613524020919878, 0.11103401744678136, 0.3118365540679905, 0.10503424457725018, 0.1777473002326705, -0.4058188236648998, -0.11983383152513735, 0.11318900529295206, 0.08175959632987337, 0.11973811686038971, -0.058273046127250115, -0.20251599284670047, 0.10157573860018485, -0.18174603659539454, -0.20834406110788545, -0.022302392780059768, 0.09298468393183523, -0.09849531479900883, -0.2644285804201518, 0.056216507489162106, 0.09979990034574462, 0.11124441144807685, -0.025868731040147044, -0.037608049201568766, 0.08516225951813883, 0.10426612676031166, -0.03792642559405537, -0.031057879118429076, 0.06362087432775766, -0.08323855666563876, -0.12757668385822926, 0.4355724917784814, -0.03435017141483484, -0.24879004031179414, 0.10623492324544538, -0.13772262762030285, -0.1389189110392885, 0.13872174810497992, 0.173082857422771, 0.08211196129841189, -0.08927965287359492, 0.13077534308409197, -0.1615159838430343, 0.12931985396050638, 0.027296049700629328, 0.004591297241859138, 0.11914086149584863, 0.05223505277066461, 0.11595389367111268, 0.1469605767859086, 0.029311955575981447, 0.004521919271698402, -0.3273511273005316, -0.23202753649844277, -0.0989585051373128, 0.13622963724417553, -0.12385812215460089, -0.21148228933734278, 0.36387755229107793, 0.07030395163042892, 0.20717932635377492, 0.12518286885273072, 0.256241258113615, 0.22703929203412226, 0.031297921894058105, 0.08390955529325912, 0.1572394695643696, 0.20736104615348122, -0.054671369673263644, -0.21675108280032873, 0.04029453209330959, 0.1714645028715172] |
1,803.03071 | Investigating light curve modulation via kernel smoothing. II. New
additional modes in single-mode OGLE classical Cepheids | Detailed knowledge of the variability of classical Cepheids, in particular
their modulations and mode composition, provides crucial insight into stellar
structure and pulsation. However, tiny modulations of the dominant radial-mode
pulsation were recently found to be very frequent, possibly ubiquitous in
Cepheids, which makes secondary modes difficult to detect and analyse, since
these modulations can easily mask the potentially weak secondary modes. The aim
of this study is to re-investigate the secondary mode content in the sample of
OGLE-III and -IV single-mode classical Cepheids using kernel regression with
adaptive kernel width for pre-whitening, instead of using a constant-parameter
model. This leads to a more precise removal of the modulated dominant
pulsation, and enables a more complete survey of secondary modes with
frequencies outside a narrow range around the primary. Our analysis reveals
that significant secondary modes occur more frequently among first overtone
Cepheids than previously thought. The mode composition appears significantly
different in the Large and Small Magellanic Clouds, suggesting a possible
dependence on chemical composition. In addition to the formerly identified
non-radial mode at $P_2 \approx 0.6\ldots 0.65 P_1$ (0.62-mode), and a cluster
of modes with near-primary frequency, we find two more candidate non-radial
modes. One is a numerous group of secondary modes with $P_2 \approx 1.25 P_1$,
which may represent the fundamental of the 0.62-mode, supposed to be the first
harmonic of an $l \in \{7,8, 9\}$ non-radial mode. The other new mode is at
$P_2 \approx 1.46 P_1$, possibly analogous to a similar, rare mode recently
discovered among first overtone RR Lyrae stars.
| astro-ph.SR | detailed knowledge of the variability of classical cepheids in particular their modulations and mode composition provides crucial insight into stellar structure and pulsation however tiny modulations of the dominant radialmode pulsation were recently found to be very frequent possibly ubiquitous in cepheids which makes secondary modes difficult to detect and analyse since these modulations can easily mask the potentially weak secondary modes the aim of this study is to reinvestigate the secondary mode content in the sample of ogleiii and iv singlemode classical cepheids using kernel regression with adaptive kernel width for prewhitening instead of using a constantparameter model this leads to a more precise removal of the modulated dominant pulsation and enables a more complete survey of secondary modes with frequencies outside a narrow range around the primary our analysis reveals that significant secondary modes occur more frequently among first overtone cepheids than previously thought the mode composition appears significantly different in the large and small magellanic clouds suggesting a possible dependence on chemical composition in addition to the formerly identified nonradial mode at p_2 approx 06ldots 065 p_1 062mode and a cluster of modes with nearprimary frequency we find two more candidate nonradial modes one is a numerous group of secondary modes with p_2 approx 125 p_1 which may represent the fundamental of the 062mode supposed to be the first harmonic of an l in 78 9 nonradial mode the other new mode is at p_2 approx 146 p_1 possibly analogous to a similar rare mode recently discovered among first overtone rr lyrae stars | [['detailed', 'knowledge', 'of', 'the', 'variability', 'of', 'classical', 'cepheids', 'in', 'particular', 'their', 'modulations', 'and', 'mode', 'composition', 'provides', 'crucial', 'insight', 'into', 'stellar', 'structure', 'and', 'pulsation', 'however', 'tiny', 'modulations', 'of', 'the', 'dominant', 'radialmode', 'pulsation', 'were', 'recently', 'found', 'to', 'be', 'very', 'frequent', 'possibly', 'ubiquitous', 'in', 'cepheids', 'which', 'makes', 'secondary', 'modes', 'difficult', 'to', 'detect', 'and', 'analyse', 'since', 'these', 'modulations', 'can', 'easily', 'mask', 'the', 'potentially', 'weak', 'secondary', 'modes', 'the', 'aim', 'of', 'this', 'study', 'is', 'to', 'reinvestigate', 'the', 'secondary', 'mode', 'content', 'in', 'the', 'sample', 'of', 'ogleiii', 'and', 'iv', 'singlemode', 'classical', 'cepheids', 'using', 'kernel', 'regression', 'with', 'adaptive', 'kernel', 'width', 'for', 'prewhitening', 'instead', 'of', 'using', 'a', 'constantparameter', 'model', 'this', 'leads', 'to', 'a', 'more', 'precise', 'removal', 'of', 'the', 'modulated', 'dominant', 'pulsation', 'and', 'enables', 'a', 'more', 'complete', 'survey', 'of', 'secondary', 'modes', 'with', 'frequencies', 'outside', 'a', 'narrow', 'range', 'around', 'the', 'primary', 'our', 'analysis', 'reveals', 'that', 'significant', 'secondary', 'modes', 'occur', 'more', 'frequently', 'among', 'first', 'overtone', 'cepheids', 'than', 'previously', 'thought', 'the', 'mode', 'composition', 'appears', 'significantly', 'different', 'in', 'the', 'large', 'and', 'small', 'magellanic', 'clouds', 'suggesting', 'a', 'possible', 'dependence', 'on', 'chemical', 'composition', 'in', 'addition', 'to', 'the', 'formerly', 'identified', 'nonradial', 'mode', 'at', 'p_2', 'approx', '06ldots', '065', 'p_1', '062mode', 'and', 'a', 'cluster', 'of', 'modes', 'with', 'nearprimary', 'frequency', 'we', 'find', 'two', 'more', 'candidate', 'nonradial', 'modes', 'one', 'is', 'a', 'numerous', 'group', 'of', 'secondary', 'modes', 'with', 'p_2', 'approx', '125', 'p_1', 'which', 'may', 'represent', 'the', 'fundamental', 'of', 'the', '062mode', 'supposed', 'to', 'be', 'the', 'first', 'harmonic', 'of', 'an', 'l', 'in', '78', '9', 'nonradial', 'mode', 'the', 'other', 'new', 'mode', 'is', 'at', 'p_2', 'approx', '146', 'p_1', 'possibly', 'analogous', 'to', 'a', 'similar', 'rare', 'mode', 'recently', 'discovered', 'among', 'first', 'overtone', 'rr', 'lyrae', 'stars']] | [-0.14079979828308015, 0.1657145660087519, -0.10241006998648305, 0.07297099933318335, -0.1391442370014764, -0.13336879625687345, 0.09903168725635161, 0.3343401201150661, -0.2501070327883113, -0.30476403466632795, 0.042986871245952823, -0.26557048760901486, -0.09862947634177371, 0.21578519828414308, -0.03676316227176271, -0.014626375364882517, 0.07665218218111448, 0.005367018990144725, 0.01419681791767722, -0.17568218947983244, 0.2565936649196027, 0.04099329778950454, 0.20704175194814092, -0.08418713810155283, -0.012825561859201463, -0.058636438061801036, -0.07686084869875764, -0.08289210264393616, -0.12615317557416952, 0.0709642986766994, 0.24719237776494876, 0.06422233168176184, 0.25704167676915873, -0.35965263438100964, -0.19697592914056417, 0.10008903294210396, 0.22391814895395545, 0.05612126398288334, 0.002462320659856593, -0.22029313138761883, 0.09364233329699981, -0.1098890419914766, -0.16585116790162238, -0.0274117555308626, 0.08690150509059932, -0.0018580819120711928, -0.2596449032473232, 0.11337222866871069, 0.05505000927951187, 0.10694594489270082, -0.061232014950032214, -0.1500279462327146, -0.06674975333578279, 0.08319284639225179, 0.06027898127499539, 0.041582108344993596, 0.052634867737882784, -0.06214711720807798, -0.07400732051344618, 0.40616902200475574, -0.08031264524141166, -0.0754828209986925, 0.2384172041497622, -0.20291673725042197, -0.15722731745336205, 0.16292989067409913, 0.15967576662891558, 0.1257916236366053, -0.15438618871271573, -0.03481830973044178, 0.03931061886408041, 0.22793276193353074, 0.12366854287647007, 0.09548679909424945, 0.27470433049362214, 0.13292409016774775, 0.02119403707125919, 0.10288969498420585, -0.20403965643795563, -0.05247846005843871, -0.2513017568567265, -0.10777359688469755, -0.10434577525429342, 0.0030084423143264196, -0.09797718633472825, -0.1458165743757808, 0.3911085298427174, 0.041455826236097705, 0.19550384348622174, -0.02368641488017544, 0.2729287901117156, 0.1064462300028748, 0.12842330300736648, 0.08300880893015318, 0.31007718009733787, 0.19078623640188386, 0.07980430099950542, -0.24639838965081182, 0.04354787989342142, -0.018700235108438407] |
1,803.03072 | Natural orbitals renormalization group approach to a Kondo singlet | A magnetic impurity embedded in a metal host is collectively screened by a
cloud of conduction electrons to form a Kondo singlet below a characteristic
energy scale $T_K$, the Kondo temperature, through the mechanism of the Kondo
effect. We have reinvestigated the Kondo singlet by means of the newly
developed natural orbitals renormalization group (NORG) method. We find that,
in the framework of natural orbitals formalism, the Kondo screening mechanism
becomes transparent and simple, while the intrinsic structure of Kondo singlet
is clearly resolved. For a single impurity Kondo system, there exits a single
active natural orbital which screens the magnetic impurity dominantly. In the
perspective of entanglement, the magnetic impurity is entangled dominantly with
the active natural orbital, i.e., the subsystem formed by the active natural
orbital and the magnetic impurity basically disentangles from the remaining
system. We have also studied the structures of the active natural orbital
respectively projected into real space and momentum space. Moreover, the
dynamical properties, represented by one-particle Green's functions defined at
impurity site with active natural orbital, were obtained by using correction
vector method. In order to clarify the spatial extension of the Kondo screening
cloud, the concept of Kondo correlation energy was introduced. With this
concept we obtain a characteristic length scale beyond which the Kondo
screening cloud is hardly detected in experiment. Our numerical results
indicate that this characteristic length scale usually is just a few
nanometers, which interprets why it is difficult to detect the Kondo screening
cloud experimentally in a metal host.
| cond-mat.str-el | a magnetic impurity embedded in a metal host is collectively screened by a cloud of conduction electrons to form a kondo singlet below a characteristic energy scale t_k the kondo temperature through the mechanism of the kondo effect we have reinvestigated the kondo singlet by means of the newly developed natural orbitals renormalization group norg method we find that in the framework of natural orbitals formalism the kondo screening mechanism becomes transparent and simple while the intrinsic structure of kondo singlet is clearly resolved for a single impurity kondo system there exits a single active natural orbital which screens the magnetic impurity dominantly in the perspective of entanglement the magnetic impurity is entangled dominantly with the active natural orbital ie the subsystem formed by the active natural orbital and the magnetic impurity basically disentangles from the remaining system we have also studied the structures of the active natural orbital respectively projected into real space and momentum space moreover the dynamical properties represented by oneparticle greens functions defined at impurity site with active natural orbital were obtained by using correction vector method in order to clarify the spatial extension of the kondo screening cloud the concept of kondo correlation energy was introduced with this concept we obtain a characteristic length scale beyond which the kondo screening cloud is hardly detected in experiment our numerical results indicate that this characteristic length scale usually is just a few nanometers which interprets why it is difficult to detect the kondo screening cloud experimentally in a metal host | [['a', 'magnetic', 'impurity', 'embedded', 'in', 'a', 'metal', 'host', 'is', 'collectively', 'screened', 'by', 'a', 'cloud', 'of', 'conduction', 'electrons', 'to', 'form', 'a', 'kondo', 'singlet', 'below', 'a', 'characteristic', 'energy', 'scale', 't_k', 'the', 'kondo', 'temperature', 'through', 'the', 'mechanism', 'of', 'the', 'kondo', 'effect', 'we', 'have', 'reinvestigated', 'the', 'kondo', 'singlet', 'by', 'means', 'of', 'the', 'newly', 'developed', 'natural', 'orbitals', 'renormalization', 'group', 'norg', 'method', 'we', 'find', 'that', 'in', 'the', 'framework', 'of', 'natural', 'orbitals', 'formalism', 'the', 'kondo', 'screening', 'mechanism', 'becomes', 'transparent', 'and', 'simple', 'while', 'the', 'intrinsic', 'structure', 'of', 'kondo', 'singlet', 'is', 'clearly', 'resolved', 'for', 'a', 'single', 'impurity', 'kondo', 'system', 'there', 'exits', 'a', 'single', 'active', 'natural', 'orbital', 'which', 'screens', 'the', 'magnetic', 'impurity', 'dominantly', 'in', 'the', 'perspective', 'of', 'entanglement', 'the', 'magnetic', 'impurity', 'is', 'entangled', 'dominantly', 'with', 'the', 'active', 'natural', 'orbital', 'ie', 'the', 'subsystem', 'formed', 'by', 'the', 'active', 'natural', 'orbital', 'and', 'the', 'magnetic', 'impurity', 'basically', 'disentangles', 'from', 'the', 'remaining', 'system', 'we', 'have', 'also', 'studied', 'the', 'structures', 'of', 'the', 'active', 'natural', 'orbital', 'respectively', 'projected', 'into', 'real', 'space', 'and', 'momentum', 'space', 'moreover', 'the', 'dynamical', 'properties', 'represented', 'by', 'oneparticle', 'greens', 'functions', 'defined', 'at', 'impurity', 'site', 'with', 'active', 'natural', 'orbital', 'were', 'obtained', 'by', 'using', 'correction', 'vector', 'method', 'in', 'order', 'to', 'clarify', 'the', 'spatial', 'extension', 'of', 'the', 'kondo', 'screening', 'cloud', 'the', 'concept', 'of', 'kondo', 'correlation', 'energy', 'was', 'introduced', 'with', 'this', 'concept', 'we', 'obtain', 'a', 'characteristic', 'length', 'scale', 'beyond', 'which', 'the', 'kondo', 'screening', 'cloud', 'is', 'hardly', 'detected', 'in', 'experiment', 'our', 'numerical', 'results', 'indicate', 'that', 'this', 'characteristic', 'length', 'scale', 'usually', 'is', 'just', 'a', 'few', 'nanometers', 'which', 'interprets', 'why', 'it', 'is', 'difficult', 'to', 'detect', 'the', 'kondo', 'screening', 'cloud', 'experimentally', 'in', 'a', 'metal', 'host']] | [-0.1392736588029601, 0.2062899951281632, -0.06921977382559802, 0.129273161977633, -0.025920791732561257, -0.16567415370567082, 0.05972955221243735, 0.3471516693844312, -0.2937777100227004, -0.30150983880259213, -0.014674564932532136, -0.2781823664341891, -0.1059051243193521, 0.13306812993698894, 0.0459533060511892, -0.02387033723777951, -0.018621450071574175, 0.009149285674553424, -0.08452331757409469, -0.21537522274708848, 0.322297152224189, 0.04027230551444171, 0.23426653973625175, 0.10296043826984094, 0.0641211998253499, 0.024972703990652153, 0.08689386834804383, 0.030677163787509523, -0.08674272998143265, 0.06391823586096824, 0.21286386936174942, -0.02129113855416007, 0.25354270432477016, -0.4058822395376092, -0.20652382179913628, 0.005400646267281402, 0.16072574051259647, 0.12955797102536992, -0.08021572673146332, -0.3035685566793536, 0.036626471873624104, -0.169566303912905, -0.12444947181557793, -0.06686027209174686, 0.013666234206452611, -0.06372485622705426, -0.25987254445268293, 0.10821283262836033, 0.029654273589253464, 0.08659396463975547, -0.07476666615906334, -0.09958308033131448, -0.047550247077615786, 0.04935513994109536, 0.045139692985916524, 0.05499936164345681, 0.1959492258361674, -0.07579971794852071, -0.07140615568399274, 0.38609597655678435, -0.05264495586096826, -0.11481223702948126, 0.1872313315943179, -0.17587240979986427, -0.07133225404420897, 0.15802066398614514, 0.09346203110180795, 0.11279976896623829, -0.16435642939800996, 0.11508379294837286, -0.08227574510503531, 0.18015752823160414, -0.006020021554644382, 0.0917525822841858, 0.27583661636024426, 0.19269050408287772, 0.03611626717195447, 0.1478622329951678, -0.13900344208296803, -0.11920368898334721, -0.2278684351134986, -0.1440416813313335, -0.2522779843282132, 0.036224293664822146, -0.05452278144002776, -0.18118995641698205, 0.4243728588409131, 0.1575981620020078, 0.20797641641859496, -0.07053939216457943, 0.2790441083119413, 0.1163242734060438, 0.13991272048322514, 0.04203100211637479, 0.19867634168264295, 0.12659491185331717, 0.07894220227460629, -0.3199732551815003, 0.03612634325806525, 0.0786047266881233] |
1,803.03073 | Compositional optimization of hard-magnetic phases with machine-learning
models | Machine Learning (ML) plays an increasingly important role in the discovery
and design of new materials. In this paper, we demonstrate the potential of ML
for materials research using hard-magnetic phases as an illustrative case. We
build kernel-based ML models to predict optimal chemical compositions for new
permanent magnets, which are key components in many green-energy technologies.
The magnetic-property data used for training and testing the ML models are
obtained from a combinatorial high-throughput screening based on
density-functional theory calculations. Our straightforward choice of
describing the different configurations enables the subsequent use of the ML
models for compositional optimization and thereby the prediction of promising
substitutes of state-of-the-art magnetic materials like Nd$_2$Fe$_{14}$B with
similar intrinsic hard-magnetic properties but a lower amount of critical
rare-earth elements.
| cond-mat.mtrl-sci | machine learning ml plays an increasingly important role in the discovery and design of new materials in this paper we demonstrate the potential of ml for materials research using hardmagnetic phases as an illustrative case we build kernelbased ml models to predict optimal chemical compositions for new permanent magnets which are key components in many greenenergy technologies the magneticproperty data used for training and testing the ml models are obtained from a combinatorial highthroughput screening based on densityfunctional theory calculations our straightforward choice of describing the different configurations enables the subsequent use of the ml models for compositional optimization and thereby the prediction of promising substitutes of stateoftheart magnetic materials like nd_2fe_14b with similar intrinsic hardmagnetic properties but a lower amount of critical rareearth elements | [['machine', 'learning', 'ml', 'plays', 'an', 'increasingly', 'important', 'role', 'in', 'the', 'discovery', 'and', 'design', 'of', 'new', 'materials', 'in', 'this', 'paper', 'we', 'demonstrate', 'the', 'potential', 'of', 'ml', 'for', 'materials', 'research', 'using', 'hardmagnetic', 'phases', 'as', 'an', 'illustrative', 'case', 'we', 'build', 'kernelbased', 'ml', 'models', 'to', 'predict', 'optimal', 'chemical', 'compositions', 'for', 'new', 'permanent', 'magnets', 'which', 'are', 'key', 'components', 'in', 'many', 'greenenergy', 'technologies', 'the', 'magneticproperty', 'data', 'used', 'for', 'training', 'and', 'testing', 'the', 'ml', 'models', 'are', 'obtained', 'from', 'a', 'combinatorial', 'highthroughput', 'screening', 'based', 'on', 'densityfunctional', 'theory', 'calculations', 'our', 'straightforward', 'choice', 'of', 'describing', 'the', 'different', 'configurations', 'enables', 'the', 'subsequent', 'use', 'of', 'the', 'ml', 'models', 'for', 'compositional', 'optimization', 'and', 'thereby', 'the', 'prediction', 'of', 'promising', 'substitutes', 'of', 'stateoftheart', 'magnetic', 'materials', 'like', 'nd_2fe_14b', 'with', 'similar', 'intrinsic', 'hardmagnetic', 'properties', 'but', 'a', 'lower', 'amount', 'of', 'critical', 'rareearth', 'elements']] | [-0.05797639896722162, 0.05642566383400803, -0.04816633570803011, 0.05918703069654861, -0.06618036989811657, -0.15846917736230465, 0.05075195735714179, 0.3797025254707995, -0.2591047274115367, -0.3459936453756399, 0.06647635414549036, -0.25523264775037524, -0.1965720637557589, 0.24397809462568806, -0.03369318908156176, 0.11264304745548624, 0.036101172208725434, -0.034530431634133184, -0.11107526042746385, -0.22954345730746664, 0.28695649450182975, 0.08505258256402927, 0.3540307338781583, 0.01961640837579602, 0.04191821763326028, 0.023116628665901053, 0.030641461457542287, -0.003930058996609556, -0.1372526490386969, 0.2093452721497241, 0.29043427195488847, 0.11931602900272341, 0.2730952581254447, -0.4553933930166853, -0.22912275480727354, 0.06230496829451342, 0.13436109105094782, 0.126010840000562, -0.14446465792683355, -0.20767578058421793, 0.06756069782810907, -0.1470217068785635, -0.08154022684169372, -0.1533643582124051, 0.002640850486127826, 0.040460724519883716, -0.2879499843934687, 0.014245394200874053, 0.03942519059495592, 0.11136612989124606, -0.08758649674653099, -0.23149606612855492, 0.021849155541494247, 0.12621977999503534, 0.04788348464885863, 0.007187354925459599, 0.14314921776105355, -0.16428596956647812, -0.1257591508518208, 0.3901700119495513, -0.03379281754870483, -0.12963024604066117, 0.22616407276146355, -0.009215734136310725, -0.1798164875064863, 0.07169696326723428, 0.23259152756337592, 0.1376016296737835, -0.16146930230296846, 0.06897001066746766, 0.038350295313781625, 0.1609312686804167, -0.031142986093731066, 0.027471324478132213, 0.24556621016624072, 0.24973566453086166, 0.009560641666958998, 0.1238701243589564, -0.08235139803150744, -0.07782160798920607, -0.22537211649028993, -0.21340448753075386, -0.16379712651506428, -0.001700303509710281, -0.11756009874996498, -0.21637824246644732, 0.3807718835210776, 0.2060535240613636, 0.15343555588487204, 0.0018185610339666407, 0.27558294194561195, 0.048998446470198444, 0.113033807919762, 0.024924418056096003, 0.24356176628829623, 0.11746624703481187, 0.09586953797672944, -0.170965382870953, 0.12232858917819775, 0.02076331789537174] |
1,803.03074 | Steady state sedimentation of ultrasoft colloids | The structural and dynamical properties of ultra-soft colloids - star
polymers - exposed to a uniform external force field are analyzed applying the
multiparticle collision dynamics approach, a hybrid coarse-grain mesoscale
simulation approach, which captures thermal fluctuations and long-range
hydrodynamic interactions. In the weak field limit, the structure of the star
polymer is nearly unchanged, however in an intermediate regime, the radius of
gyration decreases, in particular transverse to the sedimentation direction. In
the limit of a strong field, the radius of gyration increases with field
strength. Correspondingly, the sedimentation coefficient increases with
increasing field strength, passes through a maximum and decreases again at high
field strengths. The maximum value depends on the functionality of the star
polymer. High field strengths lead to symmetry breaking with trailing, strongly
stretched polymer arms and a compact star polymer body. In the weak field
linear response regime, the sedimentation coefficient follows the scaling
relation of a star polymer in terms of functionality and arm length.
| cond-mat.soft | the structural and dynamical properties of ultrasoft colloids star polymers exposed to a uniform external force field are analyzed applying the multiparticle collision dynamics approach a hybrid coarsegrain mesoscale simulation approach which captures thermal fluctuations and longrange hydrodynamic interactions in the weak field limit the structure of the star polymer is nearly unchanged however in an intermediate regime the radius of gyration decreases in particular transverse to the sedimentation direction in the limit of a strong field the radius of gyration increases with field strength correspondingly the sedimentation coefficient increases with increasing field strength passes through a maximum and decreases again at high field strengths the maximum value depends on the functionality of the star polymer high field strengths lead to symmetry breaking with trailing strongly stretched polymer arms and a compact star polymer body in the weak field linear response regime the sedimentation coefficient follows the scaling relation of a star polymer in terms of functionality and arm length | [['the', 'structural', 'and', 'dynamical', 'properties', 'of', 'ultrasoft', 'colloids', 'star', 'polymers', 'exposed', 'to', 'a', 'uniform', 'external', 'force', 'field', 'are', 'analyzed', 'applying', 'the', 'multiparticle', 'collision', 'dynamics', 'approach', 'a', 'hybrid', 'coarsegrain', 'mesoscale', 'simulation', 'approach', 'which', 'captures', 'thermal', 'fluctuations', 'and', 'longrange', 'hydrodynamic', 'interactions', 'in', 'the', 'weak', 'field', 'limit', 'the', 'structure', 'of', 'the', 'star', 'polymer', 'is', 'nearly', 'unchanged', 'however', 'in', 'an', 'intermediate', 'regime', 'the', 'radius', 'of', 'gyration', 'decreases', 'in', 'particular', 'transverse', 'to', 'the', 'sedimentation', 'direction', 'in', 'the', 'limit', 'of', 'a', 'strong', 'field', 'the', 'radius', 'of', 'gyration', 'increases', 'with', 'field', 'strength', 'correspondingly', 'the', 'sedimentation', 'coefficient', 'increases', 'with', 'increasing', 'field', 'strength', 'passes', 'through', 'a', 'maximum', 'and', 'decreases', 'again', 'at', 'high', 'field', 'strengths', 'the', 'maximum', 'value', 'depends', 'on', 'the', 'functionality', 'of', 'the', 'star', 'polymer', 'high', 'field', 'strengths', 'lead', 'to', 'symmetry', 'breaking', 'with', 'trailing', 'strongly', 'stretched', 'polymer', 'arms', 'and', 'a', 'compact', 'star', 'polymer', 'body', 'in', 'the', 'weak', 'field', 'linear', 'response', 'regime', 'the', 'sedimentation', 'coefficient', 'follows', 'the', 'scaling', 'relation', 'of', 'a', 'star', 'polymer', 'in', 'terms', 'of', 'functionality', 'and', 'arm', 'length']] | [-0.18639342664100694, 0.21768134346721127, -0.06414526593180199, -0.008754328649774833, -0.058608886937145145, -0.1066544337583764, -0.021167632609467545, 0.36269928294350395, -0.280853942304384, -0.27219974686886417, 0.018521115837211256, -0.25955903748981657, -0.08879744234145619, 0.12657075890456326, 0.02453943567816168, 0.005778597859898582, 0.02022949417005293, 0.041412066097836944, -0.047085313984280217, -0.16474500098120187, 0.23701126190426294, 0.09306572891655378, 0.2963879821531009, 0.08410044081683736, 0.07376576115202624, 0.04512731708528008, 0.048007103520649255, 0.10564558536279947, -0.2001037154259393, 0.03346779854546185, 0.14261083038509242, -0.010662127498653718, 0.24339603163098217, -0.42800926709314807, -0.20777801867225207, 0.021008192317094655, 0.169177791904076, 0.1090702466397488, -0.03390020888837171, -0.22459046732401475, 0.035380462228204124, -0.17987938263755723, -0.1962135840440169, 0.018513892497867345, 0.08249601141578751, 0.09794191783948918, -0.27809731319321146, 0.13952354522189125, 0.06397812201375927, 0.09180597824160941, -0.042380915182002356, -0.04453240027651191, -0.03141753842064645, 0.10231110536842607, 0.1043843834195286, 0.08129643172142095, 0.29123839206949925, -0.2273173818131909, -0.014642601812374778, 0.3448309000377776, -0.11326546450000023, -0.12929635518812574, 0.21616388747061138, -0.17428016362828203, -0.08719954194712046, 0.19733720585645642, 0.14991309734177777, 0.10823628843791085, -0.10258227052436268, 0.06509924536476319, 0.0362137071278994, 0.21512991918134503, 0.06821709412324709, 0.02385958148370264, 0.2608686023770133, 0.17823081394453766, 0.04237461292432272, 0.17283998180355412, -0.120082549862218, -0.1476038390654139, -0.24234453703975306, -0.11598522792919538, -0.17514448435395025, 0.019231464172480627, -0.1874826329057214, -0.17408911078673556, 0.33988323228550144, 0.10055128062522271, 0.1844406629446894, 0.07094608929837705, 0.2373171664912661, 0.10983014151424868, 0.0784093265188858, 0.05744604620849714, 0.31071551161585376, 0.23090260019307607, 0.11330841887684073, -0.31653982055431695, 0.051656390064454175, 0.04152867717348272] |
1,803.03075 | Probing the collective dynamics of nuclear spin bath in a rare-earth ion
doped crystal | Probing collective spin dynamics is a current challenge in the field of
magnetic resonance spectroscopy and has important applications in material
analysis and quantum information protocols. Recently, the rare-earth ion doped
crystals are an attractive candidate for making long-lived quantum memory.
Further enhancement of its performance would benefit from the direct knowledge
on the dynamics of nuclear-spin bath in the crystal. Here we detect the
collective dynamics of nuclear-spin bath located around the rare-earth ions in
a crystal using dynamical decoupling spectroscopy method. From the measured
spectrum, we analyze the configuration of the spin bath and characterize the
flip-flop time between two correlated nuclear spins in a long time scale ($\sim
$1s). Furthermore, we experimentally demonstrate that the rare-earth ions can
serve as a magnetic quantum sensor for external magnetic field. These results
suggest that the rare-earth ion is a useful probe for complex spin dynamics in
solids and enable quantum sensing in the low-frequency regime, revealing
promising possibilities for applications in diverse fields.
| quant-ph | probing collective spin dynamics is a current challenge in the field of magnetic resonance spectroscopy and has important applications in material analysis and quantum information protocols recently the rareearth ion doped crystals are an attractive candidate for making longlived quantum memory further enhancement of its performance would benefit from the direct knowledge on the dynamics of nuclearspin bath in the crystal here we detect the collective dynamics of nuclearspin bath located around the rareearth ions in a crystal using dynamical decoupling spectroscopy method from the measured spectrum we analyze the configuration of the spin bath and characterize the flipflop time between two correlated nuclear spins in a long time scale sim 1s furthermore we experimentally demonstrate that the rareearth ions can serve as a magnetic quantum sensor for external magnetic field these results suggest that the rareearth ion is a useful probe for complex spin dynamics in solids and enable quantum sensing in the lowfrequency regime revealing promising possibilities for applications in diverse fields | [['probing', 'collective', 'spin', 'dynamics', 'is', 'a', 'current', 'challenge', 'in', 'the', 'field', 'of', 'magnetic', 'resonance', 'spectroscopy', 'and', 'has', 'important', 'applications', 'in', 'material', 'analysis', 'and', 'quantum', 'information', 'protocols', 'recently', 'the', 'rareearth', 'ion', 'doped', 'crystals', 'are', 'an', 'attractive', 'candidate', 'for', 'making', 'longlived', 'quantum', 'memory', 'further', 'enhancement', 'of', 'its', 'performance', 'would', 'benefit', 'from', 'the', 'direct', 'knowledge', 'on', 'the', 'dynamics', 'of', 'nuclearspin', 'bath', 'in', 'the', 'crystal', 'here', 'we', 'detect', 'the', 'collective', 'dynamics', 'of', 'nuclearspin', 'bath', 'located', 'around', 'the', 'rareearth', 'ions', 'in', 'a', 'crystal', 'using', 'dynamical', 'decoupling', 'spectroscopy', 'method', 'from', 'the', 'measured', 'spectrum', 'we', 'analyze', 'the', 'configuration', 'of', 'the', 'spin', 'bath', 'and', 'characterize', 'the', 'flipflop', 'time', 'between', 'two', 'correlated', 'nuclear', 'spins', 'in', 'a', 'long', 'time', 'scale', 'sim', '1s', 'furthermore', 'we', 'experimentally', 'demonstrate', 'that', 'the', 'rareearth', 'ions', 'can', 'serve', 'as', 'a', 'magnetic', 'quantum', 'sensor', 'for', 'external', 'magnetic', 'field', 'these', 'results', 'suggest', 'that', 'the', 'rareearth', 'ion', 'is', 'a', 'useful', 'probe', 'for', 'complex', 'spin', 'dynamics', 'in', 'solids', 'and', 'enable', 'quantum', 'sensing', 'in', 'the', 'lowfrequency', 'regime', 'revealing', 'promising', 'possibilities', 'for', 'applications', 'in', 'diverse', 'fields']] | [-0.13339069928486247, 0.23556410173806375, -0.04638910659009636, 0.02677513829257805, -0.0016357478026936695, -0.15591664395860125, 0.039211150406428225, 0.40612003654695866, -0.26537417500313915, -0.28423442265654847, 0.02392209939965297, -0.303741938161959, -0.09922178126530858, 0.23105664142952642, 0.061342526269826766, 0.031010271305226857, 0.010053060168369174, 0.03199877125983376, -0.04406374979128198, -0.13628084271672045, 0.218549471902118, 0.07754822103051105, 0.28309850939748266, 0.07437714705209635, 0.08020166350846611, 0.017788937414723743, 0.08546198277859153, -0.011559423675374469, -0.09938992232713556, 0.06853291409646683, 0.2834574632224536, 0.011561220831226376, 0.2529909535901757, -0.479462113063896, -0.22590344125495815, 0.046525555833174685, 0.16529067896488236, 0.19146251518040805, -0.1403351297137816, -0.2876073500800242, 0.006834356300603803, -0.15094492727572598, -0.1327912705785754, -0.14693694290273437, -0.0017943897684922488, 0.01501203566596548, -0.25295051252015116, 0.0751482202130563, 0.04282274098144759, 0.09079356256818467, -0.08623169817913483, -0.06403932984486767, 0.02755793557245364, 0.10192706206353472, 0.0017466333626610477, 0.010248536163821771, 0.22715746319182673, -0.12269015604397282, -0.1469139220738193, 0.36020245952190966, -0.06395493497825, -0.09440235863395373, 0.18732919481514795, -0.17598017610087083, -0.13811875813038701, 0.11745408603853387, 0.16287005224716622, 0.14199650511372744, -0.15426212673575232, 0.07324943274810411, 0.0174262412062778, 0.20334874649437906, -0.001625594055484526, 0.17000616599078766, 0.27500225451814647, 0.20983372512770385, 0.01499762522942591, 0.1510497895986901, -0.15156502186508122, -0.10956521722965123, -0.18324758270017166, -0.1951393282222675, -0.2385717740271059, 0.07657420645835639, -0.08716290292103644, -0.11542012631501321, 0.4216634250422031, 0.17883143288781866, 0.1223606868198414, -0.11676260695520152, 0.2681155862775063, 0.039686504804682575, 0.07265394491075379, 0.019505320264526258, 0.28471581683857594, 0.1872679884318353, 0.12569969367497125, -0.33269741324134305, 0.04692740654345692, -0.03516162363968494] |
1,803.03076 | Path collective variables without paths | We introduce a method to obtain one-dimensional collective variables for
studying rarely occurring transitions between two metastable states separated
by a high free energy barrier. No previous information, not even approximated,
on the path followed during the transition is needed. The only requirement is
to know the fluctuations of the system while in the two metastable states. With
this information in hand we build the collective variable using a modified
version of Fisher's linear discriminant analysis. The usefulness of this
approach is tested on the metadynamics simulation of two representative
systems. The first is the freezing of silver iodide into the superionic
$\alpha$-phase, the second is the study of a classical Diels Alder reaction.
The collective variable works very well in these two diverse cases.
| physics.comp-ph cond-mat.stat-mech physics.chem-ph | we introduce a method to obtain onedimensional collective variables for studying rarely occurring transitions between two metastable states separated by a high free energy barrier no previous information not even approximated on the path followed during the transition is needed the only requirement is to know the fluctuations of the system while in the two metastable states with this information in hand we build the collective variable using a modified version of fishers linear discriminant analysis the usefulness of this approach is tested on the metadynamics simulation of two representative systems the first is the freezing of silver iodide into the superionic alphaphase the second is the study of a classical diels alder reaction the collective variable works very well in these two diverse cases | [['we', 'introduce', 'a', 'method', 'to', 'obtain', 'onedimensional', 'collective', 'variables', 'for', 'studying', 'rarely', 'occurring', 'transitions', 'between', 'two', 'metastable', 'states', 'separated', 'by', 'a', 'high', 'free', 'energy', 'barrier', 'no', 'previous', 'information', 'not', 'even', 'approximated', 'on', 'the', 'path', 'followed', 'during', 'the', 'transition', 'is', 'needed', 'the', 'only', 'requirement', 'is', 'to', 'know', 'the', 'fluctuations', 'of', 'the', 'system', 'while', 'in', 'the', 'two', 'metastable', 'states', 'with', 'this', 'information', 'in', 'hand', 'we', 'build', 'the', 'collective', 'variable', 'using', 'a', 'modified', 'version', 'of', 'fishers', 'linear', 'discriminant', 'analysis', 'the', 'usefulness', 'of', 'this', 'approach', 'is', 'tested', 'on', 'the', 'metadynamics', 'simulation', 'of', 'two', 'representative', 'systems', 'the', 'first', 'is', 'the', 'freezing', 'of', 'silver', 'iodide', 'into', 'the', 'superionic', 'alphaphase', 'the', 'second', 'is', 'the', 'study', 'of', 'a', 'classical', 'diels', 'alder', 'reaction', 'the', 'collective', 'variable', 'works', 'very', 'well', 'in', 'these', 'two', 'diverse', 'cases']] | [-0.11497879668041283, 0.14297383776800182, -0.10423076080159292, 0.07296529728750277, -0.018874659646122206, -0.1382050509489472, 0.07036166770699163, 0.34302844786303, -0.26114006687871993, -0.28557508829380235, 0.0954216967727388, -0.28005656886201785, -0.12891674059773645, 0.16486739004856996, -0.009494376571608646, 0.02904660507826315, 0.03897484673765458, 0.05558106568153767, -0.05903544159129172, -0.2208588653931304, 0.29602676468916356, 0.03544865806602062, 0.28464129822508943, 0.018022912896178182, 0.09948037299064678, -0.0005553944164045876, 0.013100844844537336, 0.006743378245427002, -0.11869048453762286, 0.11226352936899921, 0.24085562871280877, 0.07533926765749892, 0.2850030665079342, -0.41685698232838825, -0.23138518350559376, 0.10109222511152527, 0.12348176777032355, 0.14917369389666185, -0.03187423369344024, -0.2616973714001717, 0.03944188172106571, -0.12759905395233223, -0.10484351789120645, -0.08015514324389157, -0.027245717891116416, 0.017179226421567072, -0.23375125601136637, 0.08042164703064988, 0.06347248882746263, 0.05361879355229077, -0.06894688123852134, -0.1005816789890354, -0.023749440050338425, 0.1091383115478581, 0.029076297052069416, -0.009397165247778063, 0.1283426497830078, -0.10899279976400712, -0.10423876520343905, 0.3829219601147117, -0.06535577531641108, -0.17276959227820043, 0.20745009657055621, -0.12413191887073129, -0.14196164007185988, 0.14567759389718693, 0.12491300232866179, 0.1598037053575559, -0.1634034540010391, 0.031188071393708307, -0.010902680603096323, 0.18792023728841037, 0.036871063212240714, 0.004294132384764511, 0.1665945455576636, 0.21560427408304908, 0.01822571072918964, 0.16804934431979013, -0.08599629747538617, -0.15688667422434646, -0.2768157593776367, -0.17930388129917124, -0.21217414065857507, 0.01652469986877423, -0.051856903940431714, -0.16359663899657467, 0.40742619421648524, 0.11080187386523316, 0.20084657472363043, -0.011269716694275098, 0.27123114558672834, 0.10649625387328167, 0.026123729151403232, 0.0302734331025051, 0.2503313054217987, 0.11474384558800187, 0.09716500161260727, -0.23257551405361981, 0.08071462499285717, 0.050779387873086716] |
1,803.03077 | Renormalizability of $\mathcal{N}=1$ super Yang-Mills theory in Landau
gauge with a Stueckelberg-like field | We construct a vector gauge invariant transverse field configuration $V^H$,
consisting of the well-known superfield $V$ and of a Stueckelberg-like chiral
superfield. The renormalizability of the Super Yang Mills action in the Landau
gauge is analyzed in the presence of a gauge invariant mass term $m^2 \int dV
\mathcal{M}(V^H)$, with $\mathcal{M}(V^H)$ a power series in $V^H$. Unlike the
original Stueckelberg action, the resulting action turns out to be
renormalizable to all orders.
| hep-th | we construct a vector gauge invariant transverse field configuration vh consisting of the wellknown superfield v and of a stueckelberglike chiral superfield the renormalizability of the super yang mills action in the landau gauge is analyzed in the presence of a gauge invariant mass term m2 int dv mathcalmvh with mathcalmvh a power series in vh unlike the original stueckelberg action the resulting action turns out to be renormalizable to all orders | [['we', 'construct', 'a', 'vector', 'gauge', 'invariant', 'transverse', 'field', 'configuration', 'vh', 'consisting', 'of', 'the', 'wellknown', 'superfield', 'v', 'and', 'of', 'a', 'stueckelberglike', 'chiral', 'superfield', 'the', 'renormalizability', 'of', 'the', 'super', 'yang', 'mills', 'action', 'in', 'the', 'landau', 'gauge', 'is', 'analyzed', 'in', 'the', 'presence', 'of', 'a', 'gauge', 'invariant', 'mass', 'term', 'm2', 'int', 'dv', 'mathcalmvh', 'with', 'mathcalmvh', 'a', 'power', 'series', 'in', 'vh', 'unlike', 'the', 'original', 'stueckelberg', 'action', 'the', 'resulting', 'action', 'turns', 'out', 'to', 'be', 'renormalizable', 'to', 'all', 'orders']] | [-0.21415219059480087, 0.1924335371303771, -0.04569833948543029, 0.050904724289596616, -0.1063757436483034, -0.12261889377342804, -0.03832207751526896, 0.29699463067310194, -0.16840528226457535, -0.2427273432424824, 0.014116962688110237, -0.26126250071184975, -0.15477424297215683, 0.02819548442161509, -0.05156968514035855, 0.01545705654259239, -0.019176558777689933, 0.12411899021161454, -0.07072621803464633, -0.2954985548359608, 0.29657280407845976, -0.032827000067170174, 0.23819882495195738, 0.00035997269275997364, 0.18216606994558657, 0.05471882782211261, -0.022603152474455004, 0.0016541058330663612, -0.05828566403527345, 0.05432238637336663, 0.159818844610293, 0.013824186380952596, 0.15450477868850743, -0.32142104849751507, -0.18913637424952218, 0.09444077179900237, 0.1174863503713693, 0.06303442736555423, 0.017647695687732525, -0.3011584822021957, 0.06983983329430754, -0.1901833229132795, -0.1390438318368979, -0.10022375844419003, 0.037112434589237506, -0.1294967606730227, -0.3536289872335536, 0.06566419265166457, 0.0030263445074004787, 0.0666008322466431, -0.007287276842232261, -0.10543527403580291, -0.13288388568242746, -0.0010267187974282673, 0.12412836104298809, 0.16851242762724203, 0.14369336795727058, -0.25203287514990996, -0.13929066496701645, 0.4311281638486045, -0.1869834510077323, -0.24756166922992895, 0.1482714268678267, -0.1241470192026879, -0.191292453384293, 0.1047937141614966, 0.08437817416020803, 0.1314237335231155, -0.18249756262770722, 0.27037229802642415, -0.07479713508593185, 0.09087526700958344, 0.09551560857466289, 0.031028437953708427, 0.19848818733756032, 0.059949658723780885, 0.05910178820735642, 0.11996755361656791, -0.022939538942383868, -0.10039594659714826, -0.4122143235772715, -0.14262044645313707, -0.08344209399739547, 0.12837928945996932, -0.06988813988843634, -0.12657612592114934, 0.439490421222789, 0.12486151119893683, 0.14961415608413517, 0.028858372369515044, 0.20945329032838345, 0.172857069876045, 0.13377900558906342, 0.06256909204779991, 0.21888871363231113, 0.20146816500595638, 0.04532304350286722, -0.27361123631708323, -0.22305740413389036, 0.21152790171493377] |
1,803.03078 | Pulsating strings with mixed three-form flux | Circular strings pulsating in $AdS_3 \times S^3 \times T^4$ with mixed R-R
and NS-NS three-form fluxes can be described by an integrable deformation of
the one-dimensional Neumann-Rosochatius mechanical model. In this article we
find a general class of pulsating solutions to this integrable system that can
be expressed in terms of elliptic functions. In the limit of strings moving in
$AdS_{3}$ with pure NS-NS three-form flux, where the action reduces to the
$SL(2,\mathbb{R})$ WZW model, we find agreement with the analysis of the
classical solutions of the system performed using spectral flow by Maldacena
and Ooguri. We use our elliptic solutions in $AdS_{3}$ to extend the dispersion
relation beyond the limit of pure NS-NS flux.
| hep-th | circular strings pulsating in ads_3 times s3 times t4 with mixed rr and nsns threeform fluxes can be described by an integrable deformation of the onedimensional neumannrosochatius mechanical model in this article we find a general class of pulsating solutions to this integrable system that can be expressed in terms of elliptic functions in the limit of strings moving in ads_3 with pure nsns threeform flux where the action reduces to the sl2mathbbr wzw model we find agreement with the analysis of the classical solutions of the system performed using spectral flow by maldacena and ooguri we use our elliptic solutions in ads_3 to extend the dispersion relation beyond the limit of pure nsns flux | [['circular', 'strings', 'pulsating', 'in', 'ads_3', 'times', 's3', 'times', 't4', 'with', 'mixed', 'rr', 'and', 'nsns', 'threeform', 'fluxes', 'can', 'be', 'described', 'by', 'an', 'integrable', 'deformation', 'of', 'the', 'onedimensional', 'neumannrosochatius', 'mechanical', 'model', 'in', 'this', 'article', 'we', 'find', 'a', 'general', 'class', 'of', 'pulsating', 'solutions', 'to', 'this', 'integrable', 'system', 'that', 'can', 'be', 'expressed', 'in', 'terms', 'of', 'elliptic', 'functions', 'in', 'the', 'limit', 'of', 'strings', 'moving', 'in', 'ads_3', 'with', 'pure', 'nsns', 'threeform', 'flux', 'where', 'the', 'action', 'reduces', 'to', 'the', 'sl2mathbbr', 'wzw', 'model', 'we', 'find', 'agreement', 'with', 'the', 'analysis', 'of', 'the', 'classical', 'solutions', 'of', 'the', 'system', 'performed', 'using', 'spectral', 'flow', 'by', 'maldacena', 'and', 'ooguri', 'we', 'use', 'our', 'elliptic', 'solutions', 'in', 'ads_3', 'to', 'extend', 'the', 'dispersion', 'relation', 'beyond', 'the', 'limit', 'of', 'pure', 'nsns', 'flux']] | [-0.14514469097813834, 0.10050559470381933, -0.051176374861160695, 0.07176076286148442, -0.047028575477230807, -0.12852392061006115, -0.016242768501346608, 0.2950557535919158, -0.1728828206050979, -0.24955428056418896, 0.10496655566435631, -0.2897381379066602, -0.1194833476582299, 0.17730127277014696, -0.1158180618253739, 0.03203260527680749, 0.05189783371903974, 0.04367018869632612, -0.14973999396088006, -0.2643913211584415, 0.2979599250581763, -0.037384894259435975, 0.24100602866838808, -0.03964709978874611, 0.08667622426038851, -0.006958656788439207, -0.012838287222320619, -0.004954601257391598, -0.1506218660524768, 0.08262031819347454, 0.24767212133409214, 0.0356878615308391, 0.029329523282206577, -0.4747122708870017, -0.23509500173284956, 0.1103686508540388, 0.2177234040816193, 0.09882837394859804, 0.05741186912940896, -0.27067122570360486, 0.03820795394966136, -0.21169018723151606, -0.17975119068489775, -0.036971284428854355, 0.04625979975756744, 0.026470139825149723, -0.22585523441109967, 0.14035207996063906, 0.03341755164058312, 0.002765947053937808, -0.10659134924492758, -0.03047996761540518, -0.07583993326103233, 0.040629021414434134, 0.1506820345393625, 0.12330751941417871, 0.09826304174392768, -0.16175517801438336, -0.1253305217737089, 0.3308108383141782, -0.16046246365927483, -0.27703550354294154, 0.11656034576261173, -0.14659063175685055, -0.1725800760657243, 0.12281066651415566, 0.09138003645221825, 0.19092902652109447, -0.1662393041117036, 0.17129565622238696, -0.01932402143416845, 0.1452107731716039, 0.08960424421112174, 0.016189311203766998, 0.2736627731634223, 0.13568525141428994, 0.008560853589164174, 0.1711103791107788, -0.06078566463826143, -0.1269265503723822, -0.38748761830122574, -0.11095175565341893, -0.06108502355282721, 0.17955411517203015, -0.13933592360724856, -0.1787023899509855, 0.37540563503685204, 0.07697992940463692, 0.11369042962222643, 0.07274958684878505, 0.15072283080738524, 0.1586412917630261, 0.025515897557868258, 0.11061815101572353, 0.25346571381163335, 0.1659976566331866, 0.08000807124190032, -0.2807267803415332, -0.14726124275880664, 0.16126972365638484] |
1,803.03079 | Hole-doping-induced half-metallic ferromagnetism in highly-air-stable
PdSe2 monolayer under uniaxial stress | Two-dimensional (2D) high-temperature ferromagnetic materials are important
for spintronic application. Fortunately, a highly-air-stable PdSe$_2$ monolayer
semiconductor has been made through exfoliation from the layered bulk material.
It is very highly desirable to realize robust ferromagnetism, even
half-metallic ferromagnetism (100\% spin polarization), in such excellent
nonmagnetic monolayer semiconductors. Here, the first-principles investigation
shows that the PdSe$_2$ monolayer can be made to attain Stoner ferromagnetism
with the maximal Curie temperature reaching to 800K, and the hole concentration
threshold for ferromagnetism decreases with applied uniaxial stress.
Furthermore, half-metallicity can be achieved in some hole concentration
regions. For the strain of 10\% (uniaxial tensile stress of 4.4 N/m), the
monolayer can attain half-metallic ferromagnetism up to 150 K. The magnetic
anisotropic energy is suitable to not only stabilizing the 2D ferromagnetism
but also realizing fast magnetization reversal. The magnetization can be also
controlled by applying a transverse uniaxial stress. The highly-air-stable
PdSe$_2$ monolayer, with these advantages, should be promising for spintronic
applications.
| cond-mat.mes-hall | twodimensional 2d hightemperature ferromagnetic materials are important for spintronic application fortunately a highlyairstable pdse_2 monolayer semiconductor has been made through exfoliation from the layered bulk material it is very highly desirable to realize robust ferromagnetism even halfmetallic ferromagnetism 100 spin polarization in such excellent nonmagnetic monolayer semiconductors here the firstprinciples investigation shows that the pdse_2 monolayer can be made to attain stoner ferromagnetism with the maximal curie temperature reaching to 800k and the hole concentration threshold for ferromagnetism decreases with applied uniaxial stress furthermore halfmetallicity can be achieved in some hole concentration regions for the strain of 10 uniaxial tensile stress of 44 nm the monolayer can attain halfmetallic ferromagnetism up to 150 k the magnetic anisotropic energy is suitable to not only stabilizing the 2d ferromagnetism but also realizing fast magnetization reversal the magnetization can be also controlled by applying a transverse uniaxial stress the highlyairstable pdse_2 monolayer with these advantages should be promising for spintronic applications | [['twodimensional', '2d', 'hightemperature', 'ferromagnetic', 'materials', 'are', 'important', 'for', 'spintronic', 'application', 'fortunately', 'a', 'highlyairstable', 'pdse_2', 'monolayer', 'semiconductor', 'has', 'been', 'made', 'through', 'exfoliation', 'from', 'the', 'layered', 'bulk', 'material', 'it', 'is', 'very', 'highly', 'desirable', 'to', 'realize', 'robust', 'ferromagnetism', 'even', 'halfmetallic', 'ferromagnetism', '100', 'spin', 'polarization', 'in', 'such', 'excellent', 'nonmagnetic', 'monolayer', 'semiconductors', 'here', 'the', 'firstprinciples', 'investigation', 'shows', 'that', 'the', 'pdse_2', 'monolayer', 'can', 'be', 'made', 'to', 'attain', 'stoner', 'ferromagnetism', 'with', 'the', 'maximal', 'curie', 'temperature', 'reaching', 'to', '800k', 'and', 'the', 'hole', 'concentration', 'threshold', 'for', 'ferromagnetism', 'decreases', 'with', 'applied', 'uniaxial', 'stress', 'furthermore', 'halfmetallicity', 'can', 'be', 'achieved', 'in', 'some', 'hole', 'concentration', 'regions', 'for', 'the', 'strain', 'of', '10', 'uniaxial', 'tensile', 'stress', 'of', '44', 'nm', 'the', 'monolayer', 'can', 'attain', 'halfmetallic', 'ferromagnetism', 'up', 'to', '150', 'k', 'the', 'magnetic', 'anisotropic', 'energy', 'is', 'suitable', 'to', 'not', 'only', 'stabilizing', 'the', '2d', 'ferromagnetism', 'but', 'also', 'realizing', 'fast', 'magnetization', 'reversal', 'the', 'magnetization', 'can', 'be', 'also', 'controlled', 'by', 'applying', 'a', 'transverse', 'uniaxial', 'stress', 'the', 'highlyairstable', 'pdse_2', 'monolayer', 'with', 'these', 'advantages', 'should', 'be', 'promising', 'for', 'spintronic', 'applications']] | [-0.14156668552179605, 0.20957504596728355, 0.015959411886377402, -0.00956874764979614, -0.0833616299668136, -0.2181747629880332, 0.05852003275858573, 0.48306236690722215, -0.2866144182267957, -0.28009052927164024, 0.026801708961825054, -0.28842777989279383, -0.10908923802885394, 0.23077815843190855, 0.045251096673429206, 0.05870072638096575, -0.03780256670553428, -0.11978581212520695, -0.12161798971012616, -0.25250794044218194, 0.16262656484785765, 0.04068391539681798, 0.366175336127456, 0.14166797746498233, 0.008689992204427911, -0.04632359117703089, 0.2741465050613699, 0.08720202833258857, -0.15552406519143402, 0.03474868408953532, 0.31765831410526657, -0.20070186598101059, 0.2124990339940175, -0.44257046196323174, -0.21938442847936246, -0.00906738856783471, 0.1199259474210871, 0.19667019929665214, -0.12897283146874264, -0.2622185135379625, 0.1576882656559181, -0.13769617684943697, -0.12741006786923093, -0.17203657943695688, -0.03650784181156315, -0.036657137369426586, -0.2605724272539075, 0.11513335708616815, 0.07115058645677681, 0.07830094812118496, -0.12340000560615384, -0.15561559910659128, -0.13010116297906885, 0.002048674929075134, 0.08061092807493435, 0.09376731798208009, 0.2416128298948304, -0.08933939014782365, -0.09407123036455745, 0.3768085790081666, -0.010563981271563815, -0.05697366115278923, 0.14473901519504112, -0.16342719995942062, -0.0600092770675054, 0.18131605268587384, 0.0813811922338433, 0.07875695352096301, -0.16417576863955802, 0.0636913403506743, 0.031087402998169776, 0.1872381251021766, 0.07051719137383863, 0.07226415254617444, 0.31143295279710004, 0.2365035581856202, 0.07342509511046302, 0.14354762802413928, -0.10396005159978253, 0.04451137382793837, -0.13879067505088946, -0.2528311734219106, -0.26248015589767304, 0.14858311228985818, -0.1386699073421672, -0.17759548791815552, 0.35796303028622883, 0.1876409542388641, 0.09230128882858807, -0.07444714132147148, 0.1926788168374258, 0.06629334552995622, 0.0984083839560835, 0.020350116134907763, 0.3371047165689957, 0.20345924752436054, 0.13574328780687678, -0.22899396409047768, 0.12534401746793614, -0.06447895588308501] |
1,803.0308 | A Multiple-Input Multiple-Output Cepstrum | This paper extends the concept of scalar cepstrum coefficients from
single-input single-output linear time invariant dynamical systems to
multiple-input multiple-output models, making use of the Smith-McMillan form of
the transfer function. These coefficients are interpreted in terms of poles and
transmission zeros of the underlying dynamical system. We present a method to
compute the MIMO cepstrum based on input/output signal data for systems with
square transfer function matrices (i.e. systems with as many inputs as
outputs). This allows us to do a model-free analysis. Two examples to
illustrate these results are included: a simple MIMO system with 3 inputs and 3
outputs, of which the poles and zeros are known exactly, that allows us to
directly verify the equivalences derived in the paper, and a case study on
realistic data. This case study analyses data coming from a (model of) a
non-isothermal continuous stirred tank reactor, which experiences linear
fouling. We analyse normal and faulty operating behaviour, both with and
without a controller present. We show that the cepstrum detects faulty
behaviour, even when hidden by controller compensation. The code for the
numerical analysis is available online.
| cs.SY math.DS | this paper extends the concept of scalar cepstrum coefficients from singleinput singleoutput linear time invariant dynamical systems to multipleinput multipleoutput models making use of the smithmcmillan form of the transfer function these coefficients are interpreted in terms of poles and transmission zeros of the underlying dynamical system we present a method to compute the mimo cepstrum based on inputoutput signal data for systems with square transfer function matrices ie systems with as many inputs as outputs this allows us to do a modelfree analysis two examples to illustrate these results are included a simple mimo system with 3 inputs and 3 outputs of which the poles and zeros are known exactly that allows us to directly verify the equivalences derived in the paper and a case study on realistic data this case study analyses data coming from a model of a nonisothermal continuous stirred tank reactor which experiences linear fouling we analyse normal and faulty operating behaviour both with and without a controller present we show that the cepstrum detects faulty behaviour even when hidden by controller compensation the code for the numerical analysis is available online | [['this', 'paper', 'extends', 'the', 'concept', 'of', 'scalar', 'cepstrum', 'coefficients', 'from', 'singleinput', 'singleoutput', 'linear', 'time', 'invariant', 'dynamical', 'systems', 'to', 'multipleinput', 'multipleoutput', 'models', 'making', 'use', 'of', 'the', 'smithmcmillan', 'form', 'of', 'the', 'transfer', 'function', 'these', 'coefficients', 'are', 'interpreted', 'in', 'terms', 'of', 'poles', 'and', 'transmission', 'zeros', 'of', 'the', 'underlying', 'dynamical', 'system', 'we', 'present', 'a', 'method', 'to', 'compute', 'the', 'mimo', 'cepstrum', 'based', 'on', 'inputoutput', 'signal', 'data', 'for', 'systems', 'with', 'square', 'transfer', 'function', 'matrices', 'ie', 'systems', 'with', 'as', 'many', 'inputs', 'as', 'outputs', 'this', 'allows', 'us', 'to', 'do', 'a', 'modelfree', 'analysis', 'two', 'examples', 'to', 'illustrate', 'these', 'results', 'are', 'included', 'a', 'simple', 'mimo', 'system', 'with', '3', 'inputs', 'and', '3', 'outputs', 'of', 'which', 'the', 'poles', 'and', 'zeros', 'are', 'known', 'exactly', 'that', 'allows', 'us', 'to', 'directly', 'verify', 'the', 'equivalences', 'derived', 'in', 'the', 'paper', 'and', 'a', 'case', 'study', 'on', 'realistic', 'data', 'this', 'case', 'study', 'analyses', 'data', 'coming', 'from', 'a', 'model', 'of', 'a', 'nonisothermal', 'continuous', 'stirred', 'tank', 'reactor', 'which', 'experiences', 'linear', 'fouling', 'we', 'analyse', 'normal', 'and', 'faulty', 'operating', 'behaviour', 'both', 'with', 'and', 'without', 'a', 'controller', 'present', 'we', 'show', 'that', 'the', 'cepstrum', 'detects', 'faulty', 'behaviour', 'even', 'when', 'hidden', 'by', 'controller', 'compensation', 'the', 'code', 'for', 'the', 'numerical', 'analysis', 'is', 'available', 'online']] | [-0.1641114792531176, 0.03630066034884783, -0.0530310791681811, 0.03034123240955054, -0.07731327509647735, -0.17710380348682364, 0.032998679164466596, 0.3363792015870492, -0.2508699682350921, -0.2722484039378062, 0.1499572717618311, -0.2772248112322745, -0.2225349927170863, 0.20915322040235224, -0.04860612253786155, 0.11448596679775785, 0.07435738670849992, 0.028151805364897333, -0.0777723522786732, -0.20949574792382097, 0.34385735739425566, 0.030166275093271848, 0.2416232254613386, -0.01701981051053892, 0.12242656326990434, 0.027132168557414765, -0.03574003675772298, -0.039175553169722356, -0.08671432519520905, 0.09076803295262238, 0.29467280910648697, 0.1472556691626788, 0.23788514344262018, -0.40945882884214724, -0.2261232130770241, 0.11690849098389447, 0.13539446062929128, 0.09186173864309827, -0.025654027933224795, -0.26346137478036347, 0.10431168095449046, -0.20700516317149883, -0.10353358336023345, -0.0833513052709731, -0.0660111685621462, 0.033990231657435775, -0.3489122560413013, 0.03458529472556366, 0.05404678199791364, 0.08192013720831563, -0.062171286348158356, -0.1089137659955179, 0.014147050628658904, 0.14079944863217578, 0.023717843259619648, -0.035513664070036144, 0.1251706029793876, -0.09334741553456913, -0.11023777530976742, 0.34548409661698726, -0.06254135003258345, -0.25833078130318593, 0.21625374864426353, -0.1470154102648213, -0.10584232578885251, 0.11427537755920522, 0.24555841816829577, 0.07924689037815458, -0.1906682368739845, 0.05798644131808091, -0.055082384216529064, 0.1996178999443048, 0.03422388362808414, 0.009152275242251895, 0.15488808071966814, 0.14700531859767013, 0.04119008330732173, 0.17594918802065113, -0.07101907511992801, -0.11834667961774094, -0.28124829640571947, -0.11838303977042756, -0.15338744472471938, 0.022480696783981898, -0.06856308785290333, -0.14380067111348474, 0.3980584248126815, 0.17061832721435255, 0.18440621845381616, 0.12932062892603777, 0.3468059194474531, 0.11894135174506734, 0.060922711574402384, 0.08279651561151108, 0.18496314650000903, 0.1418910939309005, 0.11455397664379048, -0.21571331162266033, 0.047413685146258565, 0.012461672589603451] |
1,803.03081 | Chomp on generalized Kneser graphs and others | In chomp on graphs, two players alternatingly pick an edge or a vertex from a
graph. The player that cannot move any more loses. The questions one wants to
answer for a given graph are: Which player has a winning strategy? Can a
explicit strategy be devised? We answer these questions (and determine the
Nim-value) for the class of generalized Kneser graphs and for several families
of Johnson graphs. We also generalize some of these results to the clique
complexes of these graphs. Furthermore, we determine which player has a winning
strategy for some classes of threshold graphs.
| math.CO | in chomp on graphs two players alternatingly pick an edge or a vertex from a graph the player that cannot move any more loses the questions one wants to answer for a given graph are which player has a winning strategy can a explicit strategy be devised we answer these questions and determine the nimvalue for the class of generalized kneser graphs and for several families of johnson graphs we also generalize some of these results to the clique complexes of these graphs furthermore we determine which player has a winning strategy for some classes of threshold graphs | [['in', 'chomp', 'on', 'graphs', 'two', 'players', 'alternatingly', 'pick', 'an', 'edge', 'or', 'a', 'vertex', 'from', 'a', 'graph', 'the', 'player', 'that', 'can', 'not', 'move', 'any', 'more', 'loses', 'the', 'questions', 'one', 'wants', 'to', 'answer', 'for', 'a', 'given', 'graph', 'are', 'which', 'player', 'has', 'a', 'winning', 'strategy', 'can', 'a', 'explicit', 'strategy', 'be', 'devised', 'we', 'answer', 'these', 'questions', 'and', 'determine', 'the', 'nimvalue', 'for', 'the', 'class', 'of', 'generalized', 'kneser', 'graphs', 'and', 'for', 'several', 'families', 'of', 'johnson', 'graphs', 'we', 'also', 'generalize', 'some', 'of', 'these', 'results', 'to', 'the', 'clique', 'complexes', 'of', 'these', 'graphs', 'furthermore', 'we', 'determine', 'which', 'player', 'has', 'a', 'winning', 'strategy', 'for', 'some', 'classes', 'of', 'threshold', 'graphs']] | [-0.0833923832379338, 0.07318106931625427, -0.10569909325038845, 0.09207695614866386, -0.14126558111735968, -0.22467346493192394, 0.11839342581089397, 0.4252553205523226, -0.28048398456714974, -0.3086400178797317, 0.1032177897868678, -0.31116472707233495, -0.14782591223613256, 0.11872725391694618, -0.15650961347949702, 0.01813339051141432, 0.11129362813921438, 0.11447598196265071, 0.07355585946193473, -0.32815714582455147, 0.36290080792675117, -0.05445986888912328, 0.1161112818735266, 0.1004777260411606, 0.0885277617195941, -0.029697467615319925, 0.007075516111922987, 0.09550877822318463, -0.20672816915163886, 0.09143176460356424, 0.28503942568645335, 0.18330107680098576, 0.327344909912408, -0.3764385872266509, -0.13726187124848366, 0.22525152932814876, 0.08129566895770793, 0.14362559656875978, 0.004954603091887707, -0.24306415758951747, 0.13095590642493482, -0.1504948931849665, -0.06621231541808958, -0.045858589377291877, 0.04283468629044805, 0.017841913695023817, -0.3065397798911565, -0.12996422969107047, 0.13887420199421055, -0.0049339889812123295, 0.026773238145379408, -0.16437392861516487, -4.766856066205285e-05, 0.20338584356847209, -0.07147738490313732, -0.002300008966803852, 0.07392246321060064, -0.16600564458040576, -0.25902781475598763, 0.37191035308771664, 0.015071649029098376, -0.18403446079805644, 0.13089116233767886, -0.0996514337626521, -0.19623485567857218, 0.09029819476747453, 0.14321451874995472, 0.16515982945007507, -0.09873461600092023, 0.040425088405938385, -0.1494576752072934, 0.1328500865422415, 0.15472028833917445, 0.0011584023625185393, 0.14353053681458336, 0.09495144500514736, 0.20583961183920202, 0.15848928172672827, 0.025904322233559055, -0.06930253583222928, -0.24500527437023742, -0.13018165874962856, -0.16617578648106016, 0.0368453256888468, -0.1258470193489403, -0.1813216701225199, 0.4734405243788103, 0.12182881345389167, 0.16210137731913063, 0.1202836935761187, 0.19848263867415789, 0.05599224783781201, 0.033026949963485354, 0.13821014330600095, 0.13558347508454732, 0.11926712506013273, 0.024833968468951157, -0.13198146201209213, 0.09329216750609133, 0.13539753805944751] |
1,803.03082 | On the topological entropy of subshifts of finite type on free
semigroups | In this paper, we provide an effective method to compute the topological
entropies of $G$-subshifts of finite type ($G$-SFTs) with $G=F_{d}$ and
$S_{d}$, the free group and free semigroup with $d$ generators respectively. We
develop the entropy formula by analyzing the corresponding systems of nonlinear
recursive equations (SNREs). Four types of SNREs of $S_{2}$-SFTs, namely the
types $\mathbf{E},\mathbf{D},\mathbf{C}$ and $\mathbf{O}$, are introduced and
we could compute their entropies explicitly. This enables us to give the
complete characterization of $S_{2}$-SFTs on two symbols. That is, the set of
entropies of $S_{2}$-SFTs on two symbols is equal to $\mathbf{E}\cup
\mathbf{D}\cup \mathbf{C}\cup \mathbf{O}$. The methods developed in
$S_{d}$-SFTs will also be applied to the study of the entropy theory of
$F_{d}$-SFTs. The entropy formulae of $S_{d}$-, $F_{d}$-golden mean shifts and
$k$-colored chessboards are also presented herein.
| math.DS | in this paper we provide an effective method to compute the topological entropies of gsubshifts of finite type gsfts with gf_d and s_d the free group and free semigroup with d generators respectively we develop the entropy formula by analyzing the corresponding systems of nonlinear recursive equations snres four types of snres of s_2sfts namely the types mathbfemathbfdmathbfc and mathbfo are introduced and we could compute their entropies explicitly this enables us to give the complete characterization of s_2sfts on two symbols that is the set of entropies of s_2sfts on two symbols is equal to mathbfecup mathbfdcup mathbfccup mathbfo the methods developed in s_dsfts will also be applied to the study of the entropy theory of f_dsfts the entropy formulae of s_d f_dgolden mean shifts and kcolored chessboards are also presented herein | [['in', 'this', 'paper', 'we', 'provide', 'an', 'effective', 'method', 'to', 'compute', 'the', 'topological', 'entropies', 'of', 'gsubshifts', 'of', 'finite', 'type', 'gsfts', 'with', 'gf_d', 'and', 's_d', 'the', 'free', 'group', 'and', 'free', 'semigroup', 'with', 'd', 'generators', 'respectively', 'we', 'develop', 'the', 'entropy', 'formula', 'by', 'analyzing', 'the', 'corresponding', 'systems', 'of', 'nonlinear', 'recursive', 'equations', 'snres', 'four', 'types', 'of', 'snres', 'of', 's_2sfts', 'namely', 'the', 'types', 'mathbfemathbfdmathbfc', 'and', 'mathbfo', 'are', 'introduced', 'and', 'we', 'could', 'compute', 'their', 'entropies', 'explicitly', 'this', 'enables', 'us', 'to', 'give', 'the', 'complete', 'characterization', 'of', 's_2sfts', 'on', 'two', 'symbols', 'that', 'is', 'the', 'set', 'of', 'entropies', 'of', 's_2sfts', 'on', 'two', 'symbols', 'is', 'equal', 'to', 'mathbfecup', 'mathbfdcup', 'mathbfccup', 'mathbfo', 'the', 'methods', 'developed', 'in', 's_dsfts', 'will', 'also', 'be', 'applied', 'to', 'the', 'study', 'of', 'the', 'entropy', 'theory', 'of', 'f_dsfts', 'the', 'entropy', 'formulae', 'of', 's_d', 'f_dgolden', 'mean', 'shifts', 'and', 'kcolored', 'chessboards', 'are', 'also', 'presented', 'herein']] | [-0.11641773829984738, 0.13760378354625752, -0.10016887736522027, 0.054635059878208145, -0.031473584637259605, -0.11546137638115248, 0.022625568200696687, 0.3190835026535587, -0.24324471063789774, -0.2590837197485151, 0.08977222312279962, -0.3145815477263732, -0.13121403109847155, 0.21239435713219104, -0.08874047907130396, 0.031183762796467444, -0.007362135066688977, 0.10423333187741189, -0.10843354076734882, -0.2539306424107769, 0.34701345252926596, -0.010386265211234817, 0.2307884118168569, 0.07250636495739511, 0.0974344153140412, 0.011321185657670568, -0.06995222419614858, 0.03836963315814978, -0.21196784015171674, 0.19638004331166292, 0.23732326051495115, 0.13961946484098425, 0.19628365638620052, -0.3896770057741736, -0.1582196062339134, 0.12969289575016402, 0.1095567901168385, 0.0950308868768396, 0.01909463833177798, -0.22919884373693436, 0.12764154330705155, -0.21049804048093615, -0.10420227715970765, -0.10987696144729853, 0.04009345386055161, 0.032803452930596395, -0.23499462684066813, 0.05560096954286564, 0.06882108273328144, 0.0554759601115814, -0.06251315634361788, -0.1024290626853338, -0.025360947083605485, 0.13299515844918178, 0.023771812805341037, -0.053670183104676666, 0.04801447441244162, -0.046671532105929295, -0.14048508441001253, 0.3335918454361744, -0.05174275194523764, -0.2226133844357167, 0.16890560462498336, -0.12643286037319873, -0.11571478923843777, 0.08815643300882495, 0.16830914012980877, 0.16418579971936884, -0.1440117800470869, 0.09494296686683751, -0.01770920170944367, 0.10503860328682378, 0.05373315557409994, 0.044408632751523715, 0.13461343395966488, 0.04471512615955511, 0.06265108366916719, 0.21147308887848937, -0.04514410564309505, -0.07052182261526707, -0.3434315240010619, -0.18949836855143554, -0.1525831993356286, 0.03541730642776753, -0.08633063480076208, -0.18490265720126936, 0.4037614237439826, 0.1352617949224459, 0.16853398117465807, 0.08572446452224719, 0.22685610107718737, 0.16624098346622557, 0.04379424141132136, 0.057140344104989145, 0.13887583292623767, 0.1786790004278701, 0.0168895200518729, -0.22230607517193393, 0.00031146631179163693, 0.17748371994153397] |
1,803.03083 | Equivariant Euler characteristics of the symplectic building | We determine the equivariant Euler characteristics for the action of a finite
symplectic group on its building.
| math.CO | we determine the equivariant euler characteristics for the action of a finite symplectic group on its building | [['we', 'determine', 'the', 'equivariant', 'euler', 'characteristics', 'for', 'the', 'action', 'of', 'a', 'finite', 'symplectic', 'group', 'on', 'its', 'building']] | [-0.2383466663167757, 0.04036222102449221, -0.18382237435263746, 0.07103268714512095, -0.13967749640783844, -0.06573922619881, 0.005524065126391018, 0.3180069940931657, -0.3130480883752598, -0.18608084079973838, 0.13214782666524544, -0.19190140560214572, -0.14423053733566227, 0.21708072787698576, -0.13249240037711227, -0.001585660724873271, 0.03832557085244095, 0.15450850786531672, -0.18292619726237128, -0.2264474117768901, 0.4206606151864809, -0.016148236854111448, 0.2723708552280989, 0.03736735080533168, 0.24004715105847402, -0.0161374598631964, -0.08516810533097562, -0.05429011429933941, -0.11022330417215605, 0.11712917816989563, 0.25996450258090215, -0.018647088860983357, 0.17402013961006613, -0.40203993416884365, -0.19369257997502298, 0.12479265554643729, 0.08391362439621897, 0.04639444956282044, -0.008027202429195099, -0.2924450412392616, 0.17059708118219585, -0.2059853885541944, -0.20806695876971765, -0.05913418942295453, 0.05338862647905069, 0.03967686287839623, -0.1557505517540609, -0.13692504589391105, 0.058444903451291955, 0.1636625649407506, -0.10844392516403734, -0.09020307397141177, -0.03417355600087082, 0.220674009199309, -0.020156669375651023, -0.035252446253948355, 0.15682314328082345, -0.14128032523919554, -0.07618938975364846, 0.4674391825409496, -0.12896021773271701, -0.3157663259874372, 0.11012379529283327, -0.10933028476531892, -0.2144369865384172, 0.09006470896522789, 0.14918545808862238, 0.1746835333897787, 0.033892684561364794, 0.1658007892615655, -0.12413129155688427, 0.010216043056810604, 0.0020245686721275837, -0.04861552465487929, 0.10100964484188486, 0.13444468862486675, 0.08433378033120842, 0.08203906849410166, -0.03552541885908474, -0.07875176343847723, -0.31786853995393305, -0.2554093662594609, -0.13843022703247912, 0.1697974159820553, -0.1362524945562815, -0.24694215747363427, 0.5108591484672883, 0.08632220897604437, 0.14636881400228424, 0.18631294462829828, 0.2307788247571272, 0.09282141359632506, 0.03174833353499279, 0.04198076943045154, 0.10720632356755874, 0.2010257339433712, -0.09218224507811315, -0.30733152040663886, -0.03743739998625482, 0.3023630553746925] |
1,803.03084 | Applying Deep Learning to Fast Radio Burst Classification | Upcoming Fast Radio Burst (FRB) surveys will search $\sim$10\,$^3$ beams on
sky with very high duty cycle, generating large numbers of single-pulse
candidates. The abundance of false positives presents an intractable problem if
candidates are to be inspected by eye, making it a good application for
artificial intelligence (AI). We apply deep learning to single pulse
classification and develop a hierarchical framework for ranking events by their
probability of being true astrophysical transients. We construct a tree-like
deep neural network (DNN) that takes multiple or individual data products as
input (e.g. dynamic spectra and multi-beam detection information) and trains on
them simultaneously. We have built training and test sets using false-positive
triggers from real telescopes, along with simulated FRBs, and single pulses
from pulsars. Training of the DNN was independently done for two radio
telescopes: the CHIME Pathfinder, and Apertif on Westerbork. High accuracy and
recall can be achieved with a labelled training set of a few thousand events.
Even with high triggering rates, classification can be done very quickly on
Graphical Processing Units (GPUs). That speed is essential for selective
voltage dumps or issuing real-time VOEvents. Next, we investigate whether
dedispersion back-ends could be completely replaced by a real-time DNN
classifier. It is shown that a single forward propagation through a moderate
convolutional network could be faster than brute-force dedispersion; but the
low signal-to-noise per pixel makes such a classifier sub-optimal for this
problem. Real-time automated classification may prove useful for bright,
unexpected signals, both now and in the era of radio astronomy when data
volumes and the searchable parameter spaces further outgrow our ability to
manually inspect the data, such as for SKA and ngVLA.
| astro-ph.IM astro-ph.HE | upcoming fast radio burst frb surveys will search sim103 beams on sky with very high duty cycle generating large numbers of singlepulse candidates the abundance of false positives presents an intractable problem if candidates are to be inspected by eye making it a good application for artificial intelligence ai we apply deep learning to single pulse classification and develop a hierarchical framework for ranking events by their probability of being true astrophysical transients we construct a treelike deep neural network dnn that takes multiple or individual data products as input eg dynamic spectra and multibeam detection information and trains on them simultaneously we have built training and test sets using falsepositive triggers from real telescopes along with simulated frbs and single pulses from pulsars training of the dnn was independently done for two radio telescopes the chime pathfinder and apertif on westerbork high accuracy and recall can be achieved with a labelled training set of a few thousand events even with high triggering rates classification can be done very quickly on graphical processing units gpus that speed is essential for selective voltage dumps or issuing realtime voevents next we investigate whether dedispersion backends could be completely replaced by a realtime dnn classifier it is shown that a single forward propagation through a moderate convolutional network could be faster than bruteforce dedispersion but the low signaltonoise per pixel makes such a classifier suboptimal for this problem realtime automated classification may prove useful for bright unexpected signals both now and in the era of radio astronomy when data volumes and the searchable parameter spaces further outgrow our ability to manually inspect the data such as for ska and ngvla | [['upcoming', 'fast', 'radio', 'burst', 'frb', 'surveys', 'will', 'search', 'sim103', 'beams', 'on', 'sky', 'with', 'very', 'high', 'duty', 'cycle', 'generating', 'large', 'numbers', 'of', 'singlepulse', 'candidates', 'the', 'abundance', 'of', 'false', 'positives', 'presents', 'an', 'intractable', 'problem', 'if', 'candidates', 'are', 'to', 'be', 'inspected', 'by', 'eye', 'making', 'it', 'a', 'good', 'application', 'for', 'artificial', 'intelligence', 'ai', 'we', 'apply', 'deep', 'learning', 'to', 'single', 'pulse', 'classification', 'and', 'develop', 'a', 'hierarchical', 'framework', 'for', 'ranking', 'events', 'by', 'their', 'probability', 'of', 'being', 'true', 'astrophysical', 'transients', 'we', 'construct', 'a', 'treelike', 'deep', 'neural', 'network', 'dnn', 'that', 'takes', 'multiple', 'or', 'individual', 'data', 'products', 'as', 'input', 'eg', 'dynamic', 'spectra', 'and', 'multibeam', 'detection', 'information', 'and', 'trains', 'on', 'them', 'simultaneously', 'we', 'have', 'built', 'training', 'and', 'test', 'sets', 'using', 'falsepositive', 'triggers', 'from', 'real', 'telescopes', 'along', 'with', 'simulated', 'frbs', 'and', 'single', 'pulses', 'from', 'pulsars', 'training', 'of', 'the', 'dnn', 'was', 'independently', 'done', 'for', 'two', 'radio', 'telescopes', 'the', 'chime', 'pathfinder', 'and', 'apertif', 'on', 'westerbork', 'high', 'accuracy', 'and', 'recall', 'can', 'be', 'achieved', 'with', 'a', 'labelled', 'training', 'set', 'of', 'a', 'few', 'thousand', 'events', 'even', 'with', 'high', 'triggering', 'rates', 'classification', 'can', 'be', 'done', 'very', 'quickly', 'on', 'graphical', 'processing', 'units', 'gpus', 'that', 'speed', 'is', 'essential', 'for', 'selective', 'voltage', 'dumps', 'or', 'issuing', 'realtime', 'voevents', 'next', 'we', 'investigate', 'whether', 'dedispersion', 'backends', 'could', 'be', 'completely', 'replaced', 'by', 'a', 'realtime', 'dnn', 'classifier', 'it', 'is', 'shown', 'that', 'a', 'single', 'forward', 'propagation', 'through', 'a', 'moderate', 'convolutional', 'network', 'could', 'be', 'faster', 'than', 'bruteforce', 'dedispersion', 'but', 'the', 'low', 'signaltonoise', 'per', 'pixel', 'makes', 'such', 'a', 'classifier', 'suboptimal', 'for', 'this', 'problem', 'realtime', 'automated', 'classification', 'may', 'prove', 'useful', 'for', 'bright', 'unexpected', 'signals', 'both', 'now', 'and', 'in', 'the', 'era', 'of', 'radio', 'astronomy', 'when', 'data', 'volumes', 'and', 'the', 'searchable', 'parameter', 'spaces', 'further', 'outgrow', 'our', 'ability', 'to', 'manually', 'inspect', 'the', 'data', 'such', 'as', 'for', 'ska', 'and', 'ngvla']] | [-0.0977755796726598, 0.09290033805194363, -0.02281086254421124, 0.12369592596116116, -0.1354817350580784, -0.19403167034832203, 0.09262504576812985, 0.4690554718678609, -0.23735031494089076, -0.3518680446085248, 0.14346213394898705, -0.2671545926584032, -0.11687620480407016, 0.2691027649390614, -0.0677357419017393, 0.0705085452902383, 0.1653575310981597, -0.009763485580575165, -0.013074425876221287, -0.2880857768212193, 0.21504690535097562, 0.12890898890516786, 0.28220348571517945, -0.053989807500198, 0.13916960021519584, -0.03104667619059017, -0.051944637467070995, -0.022876925121770923, -0.009728379010041924, 0.08196936604829122, 0.33750255630075904, 0.23186124247895548, 0.28329975615568215, -0.41793036779946907, -0.19705785877560517, 0.12580325940055673, 0.15559527991499897, 0.088205042201017, -0.053986525743029715, -0.3468511857652183, 0.1110236402895194, -0.19914784474762337, -0.0670895362625887, -0.10529429392068772, 0.005304428350368669, 0.05832578646147704, -0.2672934269087914, 0.009928263206075245, -0.024541656496146164, 0.05712036525205262, -0.031106767469062217, -0.07179224533314686, 0.04000237751718516, 0.12289708441552884, -0.013584941705236622, 0.06826910430595735, 0.13475525894434282, -0.16493664841951017, -0.12663177534389825, 0.348314194966928, -0.03935399497734149, -0.11306210179831698, 0.18509742432351253, -0.10752256840140902, -0.1852216628276733, 0.15456016435176942, 0.23038123241988842, 0.08789582937743198, -0.15923387022624474, -0.031712282279532385, 0.028664036889288185, 0.22261283662975412, 0.09265453437518073, 0.014819910783414806, 0.28032861759344835, 0.23175459238364352, 0.057453527225396636, 0.13564385634818407, -0.21206819833920754, 0.024928647869506965, -0.20159587818735855, -0.09062970363024776, -0.18644267486136018, 0.06650699726356335, -0.0890368500900739, -0.1266448282625565, 0.37073086689807144, 0.15940008389835822, 0.1581824067606009, 0.1087843535521777, 0.35521731165066256, 0.048488620127391975, 0.12551125818115427, 0.07119306290710499, 0.2213463927131644, 0.023889602319966154, 0.12996250412524393, -0.11118205016334323, 0.07783926972137623, 0.0004750182751283749] |
1,803.03085 | Generalized partially linear models on Riemannian manifolds | The generalized partially linear models on Riemannian manifolds are
introduced. These models, like ordinary generalized linear models, are a
generalization of partially linear models on Riemannian manifolds that allow
for response variables with error distribution models other than a normal
distribution. Partially linear models are particularly useful when some of the
covariates of the model are elements of a Riemannian manifold, because the
curvature of these spaces makes it difficult to define parametric models. The
model was developed to address an interesting application, the prediction of
children's garment fit based on 3D scanning of their body. For this reason, we
focus on logistic and ordinal models and on the important and difficult case
where the Riemannian manifold is the three-dimensional case of Kendall's shape
space. An experimental study with a well-known 3D database is carried out to
check the goodness of the procedure. Finally it is applied to a 3D database
obtained from an anthropometric survey of the Spanish child population. A
comparative study with related techniques is carried out.
| stat.ME | the generalized partially linear models on riemannian manifolds are introduced these models like ordinary generalized linear models are a generalization of partially linear models on riemannian manifolds that allow for response variables with error distribution models other than a normal distribution partially linear models are particularly useful when some of the covariates of the model are elements of a riemannian manifold because the curvature of these spaces makes it difficult to define parametric models the model was developed to address an interesting application the prediction of childrens garment fit based on 3d scanning of their body for this reason we focus on logistic and ordinal models and on the important and difficult case where the riemannian manifold is the threedimensional case of kendalls shape space an experimental study with a wellknown 3d database is carried out to check the goodness of the procedure finally it is applied to a 3d database obtained from an anthropometric survey of the spanish child population a comparative study with related techniques is carried out | [['the', 'generalized', 'partially', 'linear', 'models', 'on', 'riemannian', 'manifolds', 'are', 'introduced', 'these', 'models', 'like', 'ordinary', 'generalized', 'linear', 'models', 'are', 'a', 'generalization', 'of', 'partially', 'linear', 'models', 'on', 'riemannian', 'manifolds', 'that', 'allow', 'for', 'response', 'variables', 'with', 'error', 'distribution', 'models', 'other', 'than', 'a', 'normal', 'distribution', 'partially', 'linear', 'models', 'are', 'particularly', 'useful', 'when', 'some', 'of', 'the', 'covariates', 'of', 'the', 'model', 'are', 'elements', 'of', 'a', 'riemannian', 'manifold', 'because', 'the', 'curvature', 'of', 'these', 'spaces', 'makes', 'it', 'difficult', 'to', 'define', 'parametric', 'models', 'the', 'model', 'was', 'developed', 'to', 'address', 'an', 'interesting', 'application', 'the', 'prediction', 'of', 'childrens', 'garment', 'fit', 'based', 'on', '3d', 'scanning', 'of', 'their', 'body', 'for', 'this', 'reason', 'we', 'focus', 'on', 'logistic', 'and', 'ordinal', 'models', 'and', 'on', 'the', 'important', 'and', 'difficult', 'case', 'where', 'the', 'riemannian', 'manifold', 'is', 'the', 'threedimensional', 'case', 'of', 'kendalls', 'shape', 'space', 'an', 'experimental', 'study', 'with', 'a', 'wellknown', '3d', 'database', 'is', 'carried', 'out', 'to', 'check', 'the', 'goodness', 'of', 'the', 'procedure', 'finally', 'it', 'is', 'applied', 'to', 'a', '3d', 'database', 'obtained', 'from', 'an', 'anthropometric', 'survey', 'of', 'the', 'spanish', 'child', 'population', 'a', 'comparative', 'study', 'with', 'related', 'techniques', 'is', 'carried', 'out']] | [-0.043813170977484654, 0.03330564915214542, -0.07802081485415864, 0.11799747809555436, -0.1097003997550072, -0.17250493458636543, -0.0009237423922647448, 0.3776089238989003, -0.25541679242297133, -0.2833361073451884, 0.13950165147509644, -0.2971711284782299, -0.1750476659166024, 0.21861634946099537, -0.0937043346615289, 0.09864980659365435, 0.07497308356687427, 0.05377509980325532, -0.07249775787692188, -0.26252391540226255, 0.3850690506672596, 0.06572440788971588, 0.2912329247988322, -0.022112046417725437, 0.10610050973208511, -0.014701825426891446, -0.06083664761253578, 0.047725052435656404, -0.11202171713636798, 0.13995624777778765, 0.22819861098935637, 0.12591444356093073, 0.24452674172763877, -0.408695019907592, -0.2363931430668077, 0.11619864566361203, 0.0823748537681668, 0.07358986829297946, -0.0025232707266695797, -0.3003331805058919, 0.04569567232940565, -0.1336490758105784, -0.1114095623824088, -0.11728896675631403, -0.01621537359760088, -0.01200961636050659, -0.26559168601627736, 0.043884865520521996, 0.07383053253151421, 0.08739880036934183, -0.0809256709920352, -0.1380386968211764, -0.025334746061879045, 0.12363464034878073, 0.04765946468858815, 0.018900044651373345, 0.07427256019179956, -0.10427588901948184, -0.09923188246115494, 0.3917718291772283, -0.04897880918450777, -0.28607602179981767, 0.18284529510419817, -0.09649668994414455, -0.14313410501653218, 0.05514288598411333, 0.21891409048933866, 0.16932585128567607, -0.15106868369355866, 0.07776846314184642, -0.06818485029644387, 0.1583329888772877, -0.01678211719605743, -0.06836375735207077, 0.20051782823249917, 0.18908525570980547, 0.0415775937411715, 0.1535019315946984, -0.10953378427143702, -0.11046421398162184, -0.2591947067056454, -0.13975453056422446, -0.1291859827209812, 0.047526816151324, -0.09166684874910382, -0.19824005817063153, 0.3959259783191716, 0.1263113006072886, 0.2022222774445682, 0.08503675856627524, 0.2766735909944948, 0.06578635152922395, 0.04773352055892567, 0.02462473246268928, 0.1896308988759034, 0.14882186787641224, 0.05196809494758353, -0.14994351053096847, 0.06520457750405459, 0.05670407216530293] |
1,803.03086 | Topological Degree of Shift Spaces on Monoids | This paper considers the topological degree of $G$-shifts of finite type for
the case where $G$ is a nonabelian monoid. Whenever the Cayley graph of $G$ has
a finite representation and the relationships among the generators of $G$ are
determined by a matrix $A$, the coefficients of the characteristic polynomial
of $A$ are revealed as the number of children of the graph. After introducing
an algorithm for the computation of the degree, the degree spectrum, which is
finite, relates to a collection of matrices in which the sum of each row of
every matrix is bounded by the number of children of the graph. Furthermore,
the algorithm extends to $G$ of finite free-followers.
| math.DS | this paper considers the topological degree of gshifts of finite type for the case where g is a nonabelian monoid whenever the cayley graph of g has a finite representation and the relationships among the generators of g are determined by a matrix a the coefficients of the characteristic polynomial of a are revealed as the number of children of the graph after introducing an algorithm for the computation of the degree the degree spectrum which is finite relates to a collection of matrices in which the sum of each row of every matrix is bounded by the number of children of the graph furthermore the algorithm extends to g of finite freefollowers | [['this', 'paper', 'considers', 'the', 'topological', 'degree', 'of', 'gshifts', 'of', 'finite', 'type', 'for', 'the', 'case', 'where', 'g', 'is', 'a', 'nonabelian', 'monoid', 'whenever', 'the', 'cayley', 'graph', 'of', 'g', 'has', 'a', 'finite', 'representation', 'and', 'the', 'relationships', 'among', 'the', 'generators', 'of', 'g', 'are', 'determined', 'by', 'a', 'matrix', 'a', 'the', 'coefficients', 'of', 'the', 'characteristic', 'polynomial', 'of', 'a', 'are', 'revealed', 'as', 'the', 'number', 'of', 'children', 'of', 'the', 'graph', 'after', 'introducing', 'an', 'algorithm', 'for', 'the', 'computation', 'of', 'the', 'degree', 'the', 'degree', 'spectrum', 'which', 'is', 'finite', 'relates', 'to', 'a', 'collection', 'of', 'matrices', 'in', 'which', 'the', 'sum', 'of', 'each', 'row', 'of', 'every', 'matrix', 'is', 'bounded', 'by', 'the', 'number', 'of', 'children', 'of', 'the', 'graph', 'furthermore', 'the', 'algorithm', 'extends', 'to', 'g', 'of', 'finite', 'freefollowers']] | [-0.16422180088037358, 0.15779559353034397, -0.0645120178565516, -0.039111257507881546, -0.07809973858612855, -0.08333173977111333, 0.0388323332975103, 0.3200940720603934, -0.314285543281585, -0.2754100876710644, 0.08624299050071775, -0.2735442631944482, -0.1565273751039058, 0.14698760306263076, -0.07273421662284818, 0.005539524485357106, 0.04581422167497554, 0.17219837192429363, -0.061174358249575435, -0.2707844173437479, 0.3475095426630495, -0.023096275366177515, 0.1975024622266314, 0.05885035865607539, 0.14218736537233262, 0.0407096138515044, -0.05362459029337125, 0.046494322446441014, -0.07385853920797152, 0.1327629990929771, 0.2460219633399642, 0.13807843722003912, 0.28039358569575207, -0.34847602897908864, -0.17619680524304776, 0.20485240031432891, 0.10241715574271179, 0.04995572672383527, 0.023122922533990016, -0.22277583246510144, 0.1809185618268592, -0.18492203177694527, -0.11165547363842572, 0.026335482531326955, 0.07576472580798768, 0.03582015187878694, -0.30047931997043115, 0.008468925121373363, 0.08536042216500002, 0.09981790171670062, 0.04204350438625885, -0.12973255759321287, -0.03900892999289291, 0.13031398875422642, -0.007000530311155931, 0.008464796464457842, 0.031135553223326236, -0.13432777270333776, -0.11660229425095688, 0.398007004604941, -0.02649620727502874, -0.17868222947825935, 0.09775309841539379, -0.1467034003414613, -0.12763135417896723, 0.12336294357997499, 0.12462078420711416, 0.14256269696592686, -0.08401324346362214, 0.17198646036091045, -0.11987972026690841, 0.12265612834432561, 0.04872399987652898, -0.001623191504872271, 0.12672836360122477, 0.13118089037847572, 0.12288398349690917, 0.17691198539354705, -0.0076603795667844156, 0.011866737498036985, -0.3324439564520227, -0.16721421333828143, -0.2702589016948228, 0.03898065571723107, -0.17271444384186907, -0.2083470905615416, 0.49308585045426817, 0.05859459463057907, 0.1988521091448742, 0.1034771126349889, 0.2149889728004512, 0.12645541775834448, 0.05726299894740805, 0.08603733202367689, 0.08196622851080194, 0.23153246798236587, -0.013762628293729253, -0.22013439521833789, 0.0818578574066383, 0.15538220430646885] |
1,803.03087 | Non-Backtracking Centrality Based Random Walk on Networks | Random walks are a fundamental tool for analyzing realistic complex networked
systems and implementing randomized algorithms to solve diverse problems such
as searching and sampling. For many real applications, their actual effect and
convenience depend on the properties (e.g. stationary distribution and hitting
time) of random walks, with biased random walks often outperforming traditional
unbiased random walks (TURW). In this paper, we present a new class of biased
random walks, non-backtracking centrality based random walks (NBCRW) on a
network, where the walker prefers to jump to neighbors with high
non-backtracking centrality that has some advantages over eigenvector
centrality. We study some properties of the non-backtracking matrix of a
network, on the basis of which we propose a theoretical framework for fast
computation of the transition probabilities, stationary distribution, and
hitting times for NBCRW on the network. Within the paradigm, we study NBCRW on
some model and real networks and compare the results with those corresponding
to TURW and maximal entropy random walks (MERW), with the latter being biased
random walks based on eigenvector centrality. We show that the behaviors of
stationary distribution and hitting times for NBCRW widely differ from those
associated with TURW and MERW, especially for heterogeneous networks.
| cs.SI physics.soc-ph | random walks are a fundamental tool for analyzing realistic complex networked systems and implementing randomized algorithms to solve diverse problems such as searching and sampling for many real applications their actual effect and convenience depend on the properties eg stationary distribution and hitting time of random walks with biased random walks often outperforming traditional unbiased random walks turw in this paper we present a new class of biased random walks nonbacktracking centrality based random walks nbcrw on a network where the walker prefers to jump to neighbors with high nonbacktracking centrality that has some advantages over eigenvector centrality we study some properties of the nonbacktracking matrix of a network on the basis of which we propose a theoretical framework for fast computation of the transition probabilities stationary distribution and hitting times for nbcrw on the network within the paradigm we study nbcrw on some model and real networks and compare the results with those corresponding to turw and maximal entropy random walks merw with the latter being biased random walks based on eigenvector centrality we show that the behaviors of stationary distribution and hitting times for nbcrw widely differ from those associated with turw and merw especially for heterogeneous networks | [['random', 'walks', 'are', 'a', 'fundamental', 'tool', 'for', 'analyzing', 'realistic', 'complex', 'networked', 'systems', 'and', 'implementing', 'randomized', 'algorithms', 'to', 'solve', 'diverse', 'problems', 'such', 'as', 'searching', 'and', 'sampling', 'for', 'many', 'real', 'applications', 'their', 'actual', 'effect', 'and', 'convenience', 'depend', 'on', 'the', 'properties', 'eg', 'stationary', 'distribution', 'and', 'hitting', 'time', 'of', 'random', 'walks', 'with', 'biased', 'random', 'walks', 'often', 'outperforming', 'traditional', 'unbiased', 'random', 'walks', 'turw', 'in', 'this', 'paper', 'we', 'present', 'a', 'new', 'class', 'of', 'biased', 'random', 'walks', 'nonbacktracking', 'centrality', 'based', 'random', 'walks', 'nbcrw', 'on', 'a', 'network', 'where', 'the', 'walker', 'prefers', 'to', 'jump', 'to', 'neighbors', 'with', 'high', 'nonbacktracking', 'centrality', 'that', 'has', 'some', 'advantages', 'over', 'eigenvector', 'centrality', 'we', 'study', 'some', 'properties', 'of', 'the', 'nonbacktracking', 'matrix', 'of', 'a', 'network', 'on', 'the', 'basis', 'of', 'which', 'we', 'propose', 'a', 'theoretical', 'framework', 'for', 'fast', 'computation', 'of', 'the', 'transition', 'probabilities', 'stationary', 'distribution', 'and', 'hitting', 'times', 'for', 'nbcrw', 'on', 'the', 'network', 'within', 'the', 'paradigm', 'we', 'study', 'nbcrw', 'on', 'some', 'model', 'and', 'real', 'networks', 'and', 'compare', 'the', 'results', 'with', 'those', 'corresponding', 'to', 'turw', 'and', 'maximal', 'entropy', 'random', 'walks', 'merw', 'with', 'the', 'latter', 'being', 'biased', 'random', 'walks', 'based', 'on', 'eigenvector', 'centrality', 'we', 'show', 'that', 'the', 'behaviors', 'of', 'stationary', 'distribution', 'and', 'hitting', 'times', 'for', 'nbcrw', 'widely', 'differ', 'from', 'those', 'associated', 'with', 'turw', 'and', 'merw', 'especially', 'for', 'heterogeneous', 'networks']] | [-0.07785505532054231, 0.13336780094017742, -0.07429884200915694, 0.05411260586872231, -0.05152112266630866, -0.17500813595484943, 0.06551014220633078, 0.44763258995488286, -0.2266268517775461, -0.24088943962706252, 0.10503423517860938, -0.30892676846589895, -0.17174571383278817, 0.17798377453698777, -0.04065564681644901, 0.12302849804982544, 0.06811443368205801, 0.05757938636466861, -0.0405848805909045, -0.22942679678089917, 0.2799992335564457, 0.042716886133421214, 0.31381361875217406, 0.009167279992252588, 0.09133051564800553, 0.046302100240718576, -0.044298038488195746, 0.05596545197127853, -0.11406993526885344, 0.11674773719743825, 0.18110447328421286, 0.11635891980025917, 0.293102835258469, -0.4001898662373424, -0.20954507566522806, 0.18686951598036103, 0.1339939610557485, 0.10997816813585815, -0.02756202352582477, -0.3275939497654326, 0.08311628575727809, -0.13435978441964835, -0.10019647342400276, -0.04139286707737483, 0.04806593153276481, 0.11188233152730391, -0.2715135968243703, 0.07106610485119745, 0.029630664503201842, 0.036694543911144135, 0.05261574639473111, -0.15227066969731823, 0.04250878296792507, 0.13130178453400732, -0.005088233710848726, -0.02889265106059611, 0.152405661563389, -0.08429983894806355, -0.21370824725250714, 0.38468177226372063, -0.01787629508646205, -0.21316810458396504, 0.18465367728378623, -0.13270386995049194, -0.19738942733965814, 0.07341291369404644, 0.2534231403237209, 0.14372132869291818, -0.1398763842182234, 0.031038827056181616, -0.03866435918142088, 0.04013270199531689, 0.021502216135850176, 0.046434947478119284, 0.12340042928233742, 0.16879724866943435, 0.11773478984978283, 0.12295145834446884, -0.0405820474497159, -0.20646322041749954, -0.21669510273030027, -0.1049725432874402, -0.2644204528769478, 0.09876196437515318, -0.20769594602214056, -0.2522622778872028, 0.44673133275471627, 0.20753691917750985, 0.2490085087157786, 0.18105821166012903, 0.24042683216976002, 0.10340609697101172, -0.025274604672740678, 0.117215756312944, 0.09112535253036186, 0.13853172624949367, 0.10017286573245655, -0.11552034870488569, 0.1432262456486933, 0.07416029246989637] |
1,803.03088 | Classification of cryptocurrency coins and tokens by the dynamics of
their market capitalisations | We empirically verify that the market capitalisations of coins and tokens in
the cryptocurrency universe follow power-law distributions with significantly
different values, with the tail exponent falling between 0.5 and 0.7 for coins,
and between 1.0 and 1.3 for tokens. We provide a rationale for this, based on a
simple proportional growth with birth & death model previously employed to
describe the size distribution of firms, cities, webpages, etc. We empirically
validate the model and its main predictions, in terms of proportional growth
(Gibrat's law) of the coins and tokens. Estimating the main parameters of the
model, the theoretical predictions for the power-law exponents of coin and
token distributions are in remarkable agreement with the empirical estimations,
given the simplicity of the model. Our results clearly characterize coins as
being "entrenched incumbents" and tokens as an "explosive immature ecosystem",
largely due to massive and exuberant Initial Coin Offering activity in the
token space. The theory predicts that the exponent for tokens should converge
to 1 in the future, reflecting a more reasonable rate of new entrants
associated with genuine technological innovations.
| physics.soc-ph q-fin.GN | we empirically verify that the market capitalisations of coins and tokens in the cryptocurrency universe follow powerlaw distributions with significantly different values with the tail exponent falling between 05 and 07 for coins and between 10 and 13 for tokens we provide a rationale for this based on a simple proportional growth with birth death model previously employed to describe the size distribution of firms cities webpages etc we empirically validate the model and its main predictions in terms of proportional growth gibrats law of the coins and tokens estimating the main parameters of the model the theoretical predictions for the powerlaw exponents of coin and token distributions are in remarkable agreement with the empirical estimations given the simplicity of the model our results clearly characterize coins as being entrenched incumbents and tokens as an explosive immature ecosystem largely due to massive and exuberant initial coin offering activity in the token space the theory predicts that the exponent for tokens should converge to 1 in the future reflecting a more reasonable rate of new entrants associated with genuine technological innovations | [['we', 'empirically', 'verify', 'that', 'the', 'market', 'capitalisations', 'of', 'coins', 'and', 'tokens', 'in', 'the', 'cryptocurrency', 'universe', 'follow', 'powerlaw', 'distributions', 'with', 'significantly', 'different', 'values', 'with', 'the', 'tail', 'exponent', 'falling', 'between', '05', 'and', '07', 'for', 'coins', 'and', 'between', '10', 'and', '13', 'for', 'tokens', 'we', 'provide', 'a', 'rationale', 'for', 'this', 'based', 'on', 'a', 'simple', 'proportional', 'growth', 'with', 'birth', 'death', 'model', 'previously', 'employed', 'to', 'describe', 'the', 'size', 'distribution', 'of', 'firms', 'cities', 'webpages', 'etc', 'we', 'empirically', 'validate', 'the', 'model', 'and', 'its', 'main', 'predictions', 'in', 'terms', 'of', 'proportional', 'growth', 'gibrats', 'law', 'of', 'the', 'coins', 'and', 'tokens', 'estimating', 'the', 'main', 'parameters', 'of', 'the', 'model', 'the', 'theoretical', 'predictions', 'for', 'the', 'powerlaw', 'exponents', 'of', 'coin', 'and', 'token', 'distributions', 'are', 'in', 'remarkable', 'agreement', 'with', 'the', 'empirical', 'estimations', 'given', 'the', 'simplicity', 'of', 'the', 'model', 'our', 'results', 'clearly', 'characterize', 'coins', 'as', 'being', 'entrenched', 'incumbents', 'and', 'tokens', 'as', 'an', 'explosive', 'immature', 'ecosystem', 'largely', 'due', 'to', 'massive', 'and', 'exuberant', 'initial', 'coin', 'offering', 'activity', 'in', 'the', 'token', 'space', 'the', 'theory', 'predicts', 'that', 'the', 'exponent', 'for', 'tokens', 'should', 'converge', 'to', '1', 'in', 'the', 'future', 'reflecting', 'a', 'more', 'reasonable', 'rate', 'of', 'new', 'entrants', 'associated', 'with', 'genuine', 'technological', 'innovations']] | [-0.04986170445914854, 0.13382577477226246, -0.09077726284760004, 0.09043004984678649, -0.04904833308183042, -0.18394508335333545, 0.09102641712736297, 0.34444960921953366, -0.22977179731112285, -0.3235614217385941, 0.08033027654115693, -0.3268591606906256, -0.09699467622789466, 0.17640222208418327, -0.09761129211186946, 0.019296682743221005, 0.01392951250393672, 0.02087887050600218, 0.03912697404404509, -0.26701385013020323, 0.30003652280565957, 0.07503845414417333, 0.2926452026907979, 0.02570152890936123, 0.0993418523068826, -0.051730274873156123, -0.047362017208858596, -0.03684402026730985, -0.1642171318707669, 0.1092897602864255, 0.1819673085275663, 0.12739253279560522, 0.2769573934886126, -0.4026747224501246, -0.13070643650024463, 0.12605529945010746, 0.1345646465691483, 0.07455337399424329, -0.04805023792596838, -0.25714273774585367, 0.08714192247411039, -0.2269215980888079, -0.1407298547730849, -0.015130314290492311, 0.06330888887526541, 0.06469988580025712, -0.2609832126012478, 0.09315379955883882, 0.03079802887358146, 0.04687675911225587, -0.06989494309820464, -0.12478877385289996, -0.016825918735176658, 0.18446741321035687, 0.0845167090317661, -0.0126700336968802, 0.12042056435365334, -0.14971237296795253, -0.16303646139405126, 0.373859848223585, -0.046076766256888155, -0.14041234935274838, 0.1592223256470001, -0.1658922020725089, -0.10219552606479498, 0.04552614215602734, 0.16829782012100825, 0.03111275808461168, -0.1407515224194227, -0.005901688470845969, -0.02651152704639475, 0.1819227368254787, 0.057541118595097474, 0.018986529506397936, 0.20364542182680614, 0.1731543863301462, 0.019501857399711563, 0.10879888534988147, -0.044044415872640304, -0.1717786019480678, -0.28245855389129076, -0.11825506351680062, -0.19924159031543442, 0.029951606944786102, -0.18522592654440997, -0.1490007702094716, 0.4067970176471928, 0.19159944503250734, 0.21530400815955753, 0.13660067743257562, 0.25349740918684105, 0.0898791589876949, 0.06516595021171194, 0.10681612874438476, 0.1775868343626404, 0.06054021356960332, 0.13084516872771543, -0.16030344514790193, 0.17958132912243543, -0.000987065314736696] |
1,803.03089 | Incoherent conductivity of holographic charge density waves | The DC resistivity of charge density waves weakly-pinned by disorder is
controlled by diffusive, incoherent processes rather than slow momentum
relaxation. The corresponding incoherent conductivity can be computed in the
limit of zero disorder. We compute this transport coefficient in holographic
spatially modulated breaking translations spontaneously. As a by-product of our
analysis, we clarify how the boundary heat current is obtained from a conserved
bulk current, defined as a suitable generalization of the Iyer-Wald Noether
current of the appropriate Killing vector.
| hep-th | the dc resistivity of charge density waves weaklypinned by disorder is controlled by diffusive incoherent processes rather than slow momentum relaxation the corresponding incoherent conductivity can be computed in the limit of zero disorder we compute this transport coefficient in holographic spatially modulated breaking translations spontaneously as a byproduct of our analysis we clarify how the boundary heat current is obtained from a conserved bulk current defined as a suitable generalization of the iyerwald noether current of the appropriate killing vector | [['the', 'dc', 'resistivity', 'of', 'charge', 'density', 'waves', 'weaklypinned', 'by', 'disorder', 'is', 'controlled', 'by', 'diffusive', 'incoherent', 'processes', 'rather', 'than', 'slow', 'momentum', 'relaxation', 'the', 'corresponding', 'incoherent', 'conductivity', 'can', 'be', 'computed', 'in', 'the', 'limit', 'of', 'zero', 'disorder', 'we', 'compute', 'this', 'transport', 'coefficient', 'in', 'holographic', 'spatially', 'modulated', 'breaking', 'translations', 'spontaneously', 'as', 'a', 'byproduct', 'of', 'our', 'analysis', 'we', 'clarify', 'how', 'the', 'boundary', 'heat', 'current', 'is', 'obtained', 'from', 'a', 'conserved', 'bulk', 'current', 'defined', 'as', 'a', 'suitable', 'generalization', 'of', 'the', 'iyerwald', 'noether', 'current', 'of', 'the', 'appropriate', 'killing', 'vector']] | [-0.18390850304269496, 0.2422207964506621, -0.05235282163837074, 0.06823951657430304, -0.06762032253081324, -0.11635107445289139, 0.049141625554680275, 0.29977881062177963, -0.309382413301249, -0.19865649409684133, 0.06761295454149756, -0.2628167286331271, -0.10697852710066479, 0.14365974924653585, 0.001319636263091255, 0.03950702525491332, -0.04093320523446173, 0.014708560977683024, -0.11348055496259972, -0.15815373659593823, 0.306470850425094, 0.03859320042056986, 0.35171691696217033, 0.05879791551212102, 0.07656490714231759, 0.012957245007985167, -0.007332753849986159, 0.0626446146943411, -0.12741384055051538, 0.039429388744871556, 0.23754597086183452, -0.02163100691029319, 0.15866200547711348, -0.45748987660547835, -0.23681788592754552, 0.04022737673230837, 0.16255551746781963, 0.13734165341650814, -0.02042439763928637, -0.2714161904712702, 0.021824275488378824, -0.14466354189969508, -0.16488764464947175, -0.1325575973160197, 0.0018396918190482221, -1.8456122941441005e-05, -0.2582741099076323, 0.21644459164092017, 0.07559236070072209, 0.05741961973659654, -0.11099513731379476, -0.07323426168547069, -0.11726533700597047, 0.059849665891149165, 0.10035849071142298, 0.0591410221302031, 0.22201475739496312, -0.14049687594991683, -0.10662069724136848, 0.29880521153272305, -0.13262065923517644, -0.24504375461213015, 0.12685557897490116, -0.15635490011607792, -0.04584562138619798, 0.13692345817423898, 0.10082648538432464, 0.1613256019183699, -0.19274772793330527, 0.07885597832500935, -0.035985179521419386, 0.09619623897769661, 0.08212460164716583, 0.027786696818369774, 0.2279190370341602, 0.15470584060128686, 0.066326205348481, 0.16852091085366952, -0.05319586331542167, -0.0753272151356034, -0.34743206705438134, -0.15228027384871917, -0.2345054381021103, 0.18021555994148653, -0.10646831074062689, -0.14200851978176493, 0.40316365295331236, 0.17577798352404325, 0.19815780886989318, 0.008864331496074612, 0.2660008718857519, 0.21178085182615222, 0.07754524781104223, 0.07744168533575664, 0.21749767605617734, 0.1726068029191667, 0.15905620418144045, -0.30394087544280207, 0.028946476732668133, 0.06997072999365628] |
1,803.0309 | Competing spin transfer and dissipation at Co/Cu(001) interfaces on
femtosecond timescales | By combining interface-sensitive non-linear magneto-optical experiments with
femtosecond time resolution and ab-initio time-dependent density functional
theory, we show that optically excited spin dynamics at Co/Cu(001) interfaces
proceeds via spin-dependent charge transfer and backtransfer between Co and Cu.
This ultrafast spin transfer competes with dissipation of spin angular momentum
mediated by spin-orbit coupling already on sub 100 fs timescales. We thereby
identify the fundamental microscopic processes during laser-induced spin
transfer at a model interface for technologically relevant ferromagnetic
heterostructures.
| cond-mat.mtrl-sci | by combining interfacesensitive nonlinear magnetooptical experiments with femtosecond time resolution and abinitio timedependent density functional theory we show that optically excited spin dynamics at cocu001 interfaces proceeds via spindependent charge transfer and backtransfer between co and cu this ultrafast spin transfer competes with dissipation of spin angular momentum mediated by spinorbit coupling already on sub 100 fs timescales we thereby identify the fundamental microscopic processes during laserinduced spin transfer at a model interface for technologically relevant ferromagnetic heterostructures | [['by', 'combining', 'interfacesensitive', 'nonlinear', 'magnetooptical', 'experiments', 'with', 'femtosecond', 'time', 'resolution', 'and', 'abinitio', 'timedependent', 'density', 'functional', 'theory', 'we', 'show', 'that', 'optically', 'excited', 'spin', 'dynamics', 'at', 'cocu001', 'interfaces', 'proceeds', 'via', 'spindependent', 'charge', 'transfer', 'and', 'backtransfer', 'between', 'co', 'and', 'cu', 'this', 'ultrafast', 'spin', 'transfer', 'competes', 'with', 'dissipation', 'of', 'spin', 'angular', 'momentum', 'mediated', 'by', 'spinorbit', 'coupling', 'already', 'on', 'sub', '100', 'fs', 'timescales', 'we', 'thereby', 'identify', 'the', 'fundamental', 'microscopic', 'processes', 'during', 'laserinduced', 'spin', 'transfer', 'at', 'a', 'model', 'interface', 'for', 'technologically', 'relevant', 'ferromagnetic', 'heterostructures']] | [-0.137284611701034, 0.2596631404131842, 0.020308002829551697, 0.04371073716827549, -0.018995862872077104, -0.16963593571637878, 0.03997622393832829, 0.4753153528779363, -0.30636439693327516, -0.2984211473988417, -0.06274534789367746, -0.2799516977169193, -0.075659219115877, 0.21483465651563632, 0.18143708864226937, 0.020412498661197532, -0.0018571469550713515, -0.17479306800911823, -0.0832013299730487, -0.0907546320798783, 0.29950961861640024, 0.046114217476152145, 0.2678144554762791, 0.12856641272978428, 0.12434692153235516, 0.06010820817512771, 0.09564886014171255, -0.09544806605658661, -0.17305900965780333, 0.08046542680285011, 0.2773090275243307, -0.14496362386228448, 0.2106494558079598, -0.5589665622474291, -0.23854639571016797, -0.09468618982758087, 0.10905151581391692, 0.18091676667786372, -0.09553194994805381, -0.26073775809103, -0.004273401155399206, -0.16747598132739464, -0.05883061490693273, -0.14772513258056, 0.0318896866713961, -0.009968576988635154, -0.2678740720073573, 0.14969086417486557, 0.05839331749563989, 0.0868258657029424, -0.10029729662570529, -0.04629519655822943, -0.14414671272373733, -0.002691777508096913, 0.0002992522219219842, 0.05847983613896828, 0.23842992317170286, -0.09473956558698167, -0.15789591630276006, 0.269680799695496, -0.10386473583415724, -0.09945158689067914, 0.21489700451732063, -0.203581820994329, -0.032185671922679134, 0.16806522449956107, 0.11790617320161217, 0.16471538520776308, -0.1353391746465021, 0.07171292975321054, 0.07434370536327314, 0.2150066557746285, 0.08593908895869763, 0.08848867255754811, 0.2934351530081282, 0.25021224012837195, 0.012901986764075283, 0.07237137855293277, -0.156502100922621, -0.09948052193085925, -0.18202402650450283, -0.12924832242349973, -0.23706351378216192, 0.13364743067620274, -0.054735956486136925, -0.024400924392140064, 0.36883080095793, 0.14504531119018793, 0.1352337314030872, -0.04965070192552864, 0.2912455797673036, 0.10525308726713635, 0.05976572101159642, -0.009945186046071542, 0.23585010969784492, 0.18615610007411584, 0.12370962155863452, -0.3855829270652089, 0.06005790012960251, -0.002131715533323586] |
1,803.03091 | Signs of Dark Matter at 21-cm? | Recently the EDGES collaboration reported an anomalous absorption signal in
the sky-averaged 21-cm spectrum around $z=17$. Such a signal may be understood
as an indication for an unexpected cooling of the hydrogen gas during or prior
to the so called Cosmic Dawn era. Here we explore the possibility that dark
matter cooled the gas through velocity-dependent, Rutherford-like interactions.
We argue that such interactions require a light mediator that is highly
constrained by 5th force experiments and limits from stellar cooling.
Consequently, only a hidden or the visible photon can in principle mediate such
a force. Neutral hydrogen thus plays a sub-leading role and the cooling occurs
via the residual free electrons and protons. We find that these two scenarios
are strongly constrained by the predicted dark matter self-interactions and by
limits on millicharged dark matter respectively. We conclude that the 21-cm
absorption line is unlikely to be the result of gas cooling via the scattering
with a dominant component of the dark matter. An order 1\% subcomponent of
millicharged dark matter remains a viable explanation.
| hep-ph astro-ph.CO | recently the edges collaboration reported an anomalous absorption signal in the skyaveraged 21cm spectrum around z17 such a signal may be understood as an indication for an unexpected cooling of the hydrogen gas during or prior to the so called cosmic dawn era here we explore the possibility that dark matter cooled the gas through velocitydependent rutherfordlike interactions we argue that such interactions require a light mediator that is highly constrained by 5th force experiments and limits from stellar cooling consequently only a hidden or the visible photon can in principle mediate such a force neutral hydrogen thus plays a subleading role and the cooling occurs via the residual free electrons and protons we find that these two scenarios are strongly constrained by the predicted dark matter selfinteractions and by limits on millicharged dark matter respectively we conclude that the 21cm absorption line is unlikely to be the result of gas cooling via the scattering with a dominant component of the dark matter an order 1 subcomponent of millicharged dark matter remains a viable explanation | [['recently', 'the', 'edges', 'collaboration', 'reported', 'an', 'anomalous', 'absorption', 'signal', 'in', 'the', 'skyaveraged', '21cm', 'spectrum', 'around', 'z17', 'such', 'a', 'signal', 'may', 'be', 'understood', 'as', 'an', 'indication', 'for', 'an', 'unexpected', 'cooling', 'of', 'the', 'hydrogen', 'gas', 'during', 'or', 'prior', 'to', 'the', 'so', 'called', 'cosmic', 'dawn', 'era', 'here', 'we', 'explore', 'the', 'possibility', 'that', 'dark', 'matter', 'cooled', 'the', 'gas', 'through', 'velocitydependent', 'rutherfordlike', 'interactions', 'we', 'argue', 'that', 'such', 'interactions', 'require', 'a', 'light', 'mediator', 'that', 'is', 'highly', 'constrained', 'by', '5th', 'force', 'experiments', 'and', 'limits', 'from', 'stellar', 'cooling', 'consequently', 'only', 'a', 'hidden', 'or', 'the', 'visible', 'photon', 'can', 'in', 'principle', 'mediate', 'such', 'a', 'force', 'neutral', 'hydrogen', 'thus', 'plays', 'a', 'subleading', 'role', 'and', 'the', 'cooling', 'occurs', 'via', 'the', 'residual', 'free', 'electrons', 'and', 'protons', 'we', 'find', 'that', 'these', 'two', 'scenarios', 'are', 'strongly', 'constrained', 'by', 'the', 'predicted', 'dark', 'matter', 'selfinteractions', 'and', 'by', 'limits', 'on', 'millicharged', 'dark', 'matter', 'respectively', 'we', 'conclude', 'that', 'the', '21cm', 'absorption', 'line', 'is', 'unlikely', 'to', 'be', 'the', 'result', 'of', 'gas', 'cooling', 'via', 'the', 'scattering', 'with', 'a', 'dominant', 'component', 'of', 'the', 'dark', 'matter', 'an', 'order', '1', 'subcomponent', 'of', 'millicharged', 'dark', 'matter', 'remains', 'a', 'viable', 'explanation']] | [-0.11433545311480495, 0.234486512170905, -0.08163276750926993, 0.11850937303288707, -0.07826427114861352, -0.09875588948173182, 0.026208487727812358, 0.35808562123349735, -0.25392399106174707, -0.34305430020604816, 0.03660113869634058, -0.29374210407957435, -0.07750921247527004, 0.16140330578034212, 0.07101915229644094, -0.027780186825298838, -0.015564799600147776, -0.01009071100237114, 0.013442725173330733, -0.21427548909692892, 0.3111612735582249, 0.10620468061018203, 0.19583740321387139, 0.11447259361988732, 0.09513054799479766, -0.04071337985673121, -0.05574144143345101, -0.04566204212605953, -0.10793254800910031, 0.04145099877113743, 0.18099293264427355, 0.08148835411827479, 0.18247810153157584, -0.4412152209665094, -0.2585405460585441, 0.20391352965895618, 0.19834810899171446, 0.10746824965945312, -0.13990639135574123, -0.2910516529344022, -0.010153477765353663, -0.2066728220600635, -0.12238155792068157, -0.038042157204555616, -0.008062289703105177, -0.03514551839126008, -0.24861184382279006, 0.11440569982265256, 0.030902200133672782, -0.03952243975031056, -0.06178633557366473, -0.06933547627712999, -0.030951508999403035, 0.0004440525014485632, 0.0562180128986282, 0.01689888087234327, 0.25709076704723494, -0.21299497179953114, -0.07100283240234213, 0.42529253576483045, -0.15724771132227033, -0.06539023382589221, 0.19558502501974415, -0.12950639163676117, -0.14669631855296236, 0.1889626561690654, 0.12708767541817256, 0.048587926467880606, -0.1469289467377322, 0.06260297472322626, -0.037159762580745985, 0.21056588318331965, 0.04329711033962667, 0.03897466065960803, 0.3688555816986731, 0.15707576499985798, 0.06060593952424824, 0.03927101613820663, -0.13746143649066134, -0.008952609529452664, -0.2872509689522641, -0.15305742107331752, -0.14688553338604313, 0.03918615008039134, -0.04882056107179129, -0.08382301334025605, 0.2979371966368386, 0.12172284116236759, 0.2137763297557831, -0.03335235686440553, 0.3466516580352826, 0.09672444938748542, 0.05124745369489704, 0.05985666814792369, 0.3726894491485187, 0.12920466865678984, 0.07134284567021365, -0.24084999087133577, 0.04905161928618327, -0.025444577147385905] |
1,803.03092 | Carnap: An Open Framework for Formal Reasoning in the Browser | This paper presents an overview of Carnap, a free and open framework for the
development of formal reasoning applications. Carnap's design emphasizes
flexibility, extensibility, and rapid prototyping. Carnap-based applications
are written in Haskell, but can be compiled to JavaScript to run in standard
web browsers. This combination of features makes Carnap ideally suited for
educational applications, where ease-of-use is crucial for students and
adaptability to different teaching strategies and classroom needs is crucial
for instructors. The paper describes Carnap's implementation, along with its
current and projected pedagogical applications.
| cs.HC | this paper presents an overview of carnap a free and open framework for the development of formal reasoning applications carnaps design emphasizes flexibility extensibility and rapid prototyping carnapbased applications are written in haskell but can be compiled to javascript to run in standard web browsers this combination of features makes carnap ideally suited for educational applications where easeofuse is crucial for students and adaptability to different teaching strategies and classroom needs is crucial for instructors the paper describes carnaps implementation along with its current and projected pedagogical applications | [['this', 'paper', 'presents', 'an', 'overview', 'of', 'carnap', 'a', 'free', 'and', 'open', 'framework', 'for', 'the', 'development', 'of', 'formal', 'reasoning', 'applications', 'carnaps', 'design', 'emphasizes', 'flexibility', 'extensibility', 'and', 'rapid', 'prototyping', 'carnapbased', 'applications', 'are', 'written', 'in', 'haskell', 'but', 'can', 'be', 'compiled', 'to', 'javascript', 'to', 'run', 'in', 'standard', 'web', 'browsers', 'this', 'combination', 'of', 'features', 'makes', 'carnap', 'ideally', 'suited', 'for', 'educational', 'applications', 'where', 'easeofuse', 'is', 'crucial', 'for', 'students', 'and', 'adaptability', 'to', 'different', 'teaching', 'strategies', 'and', 'classroom', 'needs', 'is', 'crucial', 'for', 'instructors', 'the', 'paper', 'describes', 'carnaps', 'implementation', 'along', 'with', 'its', 'current', 'and', 'projected', 'pedagogical', 'applications']] | [-0.056542443864224155, 0.02119709300188396, -0.05263709689586841, 0.05203923707207044, -0.20443315069116225, -0.19985197686815057, -0.0145765058883605, 0.4214505430353784, -0.23781859264548483, -0.3508128160075552, 0.0880335033790947, -0.21308270640585614, -0.13490079347600883, 0.2534525978924899, -0.16740252898642044, 0.044205320586220245, 0.08512913051393182, -0.04236297102928718, -0.05744277534942175, -0.2602204583811402, 0.23639566004918566, 0.10618393484974044, 0.3107155836347876, 0.11760927631717774, 0.06828353519621037, 0.05320305663599879, -0.06870349446825426, -0.035836397375825835, -0.07980945573627264, 0.17429064429397212, 0.4446322422517442, 0.2728854846851579, 0.3683321081990398, -0.40569924409019537, -0.0952939379253778, -0.0275171470236911, 0.1665394508665235, 0.07942925261911647, -0.09029605315634232, -0.2854625585986751, 0.08103004069035423, -0.23710256022797233, -0.14468712292226224, -0.16479617772602487, 0.03967124487048593, 0.026242285795595455, -0.22720662884590825, -0.07713461232682069, 0.045574946200539326, 0.15957689916864895, 0.0003726466882695583, -0.10700482162700474, 0.08449714250552158, 0.16501860548581543, 0.03420227044529613, 0.030786669053051663, 0.18442378860052633, -0.15770830653457976, -0.1422471029352097, 0.4268157496705823, 0.014536876472291248, -0.15387812247312488, 0.24336223930773465, 0.01370823971964633, -0.16917299143648867, 0.00019362008389106942, 0.22121208034798331, 0.06908656813033011, -0.20498088034854708, 0.1260004264493901, 0.12258081593893297, 0.1793250573261095, 0.010182959051674297, 0.014642339545682115, 0.24362559081322846, 0.2637922764573803, 0.0080890533054012, 0.11559877999999357, 0.042282880920831156, -0.10262833189904347, -0.3143009689647233, -0.27985773003264064, -0.10288174549952664, -0.016204626534947718, -0.024874225092065605, -0.16194356822719178, 0.39688985866505183, 0.22728673720346956, 0.03312569889828734, 0.053899329171740805, 0.3385420439272434, 0.020806318274752676, 0.07394646385941527, 0.08685997073356619, 0.11227137534564693, 0.035239915304613866, 0.23934562342112947, -0.10835207340939121, 0.10337711967549276, -0.0223888316855434] |
1,803.03093 | Towards Bi-Directional Communication in Human-Swarm Teaming: A Survey | Swarm systems consist of large numbers of robots that collaborate
autonomously. With an appropriate level of human control, swarm systems could
be applied in a variety of contexts ranging from search-and-rescue situations
to Cyber defence. The two decision making cycles of swarms and humans operate
on two different time-scales, where the former is normally orders of magnitude
faster than the latter. Closing the loop at the intersection of these two
cycles will create fast and adaptive human-swarm teaming networks. This paper
brings desperate pieces of the ground work in this research area together to
review this multidisciplinary literature. We conclude with a framework to
synthesize the findings and summarize the multi-modal indicators needed for
closed-loop human-swarm adaptive systems.
| cs.HC | swarm systems consist of large numbers of robots that collaborate autonomously with an appropriate level of human control swarm systems could be applied in a variety of contexts ranging from searchandrescue situations to cyber defence the two decision making cycles of swarms and humans operate on two different timescales where the former is normally orders of magnitude faster than the latter closing the loop at the intersection of these two cycles will create fast and adaptive humanswarm teaming networks this paper brings desperate pieces of the ground work in this research area together to review this multidisciplinary literature we conclude with a framework to synthesize the findings and summarize the multimodal indicators needed for closedloop humanswarm adaptive systems | [['swarm', 'systems', 'consist', 'of', 'large', 'numbers', 'of', 'robots', 'that', 'collaborate', 'autonomously', 'with', 'an', 'appropriate', 'level', 'of', 'human', 'control', 'swarm', 'systems', 'could', 'be', 'applied', 'in', 'a', 'variety', 'of', 'contexts', 'ranging', 'from', 'searchandrescue', 'situations', 'to', 'cyber', 'defence', 'the', 'two', 'decision', 'making', 'cycles', 'of', 'swarms', 'and', 'humans', 'operate', 'on', 'two', 'different', 'timescales', 'where', 'the', 'former', 'is', 'normally', 'orders', 'of', 'magnitude', 'faster', 'than', 'the', 'latter', 'closing', 'the', 'loop', 'at', 'the', 'intersection', 'of', 'these', 'two', 'cycles', 'will', 'create', 'fast', 'and', 'adaptive', 'humanswarm', 'teaming', 'networks', 'this', 'paper', 'brings', 'desperate', 'pieces', 'of', 'the', 'ground', 'work', 'in', 'this', 'research', 'area', 'together', 'to', 'review', 'this', 'multidisciplinary', 'literature', 'we', 'conclude', 'with', 'a', 'framework', 'to', 'synthesize', 'the', 'findings', 'and', 'summarize', 'the', 'multimodal', 'indicators', 'needed', 'for', 'closedloop', 'humanswarm', 'adaptive', 'systems']] | [-0.15968341015326648, 0.1266433938449077, -0.0698752435835836, 0.03393034541276994, -0.07459366360631914, -0.13887455697187176, 0.03294557478906334, 0.3740331808428706, -0.2532422514908584, -0.350789427488916, 0.10949359122679521, -0.24359247497661765, -0.17869025043417083, 0.23051659241160852, -0.14495868562973277, 0.024179201790178986, 0.07779566370941288, 0.007511770013340954, 0.007840406095857684, -0.26344634621340973, 0.30760189625276724, 0.01782061333839103, 0.2646398656780563, -0.02603348665002544, 0.08464822378621231, -0.017490520256460976, -0.025391301463784304, 0.009649239014834166, -0.09152502495771071, 0.1930303475454497, 0.33469869798617596, 0.1579385771992285, 0.34526099871559923, -0.4649183180309453, -0.18986875546298984, 0.11159859980472316, 0.1471743809416401, 0.08556858217738317, 0.011158121525807212, -0.29298607616732686, 0.07002827383516656, -0.18877234331394302, -0.12634988919184623, -0.0841871669034521, 0.0003369358403734484, 0.032481826539940625, -0.2427744491941343, -0.052170375393608866, 0.025253191424565294, 0.12697943116309343, -0.04601753035055126, -0.11311187079941885, 0.04809583699472754, 0.194830983569372, 0.0493447224597715, 0.017646943764826204, 0.1891112000389435, -0.13266938234387377, -0.17897297694521436, 0.3544122751770636, 0.0355766320977729, -0.1307997413026958, 0.2665315854592028, -0.07931009773954244, -0.14833010993187584, 0.11154344365379568, 0.24292118878940405, 0.12020077385892303, -0.1681641507351187, -0.027015010857366625, 0.012807807210296139, 0.1706665563515498, 0.03172773228547836, 0.01196604054736889, 0.2231126149200787, 0.21636107720245243, 0.11537854587343538, 0.09752151374685404, -0.04904166939549969, -0.14886566111028698, -0.22408988371775565, -0.1357558469398547, -0.09728705849088097, 0.006311016863653973, -0.05341331211820943, -0.11571364977665372, 0.3723271615108696, 0.22063447787994678, 0.165702118747473, 0.047615587636354866, 0.3215050364872125, 0.02625395920052651, 0.07324177782461679, 0.05122471393097855, 0.21331381086670495, 0.018115445020434967, 0.15018029138643169, -0.18545082657621637, 0.056299000733800356, -0.000398105600359455] |
1,803.03094 | Distributed virtual machine consolidation: A systematic mapping study | Background: Virtual Machine (VM) consolidation is an effective technique to
improve resource utilization and reduce energy footprint in cloud data centers.
It can be implemented in a centralized or a distributed fashion. Distributed VM
consolidation approaches are currently gaining popularity because they are
often more scalable than their centralized counterparts and they avoid a single
point of failure.
Objective: To present a comprehensive, unbiased overview of the
state-of-the-art on distributed VM consolidation approaches.
Method: A Systematic Mapping Study (SMS) of the existing distributed VM
consolidation approaches.
Results: 19 papers on distributed VM consolidation categorized in a variety
of ways. The results show that the existing distributed VM consolidation
approaches use four types of algorithms, optimize a number of different
objectives, and are often evaluated with experiments involving simulations.
Conclusion: There is currently an increasing amount of interest on developing
and evaluating novel distributed VM consolidation approaches. A number of
research gaps exist where the focus of future research may be directed.
| cs.DC | background virtual machine vm consolidation is an effective technique to improve resource utilization and reduce energy footprint in cloud data centers it can be implemented in a centralized or a distributed fashion distributed vm consolidation approaches are currently gaining popularity because they are often more scalable than their centralized counterparts and they avoid a single point of failure objective to present a comprehensive unbiased overview of the stateoftheart on distributed vm consolidation approaches method a systematic mapping study sms of the existing distributed vm consolidation approaches results 19 papers on distributed vm consolidation categorized in a variety of ways the results show that the existing distributed vm consolidation approaches use four types of algorithms optimize a number of different objectives and are often evaluated with experiments involving simulations conclusion there is currently an increasing amount of interest on developing and evaluating novel distributed vm consolidation approaches a number of research gaps exist where the focus of future research may be directed | [['background', 'virtual', 'machine', 'vm', 'consolidation', 'is', 'an', 'effective', 'technique', 'to', 'improve', 'resource', 'utilization', 'and', 'reduce', 'energy', 'footprint', 'in', 'cloud', 'data', 'centers', 'it', 'can', 'be', 'implemented', 'in', 'a', 'centralized', 'or', 'a', 'distributed', 'fashion', 'distributed', 'vm', 'consolidation', 'approaches', 'are', 'currently', 'gaining', 'popularity', 'because', 'they', 'are', 'often', 'more', 'scalable', 'than', 'their', 'centralized', 'counterparts', 'and', 'they', 'avoid', 'a', 'single', 'point', 'of', 'failure', 'objective', 'to', 'present', 'a', 'comprehensive', 'unbiased', 'overview', 'of', 'the', 'stateoftheart', 'on', 'distributed', 'vm', 'consolidation', 'approaches', 'method', 'a', 'systematic', 'mapping', 'study', 'sms', 'of', 'the', 'existing', 'distributed', 'vm', 'consolidation', 'approaches', 'results', '19', 'papers', 'on', 'distributed', 'vm', 'consolidation', 'categorized', 'in', 'a', 'variety', 'of', 'ways', 'the', 'results', 'show', 'that', 'the', 'existing', 'distributed', 'vm', 'consolidation', 'approaches', 'use', 'four', 'types', 'of', 'algorithms', 'optimize', 'a', 'number', 'of', 'different', 'objectives', 'and', 'are', 'often', 'evaluated', 'with', 'experiments', 'involving', 'simulations', 'conclusion', 'there', 'is', 'currently', 'an', 'increasing', 'amount', 'of', 'interest', 'on', 'developing', 'and', 'evaluating', 'novel', 'distributed', 'vm', 'consolidation', 'approaches', 'a', 'number', 'of', 'research', 'gaps', 'exist', 'where', 'the', 'focus', 'of', 'future', 'research', 'may', 'be', 'directed']] | [-0.16105160669471363, 0.046556206913382935, -0.04649548878407349, 0.002285020187300462, -0.07968224704797779, -0.1277898731005164, 0.09267324848846759, 0.4050406223128301, -0.2539004296330469, -0.35764757124707103, 0.12006347433024706, -0.2524103565598543, -0.0705681704255891, 0.22180921706856918, -0.10921612489962754, 0.08006590218008466, 0.0930262145135112, -0.002966941235968785, -0.030802431519422392, -0.2974196747321381, 0.25931186774262566, 0.033997470460924675, 0.39068133747262984, 0.022132716850256143, 0.017087953222296576, -0.04327527675575212, -0.09703630287350612, 0.03925502457170059, -0.05755861191754555, 0.17163457196807455, 0.3263652225759644, 0.20342457695626973, 0.3632328506611195, -0.4716958737706546, -0.20754200554024776, 0.08649909285169026, 0.18778821440581348, 0.06708019973004456, -0.07315183672824403, -0.22455725929937007, 0.12324995397386193, -0.25281917468662035, -0.059428060623984896, -0.10342973030334257, 0.030285223644597004, 0.04539787779585314, -0.2576580407504305, 0.0015409770398183802, -0.0068079053210268105, 0.0687041596497947, -0.07775865962890827, -0.16986647506840297, 0.07942471552281553, 0.1190523425173535, 0.04030250032253054, 0.06088259709009797, 0.22144632058808153, -0.1276429496092363, -0.1891089450012638, 0.3986095664039347, 0.020165506239762813, -0.19535308864592396, 0.23838925621651622, 0.047704232311431574, -0.16231055668936983, 0.09671619758935449, 0.2656818059806695, 0.1300051729223743, -0.18148921227794118, 0.028504227723359414, 0.002930845128537173, 0.15986029675424893, 0.005051523610452039, 0.008404340793129912, 0.18660897585731115, 0.24538227839406973, 0.08878354211945248, 0.0901734511966684, -0.0288406681191315, -0.12549674875675615, -0.19635953451651408, -0.1589209003726842, -0.1779643486554717, -0.010831874031689226, -0.04754100184596971, -0.15625254271598243, 0.33261193408954726, 0.18457326615989925, 0.14599505858351217, 0.04528831357356184, 0.3652745099356456, 0.0773114815342778, 0.1365583993809772, 0.14253899369458234, 0.17770459751239892, -0.021067136745344592, 0.1825848316762203, -0.15838286714152555, 0.04881871653784367, -0.019596959218405974] |
1,803.03095 | Leveraging Unlabeled Data for Crowd Counting by Learning to Rank | We propose a novel crowd counting approach that leverages abundantly
available unlabeled crowd imagery in a learning-to-rank framework. To induce a
ranking of cropped images , we use the observation that any sub-image of a
crowded scene image is guaranteed to contain the same number or fewer persons
than the super-image. This allows us to address the problem of limited size of
existing datasets for crowd counting. We collect two crowd scene datasets from
Google using keyword searches and query-by-example image retrieval,
respectively. We demonstrate how to efficiently learn from these unlabeled
datasets by incorporating learning-to-rank in a multi-task network which
simultaneously ranks images and estimates crowd density maps. Experiments on
two of the most challenging crowd counting datasets show that our approach
obtains state-of-the-art results.
| cs.CV | we propose a novel crowd counting approach that leverages abundantly available unlabeled crowd imagery in a learningtorank framework to induce a ranking of cropped images we use the observation that any subimage of a crowded scene image is guaranteed to contain the same number or fewer persons than the superimage this allows us to address the problem of limited size of existing datasets for crowd counting we collect two crowd scene datasets from google using keyword searches and querybyexample image retrieval respectively we demonstrate how to efficiently learn from these unlabeled datasets by incorporating learningtorank in a multitask network which simultaneously ranks images and estimates crowd density maps experiments on two of the most challenging crowd counting datasets show that our approach obtains stateoftheart results | [['we', 'propose', 'a', 'novel', 'crowd', 'counting', 'approach', 'that', 'leverages', 'abundantly', 'available', 'unlabeled', 'crowd', 'imagery', 'in', 'a', 'learningtorank', 'framework', 'to', 'induce', 'a', 'ranking', 'of', 'cropped', 'images', 'we', 'use', 'the', 'observation', 'that', 'any', 'subimage', 'of', 'a', 'crowded', 'scene', 'image', 'is', 'guaranteed', 'to', 'contain', 'the', 'same', 'number', 'or', 'fewer', 'persons', 'than', 'the', 'superimage', 'this', 'allows', 'us', 'to', 'address', 'the', 'problem', 'of', 'limited', 'size', 'of', 'existing', 'datasets', 'for', 'crowd', 'counting', 'we', 'collect', 'two', 'crowd', 'scene', 'datasets', 'from', 'google', 'using', 'keyword', 'searches', 'and', 'querybyexample', 'image', 'retrieval', 'respectively', 'we', 'demonstrate', 'how', 'to', 'efficiently', 'learn', 'from', 'these', 'unlabeled', 'datasets', 'by', 'incorporating', 'learningtorank', 'in', 'a', 'multitask', 'network', 'which', 'simultaneously', 'ranks', 'images', 'and', 'estimates', 'crowd', 'density', 'maps', 'experiments', 'on', 'two', 'of', 'the', 'most', 'challenging', 'crowd', 'counting', 'datasets', 'show', 'that', 'our', 'approach', 'obtains', 'stateoftheart', 'results']] | [-0.02164519934224025, -0.010008040453202182, -0.08402742179591328, 0.07373543648469832, -0.14774465596682632, -0.14475385048952435, 0.0510001708640747, 0.4430254109864754, -0.22836444489826868, -0.40468548520678477, 0.049104435930794645, -0.3470305820361142, -0.16826161556884706, 0.20724621211411431, -0.18827637963207258, 0.06856805797865344, 0.17388292295753113, 0.07308207343392555, -0.0045744829469420495, -0.3060828809027425, 0.30013192551409557, -0.037323664783710436, 0.35099745809190697, 0.01864770739789932, 0.1549870456285369, -0.034197890684158815, -0.08907789195467147, 0.021158178921811464, -0.05615312589660818, 0.24130560829766065, 0.3473260945907133, 0.2572612310187035, 0.29643932814078944, -0.4109837271633648, -0.2181549637311799, 0.12253551796123746, 0.1357349056390024, 0.12115373974619058, -0.0554912586014853, -0.4069343617170929, 0.11122386053865475, -0.1514753526698182, 0.06574094559126083, -0.17280564241622004, -0.0654715676059676, -0.0403839596847613, -0.3153178953216411, 0.0617713741751598, 0.026463976633104104, 0.02960285334096801, -0.030520121843437664, -0.08211193164630283, 0.06458540468649458, 0.2115052473269433, 0.03585928402683367, 0.008327611992436071, 0.17450086268851714, -0.24561483912628085, -0.15670804806324024, 0.3896139744413836, -0.0494874922204021, -0.19359504710131836, 0.1986099110781065, -0.07054627580463045, -0.1729631959385569, 0.13085526265316613, 0.2392039519407028, 0.1752512741311934, -0.1618740391662164, -0.019549303951921063, -0.16632276555361797, 0.2129005566239357, 0.08268385465940341, -0.050425828532165574, 0.16342838681603392, 0.23168692314967274, 0.07420706128018097, 0.14769188232810027, -0.19499192339360655, -0.007400782221192194, -0.17121574640904944, -0.05826239250159086, -0.2503443892234035, -0.030019664233893104, -0.12308063836098881, -0.12647576236709174, 0.39752121019597736, 0.3322841634921309, 0.23749962942524544, 0.11825453853628959, 0.37462710563634194, -0.03644505329711753, 0.09601020539224508, 0.09179059936920361, 0.09619914232603004, -0.07183031611437458, 0.12333641781456649, -0.13848462868894962, 0.019281689117046735, 0.07089396579296238] |
1,803.03096 | Mechanically modulated emission spectra and blockade of polaritons | We study a hybrid semiconductor-optomechanical system, which consists of a
cavity with an oscillating mirror made by semiconducting materials or with a
semiconducting membrane inside. The cavity photons and the excitons in the
oscillating mirror or semiconducting membrane form into polaritons. And
correspondingly, the optomechanical interaction between the cavity photons and
the mirror or membrane is changed into the polariton-mechanical interaction. We
theoretically study the eigenenergies and eigenfunctions of this tripartite
hybrid system with the generalized rotating-wave approximation. We show that
the emission spectrum of polariton mode is modulated by the mechanical
resonator. We also study the mechanical effect on the statistical properties of
the polariton when the cavity is driven by a weak classical field. This work
provides a detailed description of the rich nonlinearity owing to the
competition between parametric coupling and three-wave mixing interaction
concerning the polariton modes and the phonon mode. It also offers a way to
operate the photons, phonons and excitons, e.g., detect the properties of
mechanical resonator through the fine spectra of the polaritons or control the
transmission of light in the integrated semiconducting-optomechanical platform.
| quant-ph | we study a hybrid semiconductoroptomechanical system which consists of a cavity with an oscillating mirror made by semiconducting materials or with a semiconducting membrane inside the cavity photons and the excitons in the oscillating mirror or semiconducting membrane form into polaritons and correspondingly the optomechanical interaction between the cavity photons and the mirror or membrane is changed into the polaritonmechanical interaction we theoretically study the eigenenergies and eigenfunctions of this tripartite hybrid system with the generalized rotatingwave approximation we show that the emission spectrum of polariton mode is modulated by the mechanical resonator we also study the mechanical effect on the statistical properties of the polariton when the cavity is driven by a weak classical field this work provides a detailed description of the rich nonlinearity owing to the competition between parametric coupling and threewave mixing interaction concerning the polariton modes and the phonon mode it also offers a way to operate the photons phonons and excitons eg detect the properties of mechanical resonator through the fine spectra of the polaritons or control the transmission of light in the integrated semiconductingoptomechanical platform | [['we', 'study', 'a', 'hybrid', 'semiconductoroptomechanical', 'system', 'which', 'consists', 'of', 'a', 'cavity', 'with', 'an', 'oscillating', 'mirror', 'made', 'by', 'semiconducting', 'materials', 'or', 'with', 'a', 'semiconducting', 'membrane', 'inside', 'the', 'cavity', 'photons', 'and', 'the', 'excitons', 'in', 'the', 'oscillating', 'mirror', 'or', 'semiconducting', 'membrane', 'form', 'into', 'polaritons', 'and', 'correspondingly', 'the', 'optomechanical', 'interaction', 'between', 'the', 'cavity', 'photons', 'and', 'the', 'mirror', 'or', 'membrane', 'is', 'changed', 'into', 'the', 'polaritonmechanical', 'interaction', 'we', 'theoretically', 'study', 'the', 'eigenenergies', 'and', 'eigenfunctions', 'of', 'this', 'tripartite', 'hybrid', 'system', 'with', 'the', 'generalized', 'rotatingwave', 'approximation', 'we', 'show', 'that', 'the', 'emission', 'spectrum', 'of', 'polariton', 'mode', 'is', 'modulated', 'by', 'the', 'mechanical', 'resonator', 'we', 'also', 'study', 'the', 'mechanical', 'effect', 'on', 'the', 'statistical', 'properties', 'of', 'the', 'polariton', 'when', 'the', 'cavity', 'is', 'driven', 'by', 'a', 'weak', 'classical', 'field', 'this', 'work', 'provides', 'a', 'detailed', 'description', 'of', 'the', 'rich', 'nonlinearity', 'owing', 'to', 'the', 'competition', 'between', 'parametric', 'coupling', 'and', 'threewave', 'mixing', 'interaction', 'concerning', 'the', 'polariton', 'modes', 'and', 'the', 'phonon', 'mode', 'it', 'also', 'offers', 'a', 'way', 'to', 'operate', 'the', 'photons', 'phonons', 'and', 'excitons', 'eg', 'detect', 'the', 'properties', 'of', 'mechanical', 'resonator', 'through', 'the', 'fine', 'spectra', 'of', 'the', 'polaritons', 'or', 'control', 'the', 'transmission', 'of', 'light', 'in', 'the', 'integrated', 'semiconductingoptomechanical', 'platform']] | [-0.15960033949059382, 0.18583014925401045, -0.07748391434508661, -0.020414777732566104, -0.039020486821175954, -0.16248655563230788, 0.05824223945604107, 0.3945696169312773, -0.2564458804277901, -0.2654735001178677, -0.009743532153528038, -0.29571523551449347, -0.12754082436902273, 0.19872792443395826, 0.031066011638749995, 0.024134585090168862, 0.0495671870345614, -0.045942268193850305, 0.01654634756353481, -0.11228684565135637, 0.3086230822438218, 0.021624945509299512, 0.3144194548377278, 0.06950570885664341, 0.10139645374374849, -0.0027030441134793465, 0.1116606397190074, -0.05582664044594715, -0.12439689226598932, 0.12869115221618502, 0.17529573258859307, -0.030025770263382177, 0.2624911246717226, -0.4618532034209487, -0.19592433662658465, 0.06423565541399258, 0.17550750891182132, 0.15377900185903753, -0.0538564629822855, -0.32441812477662496, -0.026852970547433005, -0.12352274840062889, -0.12186412747127301, -0.038794286043107425, -0.0408715391525083, 0.010487239075533256, -0.23068029146547842, 0.040818923762700306, 0.08104371835865268, 0.037246629151028866, -0.05030760794680295, 0.006473717231605222, -0.04115384148027977, 0.06067407452946857, 0.010444805307499805, -0.04623260186899287, 0.18294213465336898, -0.14395970800844693, -0.07252400826439054, 0.39048995363217776, -0.11225368921233955, -0.1530521416610013, 0.1769506028390297, -0.13919188008466787, 0.024013571685710767, 0.1433195873064785, 0.16110042971688943, 0.060097590241029696, -0.1404434771127589, 0.052450079270885665, 0.0006074166737038996, 0.2143368308091609, 0.07912848202001782, 0.13454608263593562, 0.2446702099535302, 0.20154433402586625, -0.002469361509982101, 0.21967320808329147, -0.05603631191585192, -0.05549070219295984, -0.26271985931186703, -0.17737288983778082, -0.18462580372807025, 0.05530499877387335, -0.06089792206472725, -0.1891111635899577, 0.4595625006305002, 0.07416483635855474, 0.13406649360943107, -0.028062238877602754, 0.31997908312338275, 0.15317811405900136, 0.07925950754537929, 0.01695165230746917, 0.35981175134364285, 0.2005828345420786, 0.07460508240626178, -0.34946912628281135, -0.04492036128864108, -0.01924735425539606] |
1,803.03097 | Diffusion theory for the infection pathway of virus in a living cell | The infection pathway of virus in living cell is of interest from the
viewpoint of the physics of diffusion. Here, recent developments about a
diffusion theory for the infection pathway of an adeno-associated virus in
cytoplasm of a living HeLa cell are reported. Generalizing fractional kinetics
successfully modeling anomalous diffusion, a theory for describing the
infection pathway of the virus over the cytoplasm is presented. The statistical
property of the fluctuations of the anomalous-diffusion exponent is also
discussed based on a maximum-entropy-principle approach. In addition, an issue
regarding the continuum limit of the entropy introduced in the approach is
carefully examined. The theory is found to imply that the motion of the virus
may obey a scaling law.
| physics.bio-ph cond-mat.stat-mech | the infection pathway of virus in living cell is of interest from the viewpoint of the physics of diffusion here recent developments about a diffusion theory for the infection pathway of an adenoassociated virus in cytoplasm of a living hela cell are reported generalizing fractional kinetics successfully modeling anomalous diffusion a theory for describing the infection pathway of the virus over the cytoplasm is presented the statistical property of the fluctuations of the anomalousdiffusion exponent is also discussed based on a maximumentropyprinciple approach in addition an issue regarding the continuum limit of the entropy introduced in the approach is carefully examined the theory is found to imply that the motion of the virus may obey a scaling law | [['the', 'infection', 'pathway', 'of', 'virus', 'in', 'living', 'cell', 'is', 'of', 'interest', 'from', 'the', 'viewpoint', 'of', 'the', 'physics', 'of', 'diffusion', 'here', 'recent', 'developments', 'about', 'a', 'diffusion', 'theory', 'for', 'the', 'infection', 'pathway', 'of', 'an', 'adenoassociated', 'virus', 'in', 'cytoplasm', 'of', 'a', 'living', 'hela', 'cell', 'are', 'reported', 'generalizing', 'fractional', 'kinetics', 'successfully', 'modeling', 'anomalous', 'diffusion', 'a', 'theory', 'for', 'describing', 'the', 'infection', 'pathway', 'of', 'the', 'virus', 'over', 'the', 'cytoplasm', 'is', 'presented', 'the', 'statistical', 'property', 'of', 'the', 'fluctuations', 'of', 'the', 'anomalousdiffusion', 'exponent', 'is', 'also', 'discussed', 'based', 'on', 'a', 'maximumentropyprinciple', 'approach', 'in', 'addition', 'an', 'issue', 'regarding', 'the', 'continuum', 'limit', 'of', 'the', 'entropy', 'introduced', 'in', 'the', 'approach', 'is', 'carefully', 'examined', 'the', 'theory', 'is', 'found', 'to', 'imply', 'that', 'the', 'motion', 'of', 'the', 'virus', 'may', 'obey', 'a', 'scaling', 'law']] | [-0.07839221030208764, 0.13703193030834945, -0.09198912351938157, 0.034673374936040814, -0.008832274613488497, -0.11949684252111434, 0.05401376410937418, 0.2828676099086116, -0.25414709051557144, -0.21214610490755276, 0.08048069290415352, -0.282197236396565, -0.25498394971584964, 0.18090677178256084, -0.0829715657866849, 0.0242507204750617, -0.0014124283294097103, 0.05868228375189135, 0.09900814201184152, -0.20250344344671686, 0.2519929590627475, 0.06599149557537046, 0.3020202205867651, 0.07319432224401931, 0.12674728397215748, -0.01717639549089403, -0.05766390384062482, 0.023087505925575208, -0.19391693043401353, 0.1582926400326963, 0.19307313656237715, 0.11365988863037964, 0.28448627963019857, -0.4264362362727266, -0.31503794059671203, 0.05329208455755022, 0.1792487921554531, 0.15939828392985309, -0.045787024621827654, -0.24801227512994203, 0.042550269546436856, -0.16276314628214159, -0.1854303304491372, 0.01614083245733817, 0.039358373779546596, 0.010081764756188053, -0.23596100623173447, 0.1477285398244115, 0.06142635573633015, 0.0945793820837621, -0.08959165621340147, -0.08690195161837218, -0.029381663727188676, 0.15480872185836578, 0.08536595363643598, -0.006465692153393194, 0.19569866376094006, -0.14403908342476293, -0.13447833502492545, 0.36260202668350316, 0.010404589537788054, -0.19118210503124985, 0.14007502990766782, -0.16134776260928604, -0.15070469198138292, 0.16176645097659964, 0.14213270414620638, 0.08511178961139351, -0.20518315888555913, 0.0791294611669306, -0.00903707806920183, 0.14630955972223028, 0.029589221367194992, -0.014449522166677494, 0.1583316344767809, 0.25159178961646456, 0.008893127456821245, 0.09384014790652898, -0.11272585439367284, -0.16845048194076737, -0.2723925788806559, -0.20139962690079521, -0.16745492812759918, 0.07833300317348592, -0.0946253466636649, -0.17060300833063907, 0.3815367002891184, 0.1321632619997374, 0.15460443088849044, 0.0578847964784002, 0.1921917825258851, 0.07499609307931929, 0.043256978745219006, -0.02518991650893064, 0.19910373782201124, 0.16960814742146638, 0.1168580663958484, -0.270614151728484, 0.1355811174756221, 0.06819098493172626] |
1,803.03098 | Univalence of a certain quartic function | We give a short proof that the quartic polynomial $f(z)=\frac 1 6 z^{4} +
\frac 2 3 z^{3} + \frac 7 6 z^{2} + z$ is univalent.
| math.CV math.CA | we give a short proof that the quartic polynomial fzfrac 1 6 z4 frac 2 3 z3 frac 7 6 z2 z is univalent | [['we', 'give', 'a', 'short', 'proof', 'that', 'the', 'quartic', 'polynomial', 'fzfrac', '1', '6', 'z4', 'frac', '2', '3', 'z3', 'frac', '7', '6', 'z2', 'z', 'is', 'univalent']] | [-0.21263395897720172, 0.12921224287508623, 0.025111167003279148, 0.14601442874308027, -0.027722039705385334, -0.33231814964876877, -0.03606423719421677, 0.3322753075348294, -0.11960619979578516, -0.2222545681035389, 0.13477964492757682, -0.3877688709484494, -0.08337174963368021, 0.08341614659065785, 0.0918702592101434, -0.08779952747990256, -0.15899291460442802, -0.04396666772663593, -0.11538454945928053, -0.5400002150107985, 0.21211026131134966, -0.10245283190970836, -0.00876236719119808, 0.059211776146422264, 0.12586668425280115, -0.049512614192360124, -0.025676105414395748, -0.1905227283258801, -0.32350468373529706, 0.02210386749356985, 0.19128363725283873, 0.101910132266905, 0.2645599955449934, -0.24203007903112017, -0.006486146690566902, 0.1553677457344273, 0.21518504330078544, 0.03569288211672202, -0.080886652774137, -0.11786900284578619, 0.20680322672199944, -0.15046261712584807, -0.2391381908370101, 0.08420576398139415, 0.12903711309089608, 0.00376378461394621, -0.2044621356965407, 0.1716785609074261, 0.20461890482060288, 0.12654751814577891, 0.05209790801872378, -0.17438931823910578, -0.057127525301083275, -0.04244288042916552, -0.09201532583076345, 0.35345378929101257, 0.025953523187047762, -0.13827108547253453, -0.14474589499118534, 0.32865123612725217, -0.03549061537436817, -0.09635611429162648, 0.12053570442873499, -0.2528491879853865, -0.26972334985823737, 0.24609797253556873, 0.0398119332106865, 0.1434766310064689, -0.05830201526860828, 0.24387488123434392, -0.027108905027094093, 0.35431334198169084, 0.1206898902664366, -0.07689147489145398, 0.06049078581449778, 0.02918444719651471, 0.057674266681399036, 0.038206544421289276, -0.02686162292957306, 0.07908073310618816, -0.4259052678294804, -0.14281533569421456, -0.07544267412437045, 0.3684924177258559, -0.26052492180758197, 0.024073550335900938, 0.3467977429213731, 0.02716669464564842, 0.22260453908339792, 0.31651251961517596, 0.10775464068612327, 0.11647714030645463, 0.016438161974529856, 0.0973090741014027, 0.14494314818116633, 0.10369747504591942, 0.08384004745470441, -0.024858864935357935, -0.18518522053795017, 0.21122337003117023] |
1,803.03099 | Spectral Continuity for Aperiodic Quantum Systems II. Periodic
Approximations in 1D | The existence and construction of periodic approximations with convergent
spectra is crucial in solid state physics for the spectral study of
corresponding Schr\"odinger operators. In a forthcoming work [9]
(arXiv:1709.00975) this task was boiled down to the existence and construction
of periodic approximations of the underlying dynamical systems in the Hausdorff
topology. As a result the one-dimensional systems admitting such approximations
are completely classified in the present work. In addition explicit
constructions are provided for dynamical systems defined by primitive
substitutions covering all studied examples such as the Fibonacci sequence or
the Golay-Rudin-Shapiro sequence. One main tool is the description of the
Hausdorff topology by the local pattern topology on the dictionaries as well as
the GAP-graphs describing the local structure. The connection of branching
vertices in the GAP-graphs and defects is discussed.
| math.SP math-ph math.DS math.MP | the existence and construction of periodic approximations with convergent spectra is crucial in solid state physics for the spectral study of corresponding schrodinger operators in a forthcoming work 9 arxiv170900975 this task was boiled down to the existence and construction of periodic approximations of the underlying dynamical systems in the hausdorff topology as a result the onedimensional systems admitting such approximations are completely classified in the present work in addition explicit constructions are provided for dynamical systems defined by primitive substitutions covering all studied examples such as the fibonacci sequence or the golayrudinshapiro sequence one main tool is the description of the hausdorff topology by the local pattern topology on the dictionaries as well as the gapgraphs describing the local structure the connection of branching vertices in the gapgraphs and defects is discussed | [['the', 'existence', 'and', 'construction', 'of', 'periodic', 'approximations', 'with', 'convergent', 'spectra', 'is', 'crucial', 'in', 'solid', 'state', 'physics', 'for', 'the', 'spectral', 'study', 'of', 'corresponding', 'schrodinger', 'operators', 'in', 'a', 'forthcoming', 'work', '9', 'arxiv170900975', 'this', 'task', 'was', 'boiled', 'down', 'to', 'the', 'existence', 'and', 'construction', 'of', 'periodic', 'approximations', 'of', 'the', 'underlying', 'dynamical', 'systems', 'in', 'the', 'hausdorff', 'topology', 'as', 'a', 'result', 'the', 'onedimensional', 'systems', 'admitting', 'such', 'approximations', 'are', 'completely', 'classified', 'in', 'the', 'present', 'work', 'in', 'addition', 'explicit', 'constructions', 'are', 'provided', 'for', 'dynamical', 'systems', 'defined', 'by', 'primitive', 'substitutions', 'covering', 'all', 'studied', 'examples', 'such', 'as', 'the', 'fibonacci', 'sequence', 'or', 'the', 'golayrudinshapiro', 'sequence', 'one', 'main', 'tool', 'is', 'the', 'description', 'of', 'the', 'hausdorff', 'topology', 'by', 'the', 'local', 'pattern', 'topology', 'on', 'the', 'dictionaries', 'as', 'well', 'as', 'the', 'gapgraphs', 'describing', 'the', 'local', 'structure', 'the', 'connection', 'of', 'branching', 'vertices', 'in', 'the', 'gapgraphs', 'and', 'defects', 'is', 'discussed']] | [-0.15077228997806955, 0.10452939462288492, -0.05488081999094218, 0.0994118169661207, -0.012453789994221672, -0.07871912560035843, 0.020244127910813432, 0.32499316881966683, -0.2884937763004744, -0.2806914789212305, 0.1439394493164971, -0.26639541221219437, -0.16985869374624346, 0.18274295394482135, -0.03916736995411474, 0.065463001913817, 0.035163143548623536, 0.04818834225979251, -0.07274025004328222, -0.2304937933488612, 0.35195422586226877, 0.023015149796829205, 0.22247661703605523, 0.009436116625530944, 0.03970119703647702, 0.0025030424901421448, -0.04531191828725643, -0.0041194190848763135, -0.14168133016300294, 0.11072836245244094, 0.25091084435062355, 0.08810386274825753, 0.21520671985642767, -0.3798863758268051, -0.19765551800139305, 0.09505298516898986, 0.13140503638026904, 0.09630039689499278, -0.03968955763677034, -0.28076506129559853, 0.09738289045761953, -0.13147659531014777, -0.17408201578542476, -0.10165227981746312, 0.03972572270174359, 0.0702402812858336, -0.21056088043625878, 0.036142365665846436, 0.13052163608850506, 0.08112696004384413, -0.0905580633796405, -0.08208400063765373, -0.039046226973580414, 0.15298080160426944, 0.004362112245082046, 0.016797125716729797, 0.06428838492363922, -0.09282780152225736, -0.15131896667817765, 0.3990501708156148, -0.04677205413395842, -0.21581229709392025, 0.21448720346183278, -0.12414580929389064, -0.15498988993119361, 0.11358908005780721, 0.14245639568873386, 0.12460739946158877, -0.14573365146729214, 0.1441314531397255, -0.050552399850688705, 0.11689429283805386, 0.0775590225722092, 0.07782540865993315, 0.17378233420814193, 0.18408909597065906, 0.08156526919685361, 0.14167928039421177, -0.001196953951734905, -0.10785041882317195, -0.31714875337689424, -0.13241884913412824, -0.19026728634733361, 0.07558991630604966, -0.06476144053282436, -0.21513861648074184, 0.41219213786859843, 0.07289164484110336, 0.2122956848587812, 0.034271610231145985, 0.25226205266116897, 0.11151654833148039, 0.027115722334243867, 0.034154408390709566, 0.1695412963578232, 0.1785516014770251, 0.06483883019211854, -0.17358956560348124, 0.05063067579979452, 0.1684627951873654] |
1,803.031 | Semianalytical study of excitons and quasiparticle band gap in
two-dimensional insulators | A theoretical study of the exciton binding energy in the two-dimensional
hexagonal boron nitride monolayer is presented within the tight-binding
approximation (TBA). A self-consistent equation for the interband electron-hole
propagators is derived and in the long wavelength limit reduced to the standard
hydrogen atom like Schrodinger equation. It is shown that inclusion of
dynamically screened Coulomb interaction in ladder term is of crucial
importance for proper description of exciton binding energy. This leads to the
self-consistent eigenvalue problem with dynamical screening. The dependence of
the exciton energy on the orbital quantum number is studied. It is predicted
that for the fixed principal quantum number the states with higher orbital
momentum have lower energy than the states with lower orbital momentum. Using
the developed formulas and the experimental optical gap the quasiparticle gap
is estimated. In the limit of high polarizability, a semiclassical procedure
was used to obtain the exciton binding energy. The TBA parametrization is
supported by ab initio calculations.
| cond-mat.mtrl-sci cond-mat.mes-hall | a theoretical study of the exciton binding energy in the twodimensional hexagonal boron nitride monolayer is presented within the tightbinding approximation tba a selfconsistent equation for the interband electronhole propagators is derived and in the long wavelength limit reduced to the standard hydrogen atom like schrodinger equation it is shown that inclusion of dynamically screened coulomb interaction in ladder term is of crucial importance for proper description of exciton binding energy this leads to the selfconsistent eigenvalue problem with dynamical screening the dependence of the exciton energy on the orbital quantum number is studied it is predicted that for the fixed principal quantum number the states with higher orbital momentum have lower energy than the states with lower orbital momentum using the developed formulas and the experimental optical gap the quasiparticle gap is estimated in the limit of high polarizability a semiclassical procedure was used to obtain the exciton binding energy the tba parametrization is supported by ab initio calculations | [['a', 'theoretical', 'study', 'of', 'the', 'exciton', 'binding', 'energy', 'in', 'the', 'twodimensional', 'hexagonal', 'boron', 'nitride', 'monolayer', 'is', 'presented', 'within', 'the', 'tightbinding', 'approximation', 'tba', 'a', 'selfconsistent', 'equation', 'for', 'the', 'interband', 'electronhole', 'propagators', 'is', 'derived', 'and', 'in', 'the', 'long', 'wavelength', 'limit', 'reduced', 'to', 'the', 'standard', 'hydrogen', 'atom', 'like', 'schrodinger', 'equation', 'it', 'is', 'shown', 'that', 'inclusion', 'of', 'dynamically', 'screened', 'coulomb', 'interaction', 'in', 'ladder', 'term', 'is', 'of', 'crucial', 'importance', 'for', 'proper', 'description', 'of', 'exciton', 'binding', 'energy', 'this', 'leads', 'to', 'the', 'selfconsistent', 'eigenvalue', 'problem', 'with', 'dynamical', 'screening', 'the', 'dependence', 'of', 'the', 'exciton', 'energy', 'on', 'the', 'orbital', 'quantum', 'number', 'is', 'studied', 'it', 'is', 'predicted', 'that', 'for', 'the', 'fixed', 'principal', 'quantum', 'number', 'the', 'states', 'with', 'higher', 'orbital', 'momentum', 'have', 'lower', 'energy', 'than', 'the', 'states', 'with', 'lower', 'orbital', 'momentum', 'using', 'the', 'developed', 'formulas', 'and', 'the', 'experimental', 'optical', 'gap', 'the', 'quasiparticle', 'gap', 'is', 'estimated', 'in', 'the', 'limit', 'of', 'high', 'polarizability', 'a', 'semiclassical', 'procedure', 'was', 'used', 'to', 'obtain', 'the', 'exciton', 'binding', 'energy', 'the', 'tba', 'parametrization', 'is', 'supported', 'by', 'ab', 'initio', 'calculations']] | [-0.12751687240888715, 0.15524083812779282, -0.07312122698021994, 0.10235749247003696, -0.013858444704965223, -0.10780380964351935, 0.07248973498426495, 0.3710761922877282, -0.2149544596701162, -0.295391477807425, -0.06835170218255371, -0.30378319723531605, -0.0759133104023931, 0.15180562711611856, 0.08268643664387128, 0.07556984675466083, 0.07651665841549402, 0.0008335756254382431, -0.06905463182192761, -0.17595293937774842, 0.27984098294982684, 0.08841636284923879, 0.2713221192068886, 0.14276924082660117, 0.040929732317454184, 0.04169044104492059, 0.08208637454663403, -0.024335488610086033, -0.17626163803988676, 0.13065145810105605, 0.24031829292543988, -0.07972948545648251, 0.24652418210171162, -0.4364401548169553, -0.21282917080970948, 0.01423835574532859, 0.1483490104554221, 0.18787584209931082, -0.03520661431030021, -0.24366779981646686, 0.03516501749400049, -0.1953119073587004, -0.1520727899413032, -0.08830912018602248, 0.04588073291524779, 0.013272212412266527, -0.2339625833734317, 0.1346374930384627, -0.0009100526915062801, -0.005293092456531668, -0.1506191922031576, -0.14839341576080187, -0.0957376569393091, 0.04006668769652606, 0.022219367831712588, 0.041187388139223916, 0.1322108375665266, -0.09512593058607308, -0.06279069088632241, 0.4220805917517282, -0.07231717715449122, -0.17385370376869105, 0.11202509436843684, -0.13477107982325834, -0.05207884456322063, 0.1739984017214738, 0.04881565828691237, 0.10642171423387481, -0.15792829478268686, 0.13986923554257374, -0.021162924004602245, 0.17614295799212415, 0.0625289887204417, 0.0855713384662522, 0.18636661290947815, 0.19740896999137475, 0.04142864772147732, 0.10810840947087855, -0.09955118426296394, -0.14330966252455254, -0.23618032434023917, -0.13524516939069145, -0.2717825885076309, 0.08951588588679442, -0.06879607287100953, -0.19222388143589342, 0.41107598150501873, 0.09893066022195854, 0.15108097317570354, 0.005886086466944107, 0.26320833401114213, 0.22828721441910602, 0.06501458007587643, 0.017136530313291588, 0.29269805626827294, 0.18949861978326227, 0.05722462223784532, -0.3322534221224487, 0.0030629283663074604, 0.1070604372289381] |
1,803.03101 | Rigorous decoupling between edge states in frustrated spin chains and
ladders | We investigate the occurrence of exact zero modes in one-dimensional quantum
magnets of finite length that possess edge states. Building on conclusions
first reached in the context of the spin-1/2 XY chain in a field, then for the
spin-1 $J_1-J_2$ Heisenberg model, we show that the development of
incommensurate correlations in the bulk invariably leads to oscillations in the
sign of the coupling between edge states, hence to exact zero energy modes at
the crossing points where the coupling between the edge states rigorously
vanishes. This is true regardless of the origin of the frustration (e.g.
next-nearest neighbor coupling or biquadratic coupling for the spin-1 chain),
of the value of the bulk spin (we report on spin-1/2, spin-1 and spin-2
examples), and of the value of the edge-state emergent spin (spin-1/2 or
spin-1).
| cond-mat.str-el | we investigate the occurrence of exact zero modes in onedimensional quantum magnets of finite length that possess edge states building on conclusions first reached in the context of the spin12 xy chain in a field then for the spin1 j_1j_2 heisenberg model we show that the development of incommensurate correlations in the bulk invariably leads to oscillations in the sign of the coupling between edge states hence to exact zero energy modes at the crossing points where the coupling between the edge states rigorously vanishes this is true regardless of the origin of the frustration eg nextnearest neighbor coupling or biquadratic coupling for the spin1 chain of the value of the bulk spin we report on spin12 spin1 and spin2 examples and of the value of the edgestate emergent spin spin12 or spin1 | [['we', 'investigate', 'the', 'occurrence', 'of', 'exact', 'zero', 'modes', 'in', 'onedimensional', 'quantum', 'magnets', 'of', 'finite', 'length', 'that', 'possess', 'edge', 'states', 'building', 'on', 'conclusions', 'first', 'reached', 'in', 'the', 'context', 'of', 'the', 'spin12', 'xy', 'chain', 'in', 'a', 'field', 'then', 'for', 'the', 'spin1', 'j_1j_2', 'heisenberg', 'model', 'we', 'show', 'that', 'the', 'development', 'of', 'incommensurate', 'correlations', 'in', 'the', 'bulk', 'invariably', 'leads', 'to', 'oscillations', 'in', 'the', 'sign', 'of', 'the', 'coupling', 'between', 'edge', 'states', 'hence', 'to', 'exact', 'zero', 'energy', 'modes', 'at', 'the', 'crossing', 'points', 'where', 'the', 'coupling', 'between', 'the', 'edge', 'states', 'rigorously', 'vanishes', 'this', 'is', 'true', 'regardless', 'of', 'the', 'origin', 'of', 'the', 'frustration', 'eg', 'nextnearest', 'neighbor', 'coupling', 'or', 'biquadratic', 'coupling', 'for', 'the', 'spin1', 'chain', 'of', 'the', 'value', 'of', 'the', 'bulk', 'spin', 'we', 'report', 'on', 'spin12', 'spin1', 'and', 'spin2', 'examples', 'and', 'of', 'the', 'value', 'of', 'the', 'edgestate', 'emergent', 'spin', 'spin12', 'or', 'spin1']] | [-0.23882746333746532, 0.2643518970957152, 0.006527450719946309, 0.044826554572139694, -0.042351368461084324, -0.16091668379275983, 0.04932332054547321, 0.32904015980044704, -0.24210051491268372, -0.2344752009450353, 0.04437473514800037, -0.32949861487429727, -0.08347970105119441, 0.09121773069325302, 0.13156652181143208, -0.0008391232852985088, 0.01349200680501815, 0.09846938030332103, -0.09732460861157317, -0.20555509955979379, 0.31267970776591536, -0.0028239559404958123, 0.2951740224642637, 0.093759474186997, 0.06572051871834057, 0.07311754843003039, 0.16042669481576832, -0.02511455607075328, -0.18135807169421883, 0.06391480902981896, 0.19681493312652623, -0.06776343273433079, 0.1736404723312734, -0.4245190516366322, -0.1418516189192555, 0.10057319511302319, 0.16940988169812782, 0.18446048642543697, -0.00041038886148524574, -0.3120396154485398, 0.02160159550178087, -0.1704396650972391, -0.17441771430124467, -0.0610841340000244, -0.01870989728687485, -0.03157792374740278, -0.24822971576306604, 0.1406515218471562, 0.1175859600333567, 0.1027903374550598, -0.059866722707314544, -0.11467751497192714, -0.08255471994652223, 0.09705018183860675, 0.08233513530865452, 0.0001501580210108506, 0.06465769073176653, -0.17351487920185396, -0.17750850761190226, 0.3482181566830416, -0.08741302193445329, -0.18902790463088373, 0.17279637684429386, -0.17377565041380494, -0.10532468102812852, 0.08702305411653859, 0.1158377080070401, 0.0494115199400042, -0.09103755746036768, 0.1314048215500044, -0.014811178293828397, 0.1369453257952442, -0.011708419172170298, 0.06652542667925582, 0.2954873734580955, 0.13192072502316388, 0.0677232707157395, 0.20871154942962908, -0.11728616254544236, -0.16859336841249264, -0.2844459152731456, -0.18902853993817995, -0.2806855463107726, 0.06315750017398059, -0.08555159910343048, -0.2103254796007755, 0.45012081568514495, 0.1911303190268622, 0.19366824681607858, -0.013909429514822656, 0.20094671199812478, 0.09273230042868763, 0.026206849097393285, 0.06900872288033702, 0.2767482927748303, 0.18152801942209804, 0.015076610044387161, -0.3238990716356084, 0.012589907896866027, 0.06697532703160812] |
1,803.03102 | Front blocking versus propagation in the presence of a drift term in the
direction of propagation | In this paper we derive quantitative conditions under which a compactly
supported drift term depending on the direction of propagation blocks a
traveling wave solution or lets it pass almost unchanged. We give explicit
conditions on the drift term for blocking as well as almost unchanged
propagation in one spacial dimension.
| math.AP | in this paper we derive quantitative conditions under which a compactly supported drift term depending on the direction of propagation blocks a traveling wave solution or lets it pass almost unchanged we give explicit conditions on the drift term for blocking as well as almost unchanged propagation in one spacial dimension | [['in', 'this', 'paper', 'we', 'derive', 'quantitative', 'conditions', 'under', 'which', 'a', 'compactly', 'supported', 'drift', 'term', 'depending', 'on', 'the', 'direction', 'of', 'propagation', 'blocks', 'a', 'traveling', 'wave', 'solution', 'or', 'lets', 'it', 'pass', 'almost', 'unchanged', 'we', 'give', 'explicit', 'conditions', 'on', 'the', 'drift', 'term', 'for', 'blocking', 'as', 'well', 'as', 'almost', 'unchanged', 'propagation', 'in', 'one', 'spacial', 'dimension']] | [-0.19107945526347442, 0.10345593116739217, -0.05170181127465969, 0.06499948665527079, -0.09542560045990874, -0.12107098296138585, 0.04995249548023019, 0.3886445247951676, -0.30567344898522336, -0.21549769326606216, 0.1624393112473555, -0.21402540456905378, -0.14337644283659756, 0.17487025684585758, -0.016954924180811525, 0.03206315461327048, 0.0680592382399767, 0.08778425802787145, -0.06499729229721661, -0.23461187572455874, 0.3399206619600163, 0.03635271536140684, 0.28137957076450776, 0.07214103101675089, 0.1802019695751369, 0.0694491299252738, 0.004489563113334132, -0.003721508836629344, -0.1669989507280144, 0.022319103280703228, 0.14840389709285112, 0.06286015135564786, 0.23298371532091908, -0.46714063469028355, -0.22724449869208768, 0.03610521593295476, 0.18354256664215604, 0.1392117918847932, -0.056525475760994884, -0.2732522767037153, 0.02816658054350638, -0.10289740635483872, -0.2171686521420876, -0.02258228450356161, 0.017724333737301184, 0.04245661887541121, -0.2881583803716828, 0.10512622907830804, 0.12258928966041946, 0.027850492181731204, -0.1113285886890748, -0.07616221333178234, 0.016222105539568207, 0.12458228191598227, 0.113143861878152, 0.025495841642659084, 0.07911108279892919, -0.0736742687420737, -0.025477837990312016, 0.35523299068468167, -0.13700145016214355, -0.3030539116201301, 0.1954891343290607, -0.11103189616422991, -0.07167235498006146, 0.10422622274114367, 0.18486375233852395, 0.10848126629842263, -0.13230952971121845, 0.1012073643322961, -0.04855340742934084, 0.1444238715932942, 0.2099978169426322, 0.046940241008996964, 0.12338913318372387, 0.11510897858762274, 0.19605623910605324, 0.12358922082200355, -0.0366966567257894, -0.07113203318680034, -0.3862958838250123, -0.1576573848541753, -0.12564659792491617, 0.07859064110950795, -0.051926872816265505, -0.25076581906600326, 0.4367215104067844, 0.15072774762908617, 0.18136930719529296, 0.0896049746535901, 0.27760891428253814, 0.13157772221237274, 0.03261052258312702, 0.09980507287215076, 0.20627292742331824, 0.08367296084579007, 0.10138156208410568, -0.1473419922312685, 0.11841418227984332, 0.07684610040821865] |
1,803.03103 | Computation of Exact g-Factor Maps in 3D GRAPPA Reconstructions | Purpose: To characterize the noise distributions in 3D-MRI accelerated
acquisitions reconstructed with GRAPPA using an exact noise propagation
analysis that operates directly in k--space.
Theory and Methods: We exploit the extensive symmetries and separability in
the reconstruction steps to account for the correlation between all the
acquired k-space samples. Monte Carlo simulations and multi-repetition phantom
experiments were conducted to test both the accuracy and feasibility of the
proposed method; an in-vivo experiment was performed to assess the
applicability of our method to clinical scenarios.
Results: Our theoretical derivation shows that the direct k-space analysis
renders an exact noise characterization under the assumptions of stationarity
and uncorrelation in the original k-space. Simulations and phantom experiments
provide empirical support to the theoretical proof. Finally, the in-vivo
experiment demonstrates the ability of the proposed method to assess the impact
of the sub-sampling pattern on the overall noise behavior.
Conclusions: By operating directly in the k-space, the proposed method is
able to provide an exact characterization of noise for any Cartesian pattern
sub-sampled along the two phase-encoding directions. Exploitation of the
symmetries and separability into independent blocks through the image
reconstruction procedure allows us to overcome the computational challenges
related to the very large size of the covariance matrices involved.
| physics.med-ph | purpose to characterize the noise distributions in 3dmri accelerated acquisitions reconstructed with grappa using an exact noise propagation analysis that operates directly in kspace theory and methods we exploit the extensive symmetries and separability in the reconstruction steps to account for the correlation between all the acquired kspace samples monte carlo simulations and multirepetition phantom experiments were conducted to test both the accuracy and feasibility of the proposed method an invivo experiment was performed to assess the applicability of our method to clinical scenarios results our theoretical derivation shows that the direct kspace analysis renders an exact noise characterization under the assumptions of stationarity and uncorrelation in the original kspace simulations and phantom experiments provide empirical support to the theoretical proof finally the invivo experiment demonstrates the ability of the proposed method to assess the impact of the subsampling pattern on the overall noise behavior conclusions by operating directly in the kspace the proposed method is able to provide an exact characterization of noise for any cartesian pattern subsampled along the two phaseencoding directions exploitation of the symmetries and separability into independent blocks through the image reconstruction procedure allows us to overcome the computational challenges related to the very large size of the covariance matrices involved | [['purpose', 'to', 'characterize', 'the', 'noise', 'distributions', 'in', '3dmri', 'accelerated', 'acquisitions', 'reconstructed', 'with', 'grappa', 'using', 'an', 'exact', 'noise', 'propagation', 'analysis', 'that', 'operates', 'directly', 'in', 'kspace', 'theory', 'and', 'methods', 'we', 'exploit', 'the', 'extensive', 'symmetries', 'and', 'separability', 'in', 'the', 'reconstruction', 'steps', 'to', 'account', 'for', 'the', 'correlation', 'between', 'all', 'the', 'acquired', 'kspace', 'samples', 'monte', 'carlo', 'simulations', 'and', 'multirepetition', 'phantom', 'experiments', 'were', 'conducted', 'to', 'test', 'both', 'the', 'accuracy', 'and', 'feasibility', 'of', 'the', 'proposed', 'method', 'an', 'invivo', 'experiment', 'was', 'performed', 'to', 'assess', 'the', 'applicability', 'of', 'our', 'method', 'to', 'clinical', 'scenarios', 'results', 'our', 'theoretical', 'derivation', 'shows', 'that', 'the', 'direct', 'kspace', 'analysis', 'renders', 'an', 'exact', 'noise', 'characterization', 'under', 'the', 'assumptions', 'of', 'stationarity', 'and', 'uncorrelation', 'in', 'the', 'original', 'kspace', 'simulations', 'and', 'phantom', 'experiments', 'provide', 'empirical', 'support', 'to', 'the', 'theoretical', 'proof', 'finally', 'the', 'invivo', 'experiment', 'demonstrates', 'the', 'ability', 'of', 'the', 'proposed', 'method', 'to', 'assess', 'the', 'impact', 'of', 'the', 'subsampling', 'pattern', 'on', 'the', 'overall', 'noise', 'behavior', 'conclusions', 'by', 'operating', 'directly', 'in', 'the', 'kspace', 'the', 'proposed', 'method', 'is', 'able', 'to', 'provide', 'an', 'exact', 'characterization', 'of', 'noise', 'for', 'any', 'cartesian', 'pattern', 'subsampled', 'along', 'the', 'two', 'phaseencoding', 'directions', 'exploitation', 'of', 'the', 'symmetries', 'and', 'separability', 'into', 'independent', 'blocks', 'through', 'the', 'image', 'reconstruction', 'procedure', 'allows', 'us', 'to', 'overcome', 'the', 'computational', 'challenges', 'related', 'to', 'the', 'very', 'large', 'size', 'of', 'the', 'covariance', 'matrices', 'involved']] | [-0.05668481514907862, -0.002598109622839747, -0.1130860323250732, 0.0746258932020853, -0.06106215927238558, -0.0754915349888524, 0.05397602617763458, 0.3935082347552274, -0.24924780968028834, -0.32213611511614026, 0.08903573430314496, -0.25071498093444355, -0.15224679389582746, 0.20390184532723152, -0.04826342035883892, 0.09591405162149493, 0.11826988909103651, -0.03384382046865272, -0.10506619615525957, -0.25697734697228847, 0.2532452905696689, 0.1162656313516017, 0.37480082600742726, 0.02410768027281544, 0.11638286681708825, 0.00935759124638257, -0.07719454567368124, 0.004703827989835511, -0.1148882122239122, 0.10287887144316782, 0.23955353693557246, 0.17637444421441115, 0.26339960845150784, -0.45227141409893246, -0.19731013619742704, 0.07621373220999707, 0.12886066221193793, 0.09656723376760698, -0.061862041818219984, -0.34506725420486, 0.09912635361337487, -0.08487451218945138, -0.09792832804469428, -0.14706356583309232, -0.07634626982326154, -0.011555404235111257, -0.31173627460192815, 0.0819711086166767, 0.04280188873378268, 0.03976541134533381, -0.07307260054050643, -0.09243399266600974, 0.03202394180355922, 0.14758695938336827, 0.06617549344424761, -0.024881337614109118, 0.10682033551012293, -0.08260445813899495, -0.13007098659228158, 0.33402641597386523, -0.017207110356870472, -0.2430611373993623, 0.20381542847163098, -0.13854621965184183, -0.09316011834615733, 0.15944037537145264, 0.16470350555655563, 0.08552708056773625, -0.1450107741482355, 0.05442540346463348, 0.00945256220624216, 0.17295685210082606, 0.022399238605216584, -0.025805134444917534, 0.11081192115043272, 0.16387708374503407, 0.027353962102685783, 0.15601742452731832, -0.16870962560300112, -0.07807056158644092, -0.2923943982665044, -0.14305120679223454, -0.23335559375118464, -0.017041144513652896, -0.10603881859802355, -0.14194860762469105, 0.4124794376685339, 0.24893239851671217, 0.17790792285756885, 0.04634901941023475, 0.35626534178542596, 0.045157801621255704, 0.039644071845139156, 0.007555376064356453, 0.22082851729903588, 0.14548227397551505, 0.07664019149595726, -0.26832962911302116, 0.059547916563757346, 0.02059635773470041] |
1,803.03104 | Applicability and interpretation of the deterministic weighted cepstral
distance | Quantifying similarity between data objects is an important part of modern
data science. Deciding what similarity measure to use is very application
dependent. In this paper, we combine insights from systems theory and machine
learning, and investigate the weighted cepstral distance, which was previously
defined for signals coming from ARMA models. We provide an extension of this
distance to invertible deterministic linear time invariant single input single
output models, and assess its applicability. We show that it can always be
interpreted in terms of the poles and zeros of the underlying model, and that,
in the case of stable, minimum-phase, or unstable, maximum-phase models, a
geometrical interpretation in terms of subspace angles can be given. We then
devise a method to assess stability and phase-type of the generating models,
using only input/output signal information. In this way, we prove a connection
between the extended weighted cepstral distance and a weighted cepstral model
norm. In this way, we provide a purely data-driven way to assess different
underlying dynamics of input/output signal pairs, without the need for any
system identification step. This can be useful in machine learning tasks such
as time series clustering. An iPython tutorial is published complementary to
this paper, containing implementations of the various methods and algorithms
presented here, as well as some numerical illustrations of the equivalences
proven here.
| cs.SY cs.CV math.DS stat.ML | quantifying similarity between data objects is an important part of modern data science deciding what similarity measure to use is very application dependent in this paper we combine insights from systems theory and machine learning and investigate the weighted cepstral distance which was previously defined for signals coming from arma models we provide an extension of this distance to invertible deterministic linear time invariant single input single output models and assess its applicability we show that it can always be interpreted in terms of the poles and zeros of the underlying model and that in the case of stable minimumphase or unstable maximumphase models a geometrical interpretation in terms of subspace angles can be given we then devise a method to assess stability and phasetype of the generating models using only inputoutput signal information in this way we prove a connection between the extended weighted cepstral distance and a weighted cepstral model norm in this way we provide a purely datadriven way to assess different underlying dynamics of inputoutput signal pairs without the need for any system identification step this can be useful in machine learning tasks such as time series clustering an ipython tutorial is published complementary to this paper containing implementations of the various methods and algorithms presented here as well as some numerical illustrations of the equivalences proven here | [['quantifying', 'similarity', 'between', 'data', 'objects', 'is', 'an', 'important', 'part', 'of', 'modern', 'data', 'science', 'deciding', 'what', 'similarity', 'measure', 'to', 'use', 'is', 'very', 'application', 'dependent', 'in', 'this', 'paper', 'we', 'combine', 'insights', 'from', 'systems', 'theory', 'and', 'machine', 'learning', 'and', 'investigate', 'the', 'weighted', 'cepstral', 'distance', 'which', 'was', 'previously', 'defined', 'for', 'signals', 'coming', 'from', 'arma', 'models', 'we', 'provide', 'an', 'extension', 'of', 'this', 'distance', 'to', 'invertible', 'deterministic', 'linear', 'time', 'invariant', 'single', 'input', 'single', 'output', 'models', 'and', 'assess', 'its', 'applicability', 'we', 'show', 'that', 'it', 'can', 'always', 'be', 'interpreted', 'in', 'terms', 'of', 'the', 'poles', 'and', 'zeros', 'of', 'the', 'underlying', 'model', 'and', 'that', 'in', 'the', 'case', 'of', 'stable', 'minimumphase', 'or', 'unstable', 'maximumphase', 'models', 'a', 'geometrical', 'interpretation', 'in', 'terms', 'of', 'subspace', 'angles', 'can', 'be', 'given', 'we', 'then', 'devise', 'a', 'method', 'to', 'assess', 'stability', 'and', 'phasetype', 'of', 'the', 'generating', 'models', 'using', 'only', 'inputoutput', 'signal', 'information', 'in', 'this', 'way', 'we', 'prove', 'a', 'connection', 'between', 'the', 'extended', 'weighted', 'cepstral', 'distance', 'and', 'a', 'weighted', 'cepstral', 'model', 'norm', 'in', 'this', 'way', 'we', 'provide', 'a', 'purely', 'datadriven', 'way', 'to', 'assess', 'different', 'underlying', 'dynamics', 'of', 'inputoutput', 'signal', 'pairs', 'without', 'the', 'need', 'for', 'any', 'system', 'identification', 'step', 'this', 'can', 'be', 'useful', 'in', 'machine', 'learning', 'tasks', 'such', 'as', 'time', 'series', 'clustering', 'an', 'ipython', 'tutorial', 'is', 'published', 'complementary', 'to', 'this', 'paper', 'containing', 'implementations', 'of', 'the', 'various', 'methods', 'and', 'algorithms', 'presented', 'here', 'as', 'well', 'as', 'some', 'numerical', 'illustrations', 'of', 'the', 'equivalences', 'proven', 'here']] | [-0.07293875787061602, 0.024319762283368816, -0.12125999542973552, 0.1024007591765534, -0.092358144224575, -0.13676285219054282, 0.025378620625490414, 0.3983855888087353, -0.33478506096023475, -0.29870767531941783, 0.11176237174160583, -0.24365570083075114, -0.19993094067991082, 0.19734967920436142, -0.08236841790955429, 0.08101782335650083, 0.06481500132413943, 0.05587609653067206, -0.07275834165795862, -0.2234447862188083, 0.29867911286340243, 0.057576037823260505, 0.2661529003855313, 0.016463504674342964, 0.10533059424469438, 0.004205774660201162, -0.05855270097984583, 0.008688071406577035, -0.10748898475442759, 0.15522100785705029, 0.29840326631775943, 0.18980115994798416, 0.2729416648515951, -0.3866541003639814, -0.20718337496009348, 0.1442684029056206, 0.15264288336776063, 0.10074759429116308, -0.026493474979262285, -0.28197300065692293, 0.06718753121963943, -0.16305033171789646, -0.08174852697058618, -0.11623547030549615, 0.008694982740867933, 0.02481004336587579, -0.28372102050422543, 0.04861295148856702, 0.07357213328296437, 0.08204589380010356, -0.047304379307597504, -0.0924262563393523, 0.0322970392154024, 0.14901725008606498, 0.017569710671737352, 0.02756984521291425, 0.09045386496442476, -0.10059222152637849, -0.15306460413432835, 0.3729871361352065, -0.08209243853159283, -0.23757119550121047, 0.20124170577261025, -0.06732549717464396, -0.13698027715638988, 0.048983021772032544, 0.2259474810211797, 0.11738637887042572, -0.17608784408439204, 0.058644452488378566, -0.03839146981765917, 0.18208614808857038, 0.05115759878406697, 0.039327462308627145, 0.1757734288288727, 0.17784438701978636, 0.026675322950644866, 0.15097064810080194, -0.06300612810851133, -0.06352124364922304, -0.30428174629937055, -0.149288443059395, -0.1756194865244664, 0.014691659945750196, -0.08931833230184467, -0.1584505265593377, 0.3984708474502305, 0.19370477444943193, 0.22420367322297455, 0.07521841933527262, 0.3257023116923464, 0.12175515253250635, 0.04090384442761658, 0.05232430966592044, 0.19346040606720488, 0.12181914658854585, 0.0776980792902351, -0.15359652125828677, 0.08347372350344072, 0.06433560075744042] |
1,803.03105 | Strictly Positive Definite Functions on Compact Two-Point Homogeneous
Spaces: the Product Alternative | For two continuous and isotropic positive definite kernels on the same
compact two-point homogeneous space, we determine necessary and sufficient
conditions in order that their product be strictly positive definite. We also
provide a similar characterization for kernels on the space-time setting $G
\times S^d$, where $G$ is a locally compact group and $S^d$ is the unit sphere
in $\mathbb{R}^{d+1}$, keeping isotropy of the kernels with respect to the
$S^d$ component. Among other things, these results provide new procedures for
the construction of valid models for interpolation and approximation on compact
two-point homogeneous spaces.
| math.CA | for two continuous and isotropic positive definite kernels on the same compact twopoint homogeneous space we determine necessary and sufficient conditions in order that their product be strictly positive definite we also provide a similar characterization for kernels on the spacetime setting g times sd where g is a locally compact group and sd is the unit sphere in mathbbrd1 keeping isotropy of the kernels with respect to the sd component among other things these results provide new procedures for the construction of valid models for interpolation and approximation on compact twopoint homogeneous spaces | [['for', 'two', 'continuous', 'and', 'isotropic', 'positive', 'definite', 'kernels', 'on', 'the', 'same', 'compact', 'twopoint', 'homogeneous', 'space', 'we', 'determine', 'necessary', 'and', 'sufficient', 'conditions', 'in', 'order', 'that', 'their', 'product', 'be', 'strictly', 'positive', 'definite', 'we', 'also', 'provide', 'a', 'similar', 'characterization', 'for', 'kernels', 'on', 'the', 'spacetime', 'setting', 'g', 'times', 'sd', 'where', 'g', 'is', 'a', 'locally', 'compact', 'group', 'and', 'sd', 'is', 'the', 'unit', 'sphere', 'in', 'mathbbrd1', 'keeping', 'isotropy', 'of', 'the', 'kernels', 'with', 'respect', 'to', 'the', 'sd', 'component', 'among', 'other', 'things', 'these', 'results', 'provide', 'new', 'procedures', 'for', 'the', 'construction', 'of', 'valid', 'models', 'for', 'interpolation', 'and', 'approximation', 'on', 'compact', 'twopoint', 'homogeneous', 'spaces']] | [-0.11465463083871502, 0.08161154158779994, -0.06484908164241054, 0.11409769794021911, -0.09149155615422716, -0.12613047001526712, -0.011956231368883968, 0.4442013714938088, -0.1895596781904076, -0.1768722751337609, 0.15276012627378185, -0.23093578186718391, -0.10780177997583722, 0.23134873397252026, -0.012553264188798183, 0.008146350009446131, 0.03340465725898654, 0.08090009387307602, -0.16105936067129306, -0.28258122426477517, 0.4187163172024698, -0.0042663488953195985, 0.25090457800220933, 0.03349671658485177, 0.1062586348221459, 0.010417270672289616, -0.06609552677849585, 0.01159527224576487, -0.15021430893512902, 0.11598188378550905, 0.22297504124346348, 0.08503259566335127, 0.21211662364410275, -0.3910972482742781, -0.17623967208442565, 0.18229651500649274, 0.0651116257563154, -0.013583439825835856, -0.01624195043745629, -0.2721930116791516, 0.12144323173870748, -0.1087470659490754, -0.1407698719623558, -0.10638729173800304, 0.06440705993272205, 0.015061920060419497, -0.31620232443860236, 0.06547998862577592, 0.10832243823716318, 0.0018787364515059806, -0.11260574468054828, -0.12474158888761984, 0.02876746571781312, 0.12969999138186586, -0.04494515578064354, 0.06773150306779574, 0.054535155283643846, -0.04594113229912646, -0.0682629507698832, 0.364770310542031, -0.08733819158217732, -0.29679561475727784, 0.21611643517687124, -0.1881283892893252, -0.13747570141555465, 0.09573506387297381, 0.18377037626750609, 0.1371991370717606, -0.097610984001918, 0.13988513136629332, -0.05171890151092505, 0.10707696191372072, 0.05931489240932972, 0.036729558982807116, 0.1579950273215295, 0.08565462098773965, 0.17249261554172066, 0.09112949792897586, 0.0023420588732597993, -0.06282052255243044, -0.37190602214491747, -0.19633846755041692, -0.1814139329288353, 0.06816339302074878, -0.16960063732187067, -0.20666259049655908, 0.3501628085009833, 0.025127905559666614, 0.16463926207630875, 0.11368757130657421, 0.24853274858299088, 0.08762105093572903, 0.06116046499649182, 0.10741344917605215, 0.14708400951658793, 0.17921691003473514, 0.0180220385527912, -0.1472964868484501, 0.009092563466030233, 0.09703191240476643] |
1,803.03106 | Automatic Intent-Based Secure Service Creation Through a Multilayer SDN
Network Orchestration | Growing traffic demands and increasing security awareness are driving the
need for secure services. Current solutions require manual configuration and
deployment based on the customer's requirements. In this work, we present an
architecture for an automatic intent-based provisioning of a secure service in
a multilayer - IP, Ethernet, and optical - network while choosing the
appropriate encryption layer using an open-source software-defined networking
(SDN) orchestrator. The approach is experimentally evaluated in a testbed with
commercial equipment. Results indicate that the processing impact of secure
channel creation on a controller is negligible. As the time for setting up
services over WDM varies between technologies, it needs to be taken into
account in the decision-making process.
| cs.NI | growing traffic demands and increasing security awareness are driving the need for secure services current solutions require manual configuration and deployment based on the customers requirements in this work we present an architecture for an automatic intentbased provisioning of a secure service in a multilayer ip ethernet and optical network while choosing the appropriate encryption layer using an opensource softwaredefined networking sdn orchestrator the approach is experimentally evaluated in a testbed with commercial equipment results indicate that the processing impact of secure channel creation on a controller is negligible as the time for setting up services over wdm varies between technologies it needs to be taken into account in the decisionmaking process | [['growing', 'traffic', 'demands', 'and', 'increasing', 'security', 'awareness', 'are', 'driving', 'the', 'need', 'for', 'secure', 'services', 'current', 'solutions', 'require', 'manual', 'configuration', 'and', 'deployment', 'based', 'on', 'the', 'customers', 'requirements', 'in', 'this', 'work', 'we', 'present', 'an', 'architecture', 'for', 'an', 'automatic', 'intentbased', 'provisioning', 'of', 'a', 'secure', 'service', 'in', 'a', 'multilayer', 'ip', 'ethernet', 'and', 'optical', 'network', 'while', 'choosing', 'the', 'appropriate', 'encryption', 'layer', 'using', 'an', 'opensource', 'softwaredefined', 'networking', 'sdn', 'orchestrator', 'the', 'approach', 'is', 'experimentally', 'evaluated', 'in', 'a', 'testbed', 'with', 'commercial', 'equipment', 'results', 'indicate', 'that', 'the', 'processing', 'impact', 'of', 'secure', 'channel', 'creation', 'on', 'a', 'controller', 'is', 'negligible', 'as', 'the', 'time', 'for', 'setting', 'up', 'services', 'over', 'wdm', 'varies', 'between', 'technologies', 'it', 'needs', 'to', 'be', 'taken', 'into', 'account', 'in', 'the', 'decisionmaking', 'process']] | [-0.22780266833225532, 0.0013096410209202855, -0.03068811191146129, -0.018434480469214316, -0.06804564771924301, -0.23115110347446585, 0.10428500320163689, 0.45966948538235947, -0.2529270368894296, -0.3020240921427363, 0.12261858132010925, -0.23221455232539615, -0.11662005821667012, 0.23208603045869886, -0.1086617682594806, 0.10657773845429931, 0.056670887944554646, -0.02668679744238034, 0.015514799133857846, -0.2748426184293099, 0.28821772305777166, 0.07152298916896273, 0.40533523572126534, 0.10877207296185329, 0.052283252705819905, 0.005720387316874361, -0.03236378795034917, -0.0891853293297962, -0.053196304700512495, 0.1361114874224378, 0.33245760694470455, 0.21459060194735816, 0.3488174000730006, -0.4753632836509496, -0.20704284761034483, 0.035534918117004315, 0.1712191825125566, 0.03175176133559684, -0.06728614278628291, -0.3203974227965643, 0.10106599501991045, -0.3087801512197724, -0.0680312691027731, -0.04478512225198626, -0.0010031507481471635, 0.021879747166427217, -0.3122917009833535, -0.09227305655700288, -0.052151580241375735, 0.08004398120933079, -0.06987573024110004, -0.016074587603465522, -0.012028110715618823, 0.19290390078094788, -0.013870275727250763, 0.030501255453730534, 0.2018929038708198, -0.14563291972860629, -0.139308808192644, 0.39148124896122943, 0.021867224472641413, -0.16882474871817976, 0.1227494782812885, 0.052018848734275834, -0.13932256635494664, 0.08407139239664373, 0.2396921778604987, 0.011268328542688064, -0.21067370427772403, 0.03471141414203365, 0.039892430537812676, 0.22213426016553836, 0.026549013722355345, 0.06964190606751279, 0.18343976890069566, 0.3120614384700145, 0.13733059097596975, 0.0923220554967494, -0.02156356437314701, -0.11232167859998299, -0.2261582191193676, -0.18177946553831653, -0.16957961031792884, 0.01972335388044095, -0.097678059611878, -0.11596596184244845, 0.3430962373801906, 0.22200133281460563, 0.0877771189053809, 0.07149874643904955, 0.450548073376662, 0.05326469575915586, 0.1558274629475948, 0.1593353586703675, 0.1801915832163234, -0.041944390894579034, 0.25348415686936016, -0.1313481325050816, 0.13170822565111198, -0.032128407046132325] |
1,803.03107 | A Holographic Description of Colour Superconductivity | The difficulty of describing the gauge dependent bi-quark condensate in the
QCD colour superconducting phase has made it hard to construct a holographic
dual of the state. To side step this problem, we argue that near the chiral
restoration transition in the temperature-chemical potential plane, the
strongly coupled gluons are likely completely gapped so that the colour quantum
numbers of the quarks can be thought of below that gap as global indices. A
standard AdS-superconductor model can then be used to analyze the fermionic gap
formation. We investigate the role of four-fermion interactions, which might be
used to include the gapped QCD interactions, on the vacuum and metastable vacua
of the model. It turns out to be easiest to simply relate the standard
interaction of the holographic superconductor to the strength of the gapped
gluons. The result is a holographic description of the QCD colour
superconducting phase diagram. We take a first look at how quark mass enters
and causes a transition between the colour flavour locked phase and the 2SC
phase.
| hep-ph hep-th | the difficulty of describing the gauge dependent biquark condensate in the qcd colour superconducting phase has made it hard to construct a holographic dual of the state to side step this problem we argue that near the chiral restoration transition in the temperaturechemical potential plane the strongly coupled gluons are likely completely gapped so that the colour quantum numbers of the quarks can be thought of below that gap as global indices a standard adssuperconductor model can then be used to analyze the fermionic gap formation we investigate the role of fourfermion interactions which might be used to include the gapped qcd interactions on the vacuum and metastable vacua of the model it turns out to be easiest to simply relate the standard interaction of the holographic superconductor to the strength of the gapped gluons the result is a holographic description of the qcd colour superconducting phase diagram we take a first look at how quark mass enters and causes a transition between the colour flavour locked phase and the 2sc phase | [['the', 'difficulty', 'of', 'describing', 'the', 'gauge', 'dependent', 'biquark', 'condensate', 'in', 'the', 'qcd', 'colour', 'superconducting', 'phase', 'has', 'made', 'it', 'hard', 'to', 'construct', 'a', 'holographic', 'dual', 'of', 'the', 'state', 'to', 'side', 'step', 'this', 'problem', 'we', 'argue', 'that', 'near', 'the', 'chiral', 'restoration', 'transition', 'in', 'the', 'temperaturechemical', 'potential', 'plane', 'the', 'strongly', 'coupled', 'gluons', 'are', 'likely', 'completely', 'gapped', 'so', 'that', 'the', 'colour', 'quantum', 'numbers', 'of', 'the', 'quarks', 'can', 'be', 'thought', 'of', 'below', 'that', 'gap', 'as', 'global', 'indices', 'a', 'standard', 'adssuperconductor', 'model', 'can', 'then', 'be', 'used', 'to', 'analyze', 'the', 'fermionic', 'gap', 'formation', 'we', 'investigate', 'the', 'role', 'of', 'fourfermion', 'interactions', 'which', 'might', 'be', 'used', 'to', 'include', 'the', 'gapped', 'qcd', 'interactions', 'on', 'the', 'vacuum', 'and', 'metastable', 'vacua', 'of', 'the', 'model', 'it', 'turns', 'out', 'to', 'be', 'easiest', 'to', 'simply', 'relate', 'the', 'standard', 'interaction', 'of', 'the', 'holographic', 'superconductor', 'to', 'the', 'strength', 'of', 'the', 'gapped', 'gluons', 'the', 'result', 'is', 'a', 'holographic', 'description', 'of', 'the', 'qcd', 'colour', 'superconducting', 'phase', 'diagram', 'we', 'take', 'a', 'first', 'look', 'at', 'how', 'quark', 'mass', 'enters', 'and', 'causes', 'a', 'transition', 'between', 'the', 'colour', 'flavour', 'locked', 'phase', 'and', 'the', '2sc', 'phase']] | [-0.11718824412125875, 0.2653081433422973, -0.1440529165796333, 0.10597108069889466, -0.08003435422330821, -0.11797770861371913, 0.07574482494280399, 0.3592642770806218, -0.22060482626205638, -0.24641544863526874, 0.028865666499854448, -0.2827252447427086, -0.08779103677747223, 0.04947356480577796, 0.013572799644487746, 0.020353877708754117, -0.02681252042940982, 0.02560287995592636, -0.11036638360169224, -0.23642630118547994, 0.3413659773383509, -0.04232121805509771, 0.27174789800911264, 0.12416158271953463, 0.028006063122302294, -0.020262261843377285, 0.04166585881372585, 0.004839579837725443, -0.12306539726726923, 0.015837180328911498, 0.23819416716612657, 0.006417845049872995, 0.1405601259540109, -0.4140014640877352, -0.1949831689146402, 0.137249329628642, 0.1616734737475567, 0.14492516817237414, -0.023173203497015706, -0.28412348637905194, 0.046031252667307856, -0.17467251770636616, -0.16144649590817553, -0.0866110489347621, -0.04332780529032735, -0.09292368845028036, -0.24864532698000616, 0.05496891389621476, 0.014439070957493694, -0.03064552724501803, -0.004427165645927958, -0.08233398536274976, -0.09211188367951442, 0.1106326900788939, 0.05871399790870355, 0.10727662040085038, 0.12477826132877347, -0.20554535575348007, -0.10222971097237485, 0.42115338359247234, -0.0523914343184408, -0.12964101257076596, 0.16122391310465686, -0.12584257180912092, -0.10978572835104869, 0.12262745193917962, 0.13025075865032917, 0.09123155796790824, -0.13878939873264992, 0.08162227614050019, -0.014945395477116107, 0.19183739539003, 0.03234501402030754, 0.06835573136203868, 0.3110987236394602, 0.1633834232473472, 0.02242575220298022, 0.17974509761723526, -0.052579635183450164, -0.1330046209753217, -0.34702546368626985, -0.1406516501443762, -0.1838112758808112, 0.03550039989983334, -0.08800227290870252, -0.18076576384825302, 0.4128957719706437, 0.16680686311138904, 0.20666560629273162, -0.038517769524033234, 0.24859748527078945, 0.12281880436451448, 0.1010277504704016, 0.027222782411776923, 0.30888679476783554, 0.15933103484772693, 0.11098836325382923, -0.3031079202383647, -0.018681643056847594, 0.12080166531069314] |
1,803.03108 | Umbral Calculus, a Different Mathematical Language | This thesis is intended to provide an account of the theory and applications
of Operational Methods that allow the "translation" of the theory of special
functions and polynomials into a "different" mathematical language. The
language we are referring to is that of symbolic methods, largely based on a
formalism of umbral type which provides a tremendous simplification of the
derivation of the associated properties. The strategy we will follow is that of
establishing the rules to replace higher trascendental functions in terms of
elementary functions and to take advantage from such a recasting.
| math.CA | this thesis is intended to provide an account of the theory and applications of operational methods that allow the translation of the theory of special functions and polynomials into a different mathematical language the language we are referring to is that of symbolic methods largely based on a formalism of umbral type which provides a tremendous simplification of the derivation of the associated properties the strategy we will follow is that of establishing the rules to replace higher trascendental functions in terms of elementary functions and to take advantage from such a recasting | [['this', 'thesis', 'is', 'intended', 'to', 'provide', 'an', 'account', 'of', 'the', 'theory', 'and', 'applications', 'of', 'operational', 'methods', 'that', 'allow', 'the', 'translation', 'of', 'the', 'theory', 'of', 'special', 'functions', 'and', 'polynomials', 'into', 'a', 'different', 'mathematical', 'language', 'the', 'language', 'we', 'are', 'referring', 'to', 'is', 'that', 'of', 'symbolic', 'methods', 'largely', 'based', 'on', 'a', 'formalism', 'of', 'umbral', 'type', 'which', 'provides', 'a', 'tremendous', 'simplification', 'of', 'the', 'derivation', 'of', 'the', 'associated', 'properties', 'the', 'strategy', 'we', 'will', 'follow', 'is', 'that', 'of', 'establishing', 'the', 'rules', 'to', 'replace', 'higher', 'trascendental', 'functions', 'in', 'terms', 'of', 'elementary', 'functions', 'and', 'to', 'take', 'advantage', 'from', 'such', 'a', 'recasting']] | [-0.07105879372228747, 0.04067034705218722, -0.15847555892137083, 0.07296391146044935, -0.11980471281213281, -0.08381020832482887, 0.04430332339151115, 0.32520943151220033, -0.26584209552358673, -0.26338089536875486, 0.07146403909554584, -0.21994344552513212, -0.17930701416575492, 0.236700642388314, -0.08550901700357866, 0.016153860968821075, 0.037535658326384655, 0.03646009050483016, -0.11172013891779858, -0.22285130650371962, 0.3322303885335872, 0.03940941100312478, 0.2586891144291376, 0.0795745207907875, 0.12593633312043612, 0.01136882246836372, -0.07840552510005301, 0.002255002846536429, -0.09827532524958889, 0.2130318385632405, 0.25166501043207495, 0.20924404370294802, 0.30304219230564067, -0.47518242958366225, -0.18075098525530295, 0.07055687210927515, 0.1151781902577647, 0.12010166038753992, 0.008678286107327871, -0.25013000317646755, 0.09055098939848982, -0.18264909422672962, -0.10194874961819986, -0.08865331467139818, 0.00991559091894685, 0.04813170254878376, -0.24496053033457746, -0.002526972999634302, 0.13317730154275245, 0.07544209747372763, -0.055409655465906406, -0.11597390621191943, 0.029771993670653064, 0.15794762966486262, 0.04707568651318307, 0.013035257448158834, 0.0772255773974947, -0.134902010861602, -0.13441413192523885, 0.4109196060883772, -0.02491053843455713, -0.230503059518726, 0.19227822473191697, -0.09443286557317428, -0.17682882891360507, 0.09453090231830213, 0.16780373743613777, 0.10350988191835907, -0.1582738978120134, 0.10909122716364673, -0.029814317164456716, 0.12979274378765537, 0.03813508469560791, 0.06406541716854047, 0.18737502448240537, 0.15116120930052485, 0.01941087158933363, 0.1542296684195247, -0.0006437175483290997, -0.12736240440331723, -0.34207536960425583, -0.20014511855068753, -0.1418479069682729, 0.024822048529091735, -0.04437826916720318, -0.19230583816786986, 0.4343658452043715, 0.16884954225616125, 0.16136820860866347, 0.07839147409844294, 0.27391178448401066, 0.17383057630175483, 0.10939921432620157, -0.010482894373126328, 0.1831062019691276, 0.14215729858867987, 0.08676668169968964, -0.1524195890967309, 0.04645430694496178, 0.10361089173491801] |
1,803.03109 | On King type modification of $(p,q)$-Lupa\c{s} Bernstein operators | In this paper, a King-type modification of $(p,q)$-Lupa\c{s} Bernstein
operators are introduced. The rate of convergence of these operators are
studied by means of modulus of continuity and Lipschitz class functional.
Further, it has been shown that the error estimation of these operators on
some subintervals of $[0,1]$ are better than the $(p,q)$-Lupa\c{s} Bernstein
operators.
| math.CA | in this paper a kingtype modification of pqlupacs bernstein operators are introduced the rate of convergence of these operators are studied by means of modulus of continuity and lipschitz class functional further it has been shown that the error estimation of these operators on some subintervals of 01 are better than the pqlupacs bernstein operators | [['in', 'this', 'paper', 'a', 'kingtype', 'modification', 'of', 'pqlupacs', 'bernstein', 'operators', 'are', 'introduced', 'the', 'rate', 'of', 'convergence', 'of', 'these', 'operators', 'are', 'studied', 'by', 'means', 'of', 'modulus', 'of', 'continuity', 'and', 'lipschitz', 'class', 'functional', 'further', 'it', 'has', 'been', 'shown', 'that', 'the', 'error', 'estimation', 'of', 'these', 'operators', 'on', 'some', 'subintervals', 'of', '01', 'are', 'better', 'than', 'the', 'pqlupacs', 'bernstein', 'operators']] | [-0.11334016940684076, 0.08187901746266736, -0.07804230306870662, 0.07573326060530515, -0.0332753355614841, -0.07101164141204208, 0.0036571532725177417, 0.38188086163539153, -0.28393401406132257, -0.23194059170782566, 0.15922145200042556, -0.27646872809586615, -0.14670063100325373, 0.2241255587667603, -0.10455973068467127, 0.16754374518775597, 0.019442362979484294, 0.053079397381784826, -0.12345037435163529, -0.2841181967837306, 0.382137592523717, 0.02190496536115041, 0.19698857902907407, 0.06472296253419839, 0.05793039810557205, -0.06923973956145346, -0.06589831825560676, 0.0008241673752378959, -0.1389803960792051, 0.2114899750225819, 0.19394804735202342, 0.09659872819723275, 0.3695223174559382, -0.40217928923308277, -0.2201824715325179, 0.15096120794232076, 0.1461498387462388, -0.0009033442833102667, -0.04173337406022116, -0.28355751405111873, 0.11917030315201443, -0.15162795051359212, -0.08445441396011469, -0.11126804041962784, 0.003015704918652773, 0.11135795411358301, -0.3070558255108503, 0.11257715088028747, 0.11309099659466973, 0.0724354121619119, -0.08207368310720015, -0.15533799740772408, -0.018405867292760655, 0.06444710754574491, 0.06130828185436817, 0.048250069707417145, 0.07414103736384557, -0.06787129457090767, -0.08881288823277618, 0.30930340866773176, -0.023210613125579236, -0.2659631409467413, 0.1540826837030741, -0.18165499184173173, -0.11558023400497265, 0.07138810926475204, 0.14051296408993388, 0.15717663272069052, -0.1986423263218827, 0.1420284940921612, -0.03938942797070082, 0.0799725043336646, 0.12371801161386359, 0.10599023855040567, 0.025792414000114568, 0.10003406976242192, 0.13774441834539175, 0.10487405037005934, 0.009757929002472129, -0.06161089873729417, -0.33334636168840986, -0.17097139910150033, -0.17346802812356216, 0.021192084953117255, -0.1198901768318767, -0.14945986617273704, 0.41887299444015996, 0.11894665525939602, 0.16341011181402093, 0.1031359783731974, 0.18571941929314142, 0.21119585033291235, 0.09558983742653464, 0.043691808716035806, 0.2506266498446796, 0.1872037532963217, 0.045775003561105296, -0.16117430189087129, 0.10967343802957867, 0.17754148149665874] |
1,803.0311 | Transformation formulas and three-term relations for basic
hypergeometric series | We derive two generalizations of Gasper's transformation formula for basic
hypergeometric series. Using these generalized formulas, we give explicit
expressions for the coefficients of three-term relations for the basic
hypergeometric series {}_{2}phi_{1}, which are generalizations of the author's
previous results on three-term relations for {}_{2}phi_{1}.
| math.CA | we derive two generalizations of gaspers transformation formula for basic hypergeometric series using these generalized formulas we give explicit expressions for the coefficients of threeterm relations for the basic hypergeometric series _2phi_1 which are generalizations of the authors previous results on threeterm relations for _2phi_1 | [['we', 'derive', 'two', 'generalizations', 'of', 'gaspers', 'transformation', 'formula', 'for', 'basic', 'hypergeometric', 'series', 'using', 'these', 'generalized', 'formulas', 'we', 'give', 'explicit', 'expressions', 'for', 'the', 'coefficients', 'of', 'threeterm', 'relations', 'for', 'the', 'basic', 'hypergeometric', 'series', '_2phi_1', 'which', 'are', 'generalizations', 'of', 'the', 'authors', 'previous', 'results', 'on', 'threeterm', 'relations', 'for', '_2phi_1']] | [-0.1349778833074702, 0.004768122370458311, -0.10501682801793019, 0.1458011869341135, -0.16108929850161074, -0.11632757478704055, 0.02235325388610363, 0.29174589431948134, -0.24299260186962784, -0.2090115332769023, 0.08294906328535742, -0.2958375087939203, -0.22476035501394007, 0.3429398726309753, -0.030829805827427965, 0.0825517700571153, -0.029720435710623862, 0.018764225641886394, -0.1888859639979071, -0.31597846088310083, 0.3366888409687413, -0.08521917894120432, 0.2150482733630472, 0.004486856588886844, 0.12960059949093394, 0.03641360031647815, -0.10383038760887252, -0.14812148147159152, -0.26438030411178864, 0.15185860362317827, 0.2645217769417084, 0.1285485950919489, 0.15392604139116076, -0.45148980882432727, -0.09023163534907831, 0.031586335971951485, 0.1630291384127405, 0.04995912167166049, -0.0018511863140803244, -0.21777173748446835, 0.00938861897836129, -0.21391232148226763, -0.1783328474395805, -0.19540280881855224, 0.07948140857948197, 0.17713132657938532, -0.2839099090339409, 0.1352384167777523, 0.08475558157596323, 0.11652875718557172, -0.05735993558127019, -0.24304869038363297, 0.12217406103801397, 0.10270427755183643, 0.028868264539374244, -0.14835926993853515, -0.044388416999330126, -0.07034155351834165, -0.11613198789871401, 0.28886115840739673, -0.035590817437817654, -0.26781576118535466, 0.05720382169302967, -0.09528215388870902, -0.2908639434621566, -0.004876208822760317, 0.08799191912015279, 0.10244914533363449, -0.1645367928263214, 0.04702878600607316, -0.12375346223513285, 0.019329880591895846, 0.2519149363972247, 0.04696708586480883, 0.13371157618110172, -0.0815663680434227, -0.10224854414247804, 0.20561570031051007, 0.11094314690368871, -0.11006014566454622, -0.41488191650973427, -0.21444512195885182, -0.10404342011121723, 0.05127460712360011, -0.17289782661116784, -0.1600605938790573, 0.39507627818319535, 0.06496600545942784, 0.11780755718549092, 0.22754887887018008, 0.19912729834516843, 0.29711970155023865, 0.03374196079870065, -0.020711691801746687, 0.060880232064260374, 0.25991445485916403, 0.03292155740782619, -0.10571135241124364, 0.023987695052184992, 0.3417134516355064] |
1,803.03111 | Steam balloon concept for lifting rockets to launch altitude | Launching orbital and suborbital rockets from a high altitude is beneficial
because of e.g. nozzle optimisation and reduced drag. Aeroplanes and gas
balloons have been used for the purpose. Here we present a concept where a
balloon is filled with pure water vapour on ground so that it rises to the
launch altitude. The system resembles a gas balloon because no onboard energy
source is carried and no hard objects fall down. We simulate the ascent
behaviour of the balloon. In the baseline simulation, we consider a 10 tonne
rocket lifted to an altitude of 18 km. We model the trajectory of the balloon
by taking into account steam adiabatic cooling, surface cooling, water
condensation and balloon aerodynamic drag. The required steam mass proves to be
only 1.4 times the mass of the rocket stage and the ascent time is around 10
minutes. For small payloads, surface cooling increases the relative amount of
steam needed, unless insulation is applied to the balloon skin. The
ground-filled steam balloon seems to be an attractive and sustainable method of
lifting payloads such as rockets into high altitude.
| physics.pop-ph | launching orbital and suborbital rockets from a high altitude is beneficial because of eg nozzle optimisation and reduced drag aeroplanes and gas balloons have been used for the purpose here we present a concept where a balloon is filled with pure water vapour on ground so that it rises to the launch altitude the system resembles a gas balloon because no onboard energy source is carried and no hard objects fall down we simulate the ascent behaviour of the balloon in the baseline simulation we consider a 10 tonne rocket lifted to an altitude of 18 km we model the trajectory of the balloon by taking into account steam adiabatic cooling surface cooling water condensation and balloon aerodynamic drag the required steam mass proves to be only 14 times the mass of the rocket stage and the ascent time is around 10 minutes for small payloads surface cooling increases the relative amount of steam needed unless insulation is applied to the balloon skin the groundfilled steam balloon seems to be an attractive and sustainable method of lifting payloads such as rockets into high altitude | [['launching', 'orbital', 'and', 'suborbital', 'rockets', 'from', 'a', 'high', 'altitude', 'is', 'beneficial', 'because', 'of', 'eg', 'nozzle', 'optimisation', 'and', 'reduced', 'drag', 'aeroplanes', 'and', 'gas', 'balloons', 'have', 'been', 'used', 'for', 'the', 'purpose', 'here', 'we', 'present', 'a', 'concept', 'where', 'a', 'balloon', 'is', 'filled', 'with', 'pure', 'water', 'vapour', 'on', 'ground', 'so', 'that', 'it', 'rises', 'to', 'the', 'launch', 'altitude', 'the', 'system', 'resembles', 'a', 'gas', 'balloon', 'because', 'no', 'onboard', 'energy', 'source', 'is', 'carried', 'and', 'no', 'hard', 'objects', 'fall', 'down', 'we', 'simulate', 'the', 'ascent', 'behaviour', 'of', 'the', 'balloon', 'in', 'the', 'baseline', 'simulation', 'we', 'consider', 'a', '10', 'tonne', 'rocket', 'lifted', 'to', 'an', 'altitude', 'of', '18', 'km', 'we', 'model', 'the', 'trajectory', 'of', 'the', 'balloon', 'by', 'taking', 'into', 'account', 'steam', 'adiabatic', 'cooling', 'surface', 'cooling', 'water', 'condensation', 'and', 'balloon', 'aerodynamic', 'drag', 'the', 'required', 'steam', 'mass', 'proves', 'to', 'be', 'only', '14', 'times', 'the', 'mass', 'of', 'the', 'rocket', 'stage', 'and', 'the', 'ascent', 'time', 'is', 'around', '10', 'minutes', 'for', 'small', 'payloads', 'surface', 'cooling', 'increases', 'the', 'relative', 'amount', 'of', 'steam', 'needed', 'unless', 'insulation', 'is', 'applied', 'to', 'the', 'balloon', 'skin', 'the', 'groundfilled', 'steam', 'balloon', 'seems', 'to', 'be', 'an', 'attractive', 'and', 'sustainable', 'method', 'of', 'lifting', 'payloads', 'such', 'as', 'rockets', 'into', 'high', 'altitude']] | [-0.09030305268818635, 0.25110033740226184, -0.08561556508309198, 0.018605323828843803, -0.050212612521456, -0.11344540223305287, 0.01581257070123044, 0.3806776902996577, -0.21203514717442207, -0.3693322245093001, 0.15918613345346894, -0.2516153114182608, -0.032617462920485535, 0.23333020987383163, -0.0927473898838878, 0.044502616635457216, 0.08542049969776769, -0.037502725244049434, -0.026171764789998612, -0.20021342912530218, 0.18817326443904375, 0.18940535904890807, 0.21068234113045037, 0.07570426862246797, 0.16687729197380308, -0.08961567939975514, 0.012519897582523708, -0.019359126791951585, -0.11711107472497183, 0.009601932489773729, 0.22415116390438525, 0.10466491072924787, 0.23900624845627244, -0.47987526132223696, -0.22030725681151336, 0.09226527454966045, 0.06706830049162298, 0.031101748201443433, -0.031402549084425, -0.22303842552579367, 0.004074308989252281, -0.24902778319441354, -0.1651426050338669, 0.015081255248323043, 0.042259418179158244, -0.01644658719385836, -0.21338938863738185, -0.026696788029397255, 0.02154636788739251, 0.07702071770800503, -0.10441474229926345, -0.09373795231586772, -0.054670568174365296, 0.12221778921813674, 0.0573188498728796, 0.055216509818130144, 0.22720333869993728, -0.09639006326036466, 0.03701033206671927, 0.4576686693580596, -0.078883895051159, -0.06639793060801841, 0.22036812782631726, -0.11573982286487021, -0.04780773676571738, 0.23659674745503362, 0.19013436134120418, 0.09612525882235226, -0.11869715860146764, -0.002211551066516172, 0.0029923014411866503, 0.191463920159859, 0.12504055055758947, -0.08267965395218478, 0.2805958860541008, 0.2167496338773232, 0.13551626899561098, 0.14507948254762157, -0.2280791910073546, -0.05549124676790498, -0.23269821137220567, -0.2216536642594652, -0.13657324460775153, 0.04234088803155368, -0.006290727589937608, -0.10371310491585634, 0.33110016186537405, 0.1487351817956481, 0.13037663958147988, 0.011445705615147784, 0.365148279611226, 0.0634853975446946, 0.08698903754223036, 0.095702616737741, 0.2897961812124557, 0.05375515125502556, 0.14132819078852432, -0.2393400826386514, 0.06516112276010093, 0.046940538668902694] |
1,803.03112 | UV active plasmons in alkali and alkaline earth intercalated graphene | The interband pi and pi+sigma plasmons in pristine graphene and the Dirac
plasmon in doped graphene are not applicable, since they are broad or weak, and
weakly couple to an external longitudinal or electromagnetic probe. Therefore,
the ab initio Density Function Theory is used to demonstrate that the chemical
doping of the graphene by the alkali or alkaline earth atoms dramatically
changes the poor graphene excitation spectrum in the ultra-violet frequency
range (4 - 10 eV). Four prominent modes are detected. Two of them are the
intra-layer plasmons with the square-root dispersion, characteristic for the
two-dimensional modes. The remaining two are the inter-layer plasmons, very
strong in the long-wavelength limit but damped for larger wave-vectors. The
optical absorption calculations show that the inter-layer plasmons are both
optically active, which makes these materials suitable for small organic
molecule sensing. This is particularly intriguing because the optically active
two-dimensional plasmons have not been detected in other materials.
| cond-mat.mtrl-sci cond-mat.mes-hall | the interband pi and pisigma plasmons in pristine graphene and the dirac plasmon in doped graphene are not applicable since they are broad or weak and weakly couple to an external longitudinal or electromagnetic probe therefore the ab initio density function theory is used to demonstrate that the chemical doping of the graphene by the alkali or alkaline earth atoms dramatically changes the poor graphene excitation spectrum in the ultraviolet frequency range 4 10 ev four prominent modes are detected two of them are the intralayer plasmons with the squareroot dispersion characteristic for the twodimensional modes the remaining two are the interlayer plasmons very strong in the longwavelength limit but damped for larger wavevectors the optical absorption calculations show that the interlayer plasmons are both optically active which makes these materials suitable for small organic molecule sensing this is particularly intriguing because the optically active twodimensional plasmons have not been detected in other materials | [['the', 'interband', 'pi', 'and', 'pisigma', 'plasmons', 'in', 'pristine', 'graphene', 'and', 'the', 'dirac', 'plasmon', 'in', 'doped', 'graphene', 'are', 'not', 'applicable', 'since', 'they', 'are', 'broad', 'or', 'weak', 'and', 'weakly', 'couple', 'to', 'an', 'external', 'longitudinal', 'or', 'electromagnetic', 'probe', 'therefore', 'the', 'ab', 'initio', 'density', 'function', 'theory', 'is', 'used', 'to', 'demonstrate', 'that', 'the', 'chemical', 'doping', 'of', 'the', 'graphene', 'by', 'the', 'alkali', 'or', 'alkaline', 'earth', 'atoms', 'dramatically', 'changes', 'the', 'poor', 'graphene', 'excitation', 'spectrum', 'in', 'the', 'ultraviolet', 'frequency', 'range', '4', '10', 'ev', 'four', 'prominent', 'modes', 'are', 'detected', 'two', 'of', 'them', 'are', 'the', 'intralayer', 'plasmons', 'with', 'the', 'squareroot', 'dispersion', 'characteristic', 'for', 'the', 'twodimensional', 'modes', 'the', 'remaining', 'two', 'are', 'the', 'interlayer', 'plasmons', 'very', 'strong', 'in', 'the', 'longwavelength', 'limit', 'but', 'damped', 'for', 'larger', 'wavevectors', 'the', 'optical', 'absorption', 'calculations', 'show', 'that', 'the', 'interlayer', 'plasmons', 'are', 'both', 'optically', 'active', 'which', 'makes', 'these', 'materials', 'suitable', 'for', 'small', 'organic', 'molecule', 'sensing', 'this', 'is', 'particularly', 'intriguing', 'because', 'the', 'optically', 'active', 'twodimensional', 'plasmons', 'have', 'not', 'been', 'detected', 'in', 'other', 'materials']] | [-0.1446560341305426, 0.24656168921095056, 0.01844141857892081, 0.05541608068748459, -0.029194434657209105, -0.18789488190252865, 0.03678218446832223, 0.47082878781071347, -0.24586462617138183, -0.2700450678035472, -0.03287266553515665, -0.3529327854948034, -0.14640223899971114, 0.18815286666027864, 0.07554470376087377, 0.023188145813084655, -0.005039557940084729, -0.08080262584950436, -0.01919668766990449, -0.1639926598676444, 0.23195195974866775, 0.02416044990108772, 0.3062729073269595, 0.09834027106196365, -0.03150381219222561, -0.01927428175513814, 0.07592551341558529, -0.027799738607333077, -0.08898373144459926, 0.09411050214768764, 0.30141900602407606, -0.12895148188667976, 0.23843309686325684, -0.46679191666280295, -0.23691614530375832, 0.010116854569173188, 0.19790151602113862, 0.15492295621147428, -0.071084586586618, -0.2640406971059546, 0.02360068269787574, -0.09105317308809366, -0.11614312791543735, -0.06534830427595548, 0.020771185850857625, 0.01795256178971235, -0.2059226563115689, 0.07264505876772492, 0.018477690708521125, 0.0682905632227205, -0.09311338228494075, -0.15019039514734617, -0.08662951735525647, 0.039220478582232224, 0.0528563303576613, -0.013787551936481825, 0.23352217797927752, -0.1112174428878473, -0.01881050756322099, 0.42529617265689296, -0.08067719635323851, -0.1266327840563321, 0.243200516993446, -0.19738968904734916, -0.032712341921990615, 0.21429727583301145, 0.08679191611764663, 0.12400489549346075, -0.14198955051924478, 0.07781826375035703, -0.01778952385580119, 0.17749976721144728, 0.08588223189399759, 0.16349048905570496, 0.2730332333443372, 0.12780734287671647, 0.025977686405871305, 0.06348931213028959, -0.13334608000915577, 0.02586358587685428, -0.1832397714916423, -0.15184936314283012, -0.21520096812300482, 0.0494117019064921, -0.05470586084955759, -0.22260623719156175, 0.40864509909546803, 0.11338380898025632, 0.13126261544552958, -0.05129852708861498, 0.26834931372144777, 0.13459924145226743, 0.0956509033608849, 0.01761160276727388, 0.37522011354275336, 0.14195300013056728, 0.05899163556146109, -0.2683153727194657, 0.01032443044936986, -0.040374400209810875] |
1,803.03113 | Stabilities and non-stabilities of the reciprocal-nonic and the
reciprocal-decic functional equations | This paper focuses at the various stability results of reciprocal-nonic and
reciprocal-decic functional equations in non-Archimedes fields and
illustrations of the proper examples for their non-stabilities.
| math.CA | this paper focuses at the various stability results of reciprocalnonic and reciprocaldecic functional equations in nonarchimedes fields and illustrations of the proper examples for their nonstabilities | [['this', 'paper', 'focuses', 'at', 'the', 'various', 'stability', 'results', 'of', 'reciprocalnonic', 'and', 'reciprocaldecic', 'functional', 'equations', 'in', 'nonarchimedes', 'fields', 'and', 'illustrations', 'of', 'the', 'proper', 'examples', 'for', 'their', 'nonstabilities']] | [-0.11937062332237308, 0.05732595063322647, -0.06892368009059945, 0.03356303200019862, -0.031537919474596325, 0.021732088644057512, 0.03577917755517939, 0.3458054472099651, -0.2315401469928805, -0.3127113391052593, 0.1719679843835448, -0.27946167591620574, -0.19896521444686435, 0.2649052163416689, -0.069045198996636, 0.09868738444691355, 0.057108739729632034, 0.030139035375958138, -0.10120944907380776, -0.26747106041081925, 0.4076684967360713, 0.027587838978929954, 0.2704310872676698, 0.10567366594279354, 0.13964485465972262, -0.023900672624056988, -0.11237631560387937, 0.04701590131629597, -0.19628990814089775, 0.17942394375462423, 0.2516636670651761, 0.10673778758130291, 0.3326134451410987, -0.45775416459549556, -0.17214625455777754, 0.008535438090224157, 0.08640319194687023, 0.13222483985803343, -0.07554755723950538, -0.27760154207829724, 0.12575968253341588, -0.09629382387819616, -0.15971205552870577, -0.11565418558364565, 0.004670939768071879, 0.14709723690016704, -0.2386062124913389, 0.0569178605960174, 0.11283176390729337, 0.1438995757224885, -0.13259637321938167, -0.12620990896936168, -0.005467486869416793, 0.13114051774821497, 0.11244486381342127, -0.08876224332065745, 0.057741892862726345, -0.20478685713500122, -0.11008648057891564, 0.38526046208359976, -0.03959002388133244, -0.24504805339330976, 0.23977776735343717, -0.09837503773583607, -0.17726648531176828, 0.06934313647533683, 0.2108080452731387, 0.1784120241010731, -0.18056745395403018, 0.1267947580358437, 0.02866691096939824, 0.030475613491779022, 0.04126764562996951, 0.058596602895043114, 0.1280631497502327, 0.1427535450255329, 0.010203870479017496, 0.13156114852013576, -0.016834957017139954, -0.09955340090461752, -0.3984912953932177, -0.18579739319499244, -0.10477040013806387, -0.0640732355161824, -0.09160329613025003, -0.14601289946585894, 0.4827149954031814, 0.14712324704636226, 0.15021277883682738, 0.044875898652456024, 0.2726055309176445, 0.10910030606795441, -0.048170031143606386, 0.03587350363589146, 0.21389644821597772, 0.17695978690277447, 0.11089688982412388, -0.18629068644209343, -0.010036438661204143, 0.0023531255481595344] |
1,803.03114 | Concise Fuzzy Planar Embedding of Graphs: a Dimensionality Reduction
Approach | The enormous amount of data to be represented using large graphs exceeds in
some cases the resources of a conventional computer. Edges in particular can
take up a considerable amount of memory as compared to the number of nodes.
However, rigorous edge storage might not always be essential to be able to draw
the needed conclusions. A similar problem takes records with many variables and
attempts to extract the most discernible features. It is said that the
``dimension'' of this data is reduced. Following an approach with the same
objective in mind, we can map a graph representation to a $k$-dimensional space
and answer queries of neighboring nodes mainly by measuring Euclidean
distances. The accuracy of our answers would decrease but would be compensated
for by fuzzy logic which gives an idea about the likelihood of error. This
method allows for reasonable representation in memory while maintaining a fair
amount of useful information, and allows for concise embedding in
$k$-dimensional Euclidean space as well as solving some problems without having
to decompress the graph. Of particular interest is the case where $k=2$.
Promising highly accurate experimental results are obtained and reported.
| cs.AI | the enormous amount of data to be represented using large graphs exceeds in some cases the resources of a conventional computer edges in particular can take up a considerable amount of memory as compared to the number of nodes however rigorous edge storage might not always be essential to be able to draw the needed conclusions a similar problem takes records with many variables and attempts to extract the most discernible features it is said that the dimension of this data is reduced following an approach with the same objective in mind we can map a graph representation to a kdimensional space and answer queries of neighboring nodes mainly by measuring euclidean distances the accuracy of our answers would decrease but would be compensated for by fuzzy logic which gives an idea about the likelihood of error this method allows for reasonable representation in memory while maintaining a fair amount of useful information and allows for concise embedding in kdimensional euclidean space as well as solving some problems without having to decompress the graph of particular interest is the case where k2 promising highly accurate experimental results are obtained and reported | [['the', 'enormous', 'amount', 'of', 'data', 'to', 'be', 'represented', 'using', 'large', 'graphs', 'exceeds', 'in', 'some', 'cases', 'the', 'resources', 'of', 'a', 'conventional', 'computer', 'edges', 'in', 'particular', 'can', 'take', 'up', 'a', 'considerable', 'amount', 'of', 'memory', 'as', 'compared', 'to', 'the', 'number', 'of', 'nodes', 'however', 'rigorous', 'edge', 'storage', 'might', 'not', 'always', 'be', 'essential', 'to', 'be', 'able', 'to', 'draw', 'the', 'needed', 'conclusions', 'a', 'similar', 'problem', 'takes', 'records', 'with', 'many', 'variables', 'and', 'attempts', 'to', 'extract', 'the', 'most', 'discernible', 'features', 'it', 'is', 'said', 'that', 'the', 'dimension', 'of', 'this', 'data', 'is', 'reduced', 'following', 'an', 'approach', 'with', 'the', 'same', 'objective', 'in', 'mind', 'we', 'can', 'map', 'a', 'graph', 'representation', 'to', 'a', 'kdimensional', 'space', 'and', 'answer', 'queries', 'of', 'neighboring', 'nodes', 'mainly', 'by', 'measuring', 'euclidean', 'distances', 'the', 'accuracy', 'of', 'our', 'answers', 'would', 'decrease', 'but', 'would', 'be', 'compensated', 'for', 'by', 'fuzzy', 'logic', 'which', 'gives', 'an', 'idea', 'about', 'the', 'likelihood', 'of', 'error', 'this', 'method', 'allows', 'for', 'reasonable', 'representation', 'in', 'memory', 'while', 'maintaining', 'a', 'fair', 'amount', 'of', 'useful', 'information', 'and', 'allows', 'for', 'concise', 'embedding', 'in', 'kdimensional', 'euclidean', 'space', 'as', 'well', 'as', 'solving', 'some', 'problems', 'without', 'having', 'to', 'decompress', 'the', 'graph', 'of', 'particular', 'interest', 'is', 'the', 'case', 'where', 'k2', 'promising', 'highly', 'accurate', 'experimental', 'results', 'are', 'obtained', 'and', 'reported']] | [-0.09532202934695125, 0.06875483393172382, -0.05297416285428838, 0.06783190719370062, -0.12493412211264303, -0.13610235051159303, 0.07653409135113445, 0.3688944185406204, -0.281160157527994, -0.3530594811565121, 0.1055447843921717, -0.3009780721255293, -0.11224009140506777, 0.19648633537453195, -0.13741090673226766, 0.06489358035206347, 0.10355551671895018, 0.09119050732096999, -0.04302092731189158, -0.27689961745331787, 0.2698859705331282, 0.07754526059118864, 0.2526752295859977, 0.052032662716484504, 0.08048386062819667, -0.0026876796902454802, -0.028462406728143624, 0.06753051997180039, -0.07781724747123607, 0.15685357760085789, 0.3198825378953455, 0.16902343820444068, 0.29114445853802856, -0.44639055264616356, -0.20923854901725963, 0.1580543440122996, 0.17412855586461254, 0.12296888012596265, -0.02383648898118512, -0.2597816593162423, 0.10247199856724921, -0.1256515775265962, -0.0859463317770784, -0.10783551816696896, 0.037994421593093984, -0.023993841119181288, -0.2831544502131173, 0.015050061392056615, 0.06294076531639088, 0.017091702791759793, -0.024599551523704064, -0.11093540547454622, 0.006773721724163487, 0.16253621219864592, 0.019407540106483184, 0.09159925706984466, 0.06912060075863728, -0.12287162207505856, -0.10344383721508046, 0.4049486160370965, -0.009013768825533737, -0.2090272598653661, 0.16370400476527855, -0.11254060374272996, -0.12453562466620287, 0.13531893171755235, 0.1691563523103878, 0.08490118266909788, -0.13891984613829278, 0.04991501280233381, -0.04668867858906925, 0.18966957796072462, 0.05617786503728499, 0.06613905303648317, 0.17666787988901217, 0.16845205077823466, 0.08139100010142325, 0.14204535169980406, -0.04299634566325792, -0.08406179156812658, -0.2569078370387525, -0.16126096573667734, -0.22641415560876474, 0.027122025492711418, -0.1284005172993788, -0.1358628503061558, 0.370246794530683, 0.17489577046259067, 0.2408361046298295, 0.05466384736209113, 0.29626951865968904, 0.0898901629468904, 0.11014506317363047, 0.09834657141607235, 0.1728018328918666, 0.08863681935003095, 0.07245503430966659, -0.13029650798194228, 0.11876872927803761, 0.02586156350233792] |
1,803.03115 | On the Incompatibility of Rearrangement with Convergence: An Axiomatic
Approach to Holomorphic Recurrence Relations | In classical analysis, the convergence behavior of power series solutions to
differential or recurrence equations is generally assumed to be invariant under
internal rearrangement. This paper challenges that belief by proving that, for
holomorphic solutions to higher-order recurrence relations (order 3 or more),
rearrangement of internal terms systematically reduces the radius of
convergence. This contradicts assumptions underlying both Fuchs' theorem and
the Poincare-Perron theorem.
To address this, the paper proposes the Principle of Indivisible Integrity,
an axiom that restricts arbitrary reordering within analytic computations. Both
analytic arguments and numerical examples (see Theorem 3.3 and Table 3) show
that violation of this principle can lead to structural divergence, even when
classical conditions suggest convergence.
This framework suggests the need to reexamine analytic structures in
recurrence-based methods across mathematical physics, including quantum
mechanics, general relativity, and spectral theory. It also raises foundational
questions about computation and mathematical rigor in an age of automated
symbolic processing.
Rather than offering just a technical correction, this paper advocates a
philosophical principle: that the integrity of mathematical order must be
preserved by structure, not merely by computational convenience.
| math.CA | in classical analysis the convergence behavior of power series solutions to differential or recurrence equations is generally assumed to be invariant under internal rearrangement this paper challenges that belief by proving that for holomorphic solutions to higherorder recurrence relations order 3 or more rearrangement of internal terms systematically reduces the radius of convergence this contradicts assumptions underlying both fuchs theorem and the poincareperron theorem to address this the paper proposes the principle of indivisible integrity an axiom that restricts arbitrary reordering within analytic computations both analytic arguments and numerical examples see theorem 33 and table 3 show that violation of this principle can lead to structural divergence even when classical conditions suggest convergence this framework suggests the need to reexamine analytic structures in recurrencebased methods across mathematical physics including quantum mechanics general relativity and spectral theory it also raises foundational questions about computation and mathematical rigor in an age of automated symbolic processing rather than offering just a technical correction this paper advocates a philosophical principle that the integrity of mathematical order must be preserved by structure not merely by computational convenience | [['in', 'classical', 'analysis', 'the', 'convergence', 'behavior', 'of', 'power', 'series', 'solutions', 'to', 'differential', 'or', 'recurrence', 'equations', 'is', 'generally', 'assumed', 'to', 'be', 'invariant', 'under', 'internal', 'rearrangement', 'this', 'paper', 'challenges', 'that', 'belief', 'by', 'proving', 'that', 'for', 'holomorphic', 'solutions', 'to', 'higherorder', 'recurrence', 'relations', 'order', '3', 'or', 'more', 'rearrangement', 'of', 'internal', 'terms', 'systematically', 'reduces', 'the', 'radius', 'of', 'convergence', 'this', 'contradicts', 'assumptions', 'underlying', 'both', 'fuchs', 'theorem', 'and', 'the', 'poincareperron', 'theorem', 'to', 'address', 'this', 'the', 'paper', 'proposes', 'the', 'principle', 'of', 'indivisible', 'integrity', 'an', 'axiom', 'that', 'restricts', 'arbitrary', 'reordering', 'within', 'analytic', 'computations', 'both', 'analytic', 'arguments', 'and', 'numerical', 'examples', 'see', 'theorem', '33', 'and', 'table', '3', 'show', 'that', 'violation', 'of', 'this', 'principle', 'can', 'lead', 'to', 'structural', 'divergence', 'even', 'when', 'classical', 'conditions', 'suggest', 'convergence', 'this', 'framework', 'suggests', 'the', 'need', 'to', 'reexamine', 'analytic', 'structures', 'in', 'recurrencebased', 'methods', 'across', 'mathematical', 'physics', 'including', 'quantum', 'mechanics', 'general', 'relativity', 'and', 'spectral', 'theory', 'it', 'also', 'raises', 'foundational', 'questions', 'about', 'computation', 'and', 'mathematical', 'rigor', 'in', 'an', 'age', 'of', 'automated', 'symbolic', 'processing', 'rather', 'than', 'offering', 'just', 'a', 'technical', 'correction', 'this', 'paper', 'advocates', 'a', 'philosophical', 'principle', 'that', 'the', 'integrity', 'of', 'mathematical', 'order', 'must', 'be', 'preserved', 'by', 'structure', 'not', 'merely', 'by', 'computational', 'convenience']] | [-0.10921544243343645, 0.057610580825744516, -0.12315047331727468, 0.12849735029509987, -0.12167419325739431, -0.1340415597417402, 0.06500036591167592, 0.29756290044707173, -0.2999853960207694, -0.3085298296575854, 0.10873526902447178, -0.21243220849914457, -0.17369766449197555, 0.17580019540132974, -0.14373150740473167, 0.05661038213644873, 0.06260495874928412, 0.0007360715848895219, -0.1085524110118398, -0.2404434995036214, 0.31021959151545603, 0.04405063771640186, 0.27164046414923126, 0.07899379684394071, 0.06250915960613433, 0.014923396357846865, -0.04529202759654804, 0.010155523287971596, -0.1281781666023432, 0.16280670170889716, 0.2853096395853784, 0.17474007412566098, 0.3237335389840754, -0.4496211382038482, -0.19525716563169895, 0.06969587681601547, 0.1325674881764616, 0.10512599765046776, -0.006785011787372411, -0.25150734497039773, 0.10255149329064547, -0.16133427416015375, -0.18726457256291593, -0.13972313362583108, 0.010222152704475344, -0.018527107537150957, -0.22089175356502114, 0.09552903149828985, 0.16359874923140383, 0.12411526505640902, -0.04017394025244617, -0.053745053008782094, 0.03179923688051301, 0.057595542053324886, 0.07461890127316499, -0.0001042685113274134, 0.1086448465376724, -0.09214130280907828, -0.14405278743955993, 0.39231874173440573, 0.017432768048400667, -0.23290318880578156, 0.1612070638489408, -0.11386747814709791, -0.19084162503010133, 0.09401595651154192, 0.10703286320830767, 0.07692741557116528, -0.1719944386860224, 0.10478197837889368, -0.015944032510870475, 0.1903494530828199, 0.13190839457156772, 0.03538354795207372, 0.16395124238608713, 0.09257630198799933, 0.05709945374605972, 0.08883638562670407, 0.038380267239267844, -0.15234847139096358, -0.34260911316672277, -0.15809852495830465, -0.11315490539021954, 0.10752065218852354, -0.10320703081930872, -0.15582536574668035, 0.33420769638985726, 0.17458720125480565, 0.10309793921775993, 0.09997821267253519, 0.29738701858422156, 0.11354288331406949, 0.026365896456639518, 0.07663236285437021, 0.20361039576192314, 0.1572687611237148, 0.1109014080138877, -0.15911596928272848, 0.09199289113774405, 0.0958480172237934] |
1,803.03116 | Solutions of systems of the partial differential equations of Kamp\'e de
F\'eriet type functions | In investigation of boundary-value problems for certain partial differential
equations arising in applied mathematics, we often need to study the solution
of system of partial differential equations satisfied by hypergeometric
functions and find explicit linearly independent solutions for the system. In
this present investigation, we give the solutions of systems of partial
differential equations for two Kamp\'e de F\'eriet type functions of third and
fourth orders and of two variables.
| math.CA | in investigation of boundaryvalue problems for certain partial differential equations arising in applied mathematics we often need to study the solution of system of partial differential equations satisfied by hypergeometric functions and find explicit linearly independent solutions for the system in this present investigation we give the solutions of systems of partial differential equations for two kampe de feriet type functions of third and fourth orders and of two variables | [['in', 'investigation', 'of', 'boundaryvalue', 'problems', 'for', 'certain', 'partial', 'differential', 'equations', 'arising', 'in', 'applied', 'mathematics', 'we', 'often', 'need', 'to', 'study', 'the', 'solution', 'of', 'system', 'of', 'partial', 'differential', 'equations', 'satisfied', 'by', 'hypergeometric', 'functions', 'and', 'find', 'explicit', 'linearly', 'independent', 'solutions', 'for', 'the', 'system', 'in', 'this', 'present', 'investigation', 'we', 'give', 'the', 'solutions', 'of', 'systems', 'of', 'partial', 'differential', 'equations', 'for', 'two', 'kampe', 'de', 'feriet', 'type', 'functions', 'of', 'third', 'and', 'fourth', 'orders', 'and', 'of', 'two', 'variables']] | [-0.2139172300430281, -0.011553239103938852, -0.04838022322260908, 0.06487767482675345, -0.08301409051221396, -0.10300916502518313, -0.031421806041284334, 0.21579524390399457, -0.29567927356277196, -0.29587354998636456, 0.15912008704783928, -0.3018596836831421, -0.1648070027785642, 0.22769546742950167, -0.03162734407399382, 0.11823866399271148, 0.036886190390214325, -0.024034591079024333, -0.11190057460085621, -0.26901665441691874, 0.4486925564174141, -0.11800505290074008, 0.19547170167788863, -0.0208354457481099, 0.19616559750866144, 0.014192578292983983, -0.08537316585757902, 0.0019485169489468848, -0.17087158949247427, 0.09815346600288259, 0.31426818157945363, 0.10932678365820071, 0.257542809282417, -0.45219267031976157, -0.1305466253376965, 0.06246387498852398, 0.1500910065269896, 0.1020392897804933, -0.027738267169999224, -0.2602560266586287, 0.04621366787635322, -0.14936264571068542, -0.20035807182347135, -0.09714587437255041, 0.027187283616513014, 0.12116775276871132, -0.2778636663619961, 0.12221312594733068, 0.06723388277127275, 0.0659058305268575, -0.11221644075454346, -0.13370774839672128, 0.0232103282452694, 0.03594607352944357, 0.05254477495660207, -0.06857168386091611, -0.0077726172150245736, -0.1413098761778591, -0.12568059129906553, 0.34659575258514713, -0.07196754845790565, -0.2877199019172362, 0.11987293963154246, -0.16185693140141666, -0.1716167508158833, 0.13214643308892846, 0.20672211180041944, 0.2110395156379257, -0.1947047375076051, 0.09974881150244203, -0.005370729584579489, 0.1612642537868981, 0.10279689379302519, -0.0069849618045347076, 0.08710927042577948, 0.05574727622526032, 0.09173689984849522, 0.14245477884874813, 0.09224503263831138, -0.15762782134115697, -0.35802168839478066, -0.19169228470751218, -0.01814532063664436, 0.057577947447342535, -0.09192038421481681, -0.2170703973355038, 0.3768053700881345, 0.10636140363556998, 0.1162597609151687, 0.01984742036022778, 0.1957769712998665, 0.26150551391765475, -0.01155268054987703, -0.02387454950117639, 0.16806007184620414, 0.19321031014301948, 0.1674866403586098, -0.21244746785211777, 0.016835241465430174, 0.15021522752940655] |
1,803.03117 | Discrete Boltzmann model for implosion and explosion related
compressible flow with spherical symmetry | To kinetically model implosion and explosion related phenomena, we present a
theoretical framework for constructing Discrete Boltzmann Model(DBM) with
spherical symmetry in spherical coordinates. To this aim, a key technique is to
use \emph{local} Cartesian coordinates to describe the particle velocity in the
kinetic model. Thus, the geometric effects, like the divergence and
convergence, are described as a \textquotedblleft force term\textquotedblright.
To better access the nonequilibrium behavior, even though the corresponding
hydrodynamic model is one-dimensional, the DBM uses a Discrete Velocity
Model(DVM) with 3 dimensions. A new scheme is introduced so that the DBM can
use the same DVM no matter considering the extra degree of freedom or not. As
an example, a DVM with 26 velocities is formulated to construct the DBM in the
Navier-Stokes level. Via the DBM, one can study simultaneously the hydrodynamic
and thermodynamic nonequilibrium behaviors in the implosion and explosion
process which are not very close to the spherical center. The extension of
current model to the multiple-relaxation-time version is straightforward.
| physics.comp-ph physics.flu-dyn | to kinetically model implosion and explosion related phenomena we present a theoretical framework for constructing discrete boltzmann modeldbm with spherical symmetry in spherical coordinates to this aim a key technique is to use emphlocal cartesian coordinates to describe the particle velocity in the kinetic model thus the geometric effects like the divergence and convergence are described as a textquotedblleft force termtextquotedblright to better access the nonequilibrium behavior even though the corresponding hydrodynamic model is onedimensional the dbm uses a discrete velocity modeldvm with 3 dimensions a new scheme is introduced so that the dbm can use the same dvm no matter considering the extra degree of freedom or not as an example a dvm with 26 velocities is formulated to construct the dbm in the navierstokes level via the dbm one can study simultaneously the hydrodynamic and thermodynamic nonequilibrium behaviors in the implosion and explosion process which are not very close to the spherical center the extension of current model to the multiplerelaxationtime version is straightforward | [['to', 'kinetically', 'model', 'implosion', 'and', 'explosion', 'related', 'phenomena', 'we', 'present', 'a', 'theoretical', 'framework', 'for', 'constructing', 'discrete', 'boltzmann', 'modeldbm', 'with', 'spherical', 'symmetry', 'in', 'spherical', 'coordinates', 'to', 'this', 'aim', 'a', 'key', 'technique', 'is', 'to', 'use', 'emphlocal', 'cartesian', 'coordinates', 'to', 'describe', 'the', 'particle', 'velocity', 'in', 'the', 'kinetic', 'model', 'thus', 'the', 'geometric', 'effects', 'like', 'the', 'divergence', 'and', 'convergence', 'are', 'described', 'as', 'a', 'textquotedblleft', 'force', 'termtextquotedblright', 'to', 'better', 'access', 'the', 'nonequilibrium', 'behavior', 'even', 'though', 'the', 'corresponding', 'hydrodynamic', 'model', 'is', 'onedimensional', 'the', 'dbm', 'uses', 'a', 'discrete', 'velocity', 'modeldvm', 'with', '3', 'dimensions', 'a', 'new', 'scheme', 'is', 'introduced', 'so', 'that', 'the', 'dbm', 'can', 'use', 'the', 'same', 'dvm', 'no', 'matter', 'considering', 'the', 'extra', 'degree', 'of', 'freedom', 'or', 'not', 'as', 'an', 'example', 'a', 'dvm', 'with', '26', 'velocities', 'is', 'formulated', 'to', 'construct', 'the', 'dbm', 'in', 'the', 'navierstokes', 'level', 'via', 'the', 'dbm', 'one', 'can', 'study', 'simultaneously', 'the', 'hydrodynamic', 'and', 'thermodynamic', 'nonequilibrium', 'behaviors', 'in', 'the', 'implosion', 'and', 'explosion', 'process', 'which', 'are', 'not', 'very', 'close', 'to', 'the', 'spherical', 'center', 'the', 'extension', 'of', 'current', 'model', 'to', 'the', 'multiplerelaxationtime', 'version', 'is', 'straightforward']] | [-0.06400723290269726, 0.10185231523814345, -0.11121834272895854, 0.07208632175177716, -0.08905464728745671, -0.15067398104748111, -0.003840846466643313, 0.34229006563410436, -0.2785283553991124, -0.28217959318287167, 0.07077781786067994, -0.21541658292975893, -0.10377313457629386, 0.14080415571471278, -0.045703174383165256, 0.04970945350388693, 0.01316758435208099, 0.02719127558360299, -0.0643574686098181, -0.187724972680851, 0.2709514161091915, 0.09833183647361955, 0.2793204869412206, 0.011737078264715619, 0.1381085847584428, -0.01801306480096162, 0.025396467046526493, 0.024802037497605282, -0.13830168606832866, 0.08175498956315894, 0.1652877539127745, 0.059874175912043526, 0.23652607861312072, -0.41807408152616643, -0.2702938687339128, 0.082844073282829, 0.14902230214750384, 0.15373766747020481, -0.014497268553594686, -0.22888002772044186, 0.06125363874809096, -0.1965231245928737, -0.1892194702644244, -0.07271715327297434, -0.024842912961151795, 0.02724103747504232, -0.27942882873049363, 0.0994803302212864, 0.07573524750540593, 0.04994472928139512, -0.04725426320626509, -0.05728021889433631, -0.028150922278845053, 0.06912569389564265, 0.02949623166897014, 0.02983948509183861, 0.09972019153475715, -0.13203581819807872, -0.10176759116220191, 0.4550873533211237, -0.05098162785863812, -0.26274139090138343, 0.2204307124255785, -0.12047999725031432, -0.09357319257444947, 0.1371718391224719, 0.16757857475852583, 0.08916326531814697, -0.17256916651182289, 0.05847260256965132, -0.034785382173944016, 0.15945109150046055, 0.04102008328544536, -0.03774017267617643, 0.17939457559009636, 0.16437119632913658, 0.03327098569941301, 0.1373442227172271, -0.10326976256953564, -0.14297862161390848, -0.3198253646395826, -0.13859024127099687, -0.17761560118374375, 0.051039107979676666, -0.07313337841212601, -0.13920472695440786, 0.37020948751439164, 0.1514850370064549, 0.19134578741715502, 0.029652228883890425, 0.30233320265442726, 0.12697436570109902, 0.05545251258003291, 0.10781975536452938, 0.2280622041085021, 0.15347735417515404, 0.13036074684190055, -0.2082694019190967, 0.0017660028141197616, 0.1280013443959271] |
1,803.03118 | Poisson wavelets on $n$-dimensional spheres | In this paper, Poisson wavelets on $n$-dimensional spheres, derived from
Poisson kernel, are introduced and characterized. We compute their Gegenbauer
expansion with respect to the origin of the sphere, as well as with respect to
the field source. Further, we give recursive formulae for their explicit
representations and we show how the wavelets are localized in space. Also their
Euclidean limit is calculated explicitly and its space localization is
described. We show that Poisson wavelets can be treated as wavelets derived
from approximate identities and we give two inversion formulae.
| math.CA math-ph math.MP | in this paper poisson wavelets on ndimensional spheres derived from poisson kernel are introduced and characterized we compute their gegenbauer expansion with respect to the origin of the sphere as well as with respect to the field source further we give recursive formulae for their explicit representations and we show how the wavelets are localized in space also their euclidean limit is calculated explicitly and its space localization is described we show that poisson wavelets can be treated as wavelets derived from approximate identities and we give two inversion formulae | [['in', 'this', 'paper', 'poisson', 'wavelets', 'on', 'ndimensional', 'spheres', 'derived', 'from', 'poisson', 'kernel', 'are', 'introduced', 'and', 'characterized', 'we', 'compute', 'their', 'gegenbauer', 'expansion', 'with', 'respect', 'to', 'the', 'origin', 'of', 'the', 'sphere', 'as', 'well', 'as', 'with', 'respect', 'to', 'the', 'field', 'source', 'further', 'we', 'give', 'recursive', 'formulae', 'for', 'their', 'explicit', 'representations', 'and', 'we', 'show', 'how', 'the', 'wavelets', 'are', 'localized', 'in', 'space', 'also', 'their', 'euclidean', 'limit', 'is', 'calculated', 'explicitly', 'and', 'its', 'space', 'localization', 'is', 'described', 'we', 'show', 'that', 'poisson', 'wavelets', 'can', 'be', 'treated', 'as', 'wavelets', 'derived', 'from', 'approximate', 'identities', 'and', 'we', 'give', 'two', 'inversion', 'formulae']] | [-0.061107277311384676, 0.08429545332085885, -0.10336141990911629, 0.12703987964972233, -0.08006502737601598, -0.07374074725537665, -0.01139631915397735, 0.44790721936151384, -0.2999546181514031, -0.22973410942100195, 0.1356913807672552, -0.24962385363566378, -0.2292052477805151, 0.19991637108226618, -0.07245345629441241, 0.03582798066846509, -0.010637931753363875, 0.06288431782482398, -0.13308454777579753, -0.22409040285274387, 0.3314176672448715, 0.048445451564233126, 0.2206992529048067, 0.003801715394688977, 0.1130520908575919, 0.0025856800545524393, -0.09549482954252098, 0.0016777370584249082, -0.15007443519401326, 0.14905633574429278, 0.2518791159200999, 0.10101825345514549, 0.14021158639289852, -0.42303805142227147, -0.16138532369708022, 0.1052103432205816, 0.18535127359338932, 0.06714896872225735, -0.0050789849379927745, -0.3229763635951612, 0.09298091766734919, -0.16839112494554784, -0.16276869789904191, -0.16311417425879174, -0.014443895100460699, 0.07353711789991292, -0.2533191287062234, 0.07010196955169602, 0.08576801751559186, 0.030219618489758834, -0.12008337145800599, -0.12740744929760695, -0.01283759395333214, 0.11648222771990631, 0.043358135932228634, 0.013319174453823104, 0.08240410989253885, -0.05252951929707908, -0.12387592354854052, 0.40346377284990415, -0.06508823340086059, -0.32418971214857367, 0.15924892318952416, -0.13991183379871977, -0.1039489425201383, 0.07348058567278914, 0.16640798535922335, 0.1128093764392866, -0.11795213694050391, 0.1320071639054125, -0.0381223913282156, 0.04878230804913781, 0.1292410950202288, 0.047326508283408154, 0.13789127574612697, 0.031813586016909944, 0.052608377664970854, 0.21410554451738587, -0.08202606777712289, -0.07763660767426094, -0.32964761399974424, -0.1420068419021037, -0.2515042085485119, 0.03934920254266924, -0.12397768355699049, -0.20085858099369538, 0.3522517695816027, 0.10583540714449352, 0.22309185625312644, 0.12642941527172094, 0.21723064976071732, 0.21664734258859727, 0.018812943030045264, 0.07244445230397913, 0.1557513870091902, 0.1666513971492855, 0.0436171646575935, -0.11303194547589454, -0.006277836119342181, 0.1548762460756633] |
1,803.03119 | Semi-continuous and discrete wavelet frames on $n$-dimensional spheres | The paper shows that under some mild conditions $n$-dimensional spherical
wavelets derived from approximate identities build semi-continuous frames.
Moreover, for sufficiently dense grids Poisson wavelets on $n$-dimensional
spheres constitute a discrete frame. In the proof we only use the localization
properties of the reproducing kernel and its gradient.
| math.CA math-ph math.MP | the paper shows that under some mild conditions ndimensional spherical wavelets derived from approximate identities build semicontinuous frames moreover for sufficiently dense grids poisson wavelets on ndimensional spheres constitute a discrete frame in the proof we only use the localization properties of the reproducing kernel and its gradient | [['the', 'paper', 'shows', 'that', 'under', 'some', 'mild', 'conditions', 'ndimensional', 'spherical', 'wavelets', 'derived', 'from', 'approximate', 'identities', 'build', 'semicontinuous', 'frames', 'moreover', 'for', 'sufficiently', 'dense', 'grids', 'poisson', 'wavelets', 'on', 'ndimensional', 'spheres', 'constitute', 'a', 'discrete', 'frame', 'in', 'the', 'proof', 'we', 'only', 'use', 'the', 'localization', 'properties', 'of', 'the', 'reproducing', 'kernel', 'and', 'its', 'gradient']] | [-0.08185321143052231, 0.03152982360916212, -0.1508771100040273, 0.08495565965616454, -0.07140701803048917, -0.10101558095387493, -0.017067337702125467, 0.4530915773745316, -0.2542401870014146, -0.14075207570567727, 0.14695730193003934, -0.19025651190895587, -0.2101620449005471, 0.19986561264765138, -0.11929805331480263, 0.06778706984550809, 0.10494382513085536, 0.05156253501869893, -0.1465651815669844, -0.2222558413632214, 0.3443196719745174, 0.021426131017506123, 0.27648394149825134, -0.036671040954388445, 0.16238206114697581, -0.008559711083459357, -0.05173413862939924, -0.013626020731559644, -0.14231584471978445, 0.17934584280010313, 0.2094421909811596, 0.10205994060379453, 0.24373054151268056, -0.44285679845294607, -0.22421323490561917, 0.1549255727926114, 0.08462620621624713, 0.011117426562123, -0.09345983404637082, -0.30185973764552426, 0.09932396021516372, -0.09673942024043451, -0.16966866459309435, -0.10869185686654721, 0.015197349013760686, 0.08903299012066175, -0.31538237623559934, 0.07181426327345737, 0.17051639645554437, 0.03236737798821802, -0.14256769603283223, -0.08880187231504048, -0.0010042532618778448, 0.06947837884460266, -0.019772967731114477, 0.006787351565435529, 0.12724871916179836, -0.06610355256513382, -0.026550855215949316, 0.4035663187969476, -0.05699312341554711, -0.3120056966630121, 0.20677978350916723, -0.11996677494607866, -0.16917757862635577, 0.10208425518552151, 0.18238487686418617, 0.13945686252554879, -0.13435589987784624, 0.1740925106848105, -0.12976097560022026, 0.12470712206171204, 0.16092959350983924, 0.044666124847329534, 0.1115278514334932, 0.05777933250647038, 0.13901300311166173, 0.16541595747306323, -0.07686013249864725, -0.07826852057284366, -0.3501433842660238, -0.12344393042925124, -0.25127924942353275, 0.05313294521086694, -0.1573236533825669, -0.220567412111753, 0.3431172208317245, 0.08384915746864863, 0.21131962586271888, 0.1695010070494997, 0.23965907927292088, 0.09849578161568691, 0.03842354201090833, 0.11304121528519318, 0.14104072721784178, 0.18951535808931416, 0.06124366069949853, -0.09070064450012676, -0.018893994730509196, 0.19444058519244814] |
1,803.0312 | Directional wavelets on $n$-dimensional spheres | Directional Poisson wavelets, being directional derivatives of Poisson
kernel, are introduced on $n$-dimensional spheres. It is shown that, slightly
modified and together with another wavelet family, they are an admissible
wavelet pair according to the definition derived from the theory of approximate
identities. We investigate some of the properties of directional Poisson
wavelets, such as recursive formulae for their Fourier coefficients or explicit
representations as functions of spherical variables (for some of the wavelets).
We derive also an explicit formula for their Euclidean limits.
| math.CA math-ph math.MP | directional poisson wavelets being directional derivatives of poisson kernel are introduced on ndimensional spheres it is shown that slightly modified and together with another wavelet family they are an admissible wavelet pair according to the definition derived from the theory of approximate identities we investigate some of the properties of directional poisson wavelets such as recursive formulae for their fourier coefficients or explicit representations as functions of spherical variables for some of the wavelets we derive also an explicit formula for their euclidean limits | [['directional', 'poisson', 'wavelets', 'being', 'directional', 'derivatives', 'of', 'poisson', 'kernel', 'are', 'introduced', 'on', 'ndimensional', 'spheres', 'it', 'is', 'shown', 'that', 'slightly', 'modified', 'and', 'together', 'with', 'another', 'wavelet', 'family', 'they', 'are', 'an', 'admissible', 'wavelet', 'pair', 'according', 'to', 'the', 'definition', 'derived', 'from', 'the', 'theory', 'of', 'approximate', 'identities', 'we', 'investigate', 'some', 'of', 'the', 'properties', 'of', 'directional', 'poisson', 'wavelets', 'such', 'as', 'recursive', 'formulae', 'for', 'their', 'fourier', 'coefficients', 'or', 'explicit', 'representations', 'as', 'functions', 'of', 'spherical', 'variables', 'for', 'some', 'of', 'the', 'wavelets', 'we', 'derive', 'also', 'an', 'explicit', 'formula', 'for', 'their', 'euclidean', 'limits']] | [-0.07978819890940074, 0.07733415396978671, -0.14201787996682383, 0.1158206032414455, -0.14642581111097352, -0.08575411820562467, -0.01773652110465004, 0.4196166691392483, -0.31098086506383316, -0.1888891614840499, 0.11263672470314694, -0.2631728415754402, -0.23297075651464097, 0.22131740423806368, -0.061315746038980296, 0.0916183342314547, -0.037406746486556675, 0.09294274128651955, -0.13434014545193695, -0.22042971849441528, 0.31559504171656, 0.05731433399376415, 0.25530552492654396, -0.04191888586085822, 0.14883974414052709, 0.022118178650825507, -0.13619494766421017, -0.06728079285096014, -0.15772395375106066, 0.16835644409903103, 0.22365756676576676, 0.08404088214350243, 0.18962636016519918, -0.4227550870384134, -0.17391162118431003, 0.12808564325262392, 0.11843402832303018, 0.030037126501113, -0.010014247214366194, -0.30868909623296487, 0.09207737477984101, -0.15764839803644767, -0.17270428249945066, -0.133926915104634, 0.02078084317812075, 0.11235305097597163, -0.29125233374846476, 0.07681649137209336, 0.12654531886246764, 0.029914576205469313, -0.0910695763138522, -0.162320675206415, -0.026604793938098566, 0.04604642951606019, 0.025717966638261543, -0.04333285602652246, 0.07832940733281984, -0.07740780315361917, -0.11011151009283605, 0.3586285560678724, -0.01941527630246821, -0.3547939568580616, 0.16149911979335316, -0.102755491921146, -0.14120194882464907, 0.08953109552662465, 0.16970666656492367, 0.1249798453479473, -0.16564477580998624, 0.11204723976039704, -0.062170954404531846, 0.06654189260942596, 0.1687570038318102, 0.07739041454624385, 0.13897711619903844, -0.010827909035253384, 0.09594297769667935, 0.17047194588840717, -0.05548943568941295, -0.08079773918282063, -0.33011177658946034, -0.17114632354960554, -0.2279860999828781, 0.008185249819819416, -0.19296840992683428, -0.23001093985173307, 0.35694667099354166, 0.04255840897981432, 0.1840683841922631, 0.14118642525170885, 0.2163521506119564, 0.2156510217908016, 0.04647610979043834, 0.013772808309156625, 0.13103896258967107, 0.18720406916413812, 0.026768454867990277, -0.07507921708470565, 0.01496497403076362, 0.17081396043344976] |
1,803.03121 | Generalized Beta Function Defined by Wright Function | The main object of this paper is to present generalizations of gamma, beta
and hypergeometric functions. Some recurrence relations, transformation
formulas, operation formulas and integral representations are obtained for
these new generalizations.
| math.CA | the main object of this paper is to present generalizations of gamma beta and hypergeometric functions some recurrence relations transformation formulas operation formulas and integral representations are obtained for these new generalizations | [['the', 'main', 'object', 'of', 'this', 'paper', 'is', 'to', 'present', 'generalizations', 'of', 'gamma', 'beta', 'and', 'hypergeometric', 'functions', 'some', 'recurrence', 'relations', 'transformation', 'formulas', 'operation', 'formulas', 'and', 'integral', 'representations', 'are', 'obtained', 'for', 'these', 'new', 'generalizations']] | [-0.11741685477318242, 0.07949369709240273, -0.09644729807041585, 0.13187045598533587, -0.15439147496363148, -0.13645543900202028, 0.014418168571864953, 0.3692092638229951, -0.299149026744999, -0.23398026381619275, 0.13046020158799365, -0.27606992941582575, -0.23068424861412495, 0.3062766098883003, -0.07252687119307666, 0.06993482369580306, 0.04461555546731688, 0.005687057389877737, -0.18615270109148696, -0.23377013177378103, 0.3489987651701085, -0.03851840292918496, 0.1647405100375181, -0.0052168164984323084, 0.10170550752081908, 0.006333697805530392, -0.09952450286073145, -0.12164103891700506, -0.20308866689447314, 0.1754060305247549, 0.27479734527878463, 0.13611255421710666, 0.15525179448741255, -0.3453800506540574, -0.10759887640597299, 0.1063217904047633, 0.16020600228512194, -0.008370943578484003, -0.010487748950254172, -0.27113728265976533, 0.02375904651125893, -0.18843219377231435, -0.16147154493955895, -0.15921173233073205, 0.08102626157051418, 0.14384675680776127, -0.2499349784629885, 0.0370287361223518, 0.10393366013886407, 0.04425582245312398, -0.09817391754768323, -0.19530979834962636, 0.12063250990468077, 0.10253544997249264, 0.06264723175991094, -0.03228640870656818, 0.027083245804533362, -0.14416275533585576, -0.13720942637883127, 0.31736909435130656, 0.04377537957043387, -0.24800517171388492, 0.12464032869320363, -0.1595541083952412, -0.28145021641103085, 0.06384254948352464, 0.08928385053877719, 0.12045988830504939, -0.1906997281475924, 0.05184379704223829, -0.04872215575596783, 0.026411591836222215, 0.18843609617033508, 0.0518591329746414, 0.14794060194981284, 0.018719003826845437, -0.03537479636725038, 0.22302710646181367, 0.005963815492577851, -0.0482950498117134, -0.42783556692302227, -0.20579124509822577, -0.09861043785849688, 0.036415120150195435, -0.14058544723866362, -0.14932658715406433, 0.3911503265844658, 0.09413282934110612, 0.12137727899244055, 0.21007548456691438, 0.21922882669605315, 0.2503689602599479, 0.053123601304832846, -0.008643903871416114, 0.0721195543783324, 0.23339668492553756, 0.0624142543238122, -0.1056519088888308, 0.008455626491922885, 0.23540433771268] |
1,803.03122 | A new generalization of beta function with three parameters
Mittag-Leffler function | The main object of this paper is to present a new generalized beta function
which defined by three parametres Mittag-Leffler function. We also introduce
new generalizations of hypergeometric and confluent hypergeometric functions
with the help of new generalized beta function. Furthermore, we obtained
various properties of these functions such as integral representations, Mellin
transforms, differentiation formulas, transformation formulas, recurrence
relations and summation formula.
| math.CA | the main object of this paper is to present a new generalized beta function which defined by three parametres mittagleffler function we also introduce new generalizations of hypergeometric and confluent hypergeometric functions with the help of new generalized beta function furthermore we obtained various properties of these functions such as integral representations mellin transforms differentiation formulas transformation formulas recurrence relations and summation formula | [['the', 'main', 'object', 'of', 'this', 'paper', 'is', 'to', 'present', 'a', 'new', 'generalized', 'beta', 'function', 'which', 'defined', 'by', 'three', 'parametres', 'mittagleffler', 'function', 'we', 'also', 'introduce', 'new', 'generalizations', 'of', 'hypergeometric', 'and', 'confluent', 'hypergeometric', 'functions', 'with', 'the', 'help', 'of', 'new', 'generalized', 'beta', 'function', 'furthermore', 'we', 'obtained', 'various', 'properties', 'of', 'these', 'functions', 'such', 'as', 'integral', 'representations', 'mellin', 'transforms', 'differentiation', 'formulas', 'transformation', 'formulas', 'recurrence', 'relations', 'and', 'summation', 'formula']] | [-0.09276288378215025, 0.06256060257908844, -0.12604586451151778, 0.1506695672740332, -0.1362730392387935, -0.11087996377387926, 0.0302114905031871, 0.3244879872257274, -0.33518986332984196, -0.2239566081395698, 0.06353903365217978, -0.22848724703940135, -0.293635027867461, 0.2525502226891972, -0.0371879553768806, 0.11151164025068283, -0.026588111919986588, -0.037529754873719956, -0.20679198725089903, -0.22687114746723738, 0.38212381721666405, -0.04362771044012218, 0.19882860838154715, 0.02595817404133933, 0.1320862445004639, 0.054863500512308545, -0.07373866865352269, -0.10237399352684853, -0.19967986369830748, 0.12525100428019725, 0.22079806958162596, 0.16547312521715724, 0.21754929754099558, -0.3612255781948093, -0.11730914428416225, 0.09961090506690126, 0.19166103443352595, -0.06886124199197169, -0.02589768101830804, -0.25883448783249136, 0.00693527412497335, -0.25443730187151464, -0.19732237028120647, -0.16211995750015218, 0.016117033489521534, 0.18462240080984813, -0.2720885795600239, 0.08655684815306496, 0.048385860014056405, 0.0343828933527841, -0.07805511840371533, -0.20756108673023327, 0.07682364948263895, 0.0866416456576969, 0.049257694089430426, 0.016249543410681543, 0.03896060200881154, -0.13450340000129055, -0.11040584587802489, 0.272717762191499, -0.04238501813499227, -0.3045744208530301, 0.08490386591958148, -0.16569319663805857, -0.22872979754197692, 0.0483506459092337, 0.1036301156993778, 0.16910447144792193, -0.20653903960353798, 0.04456676527052113, -0.03858555719581625, 0.059426861111119035, 0.17636367643163317, 0.031064248584683925, 0.1230854153603552, 0.022226549093685453, -0.04403115670743679, 0.25385171739709755, 0.0082355137796156, -0.07582748777395676, -0.3982081053157647, -0.24363719540396853, -0.14020829542220334, 0.03180719570567211, -0.16111928935574796, -0.23106728730693696, 0.4304539082305772, 0.0637448900748813, 0.13867704049935417, 0.18353023944932612, 0.21195045858621597, 0.29774277868481086, 0.10396571844697945, -0.056544454820040196, 0.04492175793423066, 0.184177447908691, 0.06735345506892791, -0.11708819104861172, 0.01572421264819919, 0.24979939024215417] |
1,803.03123 | A theoretical interpretation of variance-based convergence criteria in
perturbation-based theories | In QM/MM indirect free energy simulation, QM/MM corrections can be obtained
from integration of partial derivatives of alchemical Hamiltonians or from
perturbation-based estimators including free energy perturbation (FEP) and
acceptance ratio methods. With FEP or exponential averaging, researchers tend
to only sample MM states and calculate single point energy to get the free
energy estimates. In this case the sample size hysteresis arises and the
convergence is determined by bias elimination rather than variance
minimization. Various criteria are proposed to evaluate the convergence issue
and numerical studies are reported. It has been found that criteria including
variance of distribution, effective sample size, information entropies and so
on can be used and they are variance-of-distribution-dependent. However, no
theoretical interpretation is presented. In this paper we present theoretical
interpretations to dig the underlying statistical nature behind the problem.
The convergence criteria are proven to be related with variance of distribution
in Gaussian approximated Exponential averaging. Further, we prove that these
estimators are nonlinearly dependent on the variance of the free energy
estimate. As these estimators are often orders of magnitude overestimated, the
variance of the FEP estimate is orders of magnitude underestimated. Hence,
computing this statistical uncertainty is meaningless. In numerical calculation
from timeseries data the effective sample size is bounded by 1 and N and thus
the variance of the free energy estimate is proven to be bounded by 0 and 1
(kBT)2 for EXP and 0 and 2 (kBT)2 for BAR, which indicates an inevitable
underestimation. Specifically, the upper bounds for these estimators are
sample-size dependent. The effective sample size is proven to be a function of
the overlap scalar, from which the range of the overlap scalar can also be
derived.
| physics.chem-ph cond-mat.stat-mech | in qmmm indirect free energy simulation qmmm corrections can be obtained from integration of partial derivatives of alchemical hamiltonians or from perturbationbased estimators including free energy perturbation fep and acceptance ratio methods with fep or exponential averaging researchers tend to only sample mm states and calculate single point energy to get the free energy estimates in this case the sample size hysteresis arises and the convergence is determined by bias elimination rather than variance minimization various criteria are proposed to evaluate the convergence issue and numerical studies are reported it has been found that criteria including variance of distribution effective sample size information entropies and so on can be used and they are varianceofdistributiondependent however no theoretical interpretation is presented in this paper we present theoretical interpretations to dig the underlying statistical nature behind the problem the convergence criteria are proven to be related with variance of distribution in gaussian approximated exponential averaging further we prove that these estimators are nonlinearly dependent on the variance of the free energy estimate as these estimators are often orders of magnitude overestimated the variance of the fep estimate is orders of magnitude underestimated hence computing this statistical uncertainty is meaningless in numerical calculation from timeseries data the effective sample size is bounded by 1 and n and thus the variance of the free energy estimate is proven to be bounded by 0 and 1 kbt2 for exp and 0 and 2 kbt2 for bar which indicates an inevitable underestimation specifically the upper bounds for these estimators are samplesize dependent the effective sample size is proven to be a function of the overlap scalar from which the range of the overlap scalar can also be derived | [['in', 'qmmm', 'indirect', 'free', 'energy', 'simulation', 'qmmm', 'corrections', 'can', 'be', 'obtained', 'from', 'integration', 'of', 'partial', 'derivatives', 'of', 'alchemical', 'hamiltonians', 'or', 'from', 'perturbationbased', 'estimators', 'including', 'free', 'energy', 'perturbation', 'fep', 'and', 'acceptance', 'ratio', 'methods', 'with', 'fep', 'or', 'exponential', 'averaging', 'researchers', 'tend', 'to', 'only', 'sample', 'mm', 'states', 'and', 'calculate', 'single', 'point', 'energy', 'to', 'get', 'the', 'free', 'energy', 'estimates', 'in', 'this', 'case', 'the', 'sample', 'size', 'hysteresis', 'arises', 'and', 'the', 'convergence', 'is', 'determined', 'by', 'bias', 'elimination', 'rather', 'than', 'variance', 'minimization', 'various', 'criteria', 'are', 'proposed', 'to', 'evaluate', 'the', 'convergence', 'issue', 'and', 'numerical', 'studies', 'are', 'reported', 'it', 'has', 'been', 'found', 'that', 'criteria', 'including', 'variance', 'of', 'distribution', 'effective', 'sample', 'size', 'information', 'entropies', 'and', 'so', 'on', 'can', 'be', 'used', 'and', 'they', 'are', 'varianceofdistributiondependent', 'however', 'no', 'theoretical', 'interpretation', 'is', 'presented', 'in', 'this', 'paper', 'we', 'present', 'theoretical', 'interpretations', 'to', 'dig', 'the', 'underlying', 'statistical', 'nature', 'behind', 'the', 'problem', 'the', 'convergence', 'criteria', 'are', 'proven', 'to', 'be', 'related', 'with', 'variance', 'of', 'distribution', 'in', 'gaussian', 'approximated', 'exponential', 'averaging', 'further', 'we', 'prove', 'that', 'these', 'estimators', 'are', 'nonlinearly', 'dependent', 'on', 'the', 'variance', 'of', 'the', 'free', 'energy', 'estimate', 'as', 'these', 'estimators', 'are', 'often', 'orders', 'of', 'magnitude', 'overestimated', 'the', 'variance', 'of', 'the', 'fep', 'estimate', 'is', 'orders', 'of', 'magnitude', 'underestimated', 'hence', 'computing', 'this', 'statistical', 'uncertainty', 'is', 'meaningless', 'in', 'numerical', 'calculation', 'from', 'timeseries', 'data', 'the', 'effective', 'sample', 'size', 'is', 'bounded', 'by', '1', 'and', 'n', 'and', 'thus', 'the', 'variance', 'of', 'the', 'free', 'energy', 'estimate', 'is', 'proven', 'to', 'be', 'bounded', 'by', '0', 'and', '1', 'kbt2', 'for', 'exp', 'and', '0', 'and', '2', 'kbt2', 'for', 'bar', 'which', 'indicates', 'an', 'inevitable', 'underestimation', 'specifically', 'the', 'upper', 'bounds', 'for', 'these', 'estimators', 'are', 'samplesize', 'dependent', 'the', 'effective', 'sample', 'size', 'is', 'proven', 'to', 'be', 'a', 'function', 'of', 'the', 'overlap', 'scalar', 'from', 'which', 'the', 'range', 'of', 'the', 'overlap', 'scalar', 'can', 'also', 'be', 'derived']] | [-0.052043157714789595, 0.10987717227549851, -0.09932762890466652, 0.12879050157690508, -0.03828268749372346, -0.10895757872184011, 0.0405623282996043, 0.3804811973184828, -0.263373597835501, -0.3577578429259547, 0.13266715238590168, -0.28499499941077816, -0.06713478254236942, 0.19420750582871096, -0.058351696446357716, 0.07041471039101908, 0.03059763566250362, 0.01658543595363216, -0.07166244290764093, -0.2588221968483767, 0.27263820195181704, 0.07264187912069475, 0.27421695692631615, 0.04919607188188768, 0.04822426391840582, -0.027192374898327723, -0.062368080100064636, 0.0479459420481186, -0.16923617218199852, 0.12270986688040417, 0.23994351677783501, 0.09216637462027051, 0.28463245196581743, -0.36851909016544315, -0.20684957857440664, 0.13025073278244706, 0.1842978046151332, 0.10043102501153839, -0.01218006091933417, -0.23969516778818756, 0.10043096512983349, -0.14309416616612572, -0.11181254751352747, -0.0992014987501032, -7.134313798613018e-05, 0.04823533211556, -0.3043384116483472, 0.13286948862141765, 0.03171711759207817, 0.052159677554939214, -0.055883874774136075, -0.19132744496534695, -0.009732803282675109, 0.08803947908448316, 0.09497478489403523, 0.00839269312898091, 0.14791525428861005, -0.0929103602793084, -0.07948010773806896, 0.3245959264696926, -0.043002212383230654, -0.21997305160539815, 0.15197842705854644, -0.12377493641269142, -0.08346715842800942, 0.15148320750460215, 0.14980778208680076, 0.10316103843719228, -0.15863652227239478, 0.09212999932044837, 0.029123321095461487, 0.16943302686548606, 0.05358502179497726, 0.04151728285241231, 0.12650840236910946, 0.11360131185852311, 0.08833496597608866, 0.11248715347977602, -0.09014348273906576, -0.1115860984523824, -0.30513334836089806, -0.1145304741319536, -0.220408773912187, 0.05622980190193995, -0.12052296629040143, -0.1576701605865251, 0.3363389585594443, 0.1708325428642436, 0.17369433888985264, 0.0832477403132038, 0.2927773718431752, 0.1916896900125382, 0.060452739405260594, 0.08133349954132883, 0.24937601180707095, 0.1339388607073188, 0.012994156402659246, -0.1996153587154964, 0.1112789159922737, 0.032697728191111004] |
1,803.03124 | A note on the transformation of the linear differential equation into a
system of the first order equations | A generalization of the already studied transformations of the linear
differential equation into a system of the first order equations is given. The
proposed transformation gives possibility to get new forms of the N-dimensional
system of first order equations that can be useful for analysis of the
solutions of the N-th order differential equations. In particular, for the
third-order linear equation the nonlinear second-order equation that plays the
same role as the Riccati equation for second-order linear equation is obtained.
| math.CA | a generalization of the already studied transformations of the linear differential equation into a system of the first order equations is given the proposed transformation gives possibility to get new forms of the ndimensional system of first order equations that can be useful for analysis of the solutions of the nth order differential equations in particular for the thirdorder linear equation the nonlinear secondorder equation that plays the same role as the riccati equation for secondorder linear equation is obtained | [['a', 'generalization', 'of', 'the', 'already', 'studied', 'transformations', 'of', 'the', 'linear', 'differential', 'equation', 'into', 'a', 'system', 'of', 'the', 'first', 'order', 'equations', 'is', 'given', 'the', 'proposed', 'transformation', 'gives', 'possibility', 'to', 'get', 'new', 'forms', 'of', 'the', 'ndimensional', 'system', 'of', 'first', 'order', 'equations', 'that', 'can', 'be', 'useful', 'for', 'analysis', 'of', 'the', 'solutions', 'of', 'the', 'nth', 'order', 'differential', 'equations', 'in', 'particular', 'for', 'the', 'thirdorder', 'linear', 'equation', 'the', 'nonlinear', 'secondorder', 'equation', 'that', 'plays', 'the', 'same', 'role', 'as', 'the', 'riccati', 'equation', 'for', 'secondorder', 'linear', 'equation', 'is', 'obtained']] | [-0.15877859017346055, 0.0033812267356552184, -0.11137851279345341, 0.02359816715470515, -0.1168061301112175, -0.09571786817978137, -0.07638053130358458, 0.18670072657987474, -0.32267190935090184, -0.24954420658759774, 0.09453426310064969, -0.30850200820714235, -0.1987435367424041, 0.2114788785111159, 0.0379339266452007, 0.1298552994383499, 0.01873466491815634, 0.07151770999771542, -0.1341211649705656, -0.267099814559333, 0.3691867572139017, -0.008932538121007383, 0.2221634798217565, -0.03216812402242795, 0.22992372189764865, -0.010441741929389537, 0.013770905107958243, 0.0159365848172456, -0.13418787152713776, 0.08175204091239721, 0.2636737519642338, 0.053646998926251396, 0.2814416413777508, -0.410007904516533, -0.19946045763790607, 0.0706297141732648, 0.14678557759616523, 0.1557005608221516, -0.04333858089694331, -0.2906467108987272, 0.0805805234820582, -0.12273579442407936, -0.19898391547612845, -0.09938489220803604, 0.005196426552720368, 0.053888466756325214, -0.2857625270495191, 0.11225698918874513, 0.13736946018689195, -0.03674568493061088, -0.11750753771048039, -0.07471608152554836, -0.04718548534438014, 0.09166478521656245, -0.016159547402639873, -0.020769682753598317, -0.018890057009411976, -0.12737496550544164, -0.07268110343720764, 0.44674677127040924, -0.13407501400652108, -0.27611658519599586, 0.05219345277873799, -0.1317962260101922, -0.12429033519292716, 0.13131860028079245, 0.21634722278104163, 0.15792113160714508, -0.19547727452591063, 0.11555726670194418, -0.038809141947422174, 0.1842881583084818, 0.06214043037034571, -0.010784654290182516, 0.09162691006204113, 0.14631050513999072, 0.08930041588027962, 0.15413113831164083, 0.031760251126252116, -0.1683854548551608, -0.3717682437039912, -0.20817962230648845, -0.09366193034220487, 0.05217293609312037, -0.12989333967561834, -0.13766185415443033, 0.3830827693454921, 0.10131187793449499, 0.12429433389334008, 0.012156066059833392, 0.2485235452884808, 0.33220269731100416, 0.024634448019787668, -0.0025806646561250092, 0.21467551996465772, 0.22687705510761588, 0.13850153450621291, -0.2593679889876512, 0.07195132513879798, 0.17881027287221513] |
1,803.03125 | Ages for exoplanet host stars | Age is an important characteristic of a planetary system, but also one that
is difficult to determine. Assuming that the host star and the planets are
formed at the same time, the challenge is to determine the stellar age.
Asteroseismology provides precise age determination, but in many cases the
required detailed pulsation observations are not available. Here we concentrate
on other techniques, which may have broader applicability but also serious
limitations. Further development of this area requires improvements in our
understanding of the evolution of stars and their age-dependent
characteristics, combined with observations that allow reliable calibration of
the various techniques.
| astro-ph.SR astro-ph.EP | age is an important characteristic of a planetary system but also one that is difficult to determine assuming that the host star and the planets are formed at the same time the challenge is to determine the stellar age asteroseismology provides precise age determination but in many cases the required detailed pulsation observations are not available here we concentrate on other techniques which may have broader applicability but also serious limitations further development of this area requires improvements in our understanding of the evolution of stars and their agedependent characteristics combined with observations that allow reliable calibration of the various techniques | [['age', 'is', 'an', 'important', 'characteristic', 'of', 'a', 'planetary', 'system', 'but', 'also', 'one', 'that', 'is', 'difficult', 'to', 'determine', 'assuming', 'that', 'the', 'host', 'star', 'and', 'the', 'planets', 'are', 'formed', 'at', 'the', 'same', 'time', 'the', 'challenge', 'is', 'to', 'determine', 'the', 'stellar', 'age', 'asteroseismology', 'provides', 'precise', 'age', 'determination', 'but', 'in', 'many', 'cases', 'the', 'required', 'detailed', 'pulsation', 'observations', 'are', 'not', 'available', 'here', 'we', 'concentrate', 'on', 'other', 'techniques', 'which', 'may', 'have', 'broader', 'applicability', 'but', 'also', 'serious', 'limitations', 'further', 'development', 'of', 'this', 'area', 'requires', 'improvements', 'in', 'our', 'understanding', 'of', 'the', 'evolution', 'of', 'stars', 'and', 'their', 'agedependent', 'characteristics', 'combined', 'with', 'observations', 'that', 'allow', 'reliable', 'calibration', 'of', 'the', 'various', 'techniques']] | [-0.06429959338453442, 0.10397870156877688, -0.10180454800772194, 0.08890471129106486, -0.1475036589816065, -0.09990864682776651, 0.05522060629423007, 0.4009503174462531, -0.19478279224015993, -0.3593379906240371, 0.142194227551774, -0.22187146119828713, -0.09284986102363409, 0.2625526355966778, -0.09844281069362665, 0.02092526790381658, 0.1486541625103074, 0.01303866755973437, -0.05797997784874596, -0.2848987095703435, 0.29751871444635314, 0.0696696416050712, 0.19617769577180838, 0.05962368861615363, 0.022499552854143158, -0.06544292231071924, -0.08623920226617172, -0.03799946163653118, -0.1740898500175168, 0.11252112814806181, 0.26178141784511905, 0.19039485387338123, 0.2686139019113956, -0.4136424125748511, -0.23373827217884435, 0.06799187875435789, 0.2028181995610974, 0.09079402953381696, -0.054455232438815775, -0.20001625541671372, 0.07477967057487753, -0.14600140159709915, -0.17366267169484556, -0.03587973298560275, 0.06125077029856125, 0.022603636176445254, -0.21549534123151168, 0.061097516296177844, 0.050268337310356376, 0.09789412022374644, -0.09033147859995687, -0.13521069638998165, -0.005543479669405756, 0.21056311451230603, 0.04369746538865758, 0.0015014112825588424, 0.12498129024700548, -0.1274240025028697, -0.039108477634294786, 0.4044658867365653, -0.03655092517780786, -0.12153636496329662, 0.26275633260755255, -0.17765321474669887, -0.19363918844241612, 0.0885981892288598, 0.1539391309465512, 0.11427020559105838, -0.18466668348243037, 0.008444728563760988, 0.01663913740084903, 0.19561803322469834, 0.009397496271067032, 0.0742079171693266, 0.28412641743244144, 0.1794524456254474, 0.048694339853430184, 0.029856154545888046, -0.14309057407772705, -0.07218261415341704, -0.2303181107958207, -0.12501355972934033, -0.11569537651162631, 0.04284212490014091, -0.09132215221116255, -0.15088911818502942, 0.38370877235325623, 0.21650131271418996, 0.16137100203022692, 0.019617849487193518, 0.30704902586444177, 0.0933404496725704, 0.10748086854732494, 0.0544160400000908, 0.29343967135801985, 0.13625975486149292, 0.08872714475036995, -0.24006124874715243, 0.15202678171087905, -0.048911325827167174] |
1,803.03126 | On the Nature of Discrete Space-Time: Part 1: The distance formula,
relativistic time dilation and length contraction in discrete space-time | In this work, the relativistic phenomena of Lorentz-Fitzgerald contraction
and time dilation are derived using a modified distance formula that is
appropriate for discrete space. This new distance formula is different than the
Pythagorean theorem but converges to it for distances large relative to the
Planck length. First, four candidate formulas developed by different people
over the last 70 years will be discussed. Three of the formulas are shown to be
identical for conditions that best describe discrete space. It is shown that
this new distance formula is valid for all size-scales -- from the Planck
length upwards -- and solves two major problems historically associated with
the discrete space-time (DST) model. One problem it solves is the widely
believed anisotropic nature of most discrete space models. Just as commonly
believed is the second problem -- the incompatibility of DST's concept of an
immutable atom of space and the length contraction of this atom required by
special relativity. The new formula for distance in DST solves this problem. It
is shown that length contraction of the atom of space does not occur for any
relative velocity of two reference frames. It is also shown that time dilation
of the atom of time does not occur. Also discussed is the possibility of any
object being able to travel at the speed of light for specific temporal
durations given by an equation derived in this work. Also discussed is a method
to empirical verify the discreteness of space by studying any observed
anomalies in the motion of astronomical bodies, such as differences in the
bodies' inertial masses and gravitational masses. The importance of the new
distance formula for causal set theory and other theories of quantum gravity is
also discussed.
| physics.gen-ph gr-qc | in this work the relativistic phenomena of lorentzfitzgerald contraction and time dilation are derived using a modified distance formula that is appropriate for discrete space this new distance formula is different than the pythagorean theorem but converges to it for distances large relative to the planck length first four candidate formulas developed by different people over the last 70 years will be discussed three of the formulas are shown to be identical for conditions that best describe discrete space it is shown that this new distance formula is valid for all sizescales from the planck length upwards and solves two major problems historically associated with the discrete spacetime dst model one problem it solves is the widely believed anisotropic nature of most discrete space models just as commonly believed is the second problem the incompatibility of dsts concept of an immutable atom of space and the length contraction of this atom required by special relativity the new formula for distance in dst solves this problem it is shown that length contraction of the atom of space does not occur for any relative velocity of two reference frames it is also shown that time dilation of the atom of time does not occur also discussed is the possibility of any object being able to travel at the speed of light for specific temporal durations given by an equation derived in this work also discussed is a method to empirical verify the discreteness of space by studying any observed anomalies in the motion of astronomical bodies such as differences in the bodies inertial masses and gravitational masses the importance of the new distance formula for causal set theory and other theories of quantum gravity is also discussed | [['in', 'this', 'work', 'the', 'relativistic', 'phenomena', 'of', 'lorentzfitzgerald', 'contraction', 'and', 'time', 'dilation', 'are', 'derived', 'using', 'a', 'modified', 'distance', 'formula', 'that', 'is', 'appropriate', 'for', 'discrete', 'space', 'this', 'new', 'distance', 'formula', 'is', 'different', 'than', 'the', 'pythagorean', 'theorem', 'but', 'converges', 'to', 'it', 'for', 'distances', 'large', 'relative', 'to', 'the', 'planck', 'length', 'first', 'four', 'candidate', 'formulas', 'developed', 'by', 'different', 'people', 'over', 'the', 'last', '70', 'years', 'will', 'be', 'discussed', 'three', 'of', 'the', 'formulas', 'are', 'shown', 'to', 'be', 'identical', 'for', 'conditions', 'that', 'best', 'describe', 'discrete', 'space', 'it', 'is', 'shown', 'that', 'this', 'new', 'distance', 'formula', 'is', 'valid', 'for', 'all', 'sizescales', 'from', 'the', 'planck', 'length', 'upwards', 'and', 'solves', 'two', 'major', 'problems', 'historically', 'associated', 'with', 'the', 'discrete', 'spacetime', 'dst', 'model', 'one', 'problem', 'it', 'solves', 'is', 'the', 'widely', 'believed', 'anisotropic', 'nature', 'of', 'most', 'discrete', 'space', 'models', 'just', 'as', 'commonly', 'believed', 'is', 'the', 'second', 'problem', 'the', 'incompatibility', 'of', 'dsts', 'concept', 'of', 'an', 'immutable', 'atom', 'of', 'space', 'and', 'the', 'length', 'contraction', 'of', 'this', 'atom', 'required', 'by', 'special', 'relativity', 'the', 'new', 'formula', 'for', 'distance', 'in', 'dst', 'solves', 'this', 'problem', 'it', 'is', 'shown', 'that', 'length', 'contraction', 'of', 'the', 'atom', 'of', 'space', 'does', 'not', 'occur', 'for', 'any', 'relative', 'velocity', 'of', 'two', 'reference', 'frames', 'it', 'is', 'also', 'shown', 'that', 'time', 'dilation', 'of', 'the', 'atom', 'of', 'time', 'does', 'not', 'occur', 'also', 'discussed', 'is', 'the', 'possibility', 'of', 'any', 'object', 'being', 'able', 'to', 'travel', 'at', 'the', 'speed', 'of', 'light', 'for', 'specific', 'temporal', 'durations', 'given', 'by', 'an', 'equation', 'derived', 'in', 'this', 'work', 'also', 'discussed', 'is', 'a', 'method', 'to', 'empirical', 'verify', 'the', 'discreteness', 'of', 'space', 'by', 'studying', 'any', 'observed', 'anomalies', 'in', 'the', 'motion', 'of', 'astronomical', 'bodies', 'such', 'as', 'differences', 'in', 'the', 'bodies', 'inertial', 'masses', 'and', 'gravitational', 'masses', 'the', 'importance', 'of', 'the', 'new', 'distance', 'formula', 'for', 'causal', 'set', 'theory', 'and', 'other', 'theories', 'of', 'quantum', 'gravity', 'is', 'also', 'discussed']] | [-0.09805170468610237, 0.16365339633561427, -0.07841404599644113, 0.1114223074797018, -0.07365048831214377, -0.12284066104575207, -0.010622604194162577, 0.35183781854841006, -0.284170841989761, -0.2844937648869267, 0.0817764119184862, -0.23254317932174, -0.130554509014218, 0.24397453917108738, -0.07747323956256814, 0.0589004469010162, 0.041976930065848454, 0.06461894855785527, -0.07452703422719711, -0.2403634650796129, 0.3142914671156751, 0.06549038187674197, 0.24482519088411017, 0.040371483777600685, 0.12618057371256056, -0.011374394536802643, -0.03781590569752121, 0.03889507313867573, -0.12008175981017095, 0.10266239824990758, 0.22038373063016414, 0.14443254154216367, 0.25972816764393397, -0.3804061821302432, -0.23539278689249044, 0.109075507591887, 0.10636821094192687, 0.11392386240329136, -0.011276291962713004, -0.26487601418048146, 0.06860210977029055, -0.14047862325035232, -0.1600311091349444, -0.014574943870926896, 0.10628248901482214, -0.008843811813807279, -0.2250957969764019, 0.08173685384824414, 0.06755953119815482, 0.015643708259296164, -0.08369390326470398, -0.08073711592434464, 0.01389406722676205, 0.12234877004990713, 0.07804763253549474, 0.052540271822363135, 0.07301223173231017, -0.047550789220769184, -0.1124032078899051, 0.4402041003696228, -0.04117675883018436, -0.18532073281198871, 0.16910902669391872, -0.1352902460173426, -0.12928789840243235, 0.11314147481931733, 0.11747756648171497, 0.13470116656502348, -0.17217642917653153, 0.0790091721575887, -0.05428675507611938, 0.15342019932516116, 0.11144993513610149, 0.031457197533822374, 0.18995886483176594, 0.11676769893322336, 0.07993609419484672, 0.09839597099742509, -0.07930202781357558, -0.11318894797249844, -0.33805105963828075, -0.17868633175170737, -0.21533710607531759, 0.002577459260212715, -0.10885600072159146, -0.14556805049613009, 0.33015392002110416, 0.15493601967030196, 0.16810401412249917, 0.0589032123437184, 0.26802549823922545, 0.12488768844412877, 0.09095634407940292, 0.06481508320981735, 0.2561557079322244, 0.12502699105657245, 0.07451082461211307, -0.19261896457337252, 0.059628072099988924, 0.10339600646116755] |
1,803.03127 | Alleviating State-space Explosion in Component-based Systems with
Distributed, Parallel Reachability Analysis Algorithm | In this work, we alleviate the well-known State-Space Explosion (SSE) problem
in Component Based Systems (CBS). We consider CBS that can be specified as a
system of n Communicating Finite State Machines (CFSMs) interacting by
rendezvous/handshake method. In order to avoid the SSE incurred by the
traditional product machine composition of the given input CFSMs based on
interleaving semantics, we construct a sum machine composition based on
state-oriented partial-order semantics. The sum machine consists of a set of n
unfolded CFSMs. By storing statically, just a small subset of global state
vectors at synchronization points, called the synchronous environment vectors
and generating the rest of the global-state vectors dynamically on need basis
depending on the reachability to be verified, the sum machine alleviates the
SSE of the product machine. We demonstrate the implementation of checking the
reachability of global state vector from the checking of local reachabilities
of the components of the given state vector, through a parallel, distributed
algorithm. Parallel and distributed algorithms to generate the sum machine and
verifying the reachability in it both without exponential complexity are the
contributions of this work. Keywords: interleaving semantics, partial-order
semantics, sum machine, product machine, synchronization points, synchronous
environment state vectors, reachability.
| cs.LO cs.MA | in this work we alleviate the wellknown statespace explosion sse problem in component based systems cbs we consider cbs that can be specified as a system of n communicating finite state machines cfsms interacting by rendezvoushandshake method in order to avoid the sse incurred by the traditional product machine composition of the given input cfsms based on interleaving semantics we construct a sum machine composition based on stateoriented partialorder semantics the sum machine consists of a set of n unfolded cfsms by storing statically just a small subset of global state vectors at synchronization points called the synchronous environment vectors and generating the rest of the globalstate vectors dynamically on need basis depending on the reachability to be verified the sum machine alleviates the sse of the product machine we demonstrate the implementation of checking the reachability of global state vector from the checking of local reachabilities of the components of the given state vector through a parallel distributed algorithm parallel and distributed algorithms to generate the sum machine and verifying the reachability in it both without exponential complexity are the contributions of this work keywords interleaving semantics partialorder semantics sum machine product machine synchronization points synchronous environment state vectors reachability | [['in', 'this', 'work', 'we', 'alleviate', 'the', 'wellknown', 'statespace', 'explosion', 'sse', 'problem', 'in', 'component', 'based', 'systems', 'cbs', 'we', 'consider', 'cbs', 'that', 'can', 'be', 'specified', 'as', 'a', 'system', 'of', 'n', 'communicating', 'finite', 'state', 'machines', 'cfsms', 'interacting', 'by', 'rendezvoushandshake', 'method', 'in', 'order', 'to', 'avoid', 'the', 'sse', 'incurred', 'by', 'the', 'traditional', 'product', 'machine', 'composition', 'of', 'the', 'given', 'input', 'cfsms', 'based', 'on', 'interleaving', 'semantics', 'we', 'construct', 'a', 'sum', 'machine', 'composition', 'based', 'on', 'stateoriented', 'partialorder', 'semantics', 'the', 'sum', 'machine', 'consists', 'of', 'a', 'set', 'of', 'n', 'unfolded', 'cfsms', 'by', 'storing', 'statically', 'just', 'a', 'small', 'subset', 'of', 'global', 'state', 'vectors', 'at', 'synchronization', 'points', 'called', 'the', 'synchronous', 'environment', 'vectors', 'and', 'generating', 'the', 'rest', 'of', 'the', 'globalstate', 'vectors', 'dynamically', 'on', 'need', 'basis', 'depending', 'on', 'the', 'reachability', 'to', 'be', 'verified', 'the', 'sum', 'machine', 'alleviates', 'the', 'sse', 'of', 'the', 'product', 'machine', 'we', 'demonstrate', 'the', 'implementation', 'of', 'checking', 'the', 'reachability', 'of', 'global', 'state', 'vector', 'from', 'the', 'checking', 'of', 'local', 'reachabilities', 'of', 'the', 'components', 'of', 'the', 'given', 'state', 'vector', 'through', 'a', 'parallel', 'distributed', 'algorithm', 'parallel', 'and', 'distributed', 'algorithms', 'to', 'generate', 'the', 'sum', 'machine', 'and', 'verifying', 'the', 'reachability', 'in', 'it', 'both', 'without', 'exponential', 'complexity', 'are', 'the', 'contributions', 'of', 'this', 'work', 'keywords', 'interleaving', 'semantics', 'partialorder', 'semantics', 'sum', 'machine', 'product', 'machine', 'synchronization', 'points', 'synchronous', 'environment', 'state', 'vectors', 'reachability']] | [-0.17523535267782198, 0.09684140984806695, -0.04497262913892841, 0.025901531329847658, -0.09345608520036067, -0.13198541013416296, 0.11613068636272796, 0.34733962570902094, -0.34603265166076735, -0.2685711156183751, 0.08978259051920631, -0.24004378475847854, -0.07317130082993577, 0.13471754472562342, -0.05893852720832705, 0.11085608678790343, 0.10873968457222809, 0.09077843812986947, -0.06086343510123789, -0.26275379428155626, 0.32871841056735707, -0.002356758662359087, 0.30454181263869134, -0.05672426283331448, 0.1119564936365277, 0.06837484191040785, -0.010204528561376746, 0.0031608563786999664, -0.01615806421442408, 0.14665973080666128, 0.26740820664706544, 0.2516582671403136, 0.2753788186050016, -0.42406052036033054, -0.14163922297361134, 0.13611357935222249, 0.13189551474446964, 0.0776641976986848, 0.028934216858051604, -0.3094007670972964, 0.10641764237629671, -0.19025800028820544, -0.029160341288866336, -0.0940206027800339, -0.016747155198686987, 0.03298064620537103, -0.24946352641973363, -0.01215669472500607, 0.10592379712677519, 0.07533049512094112, -0.07201193115468038, -0.12148976820958637, 0.0066134090238161875, 0.0847394206121227, -0.003438509998950714, 0.03849932407707575, 0.12097383321651337, -0.08658057541426169, -0.21146483812013164, 0.3649224264257068, -0.056041057993208604, -0.21791679237211056, 0.15429758835623705, -0.0037268857780525734, -0.11958695352358285, 0.07943982948623972, 0.21530799305618709, 0.10319607981715244, -0.14829240642469282, 0.08985816137590234, -0.03735328047774994, 0.19799583425965328, 0.05321313990467233, 0.010436431231005258, 0.18441507931162215, 0.19345117846138812, 0.05612789493503287, 0.1769182986834896, -0.00923835069886479, -0.1300877088109902, -0.27878267492750314, -0.16017973547492495, -0.1986498909103848, -0.004905578530576061, -0.08988776910869023, -0.1987796900419509, 0.37898175029701847, 0.16766290504242007, 0.18627217730469814, 0.11410794823979503, 0.35152205812683956, 0.10598594560450231, 0.07245876217008236, 0.1506526692597188, 0.15094402577522112, 0.10410076646419739, 0.10287493856298507, -0.22228021649127516, 0.12531511051286054, 0.10606312700055877] |
1,803.03128 | Towards the effective action of Non-Perturbative Gauge-Higgs Unification
(or on RG flows near quantum phase transitions) | We make a few general comments on the Renormalization Group flows in certain
Yang-Mills theories in the vicinity of phase transitions. We then present a
model in d=5 with non-periodic boundary conditions where a possible RG flow
starts from the trivial point and ends on a quantum phase transition. Near the
endpoint of the flow interesting comments can be made about the Higgs hierarchy
problem.
| hep-th | we make a few general comments on the renormalization group flows in certain yangmills theories in the vicinity of phase transitions we then present a model in d5 with nonperiodic boundary conditions where a possible rg flow starts from the trivial point and ends on a quantum phase transition near the endpoint of the flow interesting comments can be made about the higgs hierarchy problem | [['we', 'make', 'a', 'few', 'general', 'comments', 'on', 'the', 'renormalization', 'group', 'flows', 'in', 'certain', 'yangmills', 'theories', 'in', 'the', 'vicinity', 'of', 'phase', 'transitions', 'we', 'then', 'present', 'a', 'model', 'in', 'd5', 'with', 'nonperiodic', 'boundary', 'conditions', 'where', 'a', 'possible', 'rg', 'flow', 'starts', 'from', 'the', 'trivial', 'point', 'and', 'ends', 'on', 'a', 'quantum', 'phase', 'transition', 'near', 'the', 'endpoint', 'of', 'the', 'flow', 'interesting', 'comments', 'can', 'be', 'made', 'about', 'the', 'higgs', 'hierarchy', 'problem']] | [-0.1825718606983383, 0.18372788426394646, -0.10626319088041783, 0.049160762518071215, -0.08302600275223646, -0.17565986319230154, 0.09276888961187349, 0.3531733210843343, -0.2452411766164005, -0.21182860464144213, 0.16204279055281615, -0.3167646881766044, -0.1583344206572152, 0.12082795860030904, -0.04516581349934523, 0.06511633886884038, 0.051087246376734514, 0.125068752725537, -0.15847427196030578, -0.19777365852720463, 0.35740547257547195, -0.02632864072668151, 0.21663632689473722, 0.09398930246870105, 0.031571458323070636, -0.04412915075484377, 0.024740154668688775, 0.024913580486407648, -0.17112525671075743, 0.03639519160720878, 0.22899066199763463, 0.004885678838651914, 0.20935624830711347, -0.4310542998692164, -0.2315379280453691, 0.06910638523516424, 0.1314362556888507, 0.1501334920597191, -0.05978420278272377, -0.32443311733122054, 0.059809262892947745, -0.13951743740874986, -0.13826369508527792, -0.021677121974957678, -0.02854858389697396, -0.08012840808011018, -0.22174420699190636, 0.06489685567883918, -0.00583012061050305, 0.06118494934187486, -0.0094951690819401, -0.03797935541683378, -0.04467975434202414, 0.12322345982807187, 0.08551793796762537, 0.04064158758578392, 0.12369463577006871, -0.19975852856699092, -0.08022945009601803, 0.4078390600876166, -0.05591841206097832, -0.15382194402627647, 0.17213174406295786, -0.13905651573664868, -0.1538777619958497, 0.12393716384585086, 0.16034421412130961, 0.15324797491328074, -0.09399061429385956, 0.1124285570336864, -0.05715349949717235, 0.15163427806468321, 0.05838742685289337, -0.04139964496269106, 0.25660161754259697, 0.13621140696968023, 0.08648058422482931, 0.16452231369733525, -0.01673253762464111, -0.16093809589107808, -0.40450813695788385, -0.13793060531696447, -0.08001224198020422, 0.09709432012258241, -0.11662194066157099, -0.1639496337550764, 0.4113373481453611, 0.1706400425459903, 0.23897428588511851, -0.022322284415937386, 0.19699036439594167, 0.08521093249034423, 0.011515051398712855, 0.09908061632170127, 0.2372061700775073, 0.12058794479817152, 0.120153595170436, -0.19551964908191272, -0.05607832323473234, 0.16142808772050418] |
1,803.03129 | Quantum phases of a three-level matter-radiation interaction model using
$SU(3)$ coherent states with different cooperation numbers | We use coherent states as trial states for a variational approach to study a
system of a finite number of three-level atoms interacting in a dipolar
approximation with a one-mode electromagnetic field. The atoms are treated as
semi-distinguishable using different cooperation numbers and representations of
SU(3). We focus our analysis on the quantum phases of the system as well as the
behavior of the most relevant observables near the phase transitions. The
results are computed for all three possible configurations ($\Xi$, $\Lambda$
and $V$) of the three-level atoms.
| quant-ph | we use coherent states as trial states for a variational approach to study a system of a finite number of threelevel atoms interacting in a dipolar approximation with a onemode electromagnetic field the atoms are treated as semidistinguishable using different cooperation numbers and representations of su3 we focus our analysis on the quantum phases of the system as well as the behavior of the most relevant observables near the phase transitions the results are computed for all three possible configurations xi lambda and v of the threelevel atoms | [['we', 'use', 'coherent', 'states', 'as', 'trial', 'states', 'for', 'a', 'variational', 'approach', 'to', 'study', 'a', 'system', 'of', 'a', 'finite', 'number', 'of', 'threelevel', 'atoms', 'interacting', 'in', 'a', 'dipolar', 'approximation', 'with', 'a', 'onemode', 'electromagnetic', 'field', 'the', 'atoms', 'are', 'treated', 'as', 'semidistinguishable', 'using', 'different', 'cooperation', 'numbers', 'and', 'representations', 'of', 'su3', 'we', 'focus', 'our', 'analysis', 'on', 'the', 'quantum', 'phases', 'of', 'the', 'system', 'as', 'well', 'as', 'the', 'behavior', 'of', 'the', 'most', 'relevant', 'observables', 'near', 'the', 'phase', 'transitions', 'the', 'results', 'are', 'computed', 'for', 'all', 'three', 'possible', 'configurations', 'xi', 'lambda', 'and', 'v', 'of', 'the', 'threelevel', 'atoms']] | [-0.15926474841557786, 0.20086276648437668, -0.0316419113432753, 0.05472166494241562, 0.043961215791046275, -0.1332921364515934, 0.06695176678945193, 0.3598179692595169, -0.20724289773979448, -0.2569478968929114, 0.0267026955730164, -0.3046456090677744, -0.10985775537060938, 0.17728295985438014, 0.09045764401383784, 0.06154418130399895, 0.049909829392215645, 0.06984356817007921, -0.05712674601049023, -0.19773379227296375, 0.35194267617303066, -0.019600359499508023, 0.25222713439778865, 0.003734798347256307, 0.08506524313947764, 0.009682299060768437, 0.08263529313663984, 0.030963837318978775, -0.08643617345576828, 0.09016019332787321, 0.2520328135491916, 0.08892921246748803, 0.2453025356336529, -0.4334609344087798, -0.20269434016743867, 0.08180437149244478, 0.14220568664062866, 0.17924969711865502, 0.0010080948811902225, -0.3361520442747693, -0.007508031156813276, -0.17815293428413143, -0.13754641441307192, -0.12044512933312819, -0.004220317121884176, 0.05760938700438402, -0.2711704595806612, 0.025299834628086323, 0.023898484882491845, 0.0853592500240467, -0.08177692206822679, -0.12647835137697214, 0.0018334564198900399, 0.12133292050432713, -0.012128271847620777, -0.002806454680153522, 0.12678452332814535, -0.15980290023652816, -0.13564528954675656, 0.4336592676225065, -0.09704205224119213, -0.18494195199903402, 0.19286234924655365, -0.09164715598718044, -0.10426334245665662, 0.0797526848250893, 0.15676316732390858, 0.1592494950083823, -0.09377420129489968, 0.06645154717362262, -0.059658005171262754, 0.1395164245763665, 0.03889277625036822, 0.10240638588994057, 0.17468420195596657, 0.15733150053426795, 0.01844827220614614, 0.17111514621392834, -0.0822552278150815, -0.1495352130571926, -0.34059133372087586, -0.1538535881380754, -0.21203553651850243, 0.03125798487206172, -0.05711488159264347, -0.16897156242623754, 0.39756847464147654, 0.0993825821085544, 0.20893178259332976, -0.014182826613836077, 0.25701742233901187, 0.11864780604266616, 0.006988861426796721, 0.006238917525772048, 0.22953752294482513, 0.1852127924433042, 0.0333635747785969, -0.25456624068640943, -0.021283136798475665, 0.052519174260569026] |
1,803.0313 | From Cantor to Semi-hyperbolic Parameter along External Rays | For the quadratic family $f_{c}(z) = z^2+c$ with $c$ in the exterior of the
Mandelbrot set, it is known that every point in the Julia set moves
holomorphically. Let $\hat{c}$ be a semi-hyperbolic parameter in the boundary
of the Mandelbrot set. In this paper we prove that for each $z = z(c)$ in the
Julia set, the derivative $dz(c)/dc$ is uniformly $O(1/\sqrt{|c-\hat{c}|})$
when $c$ belongs to a parameter ray that lands on $\hat{c}$. We also
characterize the degeneration of the dynamics along the parameter ray.
| math.DS math.CV | for the quadratic family f_cz z2c with c in the exterior of the mandelbrot set it is known that every point in the julia set moves holomorphically let hatc be a semihyperbolic parameter in the boundary of the mandelbrot set in this paper we prove that for each z zc in the julia set the derivative dzcdc is uniformly o1sqrtchatc when c belongs to a parameter ray that lands on hatc we also characterize the degeneration of the dynamics along the parameter ray | [['for', 'the', 'quadratic', 'family', 'f_cz', 'z2c', 'with', 'c', 'in', 'the', 'exterior', 'of', 'the', 'mandelbrot', 'set', 'it', 'is', 'known', 'that', 'every', 'point', 'in', 'the', 'julia', 'set', 'moves', 'holomorphically', 'let', 'hatc', 'be', 'a', 'semihyperbolic', 'parameter', 'in', 'the', 'boundary', 'of', 'the', 'mandelbrot', 'set', 'in', 'this', 'paper', 'we', 'prove', 'that', 'for', 'each', 'z', 'zc', 'in', 'the', 'julia', 'set', 'the', 'derivative', 'dzcdc', 'is', 'uniformly', 'o1sqrtchatc', 'when', 'c', 'belongs', 'to', 'a', 'parameter', 'ray', 'that', 'lands', 'on', 'hatc', 'we', 'also', 'characterize', 'the', 'degeneration', 'of', 'the', 'dynamics', 'along', 'the', 'parameter', 'ray']] | [-0.16064337597309072, 0.09741722162307044, -0.06805418070009048, 0.0018096459514955864, -0.08344995347713982, -0.11219048190769958, 0.052098718536500305, 0.29319030709311733, -0.339840997700338, -0.15062656306466202, 0.09113380564577923, -0.32051227352133504, -0.1271228613216936, 0.20630024764456867, -0.07348277461772532, 0.0029038104205679747, 0.026732987091865067, 0.08802834968370052, -0.013874366629385838, -0.24579341258899665, 0.37861833164905323, -0.04997116353730729, 0.1615679962100622, 0.029030162777843666, 0.09069680851412776, -0.03949762390995467, 0.0422468438261637, 0.011817778538291654, -0.1806444786071316, 0.07661875492007827, 0.22869993592210022, 0.1446130511460159, 0.2412714937494861, -0.27941923772874516, -0.14953150532932746, 0.18357281973384273, 0.1262527869577393, -0.027264491493963164, 0.018308047045677626, -0.2375931022113856, 0.132042522353902, -0.10263914018754422, -0.19943972450773012, -0.003894701358620767, 0.07610203158455314, 0.0338753522546203, -0.2551091672323736, -0.032475128853593, 0.08136309015300171, 0.052011273712218725, -0.04244407671963635, -0.07756561094918, -0.12450147739807028, 0.05227107012444636, 0.0045737584500953, 0.14578019476346213, 0.09855224821000809, -0.05063267067695657, -0.059372576137567745, 0.3781523776641633, -0.06635859650347732, -0.2837387256950922, 0.15681806080802171, -0.2548625480382197, -0.17137955495926702, 0.12611920464277554, 0.13281800412791378, 0.10842054693982649, -0.11750434293872662, 0.26854108630415097, -0.09467330836995655, 0.108129245046897, 0.07884882066260886, -0.1015723162146722, 0.15178586027504484, 0.08233711624483543, 0.1355684516882455, 0.17682913786093532, -0.06099586310095073, -0.04371093801096266, -0.394982177361754, -0.20542339849527236, -0.17880096615372618, 0.0766490044368339, -0.11807354573838781, -0.23117392791872038, 0.41416297383882383, 0.12184802189837267, 0.24855097117661326, 0.07164676825481432, 0.2037004618158127, 0.08450132240843097, 0.02949025298261808, 0.1381480380271872, 0.15848854838663506, 0.07621562129093541, 0.004939623889915737, -0.15966375403244187, 0.035724818206357735, 0.15612134644416747] |
1,803.03131 | Multiphase strontium molybdate thin films for plasmonic local heating
applications | In the search for alternative plasmonic materials SrMoO3 has recently been
identified as possessing a number of desirable optical properties. Owing to the
requirement for many plasmonic devices to operate at elevated temperatures
however, it is essential to characterize the degradation of these properties
upon heating. Here, SrMoO3 thin films are annealed in air at temperatures
ranging from 75 - 500{\deg} C. Characterizations by AFM, XRD, and spectroscopic
ellipsometry after each anneal identify a loss of metallic behaviour after
annealing at 500{\deg} C, together with the underlying mechanism. Moreover, it
is shown that by annealing the films in nitrogen following deposition, an
additional crystalline phase of SrMoO4 is induced at the film surface, which
suppresses oxidation at elevated temperatures.
| cond-mat.mtrl-sci | in the search for alternative plasmonic materials srmoo3 has recently been identified as possessing a number of desirable optical properties owing to the requirement for many plasmonic devices to operate at elevated temperatures however it is essential to characterize the degradation of these properties upon heating here srmoo3 thin films are annealed in air at temperatures ranging from 75 500deg c characterizations by afm xrd and spectroscopic ellipsometry after each anneal identify a loss of metallic behaviour after annealing at 500deg c together with the underlying mechanism moreover it is shown that by annealing the films in nitrogen following deposition an additional crystalline phase of srmoo4 is induced at the film surface which suppresses oxidation at elevated temperatures | [['in', 'the', 'search', 'for', 'alternative', 'plasmonic', 'materials', 'srmoo3', 'has', 'recently', 'been', 'identified', 'as', 'possessing', 'a', 'number', 'of', 'desirable', 'optical', 'properties', 'owing', 'to', 'the', 'requirement', 'for', 'many', 'plasmonic', 'devices', 'to', 'operate', 'at', 'elevated', 'temperatures', 'however', 'it', 'is', 'essential', 'to', 'characterize', 'the', 'degradation', 'of', 'these', 'properties', 'upon', 'heating', 'here', 'srmoo3', 'thin', 'films', 'are', 'annealed', 'in', 'air', 'at', 'temperatures', 'ranging', 'from', '75', '500deg', 'c', 'characterizations', 'by', 'afm', 'xrd', 'and', 'spectroscopic', 'ellipsometry', 'after', 'each', 'anneal', 'identify', 'a', 'loss', 'of', 'metallic', 'behaviour', 'after', 'annealing', 'at', '500deg', 'c', 'together', 'with', 'the', 'underlying', 'mechanism', 'moreover', 'it', 'is', 'shown', 'that', 'by', 'annealing', 'the', 'films', 'in', 'nitrogen', 'following', 'deposition', 'an', 'additional', 'crystalline', 'phase', 'of', 'srmoo4', 'is', 'induced', 'at', 'the', 'film', 'surface', 'which', 'suppresses', 'oxidation', 'at', 'elevated', 'temperatures']] | [-0.06167946236851325, 0.22841393672656446, -0.07703295730101734, -0.06050205825910888, 0.024564382022294075, -0.1655584126868743, 0.07048671402952682, 0.4842917779657863, -0.2629061445467553, -0.33971976526712966, 0.08751505298512373, -0.3112272081336291, -0.08742496155012967, 0.2157630441627481, -0.00267295910526951, 0.046596486403883565, -0.044515382603079204, -0.07224189723255824, -0.084182837021032, -0.22519550491440093, 0.23777949652374106, 0.08795721229201309, 0.32397845527551816, 0.08670437918044627, 0.06646534920101828, -0.045596697699215455, 0.10718901006611443, 0.006609440725928141, -0.1466290888604555, 0.010683765358654625, 0.2795659670037991, -0.05513909892613163, 0.2207361504443432, -0.43783606836667, -0.2629891889716372, 0.0076656475686862815, 0.10103279667101421, 0.09291340027032104, -0.10864808721175828, -0.18847698662666826, 0.1265886310661622, -0.06198959286577242, -0.1294151379279664, -0.07211132164081653, -0.004994168372477515, -0.01978035835584752, -0.22689714959587792, 0.030224347637050737, 0.04841531981058987, 0.13822321965174417, -0.08506572386607532, -0.12381183659910398, -0.11622839197674292, 0.03959192314690326, 0.02562580634326816, 0.015675458843993434, 0.22249457346259663, -0.09825350257954797, -0.055423555461595116, 0.334941306561863, -0.03344949284347437, 0.002357904452009726, 0.2470329382034587, -0.12971362972561018, -0.09011075661470325, 0.26516720124567716, 0.08785716730951315, 0.11259756736078505, -0.19198019445826442, 0.05197018269060764, 0.0636687761575173, 0.1702114614831694, 0.14928049998756465, 0.10080490677254432, 0.22626025625899182, 0.2274529153315382, 0.020960456154494687, 0.16563671868357618, -0.09551092030054306, 0.03482424654855819, -0.18171173304721902, -0.19822397540418146, -0.18910995999477426, 0.08531083498678912, -0.06071522106676485, -0.17059302137512516, 0.33489897117902667, 0.13978253356654638, 0.15347557992751362, -0.05992692787796101, 0.2534975452601152, 0.04825654708271278, 0.10581585650442768, 0.01333620417882862, 0.2536358153408046, 0.1642951961385749, 0.12500831898574627, -0.26558719881833925, 0.1561803621895043, -0.014359798866434622] |
1,803.03132 | Forecasts for Warm Dark Matter from Photometric Galaxy Surveys | We present a Fisher matrix forecast for the sensitivity on the mass of a
thermal warm dark matter (WDM) particle from current (DES-like) and future
(LSST-like) photometric galaxy surveys using the galaxy angular power spectrum.
We model the nonlinear clustering using a modified Halo Model proposed to
account for WDM effects. We estimate that from this observable alone a lower
bound of $m_{\text{wdm}}>647$\,eV ($m_{\text{wdm}}>126$\,eV) for the LSST (DES)
case could be obtained.
| astro-ph.CO hep-ph | we present a fisher matrix forecast for the sensitivity on the mass of a thermal warm dark matter wdm particle from current deslike and future lsstlike photometric galaxy surveys using the galaxy angular power spectrum we model the nonlinear clustering using a modified halo model proposed to account for wdm effects we estimate that from this observable alone a lower bound of m_textwdm647ev m_textwdm126ev for the lsst des case could be obtained | [['we', 'present', 'a', 'fisher', 'matrix', 'forecast', 'for', 'the', 'sensitivity', 'on', 'the', 'mass', 'of', 'a', 'thermal', 'warm', 'dark', 'matter', 'wdm', 'particle', 'from', 'current', 'deslike', 'and', 'future', 'lsstlike', 'photometric', 'galaxy', 'surveys', 'using', 'the', 'galaxy', 'angular', 'power', 'spectrum', 'we', 'model', 'the', 'nonlinear', 'clustering', 'using', 'a', 'modified', 'halo', 'model', 'proposed', 'to', 'account', 'for', 'wdm', 'effects', 'we', 'estimate', 'that', 'from', 'this', 'observable', 'alone', 'a', 'lower', 'bound', 'of', 'm_textwdm647ev', 'm_textwdm126ev', 'for', 'the', 'lsst', 'des', 'case', 'could', 'be', 'obtained']] | [-0.05311770518310368, 0.07361130223476461, -0.16800318780754295, 0.14397306009362051, -0.11591009158375008, -0.06567934834747576, -0.0074923187660585555, 0.32326998293200243, -0.20420152795101915, -0.3498355115431228, 0.07493187855663044, -0.2967936021674957, -0.0624117099122876, 0.2331115295328865, 0.01610212562871831, 0.057882366346062294, 0.06021599133465705, -0.07455495979769954, -0.028152636574980405, -0.28072197531083865, 0.2738342157698103, 0.1661049133831901, 0.17953920940469417, -0.01585183931913759, 0.10801852732298098, -0.017599523606310997, -0.10314975773383464, 0.02586855012923479, -0.2088652502912737, 0.05205284795291456, 0.1946515872101632, 0.16698768099636904, 0.1894513747688117, -0.36265500580359783, -0.2506220173489835, 0.20663903367572597, 0.16768579492345453, 0.11141189127894384, -0.09375737483247316, -0.3006596888249208, 0.05308115934936463, -0.2731997065246105, -0.09388910183416946, -0.00811893354901778, -0.06468853968461709, 0.01041936379458223, -0.28875988218933346, 0.21208690616435238, -0.024635616084560753, -0.02412626494520477, -0.09330044688789972, -0.15259028870745428, -0.025426682716767703, 0.02165985240467957, -0.06201898354837405, -0.034364541387185456, 0.19167064654175192, -0.17211994328203478, 0.0026964930983792456, 0.4214565483853221, -0.16597720024375512, -0.08588092987026487, 0.09852886994236282, -0.13297847621475478, -0.17576037670618722, 0.021863197056310516, 0.22472229578665326, 0.021187772914501173, -0.13881327333594007, 0.05733948547442976, -0.024638958874025514, 0.2436392230214551, -0.0023407288693955966, 0.053450167126305, 0.34953143681798665, 0.1508695425665272, 0.10453674987490688, 0.04527642350544089, -0.20804913106174874, -0.009005667043051549, -0.25585524693929723, -0.08754323181845913, -0.19784491968208126, 0.07382495650755508, -0.13916642983822386, -0.08802960793088589, 0.39134479409882, 0.20994998006416218, 0.19052332501326288, 0.1180983204461102, 0.38168841233210904, 0.10105406709813645, 0.050734217524794595, 0.03715775128720062, 0.31443221087434464, 0.11287424117326736, 0.07969384869959738, -0.22308131740428508, -0.022683633291827782, -0.004801892808505467] |
1,803.03133 | Quantum non-Gaussianity and quantification of nonclassicality | The algebraic quantification of nonclassicality, which naturally arises from
the quantum superposition principle, is related to properties of regular
nonclassicality quasiprobabilities. The latter are obtained by non-Gaussian
filtering of the Glauber-Sudarshan $P$~function. They yield lower bounds for
the degree of nonclassicality. We also derive bounds for convex combinations of
Gaussian states for certifying quantum non-Gaussianity directly from the
experimentally accessible nonclassicality quasiprobabilities. Other
quantum-state representations, such as $s$-parametrized quasiprobabilities,
insufficiently indicate or even fail to directly uncover detailed information
on the properties of quantum states. As an example, our approach is applied to
multi-photon-added squeezed vacuum states.
| quant-ph | the algebraic quantification of nonclassicality which naturally arises from the quantum superposition principle is related to properties of regular nonclassicality quasiprobabilities the latter are obtained by nongaussian filtering of the glaubersudarshan pfunction they yield lower bounds for the degree of nonclassicality we also derive bounds for convex combinations of gaussian states for certifying quantum nongaussianity directly from the experimentally accessible nonclassicality quasiprobabilities other quantumstate representations such as sparametrized quasiprobabilities insufficiently indicate or even fail to directly uncover detailed information on the properties of quantum states as an example our approach is applied to multiphotonadded squeezed vacuum states | [['the', 'algebraic', 'quantification', 'of', 'nonclassicality', 'which', 'naturally', 'arises', 'from', 'the', 'quantum', 'superposition', 'principle', 'is', 'related', 'to', 'properties', 'of', 'regular', 'nonclassicality', 'quasiprobabilities', 'the', 'latter', 'are', 'obtained', 'by', 'nongaussian', 'filtering', 'of', 'the', 'glaubersudarshan', 'pfunction', 'they', 'yield', 'lower', 'bounds', 'for', 'the', 'degree', 'of', 'nonclassicality', 'we', 'also', 'derive', 'bounds', 'for', 'convex', 'combinations', 'of', 'gaussian', 'states', 'for', 'certifying', 'quantum', 'nongaussianity', 'directly', 'from', 'the', 'experimentally', 'accessible', 'nonclassicality', 'quasiprobabilities', 'other', 'quantumstate', 'representations', 'such', 'as', 'sparametrized', 'quasiprobabilities', 'insufficiently', 'indicate', 'or', 'even', 'fail', 'to', 'directly', 'uncover', 'detailed', 'information', 'on', 'the', 'properties', 'of', 'quantum', 'states', 'as', 'an', 'example', 'our', 'approach', 'is', 'applied', 'to', 'multiphotonadded', 'squeezed', 'vacuum', 'states']] | [-0.05297709703154396, 0.17876218520192802, -0.17102357839379087, 0.1583929826908085, -0.05956564116058871, -0.18177725620140942, 0.008721702986804303, 0.31689199725951767, -0.2914776120824172, -0.2569304061277459, 0.06268546626476261, -0.24281518077865863, -0.13058905901076892, 0.27052519559705007, -0.056432376562346086, 0.15358420220824578, 0.036271792681266866, 0.030210691775816183, -0.06864980482957132, -0.23462755983928218, 0.34199191303438664, 0.017951676385564497, 0.3119212922659547, 0.03892057871174378, 0.0635336092915774, 0.016144544856312375, 0.029665413310794975, -0.005118683261874442, -0.10952486713358667, 0.1188642569231888, 0.32278901016979944, 0.21134087526782727, 0.20480220153452441, -0.37627445642525953, -0.20236380991021483, 0.13597527848711857, 0.09649701342762758, 0.19012554361809939, 0.007664721331821056, -0.40365655784262344, -0.015049277465247238, -0.11575372146414036, -0.11560118653869722, -0.1876633274999525, -0.04651049376116134, -0.02493868159217527, -0.2652236461872235, 0.1379240136129738, 0.06873980154038388, 0.05234900147964557, 0.02790939614351373, -0.11229597268174984, -0.030997717624510795, 0.08448372834876257, -0.08735444195432744, -0.06433180063443918, 0.15860563266808944, -0.1465610150480643, -0.17057078775057258, 0.31033131475366343, -0.04343773771446043, -0.23708662557570884, 0.14987048833669783, -0.12253988641411222, -0.11293348623924733, 0.07123428492438204, 0.10566939272879002, 0.10736170439243627, -0.10362790114474289, 0.039360888729182385, -0.04659652121578498, 0.152076494757542, 0.10469128314677316, 0.21840015871081656, 0.18717458249496607, -0.007938834596037244, 0.0860037915117573, 0.22954476493820644, -0.04089359402375218, -0.1208806741196895, -0.34125905626569875, -0.17069664379717628, -0.283830366153173, 0.0807655235985294, -0.09446469319421642, -0.17741945262484174, 0.40346806874731556, 0.13744987450384846, 0.1361314828051642, 0.06031780173483033, 0.2693891214051594, 0.14944811678894135, 0.0375210628262721, -0.0010068868480933209, 0.2511594302741287, 0.20125457791194398, 0.0034039767197100446, -0.218975700714509, 0.139243289566366, 0.023125804824909817] |
1,803.03134 | A Curvature Operator for a Regular Tetrahedron Shape in LQG | An alternative approach introducing a 3 dimensional Ricci scalar curvature
quantum operator given in terms of volume and area as well as new edge length
operators is proposed. An example of monochromatic 4-valent node intertwiner
state (equilateral tetrahedra) is studied and the scalar curvature measure for
a regular tetrahedron shape is constructed. It is shown that all regular
tetrahedron states are in the negative scalar curvature regime and for the
semi-classical limit the spectrum is very close to the Euclidean regime.
| gr-qc | an alternative approach introducing a 3 dimensional ricci scalar curvature quantum operator given in terms of volume and area as well as new edge length operators is proposed an example of monochromatic 4valent node intertwiner state equilateral tetrahedra is studied and the scalar curvature measure for a regular tetrahedron shape is constructed it is shown that all regular tetrahedron states are in the negative scalar curvature regime and for the semiclassical limit the spectrum is very close to the euclidean regime | [['an', 'alternative', 'approach', 'introducing', 'a', '3', 'dimensional', 'ricci', 'scalar', 'curvature', 'quantum', 'operator', 'given', 'in', 'terms', 'of', 'volume', 'and', 'area', 'as', 'well', 'as', 'new', 'edge', 'length', 'operators', 'is', 'proposed', 'an', 'example', 'of', 'monochromatic', '4valent', 'node', 'intertwiner', 'state', 'equilateral', 'tetrahedra', 'is', 'studied', 'and', 'the', 'scalar', 'curvature', 'measure', 'for', 'a', 'regular', 'tetrahedron', 'shape', 'is', 'constructed', 'it', 'is', 'shown', 'that', 'all', 'regular', 'tetrahedron', 'states', 'are', 'in', 'the', 'negative', 'scalar', 'curvature', 'regime', 'and', 'for', 'the', 'semiclassical', 'limit', 'the', 'spectrum', 'is', 'very', 'close', 'to', 'the', 'euclidean', 'regime']] | [-0.16669330462370713, 0.1571817288184567, -0.0435342569777995, 0.09200207264317821, -0.08702611631460856, -0.1873609490899576, -0.07274909535089484, 0.3454031916910116, -0.2320478160256221, -0.2218923677954777, 0.09660135663436427, -0.34599513467401266, -0.16993281208438638, 0.13534025922647597, -0.054647346725687385, 0.0628587879286504, 0.03839464393087927, 0.12188243309472814, -0.0049598962039813215, -0.20854987934185767, 0.36157419756457304, 0.055230904397853636, 0.25193598514629734, 0.09041016997861458, 0.10496372208689098, -0.006963421487145954, 0.06342187964207964, 0.08249535977863419, -0.15360717439708188, 0.07909521160081005, 0.20316619081077752, 0.051358205967663245, 0.17800336825534885, -0.3613929159157438, -0.22439929986671533, 0.11901398554996208, 0.13779860867164384, 0.09326710567499201, -0.03133039543244206, -0.2753391854097078, 0.06263735331594944, -0.12665612661613174, -0.18903752119656952, -0.08345654942555192, 0.04944125791712676, -0.094017366959173, -0.24875459270436823, 0.0780889591558572, 0.07799061183547486, 0.017565536712307806, -0.03612377631397527, -0.12176470670067234, -0.056122051359349744, 0.08644716012763021, 0.006672759457019928, 0.06887240428908693, 0.07910961171405183, -0.10689311920218586, -0.0996473266924214, 0.34763173903856015, -0.07395479609086006, -0.26030284653843183, 0.08554832755737467, -0.132419974980071, -0.06230255895305747, 0.09094596127577034, 0.09540497236827641, 0.15396933464540374, -0.11032341878550748, 0.18255941949017276, -0.04464562599443727, 0.1223449192389294, 0.13153065688747131, 0.05997017201289167, 0.20429966243466846, 0.10624866816502662, 0.16610988984344366, 0.1864266552161828, -0.04358442950947785, -0.1478992943238053, -0.33493465810646245, -0.16746684081024593, -0.2673839410194943, 0.07381116867893273, -0.1868872847690112, -0.2259097876681883, 0.4030606696083222, -0.02926819076270072, 0.19969642523785386, 0.0677557673972146, 0.2512017617829972, 0.12513658705305447, 0.05289431462024143, 0.10245738112307326, 0.21519920136779547, 0.17257237429356914, 0.054183293915825124, -0.1668926060365378, -0.05402759144105661, 0.15068165407757517] |
1,803.03135 | Variations on a Hypergeometric Theme | The question was asked: Is it possible to express the function
\begin{equation} \tag{1.1} h(a)\equiv\,{_4F_3}(a,a,a,a;2a,a+1,a+1;1)
\label{question} \end{equation} in closed form? After considerable analysis,
the answer appears to be "no", but during the attempt to answer this question,
a number of interesting (and unexpected) related results were obtained, either
as specialized transformations, or as closed-form expressions for several
related functions. The purpose of this paper is to record and review both the
methods attempted and the related identities obtained (specifically new
$_4F_3(1)$, $_5F_6(1)$ and (generalized Euler) sums containing digamma
functions) - the former for their educational merit, since they appear to be
not-very-well-known, the latter because they do not appear to exist in the
literature.
| math.CA math-ph math.MP | the question was asked is it possible to express the function beginequation tag11 haequiv_4f_3aaaa2aa1a11 labelquestion endequation in closed form after considerable analysis the answer appears to be no but during the attempt to answer this question a number of interesting and unexpected related results were obtained either as specialized transformations or as closedform expressions for several related functions the purpose of this paper is to record and review both the methods attempted and the related identities obtained specifically new _4f_31 _5f_61 and generalized euler sums containing digamma functions the former for their educational merit since they appear to be notverywellknown the latter because they do not appear to exist in the literature | [['the', 'question', 'was', 'asked', 'is', 'it', 'possible', 'to', 'express', 'the', 'function', 'beginequation', 'tag11', 'haequiv_4f_3aaaa2aa1a11', 'labelquestion', 'endequation', 'in', 'closed', 'form', 'after', 'considerable', 'analysis', 'the', 'answer', 'appears', 'to', 'be', 'no', 'but', 'during', 'the', 'attempt', 'to', 'answer', 'this', 'question', 'a', 'number', 'of', 'interesting', 'and', 'unexpected', 'related', 'results', 'were', 'obtained', 'either', 'as', 'specialized', 'transformations', 'or', 'as', 'closedform', 'expressions', 'for', 'several', 'related', 'functions', 'the', 'purpose', 'of', 'this', 'paper', 'is', 'to', 'record', 'and', 'review', 'both', 'the', 'methods', 'attempted', 'and', 'the', 'related', 'identities', 'obtained', 'specifically', 'new', '_4f_31', '_5f_61', 'and', 'generalized', 'euler', 'sums', 'containing', 'digamma', 'functions', 'the', 'former', 'for', 'their', 'educational', 'merit', 'since', 'they', 'appear', 'to', 'be', 'notverywellknown', 'the', 'latter', 'because', 'they', 'do', 'not', 'appear', 'to', 'exist', 'in', 'the', 'literature']] | [-0.08629824141710649, 0.057085090634526214, -0.06901528083971728, 0.1449306197290387, -0.12157909485302587, -0.15688661025906694, 0.026386876652565585, 0.3505096635998827, -0.2721097121171862, -0.3244451873840016, 0.13451400580032616, -0.2871194633363668, -0.18571814670767112, 0.22592289062438828, -0.09613536011044667, 0.04997555249388042, 0.020596839642047744, 0.07816431581295122, -0.07175433838942086, -0.30421000490700567, 0.2967066851653437, 0.004708984480500569, 0.23086020290398987, 0.10026068847069394, 0.049763281455385354, -0.03220029779335606, -0.07527952256534144, 0.005813103630512117, -0.16576273570916503, 0.08639132309809466, 0.30723653603171075, 0.1486186757509675, 0.2774062281970596, -0.4105527570175233, -0.1263023045296981, 0.13449160620204617, 0.17665789011761407, 0.07515024857717419, -0.006679293669098727, -0.24597971818288006, 0.061568311972665456, -0.1366061149230314, -0.13400865599478237, -0.10126348838569688, 0.019193698454073795, 0.019537389099980904, -0.2349789920012754, 0.057195776385890545, 0.09196097101302486, 0.020551061353463435, -0.0600690335572793, -0.1558861210985788, 0.03772123265907029, 0.15766601315612477, 0.10850187222252393, 0.06510059204318117, 0.04539965800331714, -0.13463123224101195, -0.08464351894059784, 0.3796611610173343, -0.011812543127659673, -0.22971258796185742, 0.17858679414178444, -0.14125739783483826, -0.16617728905751214, 0.10030134385625754, 0.1400370671050449, 0.1333686439516284, -0.17986964208327416, 0.04392863917773781, -0.06708277009044573, 0.11159116915801418, 0.14785622511163493, 0.024810659180169004, 0.17706250444176458, 0.010654996714998628, -0.008504290323025573, 0.1360131776869889, 0.03039502303734004, -0.07594602400160647, -0.2867420116269735, -0.17806435519150485, -0.14397493311177903, 0.08292402326312703, 0.02129310614126952, -0.17111668384103018, 0.3692237332302241, 0.1428785185682126, 0.1882021196456365, 0.028426488500227717, 0.2301046966931948, 0.15747110685986407, 0.07960814676926445, 0.02888635876501484, 0.17667546355797664, 0.11358300506389726, 0.1354611395188024, -0.13942395305102168, 0.10425587052753561, 0.06339460284510087] |
1,803.03136 | Placing the newly observed state $B_{J}(5840)$ in bottom spectra along
with states $B_{1}(5721)$, $B_{2}^{*}(5747)$, $B_{s1}(5830)$,
$B_{2s}^{*}(5840)$ and $B_{J}(5970)$ | In this article, we study the two body strong decays with the emission of
light pseudo-scalar mesons $(\pi, \eta, K)$ for higher excited bottom states
with in the framework of HQET. Inspired from the recent observation of bottom
meson $B_{J}(5840)$ by LHCb collaboration \cite{9}, we classify the six
possible $J^{P}$'s for this state on the basis of the theoretically available
masses. By analyzing the strong decay widths and the branching ratios for all
these six cases of $B_{J}(5840)$, we justify one of them to be the most
favorable assignment for it. We also examined the recently observed bottom
state $B_{J}(5970)$ as 2S$1^{-}$ and states $B_{J}(5721)$ and $B_{2}^{*}(5747)$
with their strange partners $B_{s1}(5830)$ and $B_{2s}^{*}(5840)$ for their
$J^{P}$'s as $1P_{3/2}1^{+}$ and $1P_{3/2}2^{+}$ respectively. The predicted
coupling constants $g_{XH}$, $\widetilde{g}_{HH}$ and $g_{TH}$ helps in
redeeming the strong decay width of experimentally missing bottom states $B(2
^{1}S_{0})$, $B_{s}(2 ^{3}S_{1})$, $B_{s}(2 ^{1}S_{0})$, $B(1 ^{1}D_{2})$,
$B_{s}(1 ^{3}D_{1})$ and $B_{s}(1 ^{1}D_{2})$. These predictions provide a
crucial information for upcoming experimental studies.
| hep-ph | in this article we study the two body strong decays with the emission of light pseudoscalar mesons pi eta k for higher excited bottom states with in the framework of hqet inspired from the recent observation of bottom meson b_j5840 by lhcb collaboration cite9 we classify the six possible jps for this state on the basis of the theoretically available masses by analyzing the strong decay widths and the branching ratios for all these six cases of b_j5840 we justify one of them to be the most favorable assignment for it we also examined the recently observed bottom state b_j5970 as 2s1 and states b_j5721 and b_25747 with their strange partners b_s15830 and b_2s5840 for their jps as 1p_321 and 1p_322 respectively the predicted coupling constants g_xh widetildeg_hh and g_th helps in redeeming the strong decay width of experimentally missing bottom states b2 1s_0 b_s2 3s_1 b_s2 1s_0 b1 1d_2 b_s1 3d_1 and b_s1 1d_2 these predictions provide a crucial information for upcoming experimental studies | [['in', 'this', 'article', 'we', 'study', 'the', 'two', 'body', 'strong', 'decays', 'with', 'the', 'emission', 'of', 'light', 'pseudoscalar', 'mesons', 'pi', 'eta', 'k', 'for', 'higher', 'excited', 'bottom', 'states', 'with', 'in', 'the', 'framework', 'of', 'hqet', 'inspired', 'from', 'the', 'recent', 'observation', 'of', 'bottom', 'meson', 'b_j5840', 'by', 'lhcb', 'collaboration', 'cite9', 'we', 'classify', 'the', 'six', 'possible', 'jps', 'for', 'this', 'state', 'on', 'the', 'basis', 'of', 'the', 'theoretically', 'available', 'masses', 'by', 'analyzing', 'the', 'strong', 'decay', 'widths', 'and', 'the', 'branching', 'ratios', 'for', 'all', 'these', 'six', 'cases', 'of', 'b_j5840', 'we', 'justify', 'one', 'of', 'them', 'to', 'be', 'the', 'most', 'favorable', 'assignment', 'for', 'it', 'we', 'also', 'examined', 'the', 'recently', 'observed', 'bottom', 'state', 'b_j5970', 'as', '2s1', 'and', 'states', 'b_j5721', 'and', 'b_25747', 'with', 'their', 'strange', 'partners', 'b_s15830', 'and', 'b_2s5840', 'for', 'their', 'jps', 'as', '1p_321', 'and', '1p_322', 'respectively', 'the', 'predicted', 'coupling', 'constants', 'g_xh', 'widetildeg_hh', 'and', 'g_th', 'helps', 'in', 'redeeming', 'the', 'strong', 'decay', 'width', 'of', 'experimentally', 'missing', 'bottom', 'states', 'b2', '1s_0', 'b_s2', '3s_1', 'b_s2', '1s_0', 'b1', '1d_2', 'b_s1', '3d_1', 'and', 'b_s1', '1d_2', 'these', 'predictions', 'provide', 'a', 'crucial', 'information', 'for', 'upcoming', 'experimental', 'studies']] | [-0.08641451610365729, 0.22639092224756185, -0.02622963848400012, 0.12345061019723173, -0.019924808423258836, -0.15929498234940576, 0.10837027820820413, 0.3479571432535407, -0.1762806319806996, -0.2414315484443538, 0.017412806083772426, -0.33089455905594406, -0.0266502193039684, 0.11610834217111615, 0.1092428637821746, 0.11018598699556145, 0.07552446318492648, 0.01782781290810679, -0.012571414001654433, -0.1874603959274938, 0.3043356178957627, -0.027656714196163643, 0.21128963939315062, 0.1442692544649479, -0.0413967078828689, -0.012662296198143424, -0.00034028515985966485, -0.09170386035951, -0.14799118014877732, 0.11050166584119567, 0.20614993051166022, 0.09053194318246686, 0.15474079905631893, -0.34519386557932896, -0.09073374962619847, 0.1078943439937621, 0.1503370177263064, 0.0953083120144998, -0.024193906317364802, -0.3882690816351413, 0.12249575617216245, -0.18291609780568205, -0.12938888443492447, -0.10549217782018683, 0.05747000000121284, -0.051722312200213255, -0.2850812923172754, 0.08721864131066352, -0.04463381662189701, 0.02335845809311995, -0.07025493885968116, -0.2957652042077595, -0.04878742688724512, 0.09671623120379128, 0.08995012228695463, 0.04419720092864966, 0.0822433668271273, -0.1459417712353052, -0.1407955909601731, 0.37620358505062285, -0.1046017995030513, -0.1391025160474679, 0.15359933890551153, -0.15181301878853642, -0.1487584333554429, 0.1090269411642906, 0.16692320816218853, 0.09274321318975402, -0.13050813898679953, 0.03341875534506126, -0.046292903656626264, 0.13568964022612554, 0.10373273036218708, 0.1108215557370052, 0.16536968070763175, 0.14501204767523782, -0.06658330433368329, 0.09501017551335707, -0.08666757977574244, -0.0710827007634076, -0.32481874878624384, -0.13246217482506675, -0.08765830981760298, 0.038496379504758343, -0.013932509140846101, -0.04939722350287941, 0.3733937788218307, 0.049267439937949936, 0.2659664454197959, 0.017192027309048875, 0.27460470418386823, 0.059080863381806716, 0.038755143028860795, 0.08210841243161195, 0.3352830117874885, 0.2202352548586912, 0.11738226707152362, -0.27070599126399647, 0.025357913415248304, 0.012031062566557357] |
1,803.03137 | Biquandle cohomology and state-sum invariants of links and surface-links | In this paper, we discuss the (co)homology theory of biquandles, derived
biquandle cocycle invariants for oriented surface-links using broken surface
diagrams and how to compute the biquandle cocycle invariants from marked graph
diagrams. We also develop the shadow (co)homology theory of biquandles and
construct the shadow biquandle cocycle invariants for oriented surface-links.
| math.GT | in this paper we discuss the cohomology theory of biquandles derived biquandle cocycle invariants for oriented surfacelinks using broken surface diagrams and how to compute the biquandle cocycle invariants from marked graph diagrams we also develop the shadow cohomology theory of biquandles and construct the shadow biquandle cocycle invariants for oriented surfacelinks | [['in', 'this', 'paper', 'we', 'discuss', 'the', 'cohomology', 'theory', 'of', 'biquandles', 'derived', 'biquandle', 'cocycle', 'invariants', 'for', 'oriented', 'surfacelinks', 'using', 'broken', 'surface', 'diagrams', 'and', 'how', 'to', 'compute', 'the', 'biquandle', 'cocycle', 'invariants', 'from', 'marked', 'graph', 'diagrams', 'we', 'also', 'develop', 'the', 'shadow', 'cohomology', 'theory', 'of', 'biquandles', 'and', 'construct', 'the', 'shadow', 'biquandle', 'cocycle', 'invariants', 'for', 'oriented', 'surfacelinks']] | [-0.27402864283738804, 0.11681243648322728, -0.12639350382288775, 0.16599232687999924, -0.11261710306056417, -0.1637693176834056, 0.018375536191832416, 0.3560448633506894, -0.40975091520410317, -0.3008187311486556, 0.024679259529176097, -0.2286428192164749, -0.31586932104367477, 0.13182266583093083, -0.2531211912417068, -0.030181720936805226, 0.01726356270060373, 0.031190102131894, -0.12822092491058776, -0.20726024537949483, 0.45893031904975384, -0.06154736876487732, 0.15495230676606297, 0.10119419328223628, 0.07465276354699969, 0.027427136665210128, -0.07717974285165277, 0.02523048734292388, -0.24447615524359906, 0.14844026165799454, 0.3316401074989699, -0.005265348268529544, -0.10185463239367192, -0.3689247507315416, -0.03062612384271163, 0.11311854002997279, 0.11460222980867212, 0.023055781717770375, -0.014878162353012998, -0.3470458499370859, 0.13926784126446223, -0.2503029519978624, -0.17901402683212206, -0.1427259175106883, 0.03444206299116978, -0.03300202986261306, -0.1018395593173409, -0.08106654052356205, 0.0031979910384577056, 0.17330307710485962, -0.006381298719833677, -0.0018426505311463887, -0.15564087921610245, 0.1561568025678683, -0.0364948189817369, 0.06254339285302334, 0.17771570235849, -0.11305420881119342, -0.28882424202926743, 0.3547800087656539, -0.05155192279758362, -0.2547253561564363, 0.024350926203903958, -0.1227297201895943, -0.3522402669410579, 0.17190960581557682, 0.04716188868937584, 0.2181498792488128, -0.014224230043160228, 0.17628343773853536, -0.07015387004671189, -0.019780601016603984, 0.1297544648584265, -0.04037943072258853, 0.1584597621471263, -0.09435719871320404, 0.06135938738365299, 0.2737991623580456, -0.005681647766882984, -0.0392379724026586, -0.33169458881736946, -0.24741454021288797, -0.042872640143076964, 0.10592847123133162, -0.13554178962714594, -0.23950658598914742, 0.455774768255651, 0.08855117642535613, 0.12566881759714585, 0.23322031840395469, 0.2661758541631011, 0.062305170424784034, 0.07021340498557457, 0.07273038550136754, 0.06015982794073912, 0.25490196888523103, -0.013950956233132344, -0.09945554624293716, -0.06988628109684214, 0.3905748959379987] |
1,803.03138 | Tropes, Torelli and theta characteristics | Our main result is an effective version of the Torelli theorem in genus $3$
and any characteristic not $2$: the configuration of the odd theta
characteristics of a curve $C$ of genus $3$ determines a del Pezzo surface $S$
of degree two and that $C$ is recovered as the normalization of a certain curve
on $S$. This surface is not the one usually associated to $C$; we describe the
distinction. We also give an explicit geometrical description of the quadratic
twist (observed by Serre) that arises in the statement of the Torelli theorem.
| math.AG | our main result is an effective version of the torelli theorem in genus 3 and any characteristic not 2 the configuration of the odd theta characteristics of a curve c of genus 3 determines a del pezzo surface s of degree two and that c is recovered as the normalization of a certain curve on s this surface is not the one usually associated to c we describe the distinction we also give an explicit geometrical description of the quadratic twist observed by serre that arises in the statement of the torelli theorem | [['our', 'main', 'result', 'is', 'an', 'effective', 'version', 'of', 'the', 'torelli', 'theorem', 'in', 'genus', '3', 'and', 'any', 'characteristic', 'not', '2', 'the', 'configuration', 'of', 'the', 'odd', 'theta', 'characteristics', 'of', 'a', 'curve', 'c', 'of', 'genus', '3', 'determines', 'a', 'del', 'pezzo', 'surface', 's', 'of', 'degree', 'two', 'and', 'that', 'c', 'is', 'recovered', 'as', 'the', 'normalization', 'of', 'a', 'certain', 'curve', 'on', 's', 'this', 'surface', 'is', 'not', 'the', 'one', 'usually', 'associated', 'to', 'c', 'we', 'describe', 'the', 'distinction', 'we', 'also', 'give', 'an', 'explicit', 'geometrical', 'description', 'of', 'the', 'quadratic', 'twist', 'observed', 'by', 'serre', 'that', 'arises', 'in', 'the', 'statement', 'of', 'the', 'torelli', 'theorem']] | [-0.20704009073475996, 0.07541425715692551, -0.13434970238676636, 0.0926448225859873, -0.0431393531741955, -0.1781613667375378, 0.0038685207130006883, 0.2788486976617126, -0.28781352922200193, -0.2908150585748816, 0.06782242907361398, -0.2286651910442899, -0.1562493283662104, 0.2253377526317553, -0.1424221334174984, -0.0638200817128984, 0.014478811847736998, 0.07545573554772844, -0.09206890869104574, -0.293024907075119, 0.375312979663572, -0.046703284265854024, 0.20017528895448933, 0.11561659298917298, 0.07814321002512369, 0.048003524937416595, 0.018626011597613495, -0.03198317996156152, -0.15110259019016783, 0.13563794408354066, 0.2539226952965261, 0.10695546284137715, 0.15126019201531846, -0.34581561380576703, -0.17085175054468293, 0.14910504268983038, 0.06563587798186207, 0.06115846328877954, 0.02837896065521104, -0.18057804750353698, 0.10488614230291537, -0.11209519265951233, -0.2414679404808789, -0.015716965640744856, 0.07996942420359901, -0.017166992869748866, -0.18739985234494652, 0.008395782367060942, 0.1882934405177992, 0.15290404581815326, -0.019997647380135875, -0.10715746986229092, -0.10646496553684995, 0.07323013323669632, 0.034983781058721804, 0.11323407495404364, 0.06234416579927809, -0.14957886849910582, -0.058410470076005465, 0.35160499540788515, -0.10222522489806657, -0.1694834231729469, 0.12407603322137747, -0.14256901401645874, -0.13783647777933267, 0.15519957501761694, 0.07647264324208741, 0.15771683889831747, -0.04250708390628138, 0.15679344578811358, -0.09425023477524519, 0.15985990375761064, 0.09688948582287037, -0.06960017409335861, 0.1315700045876926, 0.07478848404641594, 0.05989175227781137, 0.11549130756087521, -0.09027040437657527, 0.01311421088288508, -0.42754745731751126, -0.207021877755441, -0.15375434232735505, 0.14442547082666918, -0.12413018597358767, -0.1655979204712616, 0.44309704828887214, 0.03616118075085744, 0.20986564546543104, 0.07513624830021252, 0.2311088812427335, 0.09140745441551991, 0.04500741137927698, 0.05573149453610762, 0.1673414877233138, 0.1668199141965478, -0.012246535955778053, -0.18504381261425473, 0.049581217920027114, 0.16726165835154794] |
1,803.03139 | A simple proof for Kazmi et al.'s iterative scheme | In this paper, a simple proof for the existence iterative scheme by using two
Hilbert spaces due to Kazmi et al. [K. R. Kazmi, R. Ali, M. Furkan, Hybrid
iterative method for split monotone \ldots, Numer Algor, 2017] is provided.
| math.FA | in this paper a simple proof for the existence iterative scheme by using two hilbert spaces due to kazmi et al k r kazmi r ali m furkan hybrid iterative method for split monotone ldots numer algor 2017 is provided | [['in', 'this', 'paper', 'a', 'simple', 'proof', 'for', 'the', 'existence', 'iterative', 'scheme', 'by', 'using', 'two', 'hilbert', 'spaces', 'due', 'to', 'kazmi', 'et', 'al', 'k', 'r', 'kazmi', 'r', 'ali', 'm', 'furkan', 'hybrid', 'iterative', 'method', 'for', 'split', 'monotone', 'ldots', 'numer', 'algor', '2017', 'is', 'provided']] | [-0.13728932762104604, 0.024864326166506443, -0.08005394714160098, -0.04687972101884144, -0.07647667130610596, -0.1755656553302995, 0.03140257648515722, 0.3447960991308921, -0.2544069078802649, -0.3182934858939714, 0.050604873553513445, -0.19292957387450668, -0.17860760105152926, 0.18123646607596633, -0.14105984804013538, 0.01219516128508581, 0.05629935493278834, -0.11576968359036578, -0.06420541471258427, -0.3616896086346565, 0.2791601869588097, 0.05377996599094735, 0.1999776308528251, -0.02628886518586013, 0.11623382868452205, 0.028959424920483597, -0.0686152023780677, 0.012382238844616545, -0.20251362081358415, 0.11587935869142206, 0.31892916487090084, 0.11028875935719246, 0.35874957425726783, -0.29902638122439384, -0.15079194948905045, 0.13744511232814854, 0.14560118801374403, 0.0029789404943585396, -0.03257206312587692, -0.2670386001053784, 0.12309872273666163, -0.16565544437617064, -0.09588276490103453, -0.09906778826067845, 0.11747897887188527, -0.012191692263715796, -0.4356786764692515, 0.05119660948144479, 0.1596782647797631, 0.0828412691027754, 0.044762022948513426, -0.18924387451261282, 0.007518009334388707, -0.09187925256426549, -0.11921221559168771, 0.1019202734136747, -0.04099125678961476, 0.11576793069252744, -0.09499775064695212, 0.274520904239681, -0.06623436497466173, -0.15324839980651936, 0.1413897360778517, 0.023206207474383216, -0.14589139146523344, 0.11766754279637502, 0.1268847201847368, 0.21443259919113997, -0.11613148531048662, 0.23211897866955647, -0.13126223805981377, 0.09645238530033061, 0.13657981369437444, -0.0411964876887699, 0.08466838222617905, 0.08478722185827792, 0.09013338301641245, 0.06357691493920153, -0.0011602090218932265, -0.025094623962003324, -0.2912966293644988, -0.1541433199826214, -0.24650980444211099, 0.032867642481707864, -0.03089813484499852, -0.09503628393738633, 0.31394837824205346, 0.10216878959909081, 0.18219674738227493, 0.07168368177695407, 0.27689294677434695, 0.06469199793516761, -0.09511085787218893, 0.2034977416171589, 0.14983581099659204, 0.18803916758366135, 0.11614143477183664, -0.21830702584702522, -0.03161900560371578, 0.30873094010166824] |
1,803.0314 | Spin excitations and thermodynamics of the t-J model on the honeycomb
lattice | We present a spin-rotation-invariant Green-function theory for the dynamic
spin susceptibility in the spin-1/2 antiferromagnetic t-J Heisenberg model on
the honeycomb lattice. Employing a generalized mean-field approximation for
arbitrary temperatures and hole dopings, the electronic spectrum of
excitations, the spin-excitation spectrum and thermodynamic quantities
(two-spin correlation functions, staggered magnetization, magnetic
susceptibility, correlation length) are calculated by solving a coupled system
of self-consistency equations for the correlation functions. The temperature
and doping dependence of the magnetic (uniform static) susceptibility is
ascribed to antiferromagnetic short-range order. Our results on the doping
dependencies of the magnetization and susceptibility are analyzed in comparison
with previous results for the t_J model on the square lattice.
| cond-mat.str-el | we present a spinrotationinvariant greenfunction theory for the dynamic spin susceptibility in the spin12 antiferromagnetic tj heisenberg model on the honeycomb lattice employing a generalized meanfield approximation for arbitrary temperatures and hole dopings the electronic spectrum of excitations the spinexcitation spectrum and thermodynamic quantities twospin correlation functions staggered magnetization magnetic susceptibility correlation length are calculated by solving a coupled system of selfconsistency equations for the correlation functions the temperature and doping dependence of the magnetic uniform static susceptibility is ascribed to antiferromagnetic shortrange order our results on the doping dependencies of the magnetization and susceptibility are analyzed in comparison with previous results for the t_j model on the square lattice | [['we', 'present', 'a', 'spinrotationinvariant', 'greenfunction', 'theory', 'for', 'the', 'dynamic', 'spin', 'susceptibility', 'in', 'the', 'spin12', 'antiferromagnetic', 'tj', 'heisenberg', 'model', 'on', 'the', 'honeycomb', 'lattice', 'employing', 'a', 'generalized', 'meanfield', 'approximation', 'for', 'arbitrary', 'temperatures', 'and', 'hole', 'dopings', 'the', 'electronic', 'spectrum', 'of', 'excitations', 'the', 'spinexcitation', 'spectrum', 'and', 'thermodynamic', 'quantities', 'twospin', 'correlation', 'functions', 'staggered', 'magnetization', 'magnetic', 'susceptibility', 'correlation', 'length', 'are', 'calculated', 'by', 'solving', 'a', 'coupled', 'system', 'of', 'selfconsistency', 'equations', 'for', 'the', 'correlation', 'functions', 'the', 'temperature', 'and', 'doping', 'dependence', 'of', 'the', 'magnetic', 'uniform', 'static', 'susceptibility', 'is', 'ascribed', 'to', 'antiferromagnetic', 'shortrange', 'order', 'our', 'results', 'on', 'the', 'doping', 'dependencies', 'of', 'the', 'magnetization', 'and', 'susceptibility', 'are', 'analyzed', 'in', 'comparison', 'with', 'previous', 'results', 'for', 'the', 't_j', 'model', 'on', 'the', 'square', 'lattice']] | [-0.20087854004126382, 0.19599309482357719, -0.019968103486197916, 0.08259856038070708, -0.013981324053284797, -0.1307543281169439, 0.058146600758614525, 0.37393982418897476, -0.21044781059595566, -0.23500689843415537, 0.00017412837002087723, -0.39448316247117793, -0.07948698445688933, 0.13898715606721287, 0.16860051056878134, 0.05887032635509968, -0.06027674870988862, 0.019911924317288637, -0.17368532300672748, -0.2223408824002201, 0.28842928711409593, 0.01555568551709505, 0.3121385733427649, 0.12468153401912951, 0.043562468035485254, 0.10135774032943036, 0.14988502020608974, 0.08199933509935033, -0.16336756221293894, 0.021314643060957844, 0.20964221025563098, -0.12431233772923324, 0.1277530151443154, -0.4044358074834401, -0.2373802472667938, -0.0363987415055321, 0.11509114316325973, 0.13894369238140908, 0.003136412138965997, -0.2646025386130945, -0.010377891555386171, -0.18157625808803873, -0.125675724840469, -0.19157498235475612, -0.04775996711951765, 0.039501205772500145, -0.3080061654221605, 0.19291396763186308, 0.04885364852168343, 0.14841267888180235, -0.16085371474989435, -0.15095714024077592, -0.05088847484227947, 0.06594915336251936, 0.036669472089587624, 0.08685010443864898, 0.11488803104836155, -0.07817817297340794, -0.1487663107569626, 0.3232569547200745, -0.052606888575775716, -0.16222834682769396, 0.08871900892647153, -0.1989580103069205, -0.10417707731777971, 0.10252613532991911, 0.10003397331668318, 0.0940019851804457, -0.1851985480721024, 0.12410165064502507, -0.011554649412970651, 0.2243092977420681, -0.008104341062293812, 0.06833478765646843, 0.22765593738718468, 0.16092901845377955, 0.01295502900399945, 0.17289771782234312, -0.09520719797054136, -0.16108702984638512, -0.2167554850097407, -0.06857614128173074, -0.26568177799609577, 0.07058484243991023, -0.160860334061065, -0.22181226352060382, 0.43586966678161515, 0.1846379505512728, 0.12603733923963525, 0.02237308993935585, 0.22886808777481996, 0.16398926025616345, 0.04445996471596035, 0.06777304800396616, 0.19054289762438698, 0.24772648165235295, 0.13853432872671295, -0.37352063902653754, 0.028624769012359056, 0.09799925461411477] |
1,803.03141 | Regularity of the time constant for a supercritical Bernoulli
percolation | We consider an i.i.d. supercritical bond percolation on Z^d , every edge is
open with a probability p > p\_c (d), where p\_c (d) denotes the critical
parameter for this percolation. We know that there exists almost surely a
unique infinite open cluster C\_p [11]. We are interested in the regularity
properties of the chemical distance for supercritical Bernoulli percolation.
The chemical distance between two points x, y $\in$ C\_p corresponds to the
length of the shortest path in C\_p joining the two points. The chemical
distance between 0 and nx grows asymptotically like n$\mu$\_p (x). We aim to
study the regularity properties of the map p $\rightarrow$ $\mu$\_p in the
supercritical regime. This may be seen as a special case of first passage
percolation where the distribution of the passage time is G\_p = p$\delta$\_1 +
(1 -- p)$\delta$\_$\infty$ , p > p c (d). It is already known that the map p
$\rightarrow$ $\mu$\_p is continuous (see [10]).
| math.PR | we consider an iid supercritical bond percolation on zd every edge is open with a probability p p_c d where p_c d denotes the critical parameter for this percolation we know that there exists almost surely a unique infinite open cluster c_p 11 we are interested in the regularity properties of the chemical distance for supercritical bernoulli percolation the chemical distance between two points x y in c_p corresponds to the length of the shortest path in c_p joining the two points the chemical distance between 0 and nx grows asymptotically like nmu_p x we aim to study the regularity properties of the map p rightarrow mu_p in the supercritical regime this may be seen as a special case of first passage percolation where the distribution of the passage time is g_p pdelta_1 1 pdelta_infty p p c d it is already known that the map p rightarrow mu_p is continuous see 10 | [['we', 'consider', 'an', 'iid', 'supercritical', 'bond', 'percolation', 'on', 'zd', 'every', 'edge', 'is', 'open', 'with', 'a', 'probability', 'p', 'p_c', 'd', 'where', 'p_c', 'd', 'denotes', 'the', 'critical', 'parameter', 'for', 'this', 'percolation', 'we', 'know', 'that', 'there', 'exists', 'almost', 'surely', 'a', 'unique', 'infinite', 'open', 'cluster', 'c_p', '11', 'we', 'are', 'interested', 'in', 'the', 'regularity', 'properties', 'of', 'the', 'chemical', 'distance', 'for', 'supercritical', 'bernoulli', 'percolation', 'the', 'chemical', 'distance', 'between', 'two', 'points', 'x', 'y', 'in', 'c_p', 'corresponds', 'to', 'the', 'length', 'of', 'the', 'shortest', 'path', 'in', 'c_p', 'joining', 'the', 'two', 'points', 'the', 'chemical', 'distance', 'between', '0', 'and', 'nx', 'grows', 'asymptotically', 'like', 'nmu_p', 'x', 'we', 'aim', 'to', 'study', 'the', 'regularity', 'properties', 'of', 'the', 'map', 'p', 'rightarrow', 'mu_p', 'in', 'the', 'supercritical', 'regime', 'this', 'may', 'be', 'seen', 'as', 'a', 'special', 'case', 'of', 'first', 'passage', 'percolation', 'where', 'the', 'distribution', 'of', 'the', 'passage', 'time', 'is', 'g_p', 'pdelta_1', '1', 'pdelta_infty', 'p', 'p', 'c', 'd', 'it', 'is', 'already', 'known', 'that', 'the', 'map', 'p', 'rightarrow', 'mu_p', 'is', 'continuous', 'see', '10']] | [-0.20595824749519429, 0.1996170355543533, -0.06488889466660717, 0.022740345831649997, 0.02011100538385411, -0.17822793963365258, 0.1212652260189255, 0.37139818020164966, -0.3297261649246017, -0.16416933557018637, 0.054732283847018455, -0.33648385151755067, -0.10631231878030424, 0.10589954475057312, -0.0019128699988747637, 0.05109122871731719, -0.007571630487218499, 0.14869265136619408, -0.036884480736528835, -0.23900194122300794, 0.2969216838044425, -0.05922948954626918, 0.2008916055969894, 0.04232464529379892, 0.014058715170249344, 0.017555127619222427, 0.04680448643863201, -0.0074894683218250675, -0.2887300087112817, -0.0022014364910622436, 0.22439643001339088, 0.07779937123933148, 0.26429369379378237, -0.2918956350587541, -0.18356373044972618, 0.21188232789825026, 0.1460069841550042, -0.00016290925986443957, 0.012154093486412118, -0.209459217012239, 0.11641286038327962, -0.08581616041560967, -0.18574874787901838, 0.06349351864308118, 0.17636269563498597, 0.042557775171784065, -0.30906471038237215, 0.06970161677493403, 0.10169127848930656, 0.05110680100663255, -0.019717231074658535, -0.16046352451046308, -0.03691857474545638, 0.14393921983428298, 0.010567508652651061, 0.1619036973128095, 0.09833755579117374, -0.08506867431414623, -0.10299735338427127, 0.3740626471055051, -0.04120668939625224, -0.1406035758756722, 0.16439459587136904, -0.22880636174231767, -0.19232319879345597, 0.11383235782152042, 0.120310713184687, 0.12361272407850872, -0.07764919025202592, 0.19745594171690756, -0.05896581289203217, 0.12800297423033044, 0.1251228056723873, -0.04731337506324053, 0.09968988832537434, 0.15585932261000077, 0.1376939603143061, 0.12976764736929908, -0.09866717432373359, -0.06303489323705434, -0.33587410605046897, -0.15479503561432162, -0.21745266122743487, 0.17448896872500577, -0.17019275287466978, -0.16805809489451348, 0.2555657833317916, 0.10663021710934117, 0.2823332430391262, 0.05094292228420576, 0.16333509484538808, 0.11114250044881677, -0.05711791104249035, 0.12555689598627698, 0.14251627675568065, 0.16734794428649669, 0.05932148111673693, -0.16198660250753164, 0.09533571005798876, 0.10926579117930184] |
1,803.03142 | Local automorphisms on finite-dimensional Lie and Leibniz algebras | We prove that a linear mapping on the algebra \(\mathfrak{sl}_n\) of all
trace zero complex matrices is a local automorphism if and only if it is an
automorphism or an anti-automorphism. We also show that a linear mapping on a
simple Leibniz algebra of the form \(\mathfrak{sl}_n\dot +\mathcal{I}\) is a
local automorphism if and only if it is an automorphism. We give examples of
finite-dimensional nilpotent Lie algebras \(\mathcal{L}\) with \(\dim
\mathcal{L} \geq 3\) which admit local automorphisms which are not
automorphisms.
| math.RA math.FA | we prove that a linear mapping on the algebra mathfraksl_n of all trace zero complex matrices is a local automorphism if and only if it is an automorphism or an antiautomorphism we also show that a linear mapping on a simple leibniz algebra of the form mathfraksl_ndot mathcali is a local automorphism if and only if it is an automorphism we give examples of finitedimensional nilpotent lie algebras mathcall with dim mathcall geq 3 which admit local automorphisms which are not automorphisms | [['we', 'prove', 'that', 'a', 'linear', 'mapping', 'on', 'the', 'algebra', 'mathfraksl_n', 'of', 'all', 'trace', 'zero', 'complex', 'matrices', 'is', 'a', 'local', 'automorphism', 'if', 'and', 'only', 'if', 'it', 'is', 'an', 'automorphism', 'or', 'an', 'antiautomorphism', 'we', 'also', 'show', 'that', 'a', 'linear', 'mapping', 'on', 'a', 'simple', 'leibniz', 'algebra', 'of', 'the', 'form', 'mathfraksl_ndot', 'mathcali', 'is', 'a', 'local', 'automorphism', 'if', 'and', 'only', 'if', 'it', 'is', 'an', 'automorphism', 'we', 'give', 'examples', 'of', 'finitedimensional', 'nilpotent', 'lie', 'algebras', 'mathcall', 'with', 'dim', 'mathcall', 'geq', '3', 'which', 'admit', 'local', 'automorphisms', 'which', 'are', 'not', 'automorphisms']] | [-0.18690446472186364, 0.08353761774340478, -0.07483363142352045, 0.03131734249742563, -0.17712663260667963, -0.17100284661361834, -0.08098346158218236, 0.39938790323557677, -0.4071302847177894, -0.1457771221348257, 0.18687705242040534, -0.2863061397658362, -0.17979984769287208, 0.17163567107895183, -0.12123909048782086, -0.11446280012275149, 0.06011459955451205, 0.20110969314420665, -0.1457690463953272, -0.2953778976275597, 0.4052400092283885, -0.05359580063542788, 0.14197640329093478, 0.0336191437471612, 0.18321709832705466, -0.007712016928435108, 0.07102609830506054, -0.022375826482419616, -0.12031039690550699, 0.017292386656742036, 0.28298198619144566, 0.09638899258613863, 0.19893502710778035, -0.351481064648172, -0.08364780618015814, 0.2624270752946168, 0.1499690496949134, -0.016555978114613228, -0.0630676025312026, -0.2424850315430466, 0.140403329440749, -0.21009864359174246, -0.10705049909337964, -0.08932725590780194, 0.13226779460631036, -0.06273403591303914, -0.27258732607933106, -0.008909400233806306, 0.17192164800463267, 0.16558704655157563, -0.06239600650345286, -0.028051011094192536, -0.13101097672349876, 0.06416877294476661, -0.13806176051658428, 0.03968906242193447, 0.1119662741670546, -0.04240558138922041, -0.09633640293606821, 0.3624076973761857, 0.00039579101872664913, -0.2811221777559201, 0.12591551763959874, -0.20736064515823935, -0.22134295434771498, 0.10190171864527611, 0.03404268751173844, 0.17906286627094456, -0.037263602271308136, 0.2443135744061344, -0.20652408859933968, 0.13308611638660048, 0.013181559517289753, -0.0499025411489937, 0.10634031569884148, 0.07866433267424136, 0.16746149229656124, 0.07814668951395118, 0.09948909188977179, 0.07596464690257922, -0.4047395888669991, -0.18078051382721758, -0.11249326599652615, 0.18800543527205815, -0.10978393830369043, -0.1847514543728328, 0.38781990488864665, 0.07567959493830984, 0.18326453567930945, 0.14363305083544994, 0.20729626966985287, 0.1101633150153506, 0.13826483833017172, 0.17162044440614588, 0.10137009312525208, 0.24075286237545956, -0.15227185590997522, -0.1393340371526134, -0.037497780532978565, 0.21193993574491254] |
1,803.03143 | Efficient method for fractional L\'{e}vy-Feller advection-dispersion
equation using Jacobi polynomials | In this paper, a novel formula expressing explicitly the fractional-order
derivatives, in the sense of Riesz-Feller operator, of Jacobi polynomials is
presented. Jacobi spectral collocation method together with trapezoidal rule
are used to reduce the fractional L\'{e}vy-Feller advection-dispersion equation
(LFADE) to a system of algebraic equations which greatly simplifies solving
like this fractional differential equation. Numerical simulations with some
comparisons are introduced to confirm the effectiveness and reliability of the
proposed technique for the L\'{e}vy-Feller fractional partial differential
equations.
| math.NA | in this paper a novel formula expressing explicitly the fractionalorder derivatives in the sense of rieszfeller operator of jacobi polynomials is presented jacobi spectral collocation method together with trapezoidal rule are used to reduce the fractional levyfeller advectiondispersion equation lfade to a system of algebraic equations which greatly simplifies solving like this fractional differential equation numerical simulations with some comparisons are introduced to confirm the effectiveness and reliability of the proposed technique for the levyfeller fractional partial differential equations | [['in', 'this', 'paper', 'a', 'novel', 'formula', 'expressing', 'explicitly', 'the', 'fractionalorder', 'derivatives', 'in', 'the', 'sense', 'of', 'rieszfeller', 'operator', 'of', 'jacobi', 'polynomials', 'is', 'presented', 'jacobi', 'spectral', 'collocation', 'method', 'together', 'with', 'trapezoidal', 'rule', 'are', 'used', 'to', 'reduce', 'the', 'fractional', 'levyfeller', 'advectiondispersion', 'equation', 'lfade', 'to', 'a', 'system', 'of', 'algebraic', 'equations', 'which', 'greatly', 'simplifies', 'solving', 'like', 'this', 'fractional', 'differential', 'equation', 'numerical', 'simulations', 'with', 'some', 'comparisons', 'are', 'introduced', 'to', 'confirm', 'the', 'effectiveness', 'and', 'reliability', 'of', 'the', 'proposed', 'technique', 'for', 'the', 'levyfeller', 'fractional', 'partial', 'differential', 'equations']] | [-0.1311851685317472, -0.029246682074303046, -0.08879567902439679, 0.04446555694224886, -0.16194161920784375, -0.12667167612996239, -0.011003047969634047, 0.250253520714931, -0.30829910076677036, -0.28743216543434524, 0.11701887892260669, -0.27551483642309904, -0.1920424090602841, 0.20854921758365938, -0.09446923203396206, 0.16640264275841987, 0.049179698313729696, -0.012523085759498943, -0.1374727772632375, -0.2556406644722208, 0.33766266350479174, 0.007636613857287627, 0.19444589244010738, -0.0047197672180258315, 0.179783520133545, -0.046840734094775356, -0.11820685008887011, -0.03133715336652807, -0.13883366447706252, 0.13106147085506029, 0.25890449205270183, 0.03663918015379936, 0.28809453083727604, -0.40794768159349376, -0.18802733196375462, 0.05956770970414464, 0.1842906157581661, 0.04992701975742164, -0.006337733972125137, -0.3120247530392729, 0.07159146448621193, -0.17701500684070665, -0.20902839279136595, -0.1341680710633787, -0.010790251263339693, 0.1276565473049115, -0.2826171339226839, 0.11706341043687783, 0.0448614903845084, 0.021711074403869227, -0.07252360697692403, -0.15297054235811514, -0.003731808983362638, -0.007313404583002035, -0.009025281823526781, -0.047091330688160196, 0.006947193826095034, -0.07039945526794793, -0.13911271643547268, 0.35187549624018943, -0.0637677141602557, -0.3563855667717946, 0.05837164772674441, -0.11327159356994507, -0.1488982833778629, 0.1460263172057472, 0.13114953805835775, 0.1815939667330195, -0.17884359636511177, 0.07317062552633266, -0.017641170236926813, 0.13138659112155437, 0.10766939649310632, -0.01323168259114027, 0.030267959508376244, 0.10071383126509878, 0.05796636784305939, 0.12596611695316356, 0.0028620538994287834, -0.1943459620173925, -0.3151526708657352, -0.21559800346716282, -0.136181879728937, 0.0005240786092308087, -0.13577488238362817, -0.18113592773293838, 0.3624131201933592, 0.184895490654386, 0.08651148749945256, 0.07939688740328002, 0.27116175670809567, 0.3146127830319202, 0.02370521506199088, 0.004637654371132764, 0.13003595208768579, 0.2361844774419203, 0.18145704777457583, -0.3066389537177598, 0.022841049232878365, 0.21413420260143587] |
1,803.03144 | A model structure for the Goldman-Millson theorem | By a result of Vallette, we put a sensible model structure on the category of
conilpotent Lie coalgebras. This gives us a powerful tool to study the
subcategory of Lie algebras obtained by linear dualization, also known as the
category of pronilpotent Lie algebras. This way, we recover weaker versions of
the celebrated Goldman-Millson theorem and Dolgushev-Rogers theorem by purely
homotopical methods. We explore the relations of this procedure with the
existent literature, namely the works of Lazarev-Markl and
Buijs-F\'elix-Murillo-Tanr\'e.
| math.QA math.AT | by a result of vallette we put a sensible model structure on the category of conilpotent lie coalgebras this gives us a powerful tool to study the subcategory of lie algebras obtained by linear dualization also known as the category of pronilpotent lie algebras this way we recover weaker versions of the celebrated goldmanmillson theorem and dolgushevrogers theorem by purely homotopical methods we explore the relations of this procedure with the existent literature namely the works of lazarevmarkl and buijsfelixmurillotanre | [['by', 'a', 'result', 'of', 'vallette', 'we', 'put', 'a', 'sensible', 'model', 'structure', 'on', 'the', 'category', 'of', 'conilpotent', 'lie', 'coalgebras', 'this', 'gives', 'us', 'a', 'powerful', 'tool', 'to', 'study', 'the', 'subcategory', 'of', 'lie', 'algebras', 'obtained', 'by', 'linear', 'dualization', 'also', 'known', 'as', 'the', 'category', 'of', 'pronilpotent', 'lie', 'algebras', 'this', 'way', 'we', 'recover', 'weaker', 'versions', 'of', 'the', 'celebrated', 'goldmanmillson', 'theorem', 'and', 'dolgushevrogers', 'theorem', 'by', 'purely', 'homotopical', 'methods', 'we', 'explore', 'the', 'relations', 'of', 'this', 'procedure', 'with', 'the', 'existent', 'literature', 'namely', 'the', 'works', 'of', 'lazarevmarkl', 'and', 'buijsfelixmurillotanre']] | [-0.09839321222373998, -0.025117779634409136, -0.12154572815090031, 0.1401213446719717, -0.15312168730253523, -0.1324410238907999, 0.04507973424896791, 0.3258622772991657, -0.34733736609386934, -0.25219417438394837, 0.09348351842203698, -0.15803051263988985, -0.15068521215157074, 0.21576609385998122, -0.16661806264287465, -0.07159708060517714, 0.06419307024931753, 0.06265711045957037, -0.08583826424142757, -0.2347233088342352, 0.43753081350284934, 0.03729730579312649, 0.2576096150903152, -0.004848874579244233, 0.10526865533274876, 0.05700436970460918, -0.07040750070825799, 0.0217336002652618, -0.2062674838363181, 0.17787711356778618, 0.26901877543272135, 0.08300617665004034, 0.21886257687583566, -0.35225741816805556, -0.11893816468874355, 0.11135571266300734, 0.1000579830777662, 0.10299322625936626, -0.02484136740767772, -0.32839345270404957, 0.0803234436633912, -0.23474735120770993, -0.14257535591794104, -0.07764675629071215, 0.015347609399249415, -0.027020378482782027, -0.19229520766394115, 0.03981504505522876, 0.17612309427931905, 0.0804328891484962, -0.09097681426769727, -0.07760526127992319, -0.04404310700665047, 0.07950670189865224, -0.025960943230742273, 0.01218077506833746, 0.1160864206242629, -0.07951922668144107, -0.18128119575996676, 0.37202281117826314, -0.04173658624920365, -0.1680885154947445, 0.17667215554551643, -0.11724786793619588, -0.18967007904603786, 0.04344806412549375, 0.03960807498109031, 0.15773776841241044, -0.10652403693794357, 0.18114597571548074, -0.16530732740950468, 0.0183330127945194, 0.062219180493289, 0.02502086046968236, 0.11996084252862235, 0.14501261979027033, 0.035029200304831774, 0.16061536323690376, 0.03403030109422451, -0.040060747305971464, -0.32208722065408507, -0.14796247319983585, -0.04168116800523327, 0.09993726138460945, -0.08512132195718042, -0.1575841846839561, 0.394625519874034, 0.17528525858440183, 0.18713991412917128, 0.14164387726817618, 0.2448166047779287, 0.08239948638116143, 0.12572346631945533, 0.003914654762907462, 0.19994972798937036, 0.3026501914431861, 0.053618946796065416, -0.07910332546944356, -0.02413107466569485, 0.2262815706818909] |
1,803.03145 | Physical Layer Communications System Design Over-the-Air Using
Adversarial Networks | This paper presents a novel method for synthesizing new physical layer
modulation and coding schemes for communications systems using a learning-based
approach which does not require an analytic model of the impairments in the
channel. It extends prior work published on the channel autoencoder to consider
the case where the channel response is not known or can not be easily modeled
in a closed form analytic expression. By adopting an adversarial approach for
channel response approximation and information encoding, we can jointly learn a
good solution to both tasks over a wide range of channel environments. We
describe the operation of the proposed adversarial system, share results for
its training and validation over-the-air, and discuss implications and future
work in the area.
| eess.SP cs.LG | this paper presents a novel method for synthesizing new physical layer modulation and coding schemes for communications systems using a learningbased approach which does not require an analytic model of the impairments in the channel it extends prior work published on the channel autoencoder to consider the case where the channel response is not known or can not be easily modeled in a closed form analytic expression by adopting an adversarial approach for channel response approximation and information encoding we can jointly learn a good solution to both tasks over a wide range of channel environments we describe the operation of the proposed adversarial system share results for its training and validation overtheair and discuss implications and future work in the area | [['this', 'paper', 'presents', 'a', 'novel', 'method', 'for', 'synthesizing', 'new', 'physical', 'layer', 'modulation', 'and', 'coding', 'schemes', 'for', 'communications', 'systems', 'using', 'a', 'learningbased', 'approach', 'which', 'does', 'not', 'require', 'an', 'analytic', 'model', 'of', 'the', 'impairments', 'in', 'the', 'channel', 'it', 'extends', 'prior', 'work', 'published', 'on', 'the', 'channel', 'autoencoder', 'to', 'consider', 'the', 'case', 'where', 'the', 'channel', 'response', 'is', 'not', 'known', 'or', 'can', 'not', 'be', 'easily', 'modeled', 'in', 'a', 'closed', 'form', 'analytic', 'expression', 'by', 'adopting', 'an', 'adversarial', 'approach', 'for', 'channel', 'response', 'approximation', 'and', 'information', 'encoding', 'we', 'can', 'jointly', 'learn', 'a', 'good', 'solution', 'to', 'both', 'tasks', 'over', 'a', 'wide', 'range', 'of', 'channel', 'environments', 'we', 'describe', 'the', 'operation', 'of', 'the', 'proposed', 'adversarial', 'system', 'share', 'results', 'for', 'its', 'training', 'and', 'validation', 'overtheair', 'and', 'discuss', 'implications', 'and', 'future', 'work', 'in', 'the', 'area']] | [-0.12924395807728659, -0.014342453649227477, -0.0817833322627073, 0.03069769650636638, -0.08598653388927217, -0.202056363965461, 0.06719033420944709, 0.42340529294776136, -0.2613693677179027, -0.2931182933627765, 0.10165005189950624, -0.203702100938125, -0.21766661327202483, 0.21399954903000568, -0.13827344750008377, 0.08574439093926692, 0.06262164536794862, 0.0251582365761679, -0.06279270502845527, -0.22196938140417036, 0.3084244583332606, 0.057033986723447436, 0.3171642615524747, 0.04705795580063198, 0.1111382008988227, 0.036845922660937565, -0.013315273838148255, -0.029291277972706517, -0.10274573821993353, 0.11104726343421403, 0.30103432879302283, 0.17367757401490186, 0.26349176732120944, -0.41710234767772625, -0.3060420566528547, 0.07639320943405332, 0.17207604516908281, 0.13929580606913317, -0.06392225287339391, -0.28027481913803237, 0.09207069425276847, -0.24366713882439206, -0.02883549790722547, -0.0924396285191789, -0.05367763314136594, -0.012018478704524821, -0.352414786277461, 0.017305438693032645, 0.07716928714825237, 0.033830685342555164, -0.09593620779637828, -0.09453816135074242, 0.06980024612523981, 0.15759748645455074, -0.011650154300293595, 0.04122183948839236, 0.10224591021914585, -0.14388509622496384, -0.10716019654417502, 0.3492740303369575, -0.0624608792265358, -0.2554646402656589, 0.160473046666412, -0.06621299808096813, -0.09588339508007296, 0.09662786113159334, 0.25690842284744636, 0.12290737057318453, -0.20998848597595438, 0.04602748809380411, -0.024165440602686074, 0.17701647671886156, 0.01616997742590296, 0.05503642782721607, 0.15797899382524802, 0.20892319390855607, 0.04802365673202105, 0.13752639905232783, -0.09472170887232499, -0.08741812323998721, -0.2817969530912452, -0.13476800349861628, -0.1779639002500621, -0.0122756273768409, -0.025899499238131864, -0.11726726192494828, 0.3917768778428283, 0.1857362136275309, 0.18971301819442116, 0.09431705315364525, 0.35746937569566684, 0.07207123128712543, 0.06634775504133984, 0.11373590741718768, 0.20129953177462592, 0.0760099483943987, 0.1151867670152092, -0.14852328325972938, 0.10683916391591068, -0.016867052572855694] |
1,803.03146 | SentRNA: Improving computational RNA design by incorporating a prior of
human design strategies | Solving the RNA inverse folding problem is a critical prerequisite to RNA
design, an emerging field in bioengineering with a broad range of applications
from reaction catalysis to cancer therapy. Although significant progress has
been made in developing machine-based inverse RNA folding algorithms, current
approaches still have difficulty designing sequences for large or complex
targets. On the other hand, human players of the online RNA design game EteRNA
have consistently shown superior performance in this regard, being able to
readily design sequences for targets that are challenging for machine
algorithms. Here we present a novel approach to the RNA design problem,
SentRNA, a design agent consisting of a fully-connected neural network trained
end-to-end using human-designed RNA sequences. We show that through this
approach, SentRNA can solve complex targets previously unsolvable by any
machine-based approach and achieve state-of-the-art performance on two separate
challenging test sets. Our results demonstrate that incorporating human design
strategies into a design algorithm can significantly boost machine performance
and suggests a new paradigm for machine-based RNA design.
| q-bio.QM cs.AI stat.ML | solving the rna inverse folding problem is a critical prerequisite to rna design an emerging field in bioengineering with a broad range of applications from reaction catalysis to cancer therapy although significant progress has been made in developing machinebased inverse rna folding algorithms current approaches still have difficulty designing sequences for large or complex targets on the other hand human players of the online rna design game eterna have consistently shown superior performance in this regard being able to readily design sequences for targets that are challenging for machine algorithms here we present a novel approach to the rna design problem sentrna a design agent consisting of a fullyconnected neural network trained endtoend using humandesigned rna sequences we show that through this approach sentrna can solve complex targets previously unsolvable by any machinebased approach and achieve stateoftheart performance on two separate challenging test sets our results demonstrate that incorporating human design strategies into a design algorithm can significantly boost machine performance and suggests a new paradigm for machinebased rna design | [['solving', 'the', 'rna', 'inverse', 'folding', 'problem', 'is', 'a', 'critical', 'prerequisite', 'to', 'rna', 'design', 'an', 'emerging', 'field', 'in', 'bioengineering', 'with', 'a', 'broad', 'range', 'of', 'applications', 'from', 'reaction', 'catalysis', 'to', 'cancer', 'therapy', 'although', 'significant', 'progress', 'has', 'been', 'made', 'in', 'developing', 'machinebased', 'inverse', 'rna', 'folding', 'algorithms', 'current', 'approaches', 'still', 'have', 'difficulty', 'designing', 'sequences', 'for', 'large', 'or', 'complex', 'targets', 'on', 'the', 'other', 'hand', 'human', 'players', 'of', 'the', 'online', 'rna', 'design', 'game', 'eterna', 'have', 'consistently', 'shown', 'superior', 'performance', 'in', 'this', 'regard', 'being', 'able', 'to', 'readily', 'design', 'sequences', 'for', 'targets', 'that', 'are', 'challenging', 'for', 'machine', 'algorithms', 'here', 'we', 'present', 'a', 'novel', 'approach', 'to', 'the', 'rna', 'design', 'problem', 'sentrna', 'a', 'design', 'agent', 'consisting', 'of', 'a', 'fullyconnected', 'neural', 'network', 'trained', 'endtoend', 'using', 'humandesigned', 'rna', 'sequences', 'we', 'show', 'that', 'through', 'this', 'approach', 'sentrna', 'can', 'solve', 'complex', 'targets', 'previously', 'unsolvable', 'by', 'any', 'machinebased', 'approach', 'and', 'achieve', 'stateoftheart', 'performance', 'on', 'two', 'separate', 'challenging', 'test', 'sets', 'our', 'results', 'demonstrate', 'that', 'incorporating', 'human', 'design', 'strategies', 'into', 'a', 'design', 'algorithm', 'can', 'significantly', 'boost', 'machine', 'performance', 'and', 'suggests', 'a', 'new', 'paradigm', 'for', 'machinebased', 'rna', 'design']] | [-0.052788146027957, 0.028810942082037355, -0.0476328390887786, 0.06492065260161846, -0.11354277433738821, -0.22496712025964544, 0.022728988265347045, 0.4561253833179806, -0.25547314037768437, -0.3195097986348888, 0.042037234157240685, -0.19674695710030696, -0.28042111414833926, 0.25288504889717195, -0.11128447881145846, 0.11367482052827697, 0.16654258824183626, 0.012470972729802486, 0.026504871741746597, -0.25669576150054735, 0.2663405188927538, 0.0538000295387714, 0.3304606828647333, 0.0317308715893887, 0.1060175366236806, -0.024274846001173415, 0.035127575398031956, 0.0200429866478468, -0.11293124945877069, 0.19414716309880273, 0.3632158660149712, 0.2232000938924362, 0.3406577925308652, -0.4202784299739592, -0.248140028835873, 0.11449690485217918, 0.1851364291533606, 0.14845778612652794, -0.10581465693151888, -0.27527708683295976, 0.12194223866321235, -0.13969835139522774, -0.0073749689285510355, -0.12849034199358098, -0.022150672957650386, -0.004224056626775391, -0.2879881714248941, -0.04333375467519675, 0.026277562270739248, 0.08286192641147257, -0.06785164149533514, -0.18516007700790874, 0.09967613614779632, 0.1642673150012602, 0.03405665743533367, 0.053718535256761936, 0.17037486265568683, -0.1514484816746387, -0.22046544691381445, 0.36322317899958717, 0.011621435322532696, -0.20973918330439897, 0.1837604474830663, 0.00634332949093299, -0.19283176828563833, 0.16890078280509138, 0.2278903762344271, 0.12832327636334367, -0.202278578071855, 0.037045692463011835, 0.01818562139912198, 0.20264008642836762, 0.048117183306853155, -0.0466405429338227, 0.1893200589187299, 0.3013636843367879, 0.05540027269827468, 0.14795905987938612, -0.054197029653074595, -0.10414198431230727, -0.14255063026766515, -0.12917429079971043, -0.14161111277505933, 0.015509822303318373, -0.04903889824674393, -0.16306983206024078, 0.3647291145974859, 0.1785222648565347, 0.1346738189098514, 0.10888303134457342, 0.34741241828582825, -0.012857890272806842, 0.11954823493163401, 0.02704778525678973, 0.18107265985426715, 0.02725705962456275, 0.11323273595744035, -0.213242280059993, 0.1143290692998562, 0.003957041088142432] |
1,803.03147 | Some properties of $\{k\}$-packing function problem in graphs | The recently introduced $\{k\}$-packing function problem is considered in
this paper. Special relation between a case when $k=1$, $k\ge 2$ and linear
programming relaxation is introduced with sufficient conditions for optimality.
For arbitrary simple connected graph $G$ there is construction procedure for
finding values of $k$ for which $L_{\{k\}}(G)$ can be determined in the
polynomial time. Additionally, relationship between $\{1\}$-packing function
and independent set number is established. Optimal values for some special
classes of graphs and general upper and lower bounds are introduced.
| math.CO | the recently introduced kpacking function problem is considered in this paper special relation between a case when k1 kge 2 and linear programming relaxation is introduced with sufficient conditions for optimality for arbitrary simple connected graph g there is construction procedure for finding values of k for which l_kg can be determined in the polynomial time additionally relationship between 1packing function and independent set number is established optimal values for some special classes of graphs and general upper and lower bounds are introduced | [['the', 'recently', 'introduced', 'kpacking', 'function', 'problem', 'is', 'considered', 'in', 'this', 'paper', 'special', 'relation', 'between', 'a', 'case', 'when', 'k1', 'kge', '2', 'and', 'linear', 'programming', 'relaxation', 'is', 'introduced', 'with', 'sufficient', 'conditions', 'for', 'optimality', 'for', 'arbitrary', 'simple', 'connected', 'graph', 'g', 'there', 'is', 'construction', 'procedure', 'for', 'finding', 'values', 'of', 'k', 'for', 'which', 'l_kg', 'can', 'be', 'determined', 'in', 'the', 'polynomial', 'time', 'additionally', 'relationship', 'between', '1packing', 'function', 'and', 'independent', 'set', 'number', 'is', 'established', 'optimal', 'values', 'for', 'some', 'special', 'classes', 'of', 'graphs', 'and', 'general', 'upper', 'and', 'lower', 'bounds', 'are', 'introduced']] | [-0.14532318911010242, 0.11196843127114137, -0.014833801588694373, 0.0653618255234604, -0.10801960525372212, -0.20230887511026968, 0.03977104035873774, 0.3468071835070669, -0.2543296094938933, -0.35383199711319013, 0.11049372920239098, -0.20134374432557497, -0.17774244419759117, 0.2286708910040647, -0.054806113299206795, 0.06780119635009049, 0.018862880693456853, 0.0490602496057659, -0.06391531722732337, -0.28891101354313736, 0.30018405115837793, -0.00551863268287067, 0.2119598364827773, 0.09064580039303548, 0.10411381559917726, 0.028391473376786852, 0.009485944536099413, 0.06713845298614309, -0.2194058191541762, 0.0655469426153093, 0.3096230271642646, 0.14430391095381956, 0.2616088298227952, -0.3393129200102335, -0.13526547951196005, 0.2083414571853467, 0.09294869966737657, 0.038982330904207586, -0.005131372026201472, -0.19356992084207575, 0.14333029921974494, -0.1008155454758061, -0.08960249758022557, -0.01955183213913297, 0.125977902347783, -0.0021388054073575033, -0.3617416196783264, 0.03783907688570669, 0.08930994377258313, 0.06764162988479092, -0.03911247232883989, -0.16786176697715713, 0.02364491890970034, 0.0994874498521466, -0.008471626081470266, 0.045642209402004995, -0.013845277333026191, -0.050995554860557867, -0.0898815931483026, 0.31970978901351255, -0.03212394417790943, -0.2413663195782055, 0.13397096953612853, -0.08754282820610756, -0.17822377261683256, 0.07646722889909274, 0.13596672829554743, 0.15619860793160925, -0.13661175655255078, 0.13419093058938272, -0.1056854440101299, 0.09525281012462206, 0.1389959330378796, 0.02268291102422132, 0.08717183607170381, 0.11414549914356995, 0.153329707760678, 0.18602519849152585, 0.04079201274428023, -0.05041389626518161, -0.31665711811777336, -0.10883339273733514, -0.21257445892790355, 0.001943377340324672, -0.16144724164918312, -0.11976057283036097, 0.3453042152595807, 0.055228525194821944, 0.17712468854768806, 0.15813388048351396, 0.22207363005671427, 0.18948876223592115, 0.0024673757984875195, 0.15038590571921634, 0.15776485087615102, 0.1989183281323906, -0.006478301260665238, -0.15103359305277378, 0.09963272276042726, 0.14504397116287285] |
1,803.03148 | Generating Artificial Data for Private Deep Learning | In this paper, we propose generating artificial data that retain statistical
properties of real data as the means of providing privacy with respect to the
original dataset. We use generative adversarial network to draw
privacy-preserving artificial data samples and derive an empirical method to
assess the risk of information disclosure in a differential-privacy-like way.
Our experiments show that we are able to generate artificial data of high
quality and successfully train and validate machine learning models on this
data while limiting potential privacy loss.
| cs.LG cs.CR stat.ML | in this paper we propose generating artificial data that retain statistical properties of real data as the means of providing privacy with respect to the original dataset we use generative adversarial network to draw privacypreserving artificial data samples and derive an empirical method to assess the risk of information disclosure in a differentialprivacylike way our experiments show that we are able to generate artificial data of high quality and successfully train and validate machine learning models on this data while limiting potential privacy loss | [['in', 'this', 'paper', 'we', 'propose', 'generating', 'artificial', 'data', 'that', 'retain', 'statistical', 'properties', 'of', 'real', 'data', 'as', 'the', 'means', 'of', 'providing', 'privacy', 'with', 'respect', 'to', 'the', 'original', 'dataset', 'we', 'use', 'generative', 'adversarial', 'network', 'to', 'draw', 'privacypreserving', 'artificial', 'data', 'samples', 'and', 'derive', 'an', 'empirical', 'method', 'to', 'assess', 'the', 'risk', 'of', 'information', 'disclosure', 'in', 'a', 'differentialprivacylike', 'way', 'our', 'experiments', 'show', 'that', 'we', 'are', 'able', 'to', 'generate', 'artificial', 'data', 'of', 'high', 'quality', 'and', 'successfully', 'train', 'and', 'validate', 'machine', 'learning', 'models', 'on', 'this', 'data', 'while', 'limiting', 'potential', 'privacy', 'loss']] | [-0.016716346783207235, -0.06546291601630236, -0.08992138507226145, 0.11033963297314224, -0.1227125597119062, -0.12696350078064814, 0.0869743178825803, 0.442980546190078, -0.27674209491170226, -0.39330959452262865, 0.08110719801947834, -0.3282167894473995, -0.17943583810365343, 0.17955678818377116, -0.17181191233222384, 0.12343030342136521, 0.0973701399445242, 0.029086465619122946, -0.0011015975769295033, -0.3199911972575159, 0.35984773299914885, 0.06310787938355682, 0.38396628584757625, 0.00968480744141053, 0.12665286626952912, -0.047231853524424945, -0.02220373085408236, -0.03398559856402452, -0.09021180065391524, 0.22496745589256556, 0.29312811179440895, 0.25893198909148213, 0.34336150157074613, -0.44720987441489496, -0.20269925121487264, 0.12316979974485844, 0.09380042363878295, 0.12936288692584508, -0.12710985349048018, -0.32151753325239724, 0.09611483726437282, -0.15003484401133765, -0.07138967723866184, -0.2520192973932857, -0.060748367522652426, 0.016076418787874955, -0.32747242796088916, 0.023465054836236388, 0.032891441063663686, 0.09070170843547368, -0.04398683801921735, -0.05579152773414929, -0.027636091034096408, 0.158074049654989, 0.06901753526629813, 0.019283805456270564, 0.11848678640146033, -0.14406275671713212, -0.15433968135425036, 0.34830859634486666, -0.07294377112054233, -0.20611506182116918, 0.16437889099771896, -0.046123166647122564, -0.1474556107500411, 0.04835706787094115, 0.31211069286857024, 0.04926336285130805, -0.22115461566451802, -0.013730103572892272, -0.025941232713051588, 0.17886942713689732, -0.010543743134420141, 0.0018640965761908565, 0.12124345836465258, 0.22209291963723027, 0.021017547079687376, 0.17473565389301224, -0.14598235654846642, -0.05748110417141972, -0.21888926560171398, -0.12414217596671667, -0.1978896871231586, 0.01941883695278182, -0.08691557858462574, -0.1498459609876196, 0.3681018705289048, 0.32891328639283507, 0.24958313212180175, 0.12836143009768552, 0.3817350010959858, 0.026372426015560526, 0.07199588143308815, 0.07758834296332515, 0.19462242462189802, 0.0244242082944656, 0.10310693095011794, -0.1504996935051518, 0.10545045067275684, -0.08060959551528275] |
1,803.03149 | Entanglement entropy and Berezin-Toeplitz operators | We consider Berezin-Toeplitz operators on compact Kahler manifolds whose
symbols are characteristic functions. When the support of the characteristic
function has a smooth boundary, we prove a two-term Weyl law, the second term
being proportional to the Riemannian volume of the boundary. As a consequence,
we deduce the area law for the entanglement entropy of integer quantum Hall
states. Another application is for the determinantal processes with correlation
kernel the Bergman kernels of a positive line bundle : we prove that the number
of points in a smooth domain is asymptotically normal.
| math-ph cond-mat.mes-hall math.MP math.SP quant-ph | we consider berezintoeplitz operators on compact kahler manifolds whose symbols are characteristic functions when the support of the characteristic function has a smooth boundary we prove a twoterm weyl law the second term being proportional to the riemannian volume of the boundary as a consequence we deduce the area law for the entanglement entropy of integer quantum hall states another application is for the determinantal processes with correlation kernel the bergman kernels of a positive line bundle we prove that the number of points in a smooth domain is asymptotically normal | [['we', 'consider', 'berezintoeplitz', 'operators', 'on', 'compact', 'kahler', 'manifolds', 'whose', 'symbols', 'are', 'characteristic', 'functions', 'when', 'the', 'support', 'of', 'the', 'characteristic', 'function', 'has', 'a', 'smooth', 'boundary', 'we', 'prove', 'a', 'twoterm', 'weyl', 'law', 'the', 'second', 'term', 'being', 'proportional', 'to', 'the', 'riemannian', 'volume', 'of', 'the', 'boundary', 'as', 'a', 'consequence', 'we', 'deduce', 'the', 'area', 'law', 'for', 'the', 'entanglement', 'entropy', 'of', 'integer', 'quantum', 'hall', 'states', 'another', 'application', 'is', 'for', 'the', 'determinantal', 'processes', 'with', 'correlation', 'kernel', 'the', 'bergman', 'kernels', 'of', 'a', 'positive', 'line', 'bundle', 'we', 'prove', 'that', 'the', 'number', 'of', 'points', 'in', 'a', 'smooth', 'domain', 'is', 'asymptotically', 'normal']] | [-0.20703635049554017, 0.09431793296116066, -0.09276506267897375, 0.09633198229258287, -0.09743632718275946, -0.147328457191259, 0.006123274136181143, 0.32619807604127204, -0.27086455600111037, -0.14444452667465577, 0.11227689699172605, -0.29693837361512604, -0.17299704693749055, 0.19033727477110185, -0.09621132336106601, 0.07113112555305054, 0.009843092012618269, 0.10302288356943282, -0.10593588141325329, -0.23260879230424558, 0.47498248431545037, -0.030098263160223244, 0.24067776815986242, 0.09998463949823118, 0.13865801171594105, -0.04425012548505278, 0.009390993293881376, 0.0034456962801434183, -0.12706003045692982, 0.0815261616083732, 0.25574632666513814, 0.033841918846899334, 0.24633116658858872, -0.3758519615691442, -0.19968711856015764, 0.17905062272285038, 0.08092491367094956, 0.022944035786357554, -0.00557409527175548, -0.2553231982043484, 0.07937594127820825, -0.12394341863282435, -0.20120778169667164, -0.06383507308846974, 0.056696797465230084, 0.016486901882012468, -0.2891185759914691, 0.05708203296903726, 0.10788158142099996, 0.055339022693070734, -0.09500284292376958, -0.09947273363410444, -0.013116510610536232, 0.0856214517994226, 0.01026225177914027, 0.058185754767312046, 0.11621458801424264, -0.08294071318648223, -0.10922540202775233, 0.28838698444171595, -0.08879379782784771, -0.2734010158577463, 0.10672612497480688, -0.19358368331801842, -0.08564667378623898, 0.08997526141088251, 0.1295601470596771, 0.16996659902209074, -0.059298049677246514, 0.17432404804596124, -0.07969105913262856, 0.08708896031117087, 0.0669827360895227, 0.025769289414101577, 0.16137042996514547, 0.06531650281081405, 0.16295314258332927, 0.20392456030470554, -0.0647522363182321, -0.10134921191710529, -0.39896324383361, -0.2761040288279509, -0.24637795843511492, 0.1481089660959257, -0.15479925201161876, -0.24833662130429848, 0.38524844045597284, -0.02223816385574557, 0.23801771750939743, 0.15911790402094414, 0.22661497834865207, 0.17659731127531522, 0.08695558031795772, 0.07986874136418759, 0.14125749079899474, 0.18981708704166442, 0.070542636506546, -0.18825562863008138, 0.004908729723276018, 0.1717927418956226] |
1,803.0315 | Nonlinear elliptic equations with measure valued absorption potential | We study the semilinear elliptic equation --$\Delta$u + g(u)$\sigma$ = $\mu$
with Dirichlet boundary condition in a smooth bounded domain where $\sigma$ is
a nonnegative Radon measure, $\mu$ a Radon measure and g is an absorbing
nonlinearity. We show that the problem is well posed if we assume that $\sigma$
belongs to some Morrey class. Under this condition we give a general existence
result for any bounded measure provided g satisfies a subcritical integral
assumption. We study also the supercritical case when g(r) = |r| ^{q--1} r,
with q > 1 and $\mu$ satisfies an absolute continuity condition expressed in
terms of some capacities involving $\sigma$. 2010 Mathematics Subject
Classification. 35 J 61; 31 B 15; 28 C 05 .
| math.AP | we study the semilinear elliptic equation deltau gusigma mu with dirichlet boundary condition in a smooth bounded domain where sigma is a nonnegative radon measure mu a radon measure and g is an absorbing nonlinearity we show that the problem is well posed if we assume that sigma belongs to some morrey class under this condition we give a general existence result for any bounded measure provided g satisfies a subcritical integral assumption we study also the supercritical case when gr r q1 r with q 1 and mu satisfies an absolute continuity condition expressed in terms of some capacities involving sigma 2010 mathematics subject classification 35 j 61 31 b 15 28 c 05 | [['we', 'study', 'the', 'semilinear', 'elliptic', 'equation', 'deltau', 'gusigma', 'mu', 'with', 'dirichlet', 'boundary', 'condition', 'in', 'a', 'smooth', 'bounded', 'domain', 'where', 'sigma', 'is', 'a', 'nonnegative', 'radon', 'measure', 'mu', 'a', 'radon', 'measure', 'and', 'g', 'is', 'an', 'absorbing', 'nonlinearity', 'we', 'show', 'that', 'the', 'problem', 'is', 'well', 'posed', 'if', 'we', 'assume', 'that', 'sigma', 'belongs', 'to', 'some', 'morrey', 'class', 'under', 'this', 'condition', 'we', 'give', 'a', 'general', 'existence', 'result', 'for', 'any', 'bounded', 'measure', 'provided', 'g', 'satisfies', 'a', 'subcritical', 'integral', 'assumption', 'we', 'study', 'also', 'the', 'supercritical', 'case', 'when', 'gr', 'r', 'q1', 'r', 'with', 'q', '1', 'and', 'mu', 'satisfies', 'an', 'absolute', 'continuity', 'condition', 'expressed', 'in', 'terms', 'of', 'some', 'capacities', 'involving', 'sigma', '2010', 'mathematics', 'subject', 'classification', '35', 'j', '61', '31', 'b', '15', '28', 'c', '05']] | [-0.15984892637648604, 0.0863914404111902, -0.04215275557924127, 0.052208372316192506, -0.09693837720949791, -0.20400416935597987, 0.017269261487710633, 0.30233232738662574, -0.27674589096977, -0.21802409382929144, 0.13115861243159885, -0.29719655059702826, -0.09495148211186588, 0.14243131933178296, -0.11031026388273428, 0.03983070767125148, 0.05499252727818921, 0.07571543610883007, -0.06388763645091992, -0.23537693847289407, 0.3443671175066316, -0.12555363616628343, 0.18867485907277, 0.09623195892843221, 0.08585303484895185, -0.021371157605021278, -0.0045985034258480655, 0.011485245969277202, -0.2800726100600482, 0.020802705361826445, 0.20331826057742564, 0.09380371820410355, 0.296453595063404, -0.29334823883612426, -0.17650460544565136, 0.22778809434538216, 0.04633489676359061, -0.07702346260071193, -0.016512560205771017, -0.27718666098856676, 0.1450326486425311, -0.11965178284924805, -0.19455872515927217, 0.003478959645961591, 0.12454426997717012, 0.010374034461851249, -0.3837531829710331, 0.10853191526997794, 0.13284410453062473, 0.0809648382934954, -0.13002811360025876, -0.14505342709762453, 0.0006380592566800484, -0.004635926679934767, -0.0065446395545446295, 0.1263996820994898, 0.0685892220169894, -0.07701134570392273, -0.018145321492563215, 0.37668371433392167, -0.13712922228385874, -0.29999387184190646, 0.14026783493739603, -0.2075997476252572, -0.14713597633434752, 0.08280825241991695, 0.10376835879951454, 0.1405274590289449, -0.11736915694621673, 0.22279549508841642, -0.10113306922057905, 0.15513427883566341, 0.1388907008804381, -0.022644129256501368, 0.0698013722961932, 0.09252110404052298, 0.16134389342021263, 0.1367475745317183, -0.06413369045568336, 0.014925120500520918, -0.41067900534784585, -0.14029469346069004, -0.16660536104290372, 0.17608076066040157, -0.0985343366687231, -0.13281604400100677, 0.27867480608524364, 0.04626291734574918, 0.18197657486521884, 0.10370494876252978, 0.14597273143335132, 0.19070735481453308, -0.05769247133764765, 0.11573194496725735, 0.11413413546254385, 0.1944638743001984, 0.10097164288980134, -0.15071822348124297, -0.01770005690080947, 0.09643773186472938] |
1,803.03151 | The Whitney Duals of a Graded Poset | We introduce the notion of a \emph{Whitney dual} of a graded poset. Two
posets are Whitney duals to each other if (the absolute value of) their Whitney
numbers of the first and second kind are interchanged between the two posets.
We define new types of edge and chain-edge labelings which we call
\emph{Whitney labelings}. We prove that every graded poset with a Whitney
labeling has a Whitney dual. Moreover, we show how to explicitly construct a
Whitney dual using a technique involving quotient posets.
As applications of our main theorem, we show that geometric lattices, the
lattice of noncrossing partitions, the poset of weighted partitions studied by
Gonz\'alez D'Le\'on-Wachs, and most of the R$^*$S-labelable posets studied by
Simion-Stanley all have Whitney duals. Our technique gives a combinatorial
description of a Whitney dual of the noncrossing partition lattice in terms of
a family of noncrossing Dyck paths. Our method also provides an explanation of
the Whitney duality between the poset of weighted partitions and a poset of
rooted forests studied by Reiner and Sagan. An integral part of this
explanation is a new chain-edge labeling for the poset of weighted partitions
which we show is a Whitney labeling.
Finally, we show that a graded poset with a Whitney labeling admits a local
action of the $0$-Hecke algebra of type $A$ on its set of maximal chains. The
characteristic of the associated representation is Ehrenborg's flag
quasisymmetric function. The existence of this action implies, using a result
of McNamara, that when the maximal intervals of the constructed Whitney duals
are bowtie-free, they are also snellable. In the case where these maximal
intervals are lattices, they are supersolvable.
| math.CO | we introduce the notion of a emphwhitney dual of a graded poset two posets are whitney duals to each other if the absolute value of their whitney numbers of the first and second kind are interchanged between the two posets we define new types of edge and chainedge labelings which we call emphwhitney labelings we prove that every graded poset with a whitney labeling has a whitney dual moreover we show how to explicitly construct a whitney dual using a technique involving quotient posets as applications of our main theorem we show that geometric lattices the lattice of noncrossing partitions the poset of weighted partitions studied by gonzalez dleonwachs and most of the rslabelable posets studied by simionstanley all have whitney duals our technique gives a combinatorial description of a whitney dual of the noncrossing partition lattice in terms of a family of noncrossing dyck paths our method also provides an explanation of the whitney duality between the poset of weighted partitions and a poset of rooted forests studied by reiner and sagan an integral part of this explanation is a new chainedge labeling for the poset of weighted partitions which we show is a whitney labeling finally we show that a graded poset with a whitney labeling admits a local action of the 0hecke algebra of type a on its set of maximal chains the characteristic of the associated representation is ehrenborgs flag quasisymmetric function the existence of this action implies using a result of mcnamara that when the maximal intervals of the constructed whitney duals are bowtiefree they are also snellable in the case where these maximal intervals are lattices they are supersolvable | [['we', 'introduce', 'the', 'notion', 'of', 'a', 'emphwhitney', 'dual', 'of', 'a', 'graded', 'poset', 'two', 'posets', 'are', 'whitney', 'duals', 'to', 'each', 'other', 'if', 'the', 'absolute', 'value', 'of', 'their', 'whitney', 'numbers', 'of', 'the', 'first', 'and', 'second', 'kind', 'are', 'interchanged', 'between', 'the', 'two', 'posets', 'we', 'define', 'new', 'types', 'of', 'edge', 'and', 'chainedge', 'labelings', 'which', 'we', 'call', 'emphwhitney', 'labelings', 'we', 'prove', 'that', 'every', 'graded', 'poset', 'with', 'a', 'whitney', 'labeling', 'has', 'a', 'whitney', 'dual', 'moreover', 'we', 'show', 'how', 'to', 'explicitly', 'construct', 'a', 'whitney', 'dual', 'using', 'a', 'technique', 'involving', 'quotient', 'posets', 'as', 'applications', 'of', 'our', 'main', 'theorem', 'we', 'show', 'that', 'geometric', 'lattices', 'the', 'lattice', 'of', 'noncrossing', 'partitions', 'the', 'poset', 'of', 'weighted', 'partitions', 'studied', 'by', 'gonzalez', 'dleonwachs', 'and', 'most', 'of', 'the', 'rslabelable', 'posets', 'studied', 'by', 'simionstanley', 'all', 'have', 'whitney', 'duals', 'our', 'technique', 'gives', 'a', 'combinatorial', 'description', 'of', 'a', 'whitney', 'dual', 'of', 'the', 'noncrossing', 'partition', 'lattice', 'in', 'terms', 'of', 'a', 'family', 'of', 'noncrossing', 'dyck', 'paths', 'our', 'method', 'also', 'provides', 'an', 'explanation', 'of', 'the', 'whitney', 'duality', 'between', 'the', 'poset', 'of', 'weighted', 'partitions', 'and', 'a', 'poset', 'of', 'rooted', 'forests', 'studied', 'by', 'reiner', 'and', 'sagan', 'an', 'integral', 'part', 'of', 'this', 'explanation', 'is', 'a', 'new', 'chainedge', 'labeling', 'for', 'the', 'poset', 'of', 'weighted', 'partitions', 'which', 'we', 'show', 'is', 'a', 'whitney', 'labeling', 'finally', 'we', 'show', 'that', 'a', 'graded', 'poset', 'with', 'a', 'whitney', 'labeling', 'admits', 'a', 'local', 'action', 'of', 'the', '0hecke', 'algebra', 'of', 'type', 'a', 'on', 'its', 'set', 'of', 'maximal', 'chains', 'the', 'characteristic', 'of', 'the', 'associated', 'representation', 'is', 'ehrenborgs', 'flag', 'quasisymmetric', 'function', 'the', 'existence', 'of', 'this', 'action', 'implies', 'using', 'a', 'result', 'of', 'mcnamara', 'that', 'when', 'the', 'maximal', 'intervals', 'of', 'the', 'constructed', 'whitney', 'duals', 'are', 'bowtiefree', 'they', 'are', 'also', 'snellable', 'in', 'the', 'case', 'where', 'these', 'maximal', 'intervals', 'are', 'lattices', 'they', 'are', 'supersolvable']] | [-0.17865165690751922, 0.10032552528495496, -0.0820251678584025, 0.1042413245350269, -0.12182506860655903, -0.0775405682400148, 0.03408286410073439, 0.36113094208127217, -0.3507231374237205, -0.21653837269025572, 0.06195501600870033, -0.23625096588740857, -0.17287275278836153, 0.14411198784516993, -0.15096762474130992, -0.02279359833245804, 0.07543701503586289, 0.06846887337162477, -0.05057062109805751, -0.2778624604684597, 0.38634582548727625, -0.027177805145539705, 0.22044988945109092, 0.06469849876977489, 0.11335100456269995, 0.023447719696047628, -0.020590217124796317, 0.07344303584451811, -0.1991205481182974, 0.16408903303875305, 0.2503424009695398, 0.13587489702969036, 0.24513455693983238, -0.35427619327129606, -0.09884552149911331, 0.17868217014208826, 0.12050537943224378, 0.01637697753353456, 0.0020564891230524258, -0.23542373704772848, 0.10740552516087318, -0.17984893137836752, -0.10175026118954163, -0.06262214170081701, 0.03216188773600043, 0.07731301445960441, -0.2899475944235447, -0.05527474374744923, 0.12573369470170317, 0.11784566421155933, -0.043327934399494825, -0.10190394110471876, -0.0766330328987988, 0.06849729624798796, -0.04421304211923888, 0.037849860693143215, 0.0038979710147311487, -0.07838790034107891, -0.23154161397863898, 0.3661414296355374, 0.013431128967956252, -0.22907860511617406, 0.1272733973649641, -0.16852684307334184, -0.18698517674726717, 0.11482425453141332, 0.02277961059661812, 0.1743751124353305, -0.06037481691391157, 0.12563746504739368, -0.21263497630448153, 0.0200543082388962, 0.159675362209479, 0.025422326784863482, 0.1667940696437184, 0.12284787285097173, 0.08634252039356373, 0.2400543595167585, -0.010094006416127992, -0.03946837844773569, -0.33082362644597607, -0.18969021914073367, -0.15820070656150761, 0.054386222987062534, -0.1520710502694381, -0.24579268025255271, 0.3946834105251824, 0.10581740574045316, 0.20206432845024916, 0.15533248191238958, 0.19966076863040164, 0.029855197304757296, 0.08122517593634011, 0.01407272516739335, 0.09086085472095493, 0.20851035750634997, -0.0492886231657578, -0.1477615208004659, 0.001084520377101872, 0.29113064411406714] |
1,803.03152 | Quantum friction between oscillating crystal slabs: Graphene monolayers
on dielectric substrates | We present a theoretical description of energy transfer processes between two
noncontact quasi- twodimensional crystals separated by distance a, oscillating
with frequency omega0 and amplitude rho0 , and compare it with the case of two
quasi-twodimensional crystals in uniform parallel motion. We apply the theory
to calculate van der Waals energy and dissipated energy in two oscillating
slabs where each slab consists of a graphene monolayer deposited on SiO2
substrate. The graphene dielectric response is determined from first
principles, and SiO2 surface response is described using empirical local
dielectric function. We studied the modification of vdW attraction as function
of the driving frequency and graphene doping. We propose the idea of
controlling the sticking and unsticking of slabs by tuning the graphene dopings
EF i and driving frequency omega0 . We found simple rho02 dependence of vdW and
dissipated energy. As the Dirac plasmons are the dominant channels through
which the energy between slabs can be transferred, the dissipated power in
equally doped EF1 = EF2 = 0 graphenes shows strong omega0 = 2omegap peak. This
peak is substantially reduceed when graphenes are deposited on SiO2 substrate.
If only one graphene is pristine (EFi = 0) the 2omegap peak disappears. For
larger separations a the phononic losses also become important and the doping
causes shifts, appearance and disappearance of many peaks originating from
resonant coupling between hybridized electronic-phononic excitations in
graphene-substrate slabs.
| cond-mat.mes-hall cond-mat.mtrl-sci | we present a theoretical description of energy transfer processes between two noncontact quasi twodimensional crystals separated by distance a oscillating with frequency omega0 and amplitude rho0 and compare it with the case of two quasitwodimensional crystals in uniform parallel motion we apply the theory to calculate van der waals energy and dissipated energy in two oscillating slabs where each slab consists of a graphene monolayer deposited on sio2 substrate the graphene dielectric response is determined from first principles and sio2 surface response is described using empirical local dielectric function we studied the modification of vdw attraction as function of the driving frequency and graphene doping we propose the idea of controlling the sticking and unsticking of slabs by tuning the graphene dopings ef i and driving frequency omega0 we found simple rho02 dependence of vdw and dissipated energy as the dirac plasmons are the dominant channels through which the energy between slabs can be transferred the dissipated power in equally doped ef1 ef2 0 graphenes shows strong omega0 2omegap peak this peak is substantially reduceed when graphenes are deposited on sio2 substrate if only one graphene is pristine efi 0 the 2omegap peak disappears for larger separations a the phononic losses also become important and the doping causes shifts appearance and disappearance of many peaks originating from resonant coupling between hybridized electronicphononic excitations in graphenesubstrate slabs | [['we', 'present', 'a', 'theoretical', 'description', 'of', 'energy', 'transfer', 'processes', 'between', 'two', 'noncontact', 'quasi', 'twodimensional', 'crystals', 'separated', 'by', 'distance', 'a', 'oscillating', 'with', 'frequency', 'omega0', 'and', 'amplitude', 'rho0', 'and', 'compare', 'it', 'with', 'the', 'case', 'of', 'two', 'quasitwodimensional', 'crystals', 'in', 'uniform', 'parallel', 'motion', 'we', 'apply', 'the', 'theory', 'to', 'calculate', 'van', 'der', 'waals', 'energy', 'and', 'dissipated', 'energy', 'in', 'two', 'oscillating', 'slabs', 'where', 'each', 'slab', 'consists', 'of', 'a', 'graphene', 'monolayer', 'deposited', 'on', 'sio2', 'substrate', 'the', 'graphene', 'dielectric', 'response', 'is', 'determined', 'from', 'first', 'principles', 'and', 'sio2', 'surface', 'response', 'is', 'described', 'using', 'empirical', 'local', 'dielectric', 'function', 'we', 'studied', 'the', 'modification', 'of', 'vdw', 'attraction', 'as', 'function', 'of', 'the', 'driving', 'frequency', 'and', 'graphene', 'doping', 'we', 'propose', 'the', 'idea', 'of', 'controlling', 'the', 'sticking', 'and', 'unsticking', 'of', 'slabs', 'by', 'tuning', 'the', 'graphene', 'dopings', 'ef', 'i', 'and', 'driving', 'frequency', 'omega0', 'we', 'found', 'simple', 'rho02', 'dependence', 'of', 'vdw', 'and', 'dissipated', 'energy', 'as', 'the', 'dirac', 'plasmons', 'are', 'the', 'dominant', 'channels', 'through', 'which', 'the', 'energy', 'between', 'slabs', 'can', 'be', 'transferred', 'the', 'dissipated', 'power', 'in', 'equally', 'doped', 'ef1', 'ef2', '0', 'graphenes', 'shows', 'strong', 'omega0', '2omegap', 'peak', 'this', 'peak', 'is', 'substantially', 'reduceed', 'when', 'graphenes', 'are', 'deposited', 'on', 'sio2', 'substrate', 'if', 'only', 'one', 'graphene', 'is', 'pristine', 'efi', '0', 'the', '2omegap', 'peak', 'disappears', 'for', 'larger', 'separations', 'a', 'the', 'phononic', 'losses', 'also', 'become', 'important', 'and', 'the', 'doping', 'causes', 'shifts', 'appearance', 'and', 'disappearance', 'of', 'many', 'peaks', 'originating', 'from', 'resonant', 'coupling', 'between', 'hybridized', 'electronicphononic', 'excitations', 'in', 'graphenesubstrate', 'slabs']] | [-0.17096495366210795, 0.19382730135614773, -0.0420035692010081, 0.014650687857382846, -0.010921998664906079, -0.1892193010754206, 0.06351650087083478, 0.42505455713041806, -0.268614134106412, -0.26437134819253433, -0.08369191230528734, -0.35779866587836295, -0.1309931080169256, 0.19344779445937918, 0.05791488866406408, 0.00011139319659295407, -0.014597212430089712, -0.095842352820645, -0.0588972877478227, -0.14017693370062095, 0.2939118217825043, 0.04470511624504897, 0.31589253102111714, 0.13039937581104988, 0.020164655544795095, 0.015621160549661992, 0.12227569742297584, 0.0062487800182266665, -0.18150388480968435, 0.05420346828177571, 0.2391384197250855, -0.14625628221276035, 0.2640039159187423, -0.4602299403399229, -0.20057671884741549, 0.003774932024746456, 0.1274337533787316, 0.1025743128112729, -0.06731059228503992, -0.21752316082764248, 0.01794027681885795, -0.11928043638525361, -0.08363033889062618, -0.018174856604838915, 0.006623298217097975, 0.04021485204681415, -0.2214949667517265, 0.1323581252489186, 0.05759400031476451, 0.0358714720191942, -0.1320937337163328, -0.1344724430067634, -0.1030695893960497, 0.06028200246311661, 0.04968653933822431, 0.0050831205216871405, 0.23560190871992912, -0.0759844947997904, -0.03394176066980104, 0.38048206418170594, -0.07717226150509139, -0.1296384653069915, 0.17357523386705329, -0.1663527574898167, 0.010458322787996042, 0.14291275341317736, 0.11613259610682937, 0.08095285075145181, -0.12583312238652566, 0.0872162816617757, 0.03733172834406353, 0.1962101699985479, 0.18755670021584428, 0.06192120899742638, 0.2515272526028143, 0.19286695792053996, 0.0303566702718275, 0.150888196190036, -0.11849281479900872, -0.007834611019246618, -0.24000493421388622, -0.15098748729056255, -0.26002767574444247, 0.0754937139741907, -0.07816551198312399, -0.22839743315707892, 0.4015912802784111, 0.07915332399372181, 0.17641503954602575, -0.02382690199936571, 0.28055896858197893, 0.14094968069958586, 0.06386090849674392, 0.04185587457402355, 0.29373739702542395, 0.15596491454211486, 0.09756785889198495, -0.23770577877929264, 0.02007014820013534, 0.005241657546403902] |
1,803.03153 | Value Groups and Residue Fields of Models of Real Exponentiation | Let $F$ be an archimedean field, $G$ a divisible ordered abelian group and
$h$ a group exponential on $G$. A triple $(F,G,h)$ is realised in a
non-archimedean exponential field $(K,\exp)$ if the residue field of $K$ under
the natural valuation is $F$ and the induced exponential group of $(K,\exp)$ is
$(G,h)$. We give a full characterisation of all triples $(F,G,h)$ which can be
realised in a model of real exponentiation in the following two cases: i) $G$
is countable. ii) $G$ is of cardinality $\kappa$ and $\kappa$-saturated for an
uncountable regular cardinal $\kappa$ with $\kappa^{<\kappa} = \kappa$.
Moreover, we show that for any o-minimal exponential field $(K, \exp)$
satisfying the differential equation $\exp' = \exp$, its residue exponential
field is a model of real exponentiation.
| math.LO | let f be an archimedean field g a divisible ordered abelian group and h a group exponential on g a triple fgh is realised in a nonarchimedean exponential field kexp if the residue field of k under the natural valuation is f and the induced exponential group of kexp is gh we give a full characterisation of all triples fgh which can be realised in a model of real exponentiation in the following two cases i g is countable ii g is of cardinality kappa and kappasaturated for an uncountable regular cardinal kappa with kappakappa kappa moreover we show that for any ominimal exponential field k exp satisfying the differential equation exp exp its residue exponential field is a model of real exponentiation | [['let', 'f', 'be', 'an', 'archimedean', 'field', 'g', 'a', 'divisible', 'ordered', 'abelian', 'group', 'and', 'h', 'a', 'group', 'exponential', 'on', 'g', 'a', 'triple', 'fgh', 'is', 'realised', 'in', 'a', 'nonarchimedean', 'exponential', 'field', 'kexp', 'if', 'the', 'residue', 'field', 'of', 'k', 'under', 'the', 'natural', 'valuation', 'is', 'f', 'and', 'the', 'induced', 'exponential', 'group', 'of', 'kexp', 'is', 'gh', 'we', 'give', 'a', 'full', 'characterisation', 'of', 'all', 'triples', 'fgh', 'which', 'can', 'be', 'realised', 'in', 'a', 'model', 'of', 'real', 'exponentiation', 'in', 'the', 'following', 'two', 'cases', 'i', 'g', 'is', 'countable', 'ii', 'g', 'is', 'of', 'cardinality', 'kappa', 'and', 'kappasaturated', 'for', 'an', 'uncountable', 'regular', 'cardinal', 'kappa', 'with', 'kappakappa', 'kappa', 'moreover', 'we', 'show', 'that', 'for', 'any', 'ominimal', 'exponential', 'field', 'k', 'exp', 'satisfying', 'the', 'differential', 'equation', 'exp', 'exp', 'its', 'residue', 'exponential', 'field', 'is', 'a', 'model', 'of', 'real', 'exponentiation']] | [-0.2513882830538902, 0.14992334058894083, -0.1290391904690634, 0.06431281731429332, -0.11464001796754801, -0.14942399815710122, -0.006602798019966865, 0.3568141769794824, -0.2948980696214563, -0.19038704861232564, 0.04266060490934717, -0.25166881130623425, -0.0732696558510469, 0.18940156502004574, -0.05856574892474354, -0.04984083380752189, -0.025215581309604496, 0.18877788087399291, -0.014461058488285, -0.2887713545086709, 0.3318268975612423, -0.0876930521354695, 0.15979240058290134, 0.017520614168491246, 0.09515731714373409, 0.0003216384049199044, 0.029923765046506626, 0.06565280247794227, -0.17811044372748325, 0.057553143579174175, 0.26418081675617655, 0.1023543691378056, 0.26111646749373635, -0.3310084303394576, -0.1562223900148014, 0.23965968101570181, 0.09253529740943889, -0.07232348172644476, -0.005996416529740615, -0.2504609776006565, 0.1445965209036819, -0.16540931008201987, -0.1418315430656691, -0.06670373798278738, 0.1604602984970528, 0.0035194897146756986, -0.37837775066987545, 0.009499308635857849, 0.15752619586515526, 0.17101850618092604, -0.013470192683268, -0.12918306187310927, -0.0334260991027902, -0.013805793740686552, -0.017522550055233777, 0.11793956673542454, 0.08521990770135414, -0.10619027166788982, -0.11309390249354226, 0.376388212958397, -0.16548599603716746, -0.1564809018130268, 0.07609641900640135, -0.20416058556461505, -0.13961890888254136, 0.1401040162852665, 0.05437236359104329, 0.16347295699847, -0.032264060379306146, 0.33406968116000185, -0.15915404039642905, 0.1463907715241032, 0.06397875136703499, -0.03728348716770199, 0.106716870853662, 0.06828036160816338, 0.09031844804398254, 0.12850518485200246, 0.0526843368949384, 0.017087426109716666, -0.3812582761757384, -0.1626198647335972, -0.15410815010112824, 0.18285612768901527, -0.14661687087185377, -0.22651837379787088, 0.35315736527131364, 0.04894924031047166, 0.14022088671691932, 0.10985643775413999, 0.1884846406380746, 0.14025559491855055, 0.044803624106801984, 0.07936126326997563, 0.04821317373536342, 0.20755971865035777, -0.09986830946088822, -0.1529843197540911, -0.0012208169387761226, 0.12023318480423167] |
1,803.03154 | Two Distinct Seasonally Fractionally Differenced Periodic Processes | This article is devoted to study the effects of the S-periodical fractional
differencing filter $(1-L^S)^{D_t}$. To put this effect in evidence, we have
derived the periodic auto-covariance functions of two distinct univariate
seasonally fractionally differenced periodic models. A multivariate
representation of periodically correlated process is exploited to provide the
exact and approximated expression auto-covariance of each models. The
distinction between the models is clearly obvious through the expression of
periodic autocovariance function. Besides producing different autocovariance
functions, the two models differ in their implications. In the first model, the
seasons of the multivariate series are separately fractionally integrated. In
the second model, however, the seasons for the univariate series are
fractionally co-integrated. On the simulated sample, for each models, with the
same parameters, the empirical periodic autocovariance are calculated and
graphically represented for illustrating the results and support the comparison
between the two models.
| math.ST stat.TH | this article is devoted to study the effects of the speriodical fractional differencing filter 1lsd_t to put this effect in evidence we have derived the periodic autocovariance functions of two distinct univariate seasonally fractionally differenced periodic models a multivariate representation of periodically correlated process is exploited to provide the exact and approximated expression autocovariance of each models the distinction between the models is clearly obvious through the expression of periodic autocovariance function besides producing different autocovariance functions the two models differ in their implications in the first model the seasons of the multivariate series are separately fractionally integrated in the second model however the seasons for the univariate series are fractionally cointegrated on the simulated sample for each models with the same parameters the empirical periodic autocovariance are calculated and graphically represented for illustrating the results and support the comparison between the two models | [['this', 'article', 'is', 'devoted', 'to', 'study', 'the', 'effects', 'of', 'the', 'speriodical', 'fractional', 'differencing', 'filter', '1lsd_t', 'to', 'put', 'this', 'effect', 'in', 'evidence', 'we', 'have', 'derived', 'the', 'periodic', 'autocovariance', 'functions', 'of', 'two', 'distinct', 'univariate', 'seasonally', 'fractionally', 'differenced', 'periodic', 'models', 'a', 'multivariate', 'representation', 'of', 'periodically', 'correlated', 'process', 'is', 'exploited', 'to', 'provide', 'the', 'exact', 'and', 'approximated', 'expression', 'autocovariance', 'of', 'each', 'models', 'the', 'distinction', 'between', 'the', 'models', 'is', 'clearly', 'obvious', 'through', 'the', 'expression', 'of', 'periodic', 'autocovariance', 'function', 'besides', 'producing', 'different', 'autocovariance', 'functions', 'the', 'two', 'models', 'differ', 'in', 'their', 'implications', 'in', 'the', 'first', 'model', 'the', 'seasons', 'of', 'the', 'multivariate', 'series', 'are', 'separately', 'fractionally', 'integrated', 'in', 'the', 'second', 'model', 'however', 'the', 'seasons', 'for', 'the', 'univariate', 'series', 'are', 'fractionally', 'cointegrated', 'on', 'the', 'simulated', 'sample', 'for', 'each', 'models', 'with', 'the', 'same', 'parameters', 'the', 'empirical', 'periodic', 'autocovariance', 'are', 'calculated', 'and', 'graphically', 'represented', 'for', 'illustrating', 'the', 'results', 'and', 'support', 'the', 'comparison', 'between', 'the', 'two', 'models']] | [-0.07200839262559, 0.06426584286267646, -0.11369115534782882, 0.14471509222326398, 0.0005645730981970547, -0.12505088506174655, -0.009556625446658844, 0.4146580010272143, -0.2549746156552098, -0.26590433722020873, 0.0968598247748393, -0.2903717177342886, -0.1715530105276217, 0.20877399216701184, -0.004447613312357801, 0.06527535505527236, 0.02524420263862211, -0.011886954636921332, -0.0702340708009269, -0.26119301330075195, 0.29217900504344996, 0.02604017401455154, 0.28389464093136113, -0.055314263565019825, 0.08180420297447225, -0.005943086240555383, -0.14215302890704445, -0.02191537382199206, -0.10685142680582865, 0.10666956269087165, 0.19805177827204806, 0.06804428093174708, 0.2623705336509246, -0.42412944927025203, -0.18935395617851278, 0.15695928492334107, 0.12682174783672245, 0.043148073262836734, 0.004182704241493795, -0.27848890260711284, 0.03204301890382596, -0.1603641590934811, -0.10521692240899297, -0.039436860163335384, 0.05214712098503197, 0.08313542795383935, -0.3042626641690731, 0.12401412934118973, 0.05828786703666121, 0.06554290328935629, -0.11607091268032632, -0.15995455178445284, -0.03804084270680979, 0.15499124554982802, 0.06945251807891009, -0.0557852787216535, 0.04902454015543081, -0.09676727915222061, -0.13463522262648273, 0.3032301027380245, -0.09438043483860896, -0.2660197897250174, 0.17671377096869523, -0.17766890420355427, -0.12811192106717909, 0.10774007217112509, 0.193486774278785, 0.08449696705506092, -0.19152736356547495, 0.03914856180937266, -0.05026272886504852, 0.13556586163246376, 0.036511123200065235, 0.0033329089080363934, 0.22943837359600083, 0.14762676509202155, -0.017042503661056325, 0.18381260015549217, -0.07825995798544093, -0.12987531502124472, -0.3104673697167194, -0.10840240609012282, -0.1798113634921348, -0.05007232485739121, -0.1126281496291713, -0.2165228516178232, 0.46215695212595165, 0.14528160116595912, 0.20962108046629688, 0.09608025859359284, 0.25962373856979776, 0.21619221269362934, 0.006452146135467354, 0.021537673669460584, 0.169441949318714, 0.11223144203089964, 0.07321097160046788, -0.18478809245784183, 0.13029560906989632, 0.035419071362104634] |
1,803.03155 | Learning Rules-First Classifiers | Complex classifiers may exhibit "embarassing" failures in cases where humans
can easily provide a justified classification. Avoiding such failures is
obviously of key importance. In this work, we focus on one such setting, where
a label is perfectly predictable if the input contains certain features, or
rules, and otherwise it is predictable by a linear classifier. We define a
hypothesis class that captures this notion and determine its sample complexity.
We also give evidence that efficient algorithms cannot achieve this sample
complexity. We then derive a simple and efficient algorithm and show that its
sample complexity is close to optimal, among efficient algorithms. Experiments
on synthetic and sentiment analysis data demonstrate the efficacy of the
method, both in terms of accuracy and interpretability.
| cs.LG | complex classifiers may exhibit embarassing failures in cases where humans can easily provide a justified classification avoiding such failures is obviously of key importance in this work we focus on one such setting where a label is perfectly predictable if the input contains certain features or rules and otherwise it is predictable by a linear classifier we define a hypothesis class that captures this notion and determine its sample complexity we also give evidence that efficient algorithms cannot achieve this sample complexity we then derive a simple and efficient algorithm and show that its sample complexity is close to optimal among efficient algorithms experiments on synthetic and sentiment analysis data demonstrate the efficacy of the method both in terms of accuracy and interpretability | [['complex', 'classifiers', 'may', 'exhibit', 'embarassing', 'failures', 'in', 'cases', 'where', 'humans', 'can', 'easily', 'provide', 'a', 'justified', 'classification', 'avoiding', 'such', 'failures', 'is', 'obviously', 'of', 'key', 'importance', 'in', 'this', 'work', 'we', 'focus', 'on', 'one', 'such', 'setting', 'where', 'a', 'label', 'is', 'perfectly', 'predictable', 'if', 'the', 'input', 'contains', 'certain', 'features', 'or', 'rules', 'and', 'otherwise', 'it', 'is', 'predictable', 'by', 'a', 'linear', 'classifier', 'we', 'define', 'a', 'hypothesis', 'class', 'that', 'captures', 'this', 'notion', 'and', 'determine', 'its', 'sample', 'complexity', 'we', 'also', 'give', 'evidence', 'that', 'efficient', 'algorithms', 'can', 'not', 'achieve', 'this', 'sample', 'complexity', 'we', 'then', 'derive', 'a', 'simple', 'and', 'efficient', 'algorithm', 'and', 'show', 'that', 'its', 'sample', 'complexity', 'is', 'close', 'to', 'optimal', 'among', 'efficient', 'algorithms', 'experiments', 'on', 'synthetic', 'and', 'sentiment', 'analysis', 'data', 'demonstrate', 'the', 'efficacy', 'of', 'the', 'method', 'both', 'in', 'terms', 'of', 'accuracy', 'and', 'interpretability']] | [-0.08156421587507172, 0.0387201798503378, -0.08321406834614956, 0.1058867258583839, -0.10345644233521165, -0.17418615714215288, 0.1065519064043959, 0.4385673351646439, -0.25649791325790794, -0.30302676909822757, 0.1098670703112867, -0.23812119368978632, -0.22994506696231543, 0.21093175448115245, -0.137079618564557, 0.03255340009000213, 0.11582135601438642, 0.06203850600854267, -0.03123808204484119, -0.2966770957085887, 0.27615349776134257, 0.030591564890890707, 0.3088728593382227, 0.042098288935404723, 0.0946491729530574, -0.021708376781363798, -0.033463694090856526, 0.05100030196761479, -0.08001652845209682, 0.1170141471595299, 0.30723123908860656, 0.21682836980808798, 0.3090977629086351, -0.3722505440275451, -0.1766056809006486, 0.14840752960038864, 0.13569445325425122, 0.12152378677723671, -0.028756707677678243, -0.23419279094058565, 0.13405906856135746, -0.13399344049318412, -0.06570099050754576, -0.17410219188143566, -0.002412517869284725, -0.0010016182990275262, -0.30594980595936255, 0.049336936684255296, 0.11202987261510235, 0.04988090235103921, -0.01780993685058159, -0.06602156194441808, 0.02364827939914918, 0.10437583430988215, 0.017709896453027802, -0.00900109033043519, 0.10740895556073969, -0.11561216313247115, -0.14375600699199045, 0.3835129159676835, -0.018645087764333417, -0.23223413737505916, 0.22016332237186229, -0.08362456821889533, -0.15453977201217256, 0.1027088072127284, 0.21982177477178536, 0.12438891850775335, -0.11642438268697844, 0.059905552495520834, -0.06453221477946736, 0.1895906925617861, 0.015292879707005814, 0.034670021271378526, 0.14837804339765534, 0.2056026192328976, 0.07273883563636734, 0.16778887667488762, -0.05864848225279068, -0.04114607188138899, -0.2532971858205955, -0.1431456221933893, -0.18369649657676737, 0.00344239654527254, -0.1186051528621181, -0.16814710668522895, 0.38649891613134585, 0.20782915999586657, 0.22255071729627, 0.11707761911751051, 0.3452936654240347, 0.08515484690121035, 0.04130802510260809, 0.12227523164034299, 0.19591632318433103, 0.030275958957438304, 0.029086098847229305, -0.18047258392264082, 0.149758440283377, 0.03678178900050196] |
1,803.03156 | Perturbational non-canonical theory of molecular orbitals and its
applications | The article contains a summary of fundamentals of the perturbational non-
canonical molecular orbital (PNCMO) theory formerly developed by the author. In
some respects, the PNCMO theory is a generalization of the well-known simple
PMO theory: First, the usual diagonalization problem (and/or the eigenvalue
equation) for a certain model Hamiltonian matrix ($\mathbf{H}$) is now replaced
by two interrelated non-canonical one-electron problems, namely by the
block-diagonalization problem for the matrix $\mathbf{H}$\ following from the
Brillouin theorem and determining non-canonical (localized) MOs (NCMOs) and by
the commutation equation for the respective one-electron density matrix
(charge-bond order (CBO)) matrix. Second, perturbative solutions of the
above-specified alternative problems are sought in terms of entire submatrices
(blocks) of the matrix $\mathbf{H}$\ instead of usual matrix elements (e.g. of
Coulomb and resonance parameters). Third, a generalized version of the
perturbation theory (PT) is used in place of the standard
Rayleigh-Schr\"{o}dinger PT (RSPT), wherein non-commutative quantities stand
for the usual (commutative) ones (cf. the so-called non-commutative RSPT
(NCRSPT)). As a result, algebraic expressions are derived for the principal
quantum-chemical characteristics (including the CBO matrix, the NCMO
representation matrix and the total energy) that embrace definite classes of
Hamiltonian matrices and thereby of molecules. To illustrate the point,
saturated and conjugated hydrocarbons are taken as examples. Arguments are
given that the PNCMO theory possibly forms the basis of a novel way of
qualitative chemical thinking.
| physics.chem-ph | the article contains a summary of fundamentals of the perturbational non canonical molecular orbital pncmo theory formerly developed by the author in some respects the pncmo theory is a generalization of the wellknown simple pmo theory first the usual diagonalization problem andor the eigenvalue equation for a certain model hamiltonian matrix mathbfh is now replaced by two interrelated noncanonical oneelectron problems namely by the blockdiagonalization problem for the matrix mathbfh following from the brillouin theorem and determining noncanonical localized mos ncmos and by the commutation equation for the respective oneelectron density matrix chargebond order cbo matrix second perturbative solutions of the abovespecified alternative problems are sought in terms of entire submatrices blocks of the matrix mathbfh instead of usual matrix elements eg of coulomb and resonance parameters third a generalized version of the perturbation theory pt is used in place of the standard rayleighschrodinger pt rspt wherein noncommutative quantities stand for the usual commutative ones cf the socalled noncommutative rspt ncrspt as a result algebraic expressions are derived for the principal quantumchemical characteristics including the cbo matrix the ncmo representation matrix and the total energy that embrace definite classes of hamiltonian matrices and thereby of molecules to illustrate the point saturated and conjugated hydrocarbons are taken as examples arguments are given that the pncmo theory possibly forms the basis of a novel way of qualitative chemical thinking | [['the', 'article', 'contains', 'a', 'summary', 'of', 'fundamentals', 'of', 'the', 'perturbational', 'non', 'canonical', 'molecular', 'orbital', 'pncmo', 'theory', 'formerly', 'developed', 'by', 'the', 'author', 'in', 'some', 'respects', 'the', 'pncmo', 'theory', 'is', 'a', 'generalization', 'of', 'the', 'wellknown', 'simple', 'pmo', 'theory', 'first', 'the', 'usual', 'diagonalization', 'problem', 'andor', 'the', 'eigenvalue', 'equation', 'for', 'a', 'certain', 'model', 'hamiltonian', 'matrix', 'mathbfh', 'is', 'now', 'replaced', 'by', 'two', 'interrelated', 'noncanonical', 'oneelectron', 'problems', 'namely', 'by', 'the', 'blockdiagonalization', 'problem', 'for', 'the', 'matrix', 'mathbfh', 'following', 'from', 'the', 'brillouin', 'theorem', 'and', 'determining', 'noncanonical', 'localized', 'mos', 'ncmos', 'and', 'by', 'the', 'commutation', 'equation', 'for', 'the', 'respective', 'oneelectron', 'density', 'matrix', 'chargebond', 'order', 'cbo', 'matrix', 'second', 'perturbative', 'solutions', 'of', 'the', 'abovespecified', 'alternative', 'problems', 'are', 'sought', 'in', 'terms', 'of', 'entire', 'submatrices', 'blocks', 'of', 'the', 'matrix', 'mathbfh', 'instead', 'of', 'usual', 'matrix', 'elements', 'eg', 'of', 'coulomb', 'and', 'resonance', 'parameters', 'third', 'a', 'generalized', 'version', 'of', 'the', 'perturbation', 'theory', 'pt', 'is', 'used', 'in', 'place', 'of', 'the', 'standard', 'rayleighschrodinger', 'pt', 'rspt', 'wherein', 'noncommutative', 'quantities', 'stand', 'for', 'the', 'usual', 'commutative', 'ones', 'cf', 'the', 'socalled', 'noncommutative', 'rspt', 'ncrspt', 'as', 'a', 'result', 'algebraic', 'expressions', 'are', 'derived', 'for', 'the', 'principal', 'quantumchemical', 'characteristics', 'including', 'the', 'cbo', 'matrix', 'the', 'ncmo', 'representation', 'matrix', 'and', 'the', 'total', 'energy', 'that', 'embrace', 'definite', 'classes', 'of', 'hamiltonian', 'matrices', 'and', 'thereby', 'of', 'molecules', 'to', 'illustrate', 'the', 'point', 'saturated', 'and', 'conjugated', 'hydrocarbons', 'are', 'taken', 'as', 'examples', 'arguments', 'are', 'given', 'that', 'the', 'pncmo', 'theory', 'possibly', 'forms', 'the', 'basis', 'of', 'a', 'novel', 'way', 'of', 'qualitative', 'chemical', 'thinking']] | [-0.11751498225992837, 0.09151378148791355, -0.05929739085640007, 0.07774940182114513, -0.051480424328343814, -0.1261557509888782, 0.00966783049631229, 0.27550508544233215, -0.2807968390621078, -0.24511711558978588, 0.07190374566519825, -0.2812403390818848, -0.1762936920263792, 0.13425036926018785, -0.02036881793682952, 0.053341258509343514, 0.04033219041533478, 0.05528456706871099, -0.143284882742673, -0.19145986414462277, 0.34602153575728595, 0.02422927765383473, 0.22118644121483036, 0.01323500609509814, 0.08946951804264978, 0.04414303837690686, -0.022302061623179523, -0.00549938509683438, -0.09414128144408708, 0.13756638721796796, 0.26680393618919923, 0.0860526447248073, 0.2483351983280326, -0.43712553855516184, -0.1890952598085343, 0.06399091925981534, 0.10326547507161948, 0.09072507779278914, -0.010048738415582698, -0.2680199094254507, 0.05357762174559454, -0.19089442068364287, -0.17492643467071278, -0.08176740037795206, -0.0081286107610458, 0.004077970119584532, -0.27614645537348137, 0.08060396122986309, 0.07339771332286064, 0.04919843271307098, -0.055641428200734755, -0.17731819183183542, -0.008885643355164159, 0.06942774705179537, 0.013585693313846691, -0.022657150326969078, 0.11513651963406882, -0.0795025679692908, -0.0879156017303258, 0.39464729038722846, -0.03764040823065312, -0.20358611512281868, 0.09861099124977975, -0.09070262461096766, -0.14210973741829128, 0.11104218424412718, 0.06914892029581016, 0.12740590932336324, -0.15889939342728804, 0.17737731830093742, -0.06270144670635813, 0.10745819912340614, 0.06457717631496657, 0.025419896813067753, 0.14554665102560757, 0.06066846955962262, 0.034890630588117116, 0.09412069057611407, 0.0015798379362230877, -0.17376988057481468, -0.3078422153492838, -0.15966979367266965, -0.2096464099318641, 0.06586176037136883, -0.12900902048516036, -0.1927237568998442, 0.4198748680149286, 0.07578558773595856, 0.16088490340492748, 0.03101285205968142, 0.2583679092020598, 0.16738068567476164, 0.049266645553283764, 0.0030794310855424456, 0.1806605138609472, 0.25599505044436377, 0.06587754170756971, -0.19185259931205537, 0.009950940890839081, 0.18025036439228587] |
1,803.03157 | A high-performance optical lattice clock based on bosonic atoms | Optical lattice clocks with uncertainty and instability in the
$10^{-17}$-range and below have so far been demonstrated exclusively using
fermions. Here, we demonstrate a bosonic optical lattice clock with $3\times
10^{-18}$ instability and $2.0\times 10^{-17}$ accuracy, both values improving
on previous work by a factor 30. This was enabled by probing the clock
transition with an ultra-long interrogation time of 4 s, using the long
coherence time provided by a cryogenic silicon resonator, by careful
stabilization of relevant operating parameters, and by operating at low atom
density. This work demonstrates that bosonic clocks, in combination with highly
coherent interrogation lasers, are suitable for high-accuracy applications with
particular requirements, such as high reliability, transportability, operation
in space, or suitability for particular fundamental physics topics. As an
example, we determine the $^{88}\textrm{Sr} - ^{87}$Sr isotope shift with 12
mHz uncertainty.
| physics.atom-ph quant-ph | optical lattice clocks with uncertainty and instability in the 1017range and below have so far been demonstrated exclusively using fermions here we demonstrate a bosonic optical lattice clock with 3times 1018 instability and 20times 1017 accuracy both values improving on previous work by a factor 30 this was enabled by probing the clock transition with an ultralong interrogation time of 4 s using the long coherence time provided by a cryogenic silicon resonator by careful stabilization of relevant operating parameters and by operating at low atom density this work demonstrates that bosonic clocks in combination with highly coherent interrogation lasers are suitable for highaccuracy applications with particular requirements such as high reliability transportability operation in space or suitability for particular fundamental physics topics as an example we determine the 88textrmsr 87sr isotope shift with 12 mhz uncertainty | [['optical', 'lattice', 'clocks', 'with', 'uncertainty', 'and', 'instability', 'in', 'the', '1017range', 'and', 'below', 'have', 'so', 'far', 'been', 'demonstrated', 'exclusively', 'using', 'fermions', 'here', 'we', 'demonstrate', 'a', 'bosonic', 'optical', 'lattice', 'clock', 'with', '3times', '1018', 'instability', 'and', '20times', '1017', 'accuracy', 'both', 'values', 'improving', 'on', 'previous', 'work', 'by', 'a', 'factor', '30', 'this', 'was', 'enabled', 'by', 'probing', 'the', 'clock', 'transition', 'with', 'an', 'ultralong', 'interrogation', 'time', 'of', '4', 's', 'using', 'the', 'long', 'coherence', 'time', 'provided', 'by', 'a', 'cryogenic', 'silicon', 'resonator', 'by', 'careful', 'stabilization', 'of', 'relevant', 'operating', 'parameters', 'and', 'by', 'operating', 'at', 'low', 'atom', 'density', 'this', 'work', 'demonstrates', 'that', 'bosonic', 'clocks', 'in', 'combination', 'with', 'highly', 'coherent', 'interrogation', 'lasers', 'are', 'suitable', 'for', 'highaccuracy', 'applications', 'with', 'particular', 'requirements', 'such', 'as', 'high', 'reliability', 'transportability', 'operation', 'in', 'space', 'or', 'suitability', 'for', 'particular', 'fundamental', 'physics', 'topics', 'as', 'an', 'example', 'we', 'determine', 'the', '88textrmsr', '87sr', 'isotope', 'shift', 'with', '12', 'mhz', 'uncertainty']] | [-0.10839262376754993, 0.23846172186981507, 0.04432416496522449, -0.04836586218379024, 0.009381533683174187, -0.15480634709475216, 0.10402488907609411, 0.4248169490446647, -0.18739558473505355, -0.34306532514661, 0.1322447438629482, -0.24212173043439786, -0.05317575932411408, 0.24327826246412265, -0.019426290910794505, 0.1011567214185898, 0.0350605189765769, -0.0008150146549774541, -0.06440471157052174, -0.188743361092552, 0.22811479713353847, 0.13022960742150813, 0.3086417782560198, 0.038728442370753596, 0.11922113263496646, -0.016924357979937837, 0.025829179336627324, -0.0604186146401507, -0.12349697529641196, 0.08968166844160469, 0.2622939614544588, 0.05458004854585009, 0.26694398796254837, -0.4169610184582847, -0.24646056879104838, 0.072417014105142, 0.12639121225953137, 0.12405215728234638, -0.056562382204423625, -0.30226448672927086, 0.009046243815855295, -0.176558536849916, -0.11545266132732784, -0.09946990626760654, 0.04590833155369317, 0.03939625037558101, -0.22671886094397417, 0.02741100830629606, -0.000141409815599521, 0.13896187588020606, -0.03893417892287727, -0.09504228461602772, 0.07823835147579235, 0.06249603815204292, -0.05201937174424529, 0.049559322949843825, 0.148681404893459, -0.07580878572814442, -0.137071249337384, 0.4061554638599908, -0.12275481156797872, -0.10365385684978079, 0.177792679677131, -0.15630934947273797, -0.10533388329117939, 0.12102080624619568, 0.09534149892214272, 0.07118012793017206, -0.125285257336994, 0.05474633656256763, 0.06230978032970732, 0.23396559778118023, 0.12401188141148951, 0.1381388281851455, 0.20646150705439073, 0.2500114712967641, 0.03959816640967296, 0.08972848146394999, -0.1045163186646446, -0.022948968293214286, -0.25402679552310103, -0.10498773265216085, -0.163624873985019, 0.0783633985918843, -0.05448135439677302, -0.07082279093942985, 0.35177383830908826, 0.16166002809725427, 0.17136974334371863, -0.005576100541899601, 0.3227767100799139, 0.12942078166848256, 0.07443358818332113, 0.017053787265386845, 0.2859539285060708, 0.11462494317890594, 0.06913879681033669, -0.2443497275174768, -0.016771004521460443, 0.01693945857696235] |
1,803.03158 | Degrees of Infinite Words, Polynomials, and Atoms (Extended Version) | We study finite-state transducers and their power for transforming infinite
words. Infinite sequences of symbols are of paramount importance in a wide
range of fields, from formal languages to pure mathematics and physics. While
finite automata for recognising and transforming languages are well-understood,
very little is known about the power of automata to transform infinite words.
The word transformation realised by finite-state transducers gives rise to a
complexity comparison of words and thereby induces equivalence classes, called
(transducer) degrees, and a partial order on these degrees. The ensuing
hierarchy of degrees is analogous to the recursion-theoretic degrees of
unsolvability, also known as Turing degrees, where the transformational devices
are Turing machines. However, as a complexity measure, Turing machines are too
strong: they trivialise the classification problem by identifying all
computable words. Finite-state transducers give rise to a much more
fine-grained, discriminating hierarchy. In contrast to Turing degrees, hardly
anything is known about transducer degrees, in spite of their naturality.
We use methods from linear algebra and analysis to show that there are
infinitely many atoms in the transducer degrees, that is, minimal non-trivial
degrees.
| cs.FL | we study finitestate transducers and their power for transforming infinite words infinite sequences of symbols are of paramount importance in a wide range of fields from formal languages to pure mathematics and physics while finite automata for recognising and transforming languages are wellunderstood very little is known about the power of automata to transform infinite words the word transformation realised by finitestate transducers gives rise to a complexity comparison of words and thereby induces equivalence classes called transducer degrees and a partial order on these degrees the ensuing hierarchy of degrees is analogous to the recursiontheoretic degrees of unsolvability also known as turing degrees where the transformational devices are turing machines however as a complexity measure turing machines are too strong they trivialise the classification problem by identifying all computable words finitestate transducers give rise to a much more finegrained discriminating hierarchy in contrast to turing degrees hardly anything is known about transducer degrees in spite of their naturality we use methods from linear algebra and analysis to show that there are infinitely many atoms in the transducer degrees that is minimal nontrivial degrees | [['we', 'study', 'finitestate', 'transducers', 'and', 'their', 'power', 'for', 'transforming', 'infinite', 'words', 'infinite', 'sequences', 'of', 'symbols', 'are', 'of', 'paramount', 'importance', 'in', 'a', 'wide', 'range', 'of', 'fields', 'from', 'formal', 'languages', 'to', 'pure', 'mathematics', 'and', 'physics', 'while', 'finite', 'automata', 'for', 'recognising', 'and', 'transforming', 'languages', 'are', 'wellunderstood', 'very', 'little', 'is', 'known', 'about', 'the', 'power', 'of', 'automata', 'to', 'transform', 'infinite', 'words', 'the', 'word', 'transformation', 'realised', 'by', 'finitestate', 'transducers', 'gives', 'rise', 'to', 'a', 'complexity', 'comparison', 'of', 'words', 'and', 'thereby', 'induces', 'equivalence', 'classes', 'called', 'transducer', 'degrees', 'and', 'a', 'partial', 'order', 'on', 'these', 'degrees', 'the', 'ensuing', 'hierarchy', 'of', 'degrees', 'is', 'analogous', 'to', 'the', 'recursiontheoretic', 'degrees', 'of', 'unsolvability', 'also', 'known', 'as', 'turing', 'degrees', 'where', 'the', 'transformational', 'devices', 'are', 'turing', 'machines', 'however', 'as', 'a', 'complexity', 'measure', 'turing', 'machines', 'are', 'too', 'strong', 'they', 'trivialise', 'the', 'classification', 'problem', 'by', 'identifying', 'all', 'computable', 'words', 'finitestate', 'transducers', 'give', 'rise', 'to', 'a', 'much', 'more', 'finegrained', 'discriminating', 'hierarchy', 'in', 'contrast', 'to', 'turing', 'degrees', 'hardly', 'anything', 'is', 'known', 'about', 'transducer', 'degrees', 'in', 'spite', 'of', 'their', 'naturality', 'we', 'use', 'methods', 'from', 'linear', 'algebra', 'and', 'analysis', 'to', 'show', 'that', 'there', 'are', 'infinitely', 'many', 'atoms', 'in', 'the', 'transducer', 'degrees', 'that', 'is', 'minimal', 'nontrivial', 'degrees']] | [-0.14986730465455406, 0.20163358033523368, -0.035357440900280264, 0.11169672567832648, -0.14961599718789448, -0.15449795648759312, 0.08423238582706646, 0.34850463304800267, -0.3589429699299533, -0.2847573359436153, 0.09366002152724516, -0.2664387476676063, -0.10950159901909975, 0.21816548259812407, -0.08774671701046274, 0.04341489887978558, 0.03856590561158753, 0.08612383994888818, -0.031084592191568252, -0.23143765029532876, 0.27373752601029677, 0.006348706721125737, 0.25849007422094356, -0.027186091242702274, 0.14899175613359344, -0.01597091084334787, -0.009224548028609917, 0.04020840767328121, -0.07976727590191687, 0.11556655073589987, 0.3641121022317194, 0.18210909196995603, 0.23970632209270465, -0.3811417281496055, -0.1779868452855305, 0.14270605541368359, 0.12231117828101244, 0.14036691687753142, 0.016711085518735395, -0.2619955660117304, 0.09006089880763878, -0.1548384515437014, -0.05815006397104931, -0.10755190230986994, 0.05262798359921283, 0.02590135082573397, -0.18228478574209198, -0.003886142144339196, 0.16418431755269208, 0.14758036205912206, 0.008658829669239703, -0.1158858758837754, 0.007179330894596997, 0.10899754233516591, 0.00916217932852147, 0.00029051914854157394, 0.07208161457927655, -0.16595714824253935, -0.1840008432121502, 0.3891319181041225, 0.005217514292504031, -0.22701005117319847, 0.28771636293537955, -0.09409715151211814, -0.11965159151536088, 0.13195910275934022, 0.16312769687046175, 0.07411381648220729, -0.12257463387061801, 0.12363583584627359, -0.0805876158043722, 0.24681465990041665, 0.17148936315409272, 0.10920558156415253, 0.185330715169624, 0.1417012339604654, 0.04232759440650546, 0.17806880856630375, 0.07194389949259146, -0.09879357614124235, -0.26342541383256385, -0.14563023025908953, -0.11525040299254571, 0.03193919332356334, -0.06156984072984652, -0.19109228713458162, 0.36172348173568025, 0.1342374416214981, 0.10821892889773312, 0.15916517134452157, 0.24446368816627553, 0.07880617477475545, 0.09632328480770609, 0.07684065841907717, 0.13200277686827694, 0.18693095390715272, 0.04990204776834656, -0.15621663081812742, 0.07173724151874447, 0.0830246341824734] |
1,803.03159 | From $\mathcal{N}{=}\,4$ Galilean superparticle to three-dimensional
non-relativistic $\mathcal{N}{=}\,4$ superfields | We consider the general $\mathcal{N}{=}\,4,$ $d{=}\,3$ Galilean superalgebra
with arbitrary central charges and study its dynamical realizations. Using the
nonlinear realization techniques, we introduce a class of actions for
$\mathcal{N}{=}\,4$ three-dimensional non-relativistic superparticle, such that
they are linear in the central charge Maurer-Cartan one-forms. As a
prerequisite to the quantization, we analyze the phase space constraints
structure of our model for various choices of the central charges. The first
class constraints generate gauge transformations, involving fermionic
$\kappa$-gauge transformations. The quantization of the model gives rise to the
collection of free $\mathcal{N}{=}\,4$, $d{=}\,3$ Galilean superfields, which
can be further employed, e.g., for description of three-dimensional
non-relativistic $\mathcal{N}{=}\,4$ supersymmetric theories.
| hep-th math-ph math.MP | we consider the general mathcaln4 d3 galilean superalgebra with arbitrary central charges and study its dynamical realizations using the nonlinear realization techniques we introduce a class of actions for mathcaln4 threedimensional nonrelativistic superparticle such that they are linear in the central charge maurercartan oneforms as a prerequisite to the quantization we analyze the phase space constraints structure of our model for various choices of the central charges the first class constraints generate gauge transformations involving fermionic kappagauge transformations the quantization of the model gives rise to the collection of free mathcaln4 d3 galilean superfields which can be further employed eg for description of threedimensional nonrelativistic mathcaln4 supersymmetric theories | [['we', 'consider', 'the', 'general', 'mathcaln4', 'd3', 'galilean', 'superalgebra', 'with', 'arbitrary', 'central', 'charges', 'and', 'study', 'its', 'dynamical', 'realizations', 'using', 'the', 'nonlinear', 'realization', 'techniques', 'we', 'introduce', 'a', 'class', 'of', 'actions', 'for', 'mathcaln4', 'threedimensional', 'nonrelativistic', 'superparticle', 'such', 'that', 'they', 'are', 'linear', 'in', 'the', 'central', 'charge', 'maurercartan', 'oneforms', 'as', 'a', 'prerequisite', 'to', 'the', 'quantization', 'we', 'analyze', 'the', 'phase', 'space', 'constraints', 'structure', 'of', 'our', 'model', 'for', 'various', 'choices', 'of', 'the', 'central', 'charges', 'the', 'first', 'class', 'constraints', 'generate', 'gauge', 'transformations', 'involving', 'fermionic', 'kappagauge', 'transformations', 'the', 'quantization', 'of', 'the', 'model', 'gives', 'rise', 'to', 'the', 'collection', 'of', 'free', 'mathcaln4', 'd3', 'galilean', 'superfields', 'which', 'can', 'be', 'further', 'employed', 'eg', 'for', 'description', 'of', 'threedimensional', 'nonrelativistic', 'mathcaln4', 'supersymmetric', 'theories']] | [-0.13863857615635627, 0.1809495985680432, -0.03684669686050189, 0.07203725156486379, -0.09511031485292026, -0.15574679565206342, -0.07177387747085756, 0.3192384902525831, -0.192098561989109, -0.2530359822601356, 0.07262613867189632, -0.2330693460707725, -0.17428871197194826, 0.10488494547273687, -0.06729943530754773, 0.049842866934745364, -0.009202631802677556, 0.06201991261440088, -0.16739333376042648, -0.21360485028708354, 0.33520685724431165, -0.007866898051428574, 0.2685533578063499, -0.007849799106730239, 0.11631460169209512, 0.06306599303907542, -0.005815984237145771, 0.0030866865264316504, -0.12651795778172661, 0.15162118622834828, 0.22736202258642557, 0.0501060895535543, 0.09927724721556944, -0.46873825236603067, -0.21456328126670862, 0.09728231647534778, 0.140845635518215, 0.17232188243306829, -0.0435859031751062, -0.29093368137600245, 0.008161144195279727, -0.21922141442472046, -0.17711705002067094, -0.14137518273114605, -0.0035803456471681042, -0.07318185041151958, -0.2765259354281524, 0.056085605823210684, 0.04107760076483289, 0.03363228103801332, -0.07916587016478405, -0.04027010713104607, -0.08900653813530139, 0.09771243100813418, 0.046871536878084215, -0.0051439249633673445, 0.1531384051475605, -0.20296071166403298, -0.1630926620866241, 0.4467156742854665, -0.027674048590361728, -0.2710493473267114, 0.19140104250120069, -0.13284673910863973, -0.21553719453125572, 0.07847384875209105, 0.14982186425132332, 0.17735166392177, -0.14122017365244338, 0.20996321623884054, -0.0747065069541956, 0.08004015900789657, 0.06241267607806043, 0.07954838745030833, 0.2587994570516188, 0.10319148551638203, 0.04670156904979161, 0.15839887043067494, -0.017296959792643233, -0.14270009325722371, -0.44692713427529845, -0.16610041213722002, -0.06527334788848681, 0.09445101097527961, -0.12772496267536082, -0.16274938908733289, 0.3769617053395551, 0.14272959188437434, 0.1552802795863331, 0.06947448240976815, 0.1982471129891497, 0.1535985890077427, 0.09712247096467763, 0.008548774868594828, 0.19419308713878747, 0.1964159927856936, 0.058776622918365454, -0.24242119325208478, -0.17300935547165056, 0.22750950293374006] |
1,803.0316 | A note on odd zeta values | Using a new construction of rational linear forms in odd zeta values and the
saddle point method, we prove the existence of at least two irrational numbers
amongst the 33 odd zeta values $\zeta$(5), $\zeta$(7),. .. , $\zeta$(69).
| math.NT | using a new construction of rational linear forms in odd zeta values and the saddle point method we prove the existence of at least two irrational numbers amongst the 33 odd zeta values zeta5 zeta7 zeta69 | [['using', 'a', 'new', 'construction', 'of', 'rational', 'linear', 'forms', 'in', 'odd', 'zeta', 'values', 'and', 'the', 'saddle', 'point', 'method', 'we', 'prove', 'the', 'existence', 'of', 'at', 'least', 'two', 'irrational', 'numbers', 'amongst', 'the', '33', 'odd', 'zeta', 'values', 'zeta5', 'zeta7', 'zeta69']] | [-0.30824808036642415, 0.09870095461873071, -0.13315669491088816, 0.10760173914687975, -0.04488307532987424, -0.20609523801665222, 0.07879345566034317, 0.22492680201040846, -0.24552057683467865, -0.25438584459812513, 0.045000248212766436, -0.2808111670826163, -0.1887167952954769, 0.21939204175557409, 0.04958130703972918, 0.04603604841395281, -0.03505847149395517, 0.07214564875300442, -0.08875010894345385, -0.28374576781477245, 0.3540190214557307, -0.09671990078474794, 0.12048928077731813, 0.019383685450468743, 0.11222513286130768, 0.01728084043466619, 0.017555043367402896, -0.0463393472135067, -0.12030390201668655, 0.09359484600302365, 0.2949565474143518, -0.0032105073665401767, 0.3099707200058869, -0.3099585288337299, -0.056468869408958455, 0.1902703385267939, 0.1093490003475121, -0.027376063407531806, 0.02373656917230359, -0.13158316324864114, 0.11478735203189509, -0.11278548442891666, -0.24944701865315438, -0.08145301421838147, 0.06140053634132658, 0.05641335765165942, -0.30323257935898645, 0.04988973762041756, 0.008339247586471693, 0.18307516492371048, -0.10047233469252076, -0.2755492980991091, -0.025520422382812415, 0.05244073534517416, 0.08698780649740781, -0.009282908801521574, 0.016061988872076785, -0.08900087733886071, -0.14092043585010938, 0.28775128227259433, -0.0729516338557005, -0.20660296383180787, 0.10983466048325811, -0.19828202913382223, -0.22966552703375262, 0.19083293084321276, 0.06315723760053515, 0.19832596887967416, 0.02150645564709391, 0.10023605196703492, -0.08754858763090202, 0.09791054970202302, 0.2331787098199129, -0.03873274569798793, 0.20308149081787893, -0.02193422301539353, 0.05742712683443512, 0.14046581227864538, -0.07844078588698591, -0.08432086994871497, -0.36157816435609547, -0.16453282652905077, -0.1515415521604674, 0.11801065986177751, -0.1659780471315441, -0.19170304739049504, 0.3664310271186488, 0.07493939671133246, 0.20761094601558788, 0.14929638233567988, 0.22582650477332727, 0.13324076629110745, 0.052063686028122905, 0.061612003326549064, 0.11421000233718327, 0.14946883879601955, -0.02279287250712514, -0.15468868049127715, -0.029502315819263457, 0.2580548156451966] |
1,803.03161 | Relativistic and QED effects in the fundamental vibration of T$_2$ | The hydrogen molecule has become a test ground for quantum electrodynamical
calculations in molecules. Expanding beyond studies on stable hydrogenic
species to the heavier radioactive tritium-bearing molecules, we report on a
measurement of the fundamental T$_2$ vibrational splitting $(v= 0 \rightarrow
1)$ for $J=0-5$ rotational levels. Precision frequency metrology is performed
with high-resolution coherent anti-Stokes Raman spectroscopy at an experimental
uncertainty of $10-12$~MHz, where sub-Doppler saturation features are exploited
for the strongest transition. The achieved accuracy corresponds to a fifty-fold
improvement over a previous measurement, and allows for the extraction of
relativistic and QED contributions to T$_2$ transition energies.
| physics.chem-ph physics.atom-ph | the hydrogen molecule has become a test ground for quantum electrodynamical calculations in molecules expanding beyond studies on stable hydrogenic species to the heavier radioactive tritiumbearing molecules we report on a measurement of the fundamental t_2 vibrational splitting v 0 rightarrow 1 for j05 rotational levels precision frequency metrology is performed with highresolution coherent antistokes raman spectroscopy at an experimental uncertainty of 1012mhz where subdoppler saturation features are exploited for the strongest transition the achieved accuracy corresponds to a fiftyfold improvement over a previous measurement and allows for the extraction of relativistic and qed contributions to t_2 transition energies | [['the', 'hydrogen', 'molecule', 'has', 'become', 'a', 'test', 'ground', 'for', 'quantum', 'electrodynamical', 'calculations', 'in', 'molecules', 'expanding', 'beyond', 'studies', 'on', 'stable', 'hydrogenic', 'species', 'to', 'the', 'heavier', 'radioactive', 'tritiumbearing', 'molecules', 'we', 'report', 'on', 'a', 'measurement', 'of', 'the', 'fundamental', 't_2', 'vibrational', 'splitting', 'v', '0', 'rightarrow', '1', 'for', 'j05', 'rotational', 'levels', 'precision', 'frequency', 'metrology', 'is', 'performed', 'with', 'highresolution', 'coherent', 'antistokes', 'raman', 'spectroscopy', 'at', 'an', 'experimental', 'uncertainty', 'of', '1012mhz', 'where', 'subdoppler', 'saturation', 'features', 'are', 'exploited', 'for', 'the', 'strongest', 'transition', 'the', 'achieved', 'accuracy', 'corresponds', 'to', 'a', 'fiftyfold', 'improvement', 'over', 'a', 'previous', 'measurement', 'and', 'allows', 'for', 'the', 'extraction', 'of', 'relativistic', 'and', 'qed', 'contributions', 'to', 't_2', 'transition', 'energies']] | [-0.07535542759190623, 0.19446522032027738, -0.028005530994657118, 0.0085281011670304, 0.04295184896424568, -0.15386669517223103, 0.1007513523970071, 0.4203837201542531, -0.2082930848458394, -0.241872554004658, -0.026697598204918904, -0.32136571592870194, 0.04639392361180702, 0.21984896908543305, 0.058830066942997895, 0.07596461939101573, 0.07939672779563504, 0.03223636819166131, -0.0655437667737715, -0.12377923987151007, 0.22620959894993575, 0.07686167080222124, 0.2720410976277587, 0.09290592752707501, 0.0908563918589304, -0.03062059198661397, 0.05491528102720622, -0.09775171320264538, -0.140413530204872, 0.12433910105998318, 0.2858156987543528, 0.028065993406926282, 0.2165604920107095, -0.3826093547783482, -0.21576017966435757, 0.06277033609399041, 0.14431802728874268, 0.19106692999487981, -0.023623747098554304, -0.31216159459533327, 0.0001676865249464754, -0.12832635476055052, -0.10170700798820083, -0.1206756586713406, 0.04564394227054436, -0.03963025713649889, -0.300503588883051, 0.08910525748797227, -0.00042092524624119204, 0.11887912867367352, -0.05962028013952173, -0.16748873111403859, 0.015965758136492997, 0.10489045040109583, -0.024885345692382543, 0.03539869759697467, 0.18717228469419447, -0.10717196771292947, -0.12114666679796453, 0.4336751351559845, -0.13278837566031143, -0.07349439821215735, 0.17050807939085644, -0.17757143607983986, -0.17826010141773926, 0.20990866922754017, 0.11816263852718596, 0.13625955519607183, -0.07082140183168424, 0.05221653558085867, 0.047306412510806695, 0.22196409698032463, 0.11647248247269697, 0.09840983005900246, 0.16603657428640872, 0.18709579270459167, 0.028541867630944278, 0.09272628237764972, -0.1680594692346252, -0.05851119290309725, -0.26181309871511377, -0.13687627019438273, -0.16107631901589534, 0.10715333481978935, -0.016459347301558108, -0.07739122325438075, 0.35682868160074577, 0.1069143540571531, 0.1595341837479888, -0.016806981147965416, 0.32255787593506585, 0.11697243908808257, 0.029239103646735504, -0.04360796913594337, 0.3062225501053035, 0.20544777018464325, 0.06361479828653198, -0.30373593367888435, 0.016816808410415735, -0.0010521603580855299] |
1,803.03162 | A remark on the rigidity of conformally compact Poincar{\'e}-Einstein
manifolds | In this paper, we give an optimal inequality relating the relative Yamabe
invariant of a certain compactification of a conformally compact
Poin-car{\'e}-Einstein manifold with the Yamabe invariant of its boundary at
infinity. As an application, we obtain an elementary proof of the rigidity of
the hyper-bolic space as the only conformally compact Poincar{\'e}-Einstein
manifold with the round sphere as its conformal infinity.
| math.DG | in this paper we give an optimal inequality relating the relative yamabe invariant of a certain compactification of a conformally compact poincareeinstein manifold with the yamabe invariant of its boundary at infinity as an application we obtain an elementary proof of the rigidity of the hyperbolic space as the only conformally compact poincareeinstein manifold with the round sphere as its conformal infinity | [['in', 'this', 'paper', 'we', 'give', 'an', 'optimal', 'inequality', 'relating', 'the', 'relative', 'yamabe', 'invariant', 'of', 'a', 'certain', 'compactification', 'of', 'a', 'conformally', 'compact', 'poincareeinstein', 'manifold', 'with', 'the', 'yamabe', 'invariant', 'of', 'its', 'boundary', 'at', 'infinity', 'as', 'an', 'application', 'we', 'obtain', 'an', 'elementary', 'proof', 'of', 'the', 'rigidity', 'of', 'the', 'hyperbolic', 'space', 'as', 'the', 'only', 'conformally', 'compact', 'poincareeinstein', 'manifold', 'with', 'the', 'round', 'sphere', 'as', 'its', 'conformal', 'infinity']] | [-0.18797580609398504, 0.0861652904598985, -0.12049204189961235, 0.0758621386278631, -0.14095257751403317, -0.1844316941025036, -0.07163742173279095, 0.2968843286676753, -0.23470137748987444, -0.21395841866896878, 0.18654695284485276, -0.27299462335424557, -0.14754330014318018, 0.13869699781700487, -0.16670471757289865, 0.06865641210160608, 0.010607696904410277, 0.1695815069139034, -0.1533329551476204, -0.2530537064397527, 0.4933718682056473, 0.013116945647784779, 0.21447208602612297, 0.10837424246053542, 0.1529987120133404, -0.039796809515645425, 0.03396579944678853, 0.007201243334190709, -0.21292444492780394, 0.14279996236455778, 0.21242756919274408, 0.06325919718872156, 0.18426938564892137, -0.3615893782867539, -0.15863849992503323, 0.13446312271539243, 0.14657505217849487, 0.021467921879863548, -0.043130894007551816, -0.3402127915572736, 0.06795647151527866, -0.07399483121210529, -0.2603589475845858, -0.058606586659387234, -0.0056473686389865415, -0.060244351370079864, -0.15495542791341582, 0.01640378530587881, 0.14443781567540775, 0.06397372192793316, -0.13258195813039259, -0.008237518527875505, -0.06128731286603837, 0.10387382621786767, 0.12904907249274752, 0.11384864408342589, 0.1347697102164309, -0.016278889927742703, -0.11039545594324027, 0.35751961826557116, -0.12393461783686953, -0.3157129293427833, 0.11188824504854218, -0.12387620720772012, -0.17399857388508896, 0.12066936090348228, 0.17504891248479967, 0.22940324997949985, -0.06523497899874084, 0.20873283515233668, -0.09918431847378792, 0.06816706949123932, 0.14180183628453844, 0.008059772557669109, 0.10692686383657518, 0.121488360628005, 0.256641770337498, 0.18049014811854688, 0.011771936093517128, -0.03211212957337979, -0.4676874737826086, -0.28707176816439434, -0.19779726251539204, 0.2525419727448494, -0.21650988530487783, -0.25569199857812736, 0.3550181312471508, -0.0560493294289054, 0.23994770625065412, 0.1728662274807932, 0.21614597587575834, 0.07664802552467483, 0.002489223062331157, 0.11954266394698812, 0.18444213784119534, 0.19915831233224562, 0.06611412423174648, -0.16099862726555475, -0.13626088261333924, 0.18158429350343444] |
1,803.03163 | Modeling neutrino-induced charged pion production on water at T2K
kinematics | Pion production is a significant component of the signal in accelerator-based
neutrino experiments. Over the last years, the MiniBooNE, T2K and MINERvA
collaborations have reported a substantial amount of data on
(anti)neutrino-induced pion production on the nucleus. However, a comprehensive
and consistent description of the whole data set is still missing. We aim at
improving the current understanding of neutrino-induced pion production on the
nucleus. To this end, the comparison of experimental data with theoretical
predictions, preferably based on microscopic models, is essential to
disentangle the different reaction mechanisms involved in the process. To
describe single-pion production (SPP) we use a hybrid model that combines a
low- and a high-energy approach. The low-energy model (LEM) contains resonances
and background terms. At high invariant masses, a high-energy model based on a
Regge approach is employed. The model is implemented in the nucleus using the
relativistic plane wave impulse approximation (RPWIA). We present a comparison
of the hybrid-RPWIA and LEM with the recent neutrino-induced charged current
$1\pi^+$ production cross section on water reported by T2K. In order to judge
the impact of final-state interactions (FSI) we confront our results with those
of the NuWro Monte Carlo generator. The hybrid-RPWIA model and NuWro compare
favorably to the data, albeit that FSI are not included in the former. These
results complement our previous work [Phys. Rev. D 97, 013004 (2018)] where we
compared the models to the MINERvA and MiniBooNE $1\pi^+$ data. The
hybrid-RPWIA model tends to overpredict both the T2K and MINERvA data in
kinematic regions where the largest suppression due to FSI is expected, and
agrees remarkably well with the data in other kinematic regions. On the
contrary, the MiniBooNE data is underpredicted over the whole kinematic range.
| nucl-th | pion production is a significant component of the signal in acceleratorbased neutrino experiments over the last years the miniboone t2k and minerva collaborations have reported a substantial amount of data on antineutrinoinduced pion production on the nucleus however a comprehensive and consistent description of the whole data set is still missing we aim at improving the current understanding of neutrinoinduced pion production on the nucleus to this end the comparison of experimental data with theoretical predictions preferably based on microscopic models is essential to disentangle the different reaction mechanisms involved in the process to describe singlepion production spp we use a hybrid model that combines a low and a highenergy approach the lowenergy model lem contains resonances and background terms at high invariant masses a highenergy model based on a regge approach is employed the model is implemented in the nucleus using the relativistic plane wave impulse approximation rpwia we present a comparison of the hybridrpwia and lem with the recent neutrinoinduced charged current 1pi production cross section on water reported by t2k in order to judge the impact of finalstate interactions fsi we confront our results with those of the nuwro monte carlo generator the hybridrpwia model and nuwro compare favorably to the data albeit that fsi are not included in the former these results complement our previous work phys rev d 97 013004 2018 where we compared the models to the minerva and miniboone 1pi data the hybridrpwia model tends to overpredict both the t2k and minerva data in kinematic regions where the largest suppression due to fsi is expected and agrees remarkably well with the data in other kinematic regions on the contrary the miniboone data is underpredicted over the whole kinematic range | [['pion', 'production', 'is', 'a', 'significant', 'component', 'of', 'the', 'signal', 'in', 'acceleratorbased', 'neutrino', 'experiments', 'over', 'the', 'last', 'years', 'the', 'miniboone', 't2k', 'and', 'minerva', 'collaborations', 'have', 'reported', 'a', 'substantial', 'amount', 'of', 'data', 'on', 'antineutrinoinduced', 'pion', 'production', 'on', 'the', 'nucleus', 'however', 'a', 'comprehensive', 'and', 'consistent', 'description', 'of', 'the', 'whole', 'data', 'set', 'is', 'still', 'missing', 'we', 'aim', 'at', 'improving', 'the', 'current', 'understanding', 'of', 'neutrinoinduced', 'pion', 'production', 'on', 'the', 'nucleus', 'to', 'this', 'end', 'the', 'comparison', 'of', 'experimental', 'data', 'with', 'theoretical', 'predictions', 'preferably', 'based', 'on', 'microscopic', 'models', 'is', 'essential', 'to', 'disentangle', 'the', 'different', 'reaction', 'mechanisms', 'involved', 'in', 'the', 'process', 'to', 'describe', 'singlepion', 'production', 'spp', 'we', 'use', 'a', 'hybrid', 'model', 'that', 'combines', 'a', 'low', 'and', 'a', 'highenergy', 'approach', 'the', 'lowenergy', 'model', 'lem', 'contains', 'resonances', 'and', 'background', 'terms', 'at', 'high', 'invariant', 'masses', 'a', 'highenergy', 'model', 'based', 'on', 'a', 'regge', 'approach', 'is', 'employed', 'the', 'model', 'is', 'implemented', 'in', 'the', 'nucleus', 'using', 'the', 'relativistic', 'plane', 'wave', 'impulse', 'approximation', 'rpwia', 'we', 'present', 'a', 'comparison', 'of', 'the', 'hybridrpwia', 'and', 'lem', 'with', 'the', 'recent', 'neutrinoinduced', 'charged', 'current', '1pi', 'production', 'cross', 'section', 'on', 'water', 'reported', 'by', 't2k', 'in', 'order', 'to', 'judge', 'the', 'impact', 'of', 'finalstate', 'interactions', 'fsi', 'we', 'confront', 'our', 'results', 'with', 'those', 'of', 'the', 'nuwro', 'monte', 'carlo', 'generator', 'the', 'hybridrpwia', 'model', 'and', 'nuwro', 'compare', 'favorably', 'to', 'the', 'data', 'albeit', 'that', 'fsi', 'are', 'not', 'included', 'in', 'the', 'former', 'these', 'results', 'complement', 'our', 'previous', 'work', 'phys', 'rev', 'd', '97', '013004', '2018', 'where', 'we', 'compared', 'the', 'models', 'to', 'the', 'minerva', 'and', 'miniboone', '1pi', 'data', 'the', 'hybridrpwia', 'model', 'tends', 'to', 'overpredict', 'both', 'the', 't2k', 'and', 'minerva', 'data', 'in', 'kinematic', 'regions', 'where', 'the', 'largest', 'suppression', 'due', 'to', 'fsi', 'is', 'expected', 'and', 'agrees', 'remarkably', 'well', 'with', 'the', 'data', 'in', 'other', 'kinematic', 'regions', 'on', 'the', 'contrary', 'the', 'miniboone', 'data', 'is', 'underpredicted', 'over', 'the', 'whole', 'kinematic', 'range']] | [-0.036498956625725616, 0.09798578458343911, -0.07281883057694996, 0.11002508360362666, -0.04546836551540254, -0.06380331525456552, 0.03449191768294233, 0.3332099528819845, -0.15766009028282083, -0.30085219387291817, 0.006735865777489125, -0.3805716368810911, -0.03790772568042341, 0.1923683526174149, -3.4950945420158016e-05, 0.08285046343659991, 0.1263467143502152, 0.005700446767405721, -0.03002690936289646, -0.20143970884546114, 0.27202779423086004, 0.12854010941493407, 0.2807918717365777, 0.10631105342046092, 0.07404837213097173, 0.027438007293906257, -0.09584698348465424, -0.04915516622070419, -0.1337005421579019, 0.08212664885989701, 0.24828982456832852, 0.08629083278376544, 0.12645404194265944, -0.4167349472838013, -0.17514748961558532, 0.08586640806966707, 0.12983342147219862, 0.12506997958928542, -0.04756667680605396, -0.29326910575557696, 0.06257692546984017, -0.23198534810033283, -0.1084076085356636, -0.05286374007098442, -0.01567319092165123, -0.013278172346722465, -0.287726631407675, 0.0804413994034883, -0.029327020906483786, 0.0279032144491283, -0.06837336753919851, -0.189878778117137, -0.007803503427197013, 0.06514398244683418, 0.10425105729628469, 0.09837583539805277, 0.13348113780661502, -0.13308121284884564, -0.14220289330145247, 0.37565564505363763, -0.0564179047513263, -0.1592526454825706, 0.19855572002073912, -0.19032505318694012, -0.1214027809281425, 0.1680424878308386, 0.20538028877906567, 0.0845244714328529, -0.19400235963495155, 0.07513921572489811, -0.05598593501025901, 0.1599977455771806, 0.022613093147479127, -0.029224510234372135, 0.15257544333376644, 0.26067429293731326, -0.0318962997454627, 0.02497362430685347, -0.14697459742851687, -0.10382600145316438, -0.3581570157911955, -0.07105534383536953, -0.10265809892423516, 0.0045672121059492626, -0.014546691798227186, -0.09729314803660503, 0.37826578003076605, 0.1640689984941753, 0.25348044256802255, 0.011072545052555047, 0.3470663295895384, 0.04410719128632959, 0.0588204735481556, 0.04637944989739672, 0.30700866171371255, 0.12334929528450103, 0.12719063405192604, -0.24401584891275618, 0.08070607847787374, 0.02077183587672679] |
1,803.03164 | On the Complexity of Pointer Arithmetic in Separation Logic (an extended
version) | We investigate the complexity consequences of adding pointer arithmetic to
separation logic. Specifically, we study extensions of the points-to fragment
of symbolic-heap separation logic with various forms of Presburger arithmetic
constraints.
Most significantly, we find that, even in the minimal case when we allow only
conjunctions of simple "difference constraints" (x'\leq x+k) where k is an
integer, polynomial-time decidability is already impossible: satisfiability
becomes NP-complete, while quantifier-free entailment becomes coNP-complete and
quantified entailment becomes P2-complete (P2 is the second class in the
polynomial-time hierarchy)
In fact we prove that the upper bound is the same, P2, even for the full
pointer arithmetic but with a fixed pointer offset, where we allow any Boolean
combinations of the elementary formulas (x'=x+k0), (x'\leq x+k0), and
(x'<x+k0), and, in addition to the points-to formulas, we allow spatial
formulas of the arrays the length of which is bounded by k0 and lists which
length is bounded by k0, etc, where k0 is a fixed integer.
However, if we allow a significantly more expressive form of pointer
arithmetic - namely arbitrary Boolean combinations of elementary formulas over
arbitrary pointer sums - then the complexity increase is relatively modest for
satisfiability and quantifier-free entailment: they are still NP-complete and
coNP-complete respectively, and the complexity appears to increase drastically
for quantified entailments.
| cs.LO | we investigate the complexity consequences of adding pointer arithmetic to separation logic specifically we study extensions of the pointsto fragment of symbolicheap separation logic with various forms of presburger arithmetic constraints most significantly we find that even in the minimal case when we allow only conjunctions of simple difference constraints xleq xk where k is an integer polynomialtime decidability is already impossible satisfiability becomes npcomplete while quantifierfree entailment becomes conpcomplete and quantified entailment becomes p2complete p2 is the second class in the polynomialtime hierarchy in fact we prove that the upper bound is the same p2 even for the full pointer arithmetic but with a fixed pointer offset where we allow any boolean combinations of the elementary formulas xxk0 xleq xk0 and xxk0 and in addition to the pointsto formulas we allow spatial formulas of the arrays the length of which is bounded by k0 and lists which length is bounded by k0 etc where k0 is a fixed integer however if we allow a significantly more expressive form of pointer arithmetic namely arbitrary boolean combinations of elementary formulas over arbitrary pointer sums then the complexity increase is relatively modest for satisfiability and quantifierfree entailment they are still npcomplete and conpcomplete respectively and the complexity appears to increase drastically for quantified entailments | [['we', 'investigate', 'the', 'complexity', 'consequences', 'of', 'adding', 'pointer', 'arithmetic', 'to', 'separation', 'logic', 'specifically', 'we', 'study', 'extensions', 'of', 'the', 'pointsto', 'fragment', 'of', 'symbolicheap', 'separation', 'logic', 'with', 'various', 'forms', 'of', 'presburger', 'arithmetic', 'constraints', 'most', 'significantly', 'we', 'find', 'that', 'even', 'in', 'the', 'minimal', 'case', 'when', 'we', 'allow', 'only', 'conjunctions', 'of', 'simple', 'difference', 'constraints', 'xleq', 'xk', 'where', 'k', 'is', 'an', 'integer', 'polynomialtime', 'decidability', 'is', 'already', 'impossible', 'satisfiability', 'becomes', 'npcomplete', 'while', 'quantifierfree', 'entailment', 'becomes', 'conpcomplete', 'and', 'quantified', 'entailment', 'becomes', 'p2complete', 'p2', 'is', 'the', 'second', 'class', 'in', 'the', 'polynomialtime', 'hierarchy', 'in', 'fact', 'we', 'prove', 'that', 'the', 'upper', 'bound', 'is', 'the', 'same', 'p2', 'even', 'for', 'the', 'full', 'pointer', 'arithmetic', 'but', 'with', 'a', 'fixed', 'pointer', 'offset', 'where', 'we', 'allow', 'any', 'boolean', 'combinations', 'of', 'the', 'elementary', 'formulas', 'xxk0', 'xleq', 'xk0', 'and', 'xxk0', 'and', 'in', 'addition', 'to', 'the', 'pointsto', 'formulas', 'we', 'allow', 'spatial', 'formulas', 'of', 'the', 'arrays', 'the', 'length', 'of', 'which', 'is', 'bounded', 'by', 'k0', 'and', 'lists', 'which', 'length', 'is', 'bounded', 'by', 'k0', 'etc', 'where', 'k0', 'is', 'a', 'fixed', 'integer', 'however', 'if', 'we', 'allow', 'a', 'significantly', 'more', 'expressive', 'form', 'of', 'pointer', 'arithmetic', 'namely', 'arbitrary', 'boolean', 'combinations', 'of', 'elementary', 'formulas', 'over', 'arbitrary', 'pointer', 'sums', 'then', 'the', 'complexity', 'increase', 'is', 'relatively', 'modest', 'for', 'satisfiability', 'and', 'quantifierfree', 'entailment', 'they', 'are', 'still', 'npcomplete', 'and', 'conpcomplete', 'respectively', 'and', 'the', 'complexity', 'appears', 'to', 'increase', 'drastically', 'for', 'quantified', 'entailments']] | [-0.15766522067637057, 0.13350522338896553, -0.03697312359760802, 0.14899304107082292, -0.12664540339923966, -0.21858282941348778, 0.09651725514469525, 0.33946402126905295, -0.3322965917339808, -0.28410570761367965, 0.09173184422028359, -0.2542519533711199, -0.09194755169189123, 0.1944347999837751, -0.07365625703907706, 0.07866171834589644, 0.027418233209083646, 0.09087777820576985, -0.08385406147135654, -0.27719245477167603, 0.2843482880315815, -0.05161861843841437, 0.16740408660776807, 0.07413520428459518, 0.054469246520266794, 0.03886333100560408, 0.03616725510577313, 0.06906022069737307, -0.10607710016630825, 0.09615237557003499, 0.32409069251018363, 0.21878325790059813, 0.24612185320494553, -0.42466795241209465, -0.05851990073782732, 0.1824606573142004, 0.134922931053622, 0.11345576966218338, 0.04318555383214026, -0.2189369675375369, 0.11562308564316481, -0.14449925698080243, -0.03926332289567934, -0.08124093902097229, 0.125847349801356, 0.007372883831591865, -0.27255567417999443, 0.012725974820428886, 0.19728363984568903, 0.09257484560867642, -0.0429317106390954, -0.15371594250273818, 0.034784453718972284, 0.04366738039761213, -0.03075554673481607, 0.015615282059745649, 0.05654367453378374, -0.12425517048597193, -0.13344636526072953, 0.3693771000790338, -0.01760466113214184, -0.23254166116329053, 0.12573679611243557, -0.1421863385162746, -0.19106977981685375, 0.11185999300393562, 0.07650877474449001, 0.14060063029151373, -0.04397239525223995, 0.15775517842205142, -0.09520535364684363, 0.28449316919208145, 0.18224523187606023, 0.07004456756448445, 0.13827760580954, 0.13593527714440895, 0.07645883753306967, 0.22019960395454502, -0.004268003587360279, -0.07484709849813953, -0.2981489853700623, -0.15236903981741096, -0.10810460580530791, 0.013851028710352974, -0.13464607513917423, -0.1586583386949944, 0.32116006743028547, 0.12340552091392545, 0.12151719599093597, 0.23214008587596113, 0.2901170015729104, 0.16139221485578814, 0.05163596548999731, 0.07792342576654986, 0.12924989339976142, 0.1297387338876993, 0.013715397493237665, -0.20154857059815884, 0.14108495870739438, 0.0809549546442073] |
1,803.03165 | First-principles study of spin-wave dispersion in
Sm(Fe$_{1-x}$Co$_{x}$)$_{12}$ | We present spin-wave dispersion in Sm(Fe$_{1-x}$Co$_x$)$_{12}$ calculated
based on first-principles. Anisotropy in the lowest branch of the spin-wave
dispersion around the $\Gamma$ point is discussed. Spin-waves propagate more
easily along $a^*$-axis than along $c^*$-axis, especially in SmFe$_{12}$. We
also compare values of the spin-wave stiffness with those obtained from an
experiment. The calculated values are in good agreement with the experimental
values.
| cond-mat.mtrl-sci | we present spinwave dispersion in smfe_1xco_x_12 calculated based on firstprinciples anisotropy in the lowest branch of the spinwave dispersion around the gamma point is discussed spinwaves propagate more easily along aaxis than along caxis especially in smfe_12 we also compare values of the spinwave stiffness with those obtained from an experiment the calculated values are in good agreement with the experimental values | [['we', 'present', 'spinwave', 'dispersion', 'in', 'smfe_1xco_x_12', 'calculated', 'based', 'on', 'firstprinciples', 'anisotropy', 'in', 'the', 'lowest', 'branch', 'of', 'the', 'spinwave', 'dispersion', 'around', 'the', 'gamma', 'point', 'is', 'discussed', 'spinwaves', 'propagate', 'more', 'easily', 'along', 'aaxis', 'than', 'along', 'caxis', 'especially', 'in', 'smfe_12', 'we', 'also', 'compare', 'values', 'of', 'the', 'spinwave', 'stiffness', 'with', 'those', 'obtained', 'from', 'an', 'experiment', 'the', 'calculated', 'values', 'are', 'in', 'good', 'agreement', 'with', 'the', 'experimental', 'values']] | [-0.15050744471567062, 0.17258031991683917, -0.05697902563648919, 0.015101005783071742, -0.08842011305581157, -0.07860046215355396, 0.04177658900540943, 0.4845697320997715, -0.22366762285722264, -0.23404623782262207, -0.008383875922299921, -0.3608955046006789, -0.06876680266092687, 0.2930914954282343, 0.08344401388118665, 0.01820465911757007, 0.04070822219364345, 0.04923887747960786, -0.10909183540691932, -0.13252493465940157, 0.24130501832502585, 0.07546895292277138, 0.3320878606134405, 0.008691988730182251, -0.013483444089069962, 0.02834236015720914, 0.055403853844230376, 0.05298010049543033, -0.200797391240485, 0.12573683046114942, 0.24985533187088246, -0.1259263671003282, 0.13897576440746587, -0.4217472759075463, -0.16999984888825564, -0.037157099988932414, 0.18845072678135086, 0.17092449543997645, -0.043338125664013204, -0.2657887197099626, 0.09339556403768559, -0.11913284022981922, -0.16252107334682175, -0.0720182119247814, -0.05296266447597494, 0.036657858500257136, -0.18543574810028077, 0.12279782551680303, -0.08988861339166761, 0.13957515814496826, -0.12776064268158127, -0.2359919270966202, -0.10952375672447184, 0.027735665386232237, 0.10379974238652115, 0.06474424873789152, 0.09583995480400821, -0.08836978075560183, -0.08801825996488333, 0.3890901402880748, -0.12055170762396301, -0.12332448720311125, 0.08207872938752796, -0.20493521993048489, -0.07778843617221962, 0.15203160257078707, 0.07492758883939435, 0.05543768662028015, -0.08723511759502192, 0.03562589029315859, 0.01159484573242177, 0.17570606708613923, 0.08483421424559007, 0.026017693290365667, 0.19912973534471046, 0.13104727855340267, -0.028462678054347636, 0.13276999187655747, -0.12330491973940903, -0.09062409458759552, -0.28019158146344125, -0.10693347513054809, -0.19791666680636505, -0.0544010658438007, -0.15792667591789117, -0.1252150080166757, 0.3710401945160508, 0.20592764378525316, 0.2625673834234476, 0.05713707286631688, 0.2436631246159474, 0.15307968412525952, 0.0677304590586573, 0.1313748105817164, 0.3398640592272083, 0.18171769040636718, 0.10442041945643724, -0.25181886959277716, 0.06902971242088825, -0.018217565154191106] |
1,803.03166 | Aggregation using input-output trade-off | In this paper, we introduce a new learning strategy based on a seminal idea
of Mojirsheibani (1999, 2000, 2002a, 2002b), who proposed a smart method for
combining several classifiers, relying on a consensus notion. In many
aggregation methods, the prediction for a new observation x is computed by
building a linear or convex combination over a collection of basic estimators
r1(x),. .. , rm(x) previously calibrated using a training data set.
Mojirsheibani proposes to compute the prediction associated to a new
observation by combining selected outputs of the training examples. The output
of a training example is selected if some kind of consensus is observed: the
predictions computed for the training example with the different machines have
to be "similar" to the prediction for the new observation. This approach has
been recently extended to the context of regression in Biau et al. (2016). In
the original scheme, the agreement condition is actually required to hold for
all individual estimators, which appears inadequate if there is one bad initial
estimator. In practice, a few disagreements are allowed ; for establishing the
theoretical results, the proportion of estimators satisfying the condition is
required to tend to 1. In this paper, we propose an alternative procedure,
mixing the previous consensus ideas on the predictions with the Euclidean
distance computed between entries. This may be seen as an alternative approach
allowing to reduce the effect of a possibly bad estimator in the initial list,
using a constraint on the inputs. We prove the consistency of our strategy in
classification and in regression. We also provide some numerical experiments on
simulated and real data to illustrate the benefits of this new aggregation
method. On the whole, our practical study shows that our method may perform
much better than the original combination technique, and, in particular,
exhibit far less variance. We also show on simulated examples that this
procedure mixing inputs and outputs is still robust to high dimensional inputs.
| stat.ML stat.AP | in this paper we introduce a new learning strategy based on a seminal idea of mojirsheibani 1999 2000 2002a 2002b who proposed a smart method for combining several classifiers relying on a consensus notion in many aggregation methods the prediction for a new observation x is computed by building a linear or convex combination over a collection of basic estimators r1x rmx previously calibrated using a training data set mojirsheibani proposes to compute the prediction associated to a new observation by combining selected outputs of the training examples the output of a training example is selected if some kind of consensus is observed the predictions computed for the training example with the different machines have to be similar to the prediction for the new observation this approach has been recently extended to the context of regression in biau et al 2016 in the original scheme the agreement condition is actually required to hold for all individual estimators which appears inadequate if there is one bad initial estimator in practice a few disagreements are allowed for establishing the theoretical results the proportion of estimators satisfying the condition is required to tend to 1 in this paper we propose an alternative procedure mixing the previous consensus ideas on the predictions with the euclidean distance computed between entries this may be seen as an alternative approach allowing to reduce the effect of a possibly bad estimator in the initial list using a constraint on the inputs we prove the consistency of our strategy in classification and in regression we also provide some numerical experiments on simulated and real data to illustrate the benefits of this new aggregation method on the whole our practical study shows that our method may perform much better than the original combination technique and in particular exhibit far less variance we also show on simulated examples that this procedure mixing inputs and outputs is still robust to high dimensional inputs | [['in', 'this', 'paper', 'we', 'introduce', 'a', 'new', 'learning', 'strategy', 'based', 'on', 'a', 'seminal', 'idea', 'of', 'mojirsheibani', '1999', '2000', '2002a', '2002b', 'who', 'proposed', 'a', 'smart', 'method', 'for', 'combining', 'several', 'classifiers', 'relying', 'on', 'a', 'consensus', 'notion', 'in', 'many', 'aggregation', 'methods', 'the', 'prediction', 'for', 'a', 'new', 'observation', 'x', 'is', 'computed', 'by', 'building', 'a', 'linear', 'or', 'convex', 'combination', 'over', 'a', 'collection', 'of', 'basic', 'estimators', 'r1x', 'rmx', 'previously', 'calibrated', 'using', 'a', 'training', 'data', 'set', 'mojirsheibani', 'proposes', 'to', 'compute', 'the', 'prediction', 'associated', 'to', 'a', 'new', 'observation', 'by', 'combining', 'selected', 'outputs', 'of', 'the', 'training', 'examples', 'the', 'output', 'of', 'a', 'training', 'example', 'is', 'selected', 'if', 'some', 'kind', 'of', 'consensus', 'is', 'observed', 'the', 'predictions', 'computed', 'for', 'the', 'training', 'example', 'with', 'the', 'different', 'machines', 'have', 'to', 'be', 'similar', 'to', 'the', 'prediction', 'for', 'the', 'new', 'observation', 'this', 'approach', 'has', 'been', 'recently', 'extended', 'to', 'the', 'context', 'of', 'regression', 'in', 'biau', 'et', 'al', '2016', 'in', 'the', 'original', 'scheme', 'the', 'agreement', 'condition', 'is', 'actually', 'required', 'to', 'hold', 'for', 'all', 'individual', 'estimators', 'which', 'appears', 'inadequate', 'if', 'there', 'is', 'one', 'bad', 'initial', 'estimator', 'in', 'practice', 'a', 'few', 'disagreements', 'are', 'allowed', 'for', 'establishing', 'the', 'theoretical', 'results', 'the', 'proportion', 'of', 'estimators', 'satisfying', 'the', 'condition', 'is', 'required', 'to', 'tend', 'to', '1', 'in', 'this', 'paper', 'we', 'propose', 'an', 'alternative', 'procedure', 'mixing', 'the', 'previous', 'consensus', 'ideas', 'on', 'the', 'predictions', 'with', 'the', 'euclidean', 'distance', 'computed', 'between', 'entries', 'this', 'may', 'be', 'seen', 'as', 'an', 'alternative', 'approach', 'allowing', 'to', 'reduce', 'the', 'effect', 'of', 'a', 'possibly', 'bad', 'estimator', 'in', 'the', 'initial', 'list', 'using', 'a', 'constraint', 'on', 'the', 'inputs', 'we', 'prove', 'the', 'consistency', 'of', 'our', 'strategy', 'in', 'classification', 'and', 'in', 'regression', 'we', 'also', 'provide', 'some', 'numerical', 'experiments', 'on', 'simulated', 'and', 'real', 'data', 'to', 'illustrate', 'the', 'benefits', 'of', 'this', 'new', 'aggregation', 'method', 'on', 'the', 'whole', 'our', 'practical', 'study', 'shows', 'that', 'our', 'method', 'may', 'perform', 'much', 'better', 'than', 'the', 'original', 'combination', 'technique', 'and', 'in', 'particular', 'exhibit', 'far', 'less', 'variance', 'we', 'also', 'show', 'on', 'simulated', 'examples', 'that', 'this', 'procedure', 'mixing', 'inputs', 'and', 'outputs', 'is', 'still', 'robust', 'to', 'high', 'dimensional', 'inputs']] | [-0.052258663005766655, 0.02894232615342718, -0.10072260003085921, 0.07466366165939942, -0.08149568287731856, -0.1458975137218704, 0.0799358281641525, 0.3881542952204088, -0.23831677657798073, -0.33148680482376014, 0.11924572038587253, -0.24951281572498804, -0.17052034640673008, 0.2228527830491932, -0.1270421906579403, 0.07437749549932485, 0.09153572590465206, 0.0249085415429443, -0.06995066742591396, -0.3148865430145788, 0.2849804909329469, 0.06099666231868308, 0.2926209404602033, -0.004473464872465475, 0.10474740122459571, -0.012031709796378576, -0.05704094114151063, 0.03901774353646445, -0.11843512145021334, 0.14331900988688617, 0.240266407998103, 0.16476741381196025, 0.3320980551535463, -0.3714870199467401, -0.20234693881086185, 0.1150003621345913, 0.11716715552340373, 0.13104602331454857, -0.06024981588718288, -0.2701310967435656, 0.10140299809834503, -0.15708440753086558, -0.08078020991048769, -0.09945018057779698, -0.019873894658818277, -0.007200927612351242, -0.3330725198523756, 0.044299031207125646, 0.056038695249161774, 0.042735553065420324, -0.04037817296536885, -0.1273324906228567, 0.026283413296969572, 0.09641557794617805, 0.04343671457470049, 0.028065474100598373, 0.07327854138676007, -0.07834936673606986, -0.13169013899194557, 0.33631098722605585, -0.04156869963499162, -0.20333490864314804, 0.20426549217916304, -0.08581867755636713, -0.15819676783383946, 0.09494948454212936, 0.18827143724848158, 0.1071070398551078, -0.15023652193430848, 0.03305216854417685, -0.07865080530989517, 0.14542027132852156, 0.028318896462830406, -0.01249852054480133, 0.14301170882880218, 0.1981731308862104, 0.06352615303051681, 0.12714834425323088, -0.08122080568974302, -0.07042271760347264, -0.29859743208357914, -0.12121321390907913, -0.2037249707947075, 0.014853528986315964, -0.0767853239288703, -0.14786482322961092, 0.37834390448138866, 0.20440983877545837, 0.23357702133321911, 0.09265213969907483, 0.31595294480504904, 0.08689923333147806, 0.06574024913141376, 0.08238851441562457, 0.22687124370018155, 0.08641875067703081, 0.07167792998205975, -0.1598371599336688, 0.10193226668608826, 0.05786513599329891] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.