---
_id: '11606'
abstract:
- lang: eng
text: "Context. Our knowledge of the dynamics of stars has undergone a revolution
through the simultaneous large amount of high-quality photometric observations
collected by space-based asteroseismology and ground-based high-precision spectropolarimetry.
They allowed us to probe the internal rotation of stars and their surface magnetism
in the whole Hertzsprung-Russell diagram. However, new methods should still be
developed to probe the deep magnetic fields in these stars.\r\n\r\nAims. Our goal
is to provide seismic diagnoses that allow us to probe the internal magnetism
of stars.\r\n\r\nMethods. We focused on asymptotic low-frequency gravity modes
and high-frequency acoustic modes. Using a first-order perturbative theory, we
derived magnetic splittings of their frequencies as explicit functions of stellar
parameters.\r\n\r\nResults. As in the case of rotation, we show that asymptotic
gravity and acoustic modes can allow us to probe the different components of the
magnetic field in the cavities in which they propagate. This again demonstrates
the high potential of using mixed-modes when this is possible."
acknowledgement: The authors thank the referee and Pr. J. Christensen-Dalsgaard for
their very constructive comments and remarks that allowed us to improve the article.
St. M., L. B., V. P., and K. A. acknowledge support from the European Research Council
through ERC grant SPIRE 647383. All the members from CEA acknowledge support from
GOLF and PLATO CNES grants of the Astrophysics Division at CEA. S. Mathur acknowledges
support by the Ramon y Cajal fellowship number RYC-2015-17697. We made great use
of the megyr python package for interfacing MESA and GYRE codes.
article_number: A122
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: S.
full_name: Mathis, S.
last_name: Mathis
- first_name: Lisa Annabelle
full_name: Bugnet, Lisa Annabelle
id: d9edb345-f866-11ec-9b37-d119b5234501
last_name: Bugnet
orcid: 0000-0003-0142-4000
- first_name: V.
full_name: Prat, V.
last_name: Prat
- first_name: K.
full_name: Augustson, K.
last_name: Augustson
- first_name: S.
full_name: Mathur, S.
last_name: Mathur
- first_name: R. A.
full_name: Garcia, R. A.
last_name: Garcia
citation:
ama: Mathis S, Bugnet LA, Prat V, Augustson K, Mathur S, Garcia RA. Probing the
internal magnetism of stars using asymptotic magneto-asteroseismology. Astronomy
& Astrophysics. 2021;647. doi:10.1051/0004-6361/202039180
apa: Mathis, S., Bugnet, L. A., Prat, V., Augustson, K., Mathur, S., & Garcia,
R. A. (2021). Probing the internal magnetism of stars using asymptotic magneto-asteroseismology.
Astronomy & Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/202039180
chicago: Mathis, S., Lisa Annabelle Bugnet, V. Prat, K. Augustson, S. Mathur, and
R. A. Garcia. “Probing the Internal Magnetism of Stars Using Asymptotic Magneto-Asteroseismology.”
Astronomy & Astrophysics. EDP Sciences, 2021. https://doi.org/10.1051/0004-6361/202039180.
ieee: S. Mathis, L. A. Bugnet, V. Prat, K. Augustson, S. Mathur, and R. A. Garcia,
“Probing the internal magnetism of stars using asymptotic magneto-asteroseismology,”
Astronomy & Astrophysics, vol. 647. EDP Sciences, 2021.
ista: Mathis S, Bugnet LA, Prat V, Augustson K, Mathur S, Garcia RA. 2021. Probing
the internal magnetism of stars using asymptotic magneto-asteroseismology. Astronomy
& Astrophysics. 647, A122.
mla: Mathis, S., et al. “Probing the Internal Magnetism of Stars Using Asymptotic
Magneto-Asteroseismology.” Astronomy & Astrophysics, vol. 647, A122,
EDP Sciences, 2021, doi:10.1051/0004-6361/202039180.
short: S. Mathis, L.A. Bugnet, V. Prat, K. Augustson, S. Mathur, R.A. Garcia, Astronomy
& Astrophysics 647 (2021).
date_created: 2022-07-18T12:15:27Z
date_published: 2021-03-18T00:00:00Z
date_updated: 2022-08-19T10:11:52Z
day: '18'
doi: 10.1051/0004-6361/202039180
extern: '1'
external_id:
arxiv:
- '2012.11050'
intvolume: ' 647'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- asteroseismology / waves / stars
- magnetic field / stars
- oscillations / methods
- analytical
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2012.11050
month: '03'
oa: 1
oa_version: Preprint
publication: Astronomy & Astrophysics
publication_identifier:
eissn:
- 1432-0746
issn:
- 0004-6361
publication_status: published
publisher: EDP Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: Probing the internal magnetism of stars using asymptotic magneto-asteroseismology
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 647
year: '2021'
...
---
_id: '11608'
abstract:
- lang: eng
text: 'In order to understand stellar evolution, it is crucial to efficiently determine
stellar surface rotation periods. Indeed, while they are of great importance in
stellar models, angular momentum transport processes inside stars are still poorly
understood today. Surface rotation, which is linked to the age of the star, is
one of the constraints needed to improve the way those processes are modelled.
Statistics of the surface rotation periods for a large sample of stars of different
spectral types are thus necessary. An efficient tool to automatically determine
reliable rotation periods is needed when dealing with large samples of stellar
photometric datasets. The objective of this work is to develop such a tool. For
this purpose, machine learning classifiers constitute relevant bases to build
our new methodology. Random forest learning abilities are exploited to automate
the extraction of rotation periods in Kepler light curves. Rotation periods and
complementary parameters are obtained via three different methods: a wavelet analysis,
the autocorrelation function of the light curve, and the composite spectrum. We
trained three different classifiers: one to detect if rotational modulations are
present in the light curve, one to flag close binary or classical pulsators candidates
that can bias our rotation period determination, and finally one classifier to
provide the final rotation period. We tested our machine learning pipeline on
23 431 stars of the Kepler K and M dwarf reference rotation catalogue for which
60% of the stars have been visually inspected. For the sample of 21 707 stars
where all the input parameters are provided to the algorithm, 94.2% of them are
correctly classified (as rotating or not). Among the stars that have a rotation
period in the reference catalogue, the machine learning provides a period that
agrees within 10% of the reference value for 95.3% of the stars. Moreover, the
yield of correct rotation periods is raised to 99.5% after visually inspecting
25.2% of the stars. Over the two main analysis steps, rotation classification
and period selection, the pipeline yields a global agreement with the reference
values of 92.1% and 96.9% before and after visual inspection. Random forest classifiers
are efficient tools to determine reliable rotation periods in large samples of
stars. The methodology presented here could be easily adapted to extract surface
rotation periods for stars with different spectral types or observed by other
instruments such as K2, TESS or by PLATO in the near future.'
acknowledgement: 'We thank Suzanne Aigrain and Joe Llama for providing us with the
simulated data used in Aigrain et al. (2015). S. N. B., L. B. and R. A. G. acknowledge
the support from PLATO and GOLF CNES grants. A. R. G. S. acknowledges the support
from NASA under grant NNX17AF27G. S. M. acknowledges the support from the Spanish
Ministry of Science and Innovation with the Ramon y Cajal fellowship number RYC-2015-17697.
P. L. P. and S. M. acknowledge support from the Spanish Ministry of Science and
Innovation with the grant number PID2019-107187GB-I00. This research has made use
of the NASA Exoplanet Archive, which is operated by the California Institute of
Technology, under contract with the National Aeronautics and Space Administration
under the Exoplanet Exploration Program. Software: Python (Van Rossum & Drake 2009),
numpy (Oliphant 2006), pandas (The pandas development team 2020; McKinney 2010),
matplotlib (Hunter 2007), scikit-learn (Pedregosa et al. 2011). The source code
used to obtain the present results can be found at: https://gitlab.com/sybreton/pushkin
; https://gitlab.com/sybreton/ml_surface_rotation_paper .'
article_number: A125
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: S. N.
full_name: Breton, S. N.
last_name: Breton
- first_name: A. R. G.
full_name: Santos, A. R. G.
last_name: Santos
- first_name: Lisa Annabelle
full_name: Bugnet, Lisa Annabelle
id: d9edb345-f866-11ec-9b37-d119b5234501
last_name: Bugnet
orcid: 0000-0003-0142-4000
- first_name: S.
full_name: Mathur, S.
last_name: Mathur
- first_name: R. A.
full_name: García, R. A.
last_name: García
- first_name: P. L.
full_name: Pallé, P. L.
last_name: Pallé
citation:
ama: 'Breton SN, Santos ARG, Bugnet LA, Mathur S, García RA, Pallé PL. ROOSTER:
A machine-learning analysis tool for Kepler stellar rotation periods. Astronomy
& Astrophysics. 2021;647. doi:10.1051/0004-6361/202039947'
apa: 'Breton, S. N., Santos, A. R. G., Bugnet, L. A., Mathur, S., García, R. A.,
& Pallé, P. L. (2021). ROOSTER: A machine-learning analysis tool for Kepler
stellar rotation periods. Astronomy & Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/202039947'
chicago: 'Breton, S. N., A. R. G. Santos, Lisa Annabelle Bugnet, S. Mathur, R. A.
García, and P. L. Pallé. “ROOSTER: A Machine-Learning Analysis Tool for Kepler
Stellar Rotation Periods.” Astronomy & Astrophysics. EDP Sciences,
2021. https://doi.org/10.1051/0004-6361/202039947.'
ieee: 'S. N. Breton, A. R. G. Santos, L. A. Bugnet, S. Mathur, R. A. García, and
P. L. Pallé, “ROOSTER: A machine-learning analysis tool for Kepler stellar rotation
periods,” Astronomy & Astrophysics, vol. 647. EDP Sciences, 2021.'
ista: 'Breton SN, Santos ARG, Bugnet LA, Mathur S, García RA, Pallé PL. 2021. ROOSTER:
A machine-learning analysis tool for Kepler stellar rotation periods. Astronomy
& Astrophysics. 647, A125.'
mla: 'Breton, S. N., et al. “ROOSTER: A Machine-Learning Analysis Tool for Kepler
Stellar Rotation Periods.” Astronomy & Astrophysics, vol. 647, A125,
EDP Sciences, 2021, doi:10.1051/0004-6361/202039947.'
short: S.N. Breton, A.R.G. Santos, L.A. Bugnet, S. Mathur, R.A. García, P.L. Pallé,
Astronomy & Astrophysics 647 (2021).
date_created: 2022-07-18T12:21:32Z
date_published: 2021-03-19T00:00:00Z
date_updated: 2022-08-22T08:47:47Z
day: '19'
doi: 10.1051/0004-6361/202039947
extern: '1'
external_id:
arxiv:
- '2101.10152'
intvolume: ' 647'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- 'methods: data analysis / stars: solar-type / stars: activity / stars: rotation
/ starspots'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2101.10152
month: '03'
oa: 1
oa_version: Preprint
publication: Astronomy & Astrophysics
publication_identifier:
eissn:
- 1432-0746
issn:
- 0004-6361
publication_status: published
publisher: EDP Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'ROOSTER: A machine-learning analysis tool for Kepler stellar rotation periods'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 647
year: '2021'
...
---
_id: '11609'
abstract:
- lang: eng
text: "Context. Stellar interiors are the seat of efficient transport of angular
momentum all along their evolution. In this context, understanding the dependence
of the turbulent transport triggered by the instabilities of the vertical and
horizontal shears of the differential rotation in stellar radiation zones as a
function of their rotation, stratification, and thermal diffusivity is mandatory.
Indeed, it constitutes one of the cornerstones of the rotational transport and
mixing theory, which is implemented in stellar evolution codes to predict the
rotational and chemical evolutions of stars.\r\n\r\nAims. We investigate horizontal
shear instabilities in rotating stellar radiation zones by considering the full
Coriolis acceleration with both the dimensionless horizontal Coriolis component
f̃ and the vertical component f.\r\n\r\nMethods. We performed a linear stability
analysis using linearized equations derived from the Navier-Stokes and heat transport
equations in the rotating nontraditional f-plane. We considered a horizontal shear
flow with a hyperbolic tangent profile as the base flow. The linear stability
was analyzed numerically in wide ranges of parameters, and we performed an asymptotic
analysis for large vertical wavenumbers using the Wentzel-Kramers-Brillouin-Jeffreys
(WKBJ) approximation for nondiffusive and highly-diffusive fluids.\r\n\r\nResults.
As in the traditional f-plane approximation, we identify two types of instabilities:
the inflectional and inertial instabilities. The inflectional instability is destabilized
as f̃ increases and its maximum growth rate increases significantly, while the
thermal diffusivity stabilizes the inflectional instability similarly to the traditional
case. The inertial instability is also strongly affected; for instance, the inertially
unstable regime is also extended in the nondiffusive limit as 0 < f < 1 + f̃ 2/N2,
where N is the dimensionless Brunt-Väisälä frequency. More strikingly, in the
high thermal diffusivity limit, it is always inertially unstable at any colatitude
θ except at the poles (i.e., 0° < θ < 180°). We also derived the critical Reynolds
numbers for the inertial instability using the asymptotic dispersion relations
obtained from the WKBJ analysis. Using the asymptotic and numerical results, we
propose a prescription for the effective turbulent viscosities induced by the
inertial and inflectional instabilities that can be possibly used in stellar evolution
models. The characteristic time of this turbulence is short enough so that it
is efficient to redistribute angular momentum and to mix chemicals in stellar
radiation zones."
acknowledgement: The authors acknowledge support from the European Research Council
through ERC grant SPIRE 647383 and from GOLF and PLATO CNES grants at the Department
of Astrophysics at CEA Paris-Saclay. We thank the referee, Prof. A. J. Barker, for
his constructive comments that allow us to improve the article.
article_number: A64
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: J.
full_name: Park, J.
last_name: Park
- first_name: V.
full_name: Prat, V.
last_name: Prat
- first_name: S.
full_name: Mathis, S.
last_name: Mathis
- first_name: Lisa Annabelle
full_name: Bugnet, Lisa Annabelle
id: d9edb345-f866-11ec-9b37-d119b5234501
last_name: Bugnet
orcid: 0000-0003-0142-4000
citation:
ama: 'Park J, Prat V, Mathis S, Bugnet LA. Horizontal shear instabilities in rotating
stellar radiation zones: II. Effects of the full Coriolis acceleration. Astronomy
& Astrophysics. 2021;646. doi:10.1051/0004-6361/202038654'
apa: 'Park, J., Prat, V., Mathis, S., & Bugnet, L. A. (2021). Horizontal shear
instabilities in rotating stellar radiation zones: II. Effects of the full Coriolis
acceleration. Astronomy & Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/202038654'
chicago: 'Park, J., V. Prat, S. Mathis, and Lisa Annabelle Bugnet. “Horizontal Shear
Instabilities in Rotating Stellar Radiation Zones: II. Effects of the Full Coriolis
Acceleration.” Astronomy & Astrophysics. EDP Sciences, 2021. https://doi.org/10.1051/0004-6361/202038654.'
ieee: 'J. Park, V. Prat, S. Mathis, and L. A. Bugnet, “Horizontal shear instabilities
in rotating stellar radiation zones: II. Effects of the full Coriolis acceleration,”
Astronomy & Astrophysics, vol. 646. EDP Sciences, 2021.'
ista: 'Park J, Prat V, Mathis S, Bugnet LA. 2021. Horizontal shear instabilities
in rotating stellar radiation zones: II. Effects of the full Coriolis acceleration.
Astronomy & Astrophysics. 646, A64.'
mla: 'Park, J., et al. “Horizontal Shear Instabilities in Rotating Stellar Radiation
Zones: II. Effects of the Full Coriolis Acceleration.” Astronomy & Astrophysics,
vol. 646, A64, EDP Sciences, 2021, doi:10.1051/0004-6361/202038654.'
short: J. Park, V. Prat, S. Mathis, L.A. Bugnet, Astronomy & Astrophysics 646
(2021).
date_created: 2022-07-18T13:24:32Z
date_published: 2021-02-08T00:00:00Z
date_updated: 2022-08-19T10:18:03Z
day: '08'
doi: 10.1051/0004-6361/202038654
extern: '1'
external_id:
arxiv:
- '2006.10660'
intvolume: ' 646'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- hydrodynamics / turbulence / stars
- rotation / stars
- evolution
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2006.10660
month: '02'
oa: 1
oa_version: Preprint
publication: Astronomy & Astrophysics
publication_identifier:
eissn:
- 1432-0746
issn:
- 0004-6361
publication_status: published
publisher: EDP Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Horizontal shear instabilities in rotating stellar radiation zones: II. Effects
of the full Coriolis acceleration'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 646
year: '2021'
...
---
_id: '11649'
abstract:
- lang: eng
text: 'While operating communication networks adaptively may improve utilization
and performance, frequent adjustments also introduce an algorithmic challenge:
the re-optimization of traffic engineering solutions is time-consuming and may
limit the granularity at which a network can be adjusted. This paper is motivated
by question whether the reactivity of a network can be improved by re-optimizing
solutions dynamically rather than from scratch, especially if inputs such as link
weights do not change significantly. This paper explores to what extent dynamic
algorithms can be used to speed up fundamental tasks in network operations. We
specifically investigate optimizations related to traffic engineering (namely
shortest paths and maximum flow computations), but also consider spanning tree
and matching applications. While prior work on dynamic graph algorithms focusses
on link insertions and deletions, we are interested in the practical problem of
link weight changes. We revisit existing upper bounds in the weight-dynamic model,
and present several novel lower bounds on the amortized runtime for recomputing
solutions. In general, we find that the potential performance gains depend on
the application, and there are also strict limitations on what can be achieved,
even if link weights change only slightly.'
article_processing_charge: No
arxiv: 1
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Ami
full_name: Paz, Ami
last_name: Paz
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'Henzinger MH, Paz A, Schmid S. On the complexity of weight-dynamic network
algorithms. In: IFIP Networking Conference. Institute of Electrical and
Electronics Engineers; 2021. doi:10.23919/ifipnetworking52078.2021.9472803'
apa: 'Henzinger, M. H., Paz, A., & Schmid, S. (2021). On the complexity of weight-dynamic
network algorithms. In IFIP Networking Conference. Espoo and Helsinki,
Finland: Institute of Electrical and Electronics Engineers. https://doi.org/10.23919/ifipnetworking52078.2021.9472803'
chicago: Henzinger, Monika H, Ami Paz, and Stefan Schmid. “On the Complexity of
Weight-Dynamic Network Algorithms.” In IFIP Networking Conference. Institute
of Electrical and Electronics Engineers, 2021. https://doi.org/10.23919/ifipnetworking52078.2021.9472803.
ieee: M. H. Henzinger, A. Paz, and S. Schmid, “On the complexity of weight-dynamic
network algorithms,” in IFIP Networking Conference, Espoo and Helsinki,
Finland, 2021.
ista: 'Henzinger MH, Paz A, Schmid S. 2021. On the complexity of weight-dynamic
network algorithms. IFIP Networking Conference. IFIP: Networking.'
mla: Henzinger, Monika H., et al. “On the Complexity of Weight-Dynamic Network Algorithms.”
IFIP Networking Conference, Institute of Electrical and Electronics Engineers,
2021, doi:10.23919/ifipnetworking52078.2021.9472803.
short: M.H. Henzinger, A. Paz, S. Schmid, in:, IFIP Networking Conference, Institute
of Electrical and Electronics Engineers, 2021.
conference:
end_date: 2021-06-24
location: ' Espoo and Helsinki, Finland'
name: 'IFIP: Networking'
start_date: 2021-06-21
date_created: 2022-07-25T11:13:06Z
date_published: 2021-06-21T00:00:00Z
date_updated: 2023-02-09T09:11:51Z
day: '21'
doi: 10.23919/ifipnetworking52078.2021.9472803
extern: '1'
external_id:
arxiv:
- '2105.13172'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.2105.13172'
month: '06'
oa: 1
oa_version: Preprint
publication: IFIP Networking Conference
publication_identifier:
eissn:
- 1861-2288
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the complexity of weight-dynamic network algorithms
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '11663'
abstract:
- lang: eng
text: "Many dynamic graph algorithms have an amortized update time, rather than
a stronger worst-case guarantee. But amortized data structures are not suitable
for real-time systems, where each individual operation has to be executed quickly.
For this reason, there exist many recent randomized results that aim to provide
a guarantee stronger than amortized expected. The strongest possible guarantee
for a randomized algorithm is that it is always correct (Las Vegas) and has high-probability
worst-case update time, which gives a bound on the time for each individual operation
that holds with high probability.\r\n\r\nIn this article, we present the first
polylogarithmic high-probability worst-case time bounds for the dynamic spanner
and the dynamic maximal matching problem.\r\n\r\n(1)\r\n\r\nFor dynamic spanner,
the only known o(n) worst-case bounds were O(n3/4) high-probability worst-case
update time for maintaining a 3-spanner and O(n5/9) for maintaining a 5-spanner.
We give a O(1)k log3 (n) high-probability worst-case time bound for maintaining
a (2k-1)-spanner, which yields the first worst-case polylog update time for all
constant k. (All the results above maintain the optimal tradeoff of stretch 2k-1
and Õ(n1+1/k) edges.)\r\n\r\n(2)\r\n\r\nFor dynamic maximal matching, or dynamic
2-approximate maximum matching, no algorithm with o(n) worst-case time bound was
known and we present an algorithm with O(log 5 (n)) high-probability worst-case
time; similar worst-case bounds existed only for maintaining a matching that was
(2+ϵ)-approximate, and hence not maximal.\r\n\r\nOur results are achieved using
a new approach for converting amortized guarantees to worst-case ones for randomized
data structures by going through a third type of guarantee, which is a middle
ground between the two above: An algorithm is said to have worst-case expected
update time ɑ if for every update σ, the expected time to process σ is at most
ɑ. Although stronger than amortized expected, the worst-case expected guarantee
does not resolve the fundamental problem of amortization: A worst-case expected
update time of O(1) still allows for the possibility that every 1/f(n) updates
requires ϴ (f(n)) time to process, for arbitrarily high f(n). In this article,
we present a black-box reduction that converts any data structure with worst-case
expected update time into one with a high-probability worst-case update time:
The query time remains the same, while the update time increases by a factor of
O(log 2(n)).\r\n\r\nThus, we achieve our results in two steps:\r\n\r\n(1) First,
we show how to convert existing dynamic graph algorithms with amortized expected
polylogarithmic running times into algorithms with worst-case expected polylogarithmic
running times.\r\n\r\n(2) Then, we use our black-box reduction to achieve the
polylogarithmic high-probability worst-case time bound. All our algorithms are
Las-Vegas-type algorithms."
acknowledgement: 'The conference version of this article [10] had an error in the
analysis of the dynamic matching algorithm. In particular, Lemma 4.5 assumed an
independence between adversarial updates to the hierarchy that is in fact true,
but which requires a sophisticated proof. We are very grateful to the anonymous
reviewers of Transactions on Algorithms for pointing out this mistake in our analysis.
The mistake is fixed in Section 4.5. Almost the entire fix is a matter of analysis:
the only change to the algorithm itself is the introduction of responsible bits
in Algorithm 2. The first author would like to thank Mikkel Thorup and Alan Roytman
for a very helpful discussion of the proof of Theorem 1.1.'
article_number: '29'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Aaron
full_name: Bernstein, Aaron
last_name: Bernstein
- first_name: Sebastian
full_name: Forster, Sebastian
last_name: Forster
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
citation:
ama: Bernstein A, Forster S, Henzinger MH. A deamortization approach for dynamic
spanner and dynamic maximal matching. ACM Transactions on Algorithms. 2021;17(4).
doi:10.1145/3469833
apa: Bernstein, A., Forster, S., & Henzinger, M. H. (2021). A deamortization
approach for dynamic spanner and dynamic maximal matching. ACM Transactions
on Algorithms. Association for Computing Machinery. https://doi.org/10.1145/3469833
chicago: Bernstein, Aaron, Sebastian Forster, and Monika H Henzinger. “A Deamortization
Approach for Dynamic Spanner and Dynamic Maximal Matching.” ACM Transactions
on Algorithms. Association for Computing Machinery, 2021. https://doi.org/10.1145/3469833.
ieee: A. Bernstein, S. Forster, and M. H. Henzinger, “A deamortization approach
for dynamic spanner and dynamic maximal matching,” ACM Transactions on Algorithms,
vol. 17, no. 4. Association for Computing Machinery, 2021.
ista: Bernstein A, Forster S, Henzinger MH. 2021. A deamortization approach for
dynamic spanner and dynamic maximal matching. ACM Transactions on Algorithms.
17(4), 29.
mla: Bernstein, Aaron, et al. “A Deamortization Approach for Dynamic Spanner and
Dynamic Maximal Matching.” ACM Transactions on Algorithms, vol. 17, no.
4, 29, Association for Computing Machinery, 2021, doi:10.1145/3469833.
short: A. Bernstein, S. Forster, M.H. Henzinger, ACM Transactions on Algorithms
17 (2021).
date_created: 2022-07-27T11:09:06Z
date_published: 2021-10-04T00:00:00Z
date_updated: 2022-09-09T11:35:44Z
day: '04'
doi: 10.1145/3469833
extern: '1'
external_id:
arxiv:
- '1810.10932'
intvolume: ' 17'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1810.10932
month: '10'
oa: 1
oa_version: Preprint
publication: ACM Transactions on Algorithms
publication_identifier:
eissn:
- 1549-6333
issn:
- 1549-6325
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: A deamortization approach for dynamic spanner and dynamic maximal matching
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 17
year: '2021'
...
---
_id: '11756'
abstract:
- lang: eng
text: We give two fully dynamic algorithms that maintain a (1 + ε)-approximation
of the weight M of a minimum spanning forest (MSF) of an n-node graph G with edges
weights in [1, W ], for any ε > 0. (1) Our deterministic algorithm takes O (W
2 log W /ε3) worst-case update time, which is O (1) if both W and ε are constants.
(2) Our randomized (Monte-Carlo style) algorithm works with high probability and
runs in worst-case O (log W /ε4) update time if W = O ((m∗)1/6/log2/3 n), where
m∗ is the minimum number of edges in the graph throughout all the updates. It
works even against an adaptive adversary. We complement our algorithmic results
with two cell-probe lower bounds for dynamically maintaining an approximation
of the weight of an MSF of a graph.
article_number: '104805'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Pan
full_name: Peng, Pan
last_name: Peng
citation:
ama: Henzinger MH, Peng P. Constant-time dynamic weight approximation for minimum
spanning forest. Information and Computation. 2021;281(12). doi:10.1016/j.ic.2021.104805
apa: Henzinger, M. H., & Peng, P. (2021). Constant-time dynamic weight approximation
for minimum spanning forest. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2021.104805
chicago: Henzinger, Monika H, and Pan Peng. “Constant-Time Dynamic Weight Approximation
for Minimum Spanning Forest.” Information and Computation. Elsevier, 2021.
https://doi.org/10.1016/j.ic.2021.104805.
ieee: M. H. Henzinger and P. Peng, “Constant-time dynamic weight approximation for
minimum spanning forest,” Information and Computation, vol. 281, no. 12.
Elsevier, 2021.
ista: Henzinger MH, Peng P. 2021. Constant-time dynamic weight approximation for
minimum spanning forest. Information and Computation. 281(12), 104805.
mla: Henzinger, Monika H., and Pan Peng. “Constant-Time Dynamic Weight Approximation
for Minimum Spanning Forest.” Information and Computation, vol. 281, no.
12, 104805, Elsevier, 2021, doi:10.1016/j.ic.2021.104805.
short: M.H. Henzinger, P. Peng, Information and Computation 281 (2021).
date_created: 2022-08-08T10:58:29Z
date_published: 2021-12-01T00:00:00Z
date_updated: 2022-09-12T09:29:29Z
day: '01'
doi: 10.1016/j.ic.2021.104805
extern: '1'
external_id:
arxiv:
- '2011.00977'
intvolume: ' 281'
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2011.00977
month: '12'
oa: 1
oa_version: Preprint
publication: Information and Computation
publication_identifier:
issn:
- 0890-5401
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Constant-time dynamic weight approximation for minimum spanning forest
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 281
year: '2021'
...
---
_id: '11771'
abstract:
- lang: eng
text: "Classic dynamic data structure problems maintain a data structure subject
to a sequence S of updates and they answer queries using the latest version of
the data structure, i.e., the data structure after processing the whole sequence.
To handle operations that change the sequence S of updates, Demaine et al. [7]
introduced retroactive data structures (RDS). A retroactive operation modifies
the update sequence S in a given position t, called time, and either creates or
cancels an update in S at time t. A fully retroactive data structure supports
queries at any time t: a query at time t is answered using only the updates of
S up to time t. While efficient RDS have been proposed for classic data structures,
e.g., stack, priority queue and binary search tree, the retroactive version of
graph problems are rarely studied.\r\n\r\nIn this paper we study retroactive graph
problems including connectivity, minimum spanning forest (MSF), maximum degree,
etc. We show that under the OMv conjecture (proposed by Henzinger et al. [15]),
there does not exist fully RDS maintaining connectivity or MSF, or incremental
fully RDS maintaining the maximum degree with \U0001D442(\U0001D45B1−\U0001D716)
time per operation, for any constant \U0001D716>0. Furthermore, We provide RDS
with almost tight time per operation. We give fully RDS for maintaining the maximum
degree, connectivity and MSF in \U0001D442̃ (\U0001D45B) time per operation. We
also give an algorithm for the incremental (insertion-only) fully retroactive
connectivity with \U0001D442̃ (1) time per operation, showing that the lower bound
cannot be extended to this setting.\r\n\r\nWe also study a restricted version
of RDS, where the only change to S is the swap of neighboring updates and show
that for this problem we can beat the above hardness result. This also implies
the first non-trivial dynamic Reeb graph computation algorithm."
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Xiaowei
full_name: Wu, Xiaowei
last_name: Wu
citation:
ama: 'Henzinger MH, Wu X. Upper and lower bounds for fully retroactive graph problems.
In: 17th International Symposium on Algorithms and Data Structures. Vol
12808. Springer Nature; 2021:471–484. doi:10.1007/978-3-030-83508-8_34'
apa: 'Henzinger, M. H., & Wu, X. (2021). Upper and lower bounds for fully retroactive
graph problems. In 17th International Symposium on Algorithms and Data Structures
(Vol. 12808, pp. 471–484). Virtual: Springer Nature. https://doi.org/10.1007/978-3-030-83508-8_34'
chicago: Henzinger, Monika H, and Xiaowei Wu. “Upper and Lower Bounds for Fully
Retroactive Graph Problems.” In 17th International Symposium on Algorithms
and Data Structures, 12808:471–484. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-83508-8_34.
ieee: M. H. Henzinger and X. Wu, “Upper and lower bounds for fully retroactive graph
problems,” in 17th International Symposium on Algorithms and Data Structures,
Virtual, 2021, vol. 12808, pp. 471–484.
ista: 'Henzinger MH, Wu X. 2021. Upper and lower bounds for fully retroactive graph
problems. 17th International Symposium on Algorithms and Data Structures. WADS:
Workshop on Algorithms and Data Structures, LNCS, vol. 12808, 471–484.'
mla: Henzinger, Monika H., and Xiaowei Wu. “Upper and Lower Bounds for Fully Retroactive
Graph Problems.” 17th International Symposium on Algorithms and Data Structures,
vol. 12808, Springer Nature, 2021, pp. 471–484, doi:10.1007/978-3-030-83508-8_34.
short: M.H. Henzinger, X. Wu, in:, 17th International Symposium on Algorithms and
Data Structures, Springer Nature, 2021, pp. 471–484.
conference:
end_date: 2021-08-11
location: Virtual
name: 'WADS: Workshop on Algorithms and Data Structures'
start_date: 2021-08-09
date_created: 2022-08-08T13:01:29Z
date_published: 2021-08-09T00:00:00Z
date_updated: 2023-02-10T08:31:50Z
day: '09'
doi: 10.1007/978-3-030-83508-8_34
extern: '1'
external_id:
arxiv:
- '1910.03332'
intvolume: ' 12808'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1910.03332
month: '08'
oa: 1
oa_version: Preprint
page: 471–484
publication: 17th International Symposium on Algorithms and Data Structures
publication_identifier:
eisbn:
- '9783030835088'
eissn:
- 1611-3349
isbn:
- '9783030835071'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Upper and lower bounds for fully retroactive graph problems
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 12808
year: '2021'
...
---
_id: '7883'
abstract:
- lang: eng
text: All vertebrates have a spinal cord with dimensions and shape specific to their
species. Yet how species‐specific organ size and shape are achieved is a fundamental
unresolved question in biology. The formation and sculpting of organs begins during
embryonic development. As it develops, the spinal cord extends in anterior–posterior
direction in synchrony with the overall growth of the body. The dorsoventral (DV)
and apicobasal lengths of the spinal cord neuroepithelium also change, while at
the same time a characteristic pattern of neural progenitor subtypes along the
DV axis is established and elaborated. At the basis of these changes in tissue
size and shape are biophysical determinants, such as the change in cell number,
cell size and shape, and anisotropic tissue growth. These processes are controlled
by global tissue‐scale regulators, such as morphogen signaling gradients as well
as mechanical forces. Current challenges in the field are to uncover how these
tissue‐scale regulatory mechanisms are translated to the cellular and molecular
level, and how regulation of distinct cellular processes gives rise to an overall
defined size. Addressing these questions will help not only to achieve a better
understanding of how size is controlled, but also of how tissue size is coordinated
with the specification of pattern.
acknowledgement: 'Austrian Academy of Sciences, Grant/Award Number: DOC fellowship
for Katarzyna Kuzmicz-Kowalska; Austrian Science Fund, Grant/Award Number: F78 (Stem
Cell Modulation); H2020 European Research Council, Grant/Award Number: 680037'
article_number: e383
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Katarzyna
full_name: Kuzmicz-Kowalska, Katarzyna
id: 4CED352A-F248-11E8-B48F-1D18A9856A87
last_name: Kuzmicz-Kowalska
- first_name: Anna
full_name: Kicheva, Anna
id: 3959A2A0-F248-11E8-B48F-1D18A9856A87
last_name: Kicheva
orcid: 0000-0003-4509-4998
citation:
ama: 'Kuzmicz-Kowalska K, Kicheva A. Regulation of size and scale in vertebrate
spinal cord development. Wiley Interdisciplinary Reviews: Developmental Biology.
2021. doi:10.1002/wdev.383'
apa: 'Kuzmicz-Kowalska, K., & Kicheva, A. (2021). Regulation of size and scale
in vertebrate spinal cord development. Wiley Interdisciplinary Reviews: Developmental
Biology. Wiley. https://doi.org/10.1002/wdev.383'
chicago: 'Kuzmicz-Kowalska, Katarzyna, and Anna Kicheva. “Regulation of Size and
Scale in Vertebrate Spinal Cord Development.” Wiley Interdisciplinary Reviews:
Developmental Biology. Wiley, 2021. https://doi.org/10.1002/wdev.383.'
ieee: 'K. Kuzmicz-Kowalska and A. Kicheva, “Regulation of size and scale in vertebrate
spinal cord development,” Wiley Interdisciplinary Reviews: Developmental Biology.
Wiley, 2021.'
ista: 'Kuzmicz-Kowalska K, Kicheva A. 2021. Regulation of size and scale in vertebrate
spinal cord development. Wiley Interdisciplinary Reviews: Developmental Biology.,
e383.'
mla: 'Kuzmicz-Kowalska, Katarzyna, and Anna Kicheva. “Regulation of Size and Scale
in Vertebrate Spinal Cord Development.” Wiley Interdisciplinary Reviews: Developmental
Biology, e383, Wiley, 2021, doi:10.1002/wdev.383.'
short: 'K. Kuzmicz-Kowalska, A. Kicheva, Wiley Interdisciplinary Reviews: Developmental
Biology (2021).'
date_created: 2020-05-24T22:01:00Z
date_published: 2021-04-15T00:00:00Z
date_updated: 2024-03-07T15:03:00Z
day: '15'
ddc:
- '570'
department:
- _id: AnKi
doi: 10.1002/wdev.383
ec_funded: 1
external_id:
isi:
- '000531419400001'
pmid:
- '32391980'
file:
- access_level: open_access
checksum: f0a7745d48afa09ea7025e876a0145a8
content_type: application/pdf
creator: dernst
date_created: 2020-11-24T13:11:39Z
date_updated: 2020-11-24T13:11:39Z
file_id: '8800'
file_name: 2020_WIREs_DevBio_KuzmiczKowalska.pdf
file_size: 2527276
relation: main_file
success: 1
file_date_updated: 2020-11-24T13:11:39Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: B6FC0238-B512-11E9-945C-1524E6697425
call_identifier: H2020
grant_number: '680037'
name: Coordination of Patterning And Growth In the Spinal Cord
- _id: 267AF0E4-B435-11E9-9278-68D0E5697425
name: The role of morphogens in the regulation of neural tube growth
- _id: 059DF620-7A3F-11EA-A408-12923DDC885E
grant_number: F07802
name: Morphogen control of growth and pattern in the spinal cord
publication: 'Wiley Interdisciplinary Reviews: Developmental Biology'
publication_identifier:
eissn:
- '17597692'
issn:
- '17597684'
publication_status: published
publisher: Wiley
quality_controlled: '1'
related_material:
record:
- id: '14323'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Regulation of size and scale in vertebrate spinal cord development
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '7900'
abstract:
- lang: eng
text: Hartree–Fock theory has been justified as a mean-field approximation for fermionic
systems. However, it suffers from some defects in predicting physical properties,
making necessary a theory of quantum correlations. Recently, bosonization of many-body
correlations has been rigorously justified as an upper bound on the correlation
energy at high density with weak interactions. We review the bosonic approximation,
deriving an effective Hamiltonian. We then show that for systems with Coulomb
interaction this effective theory predicts collective excitations (plasmons) in
accordance with the random phase approximation of Bohm and Pines, and with experimental
observation.
article_number: '2060009'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Niels P
full_name: Benedikter, Niels P
id: 3DE6C32A-F248-11E8-B48F-1D18A9856A87
last_name: Benedikter
orcid: 0000-0002-1071-6091
citation:
ama: Benedikter NP. Bosonic collective excitations in Fermi gases. Reviews in
Mathematical Physics. 2021;33(1). doi:10.1142/s0129055x20600090
apa: Benedikter, N. P. (2021). Bosonic collective excitations in Fermi gases. Reviews
in Mathematical Physics. World Scientific. https://doi.org/10.1142/s0129055x20600090
chicago: Benedikter, Niels P. “Bosonic Collective Excitations in Fermi Gases.” Reviews
in Mathematical Physics. World Scientific, 2021. https://doi.org/10.1142/s0129055x20600090.
ieee: N. P. Benedikter, “Bosonic collective excitations in Fermi gases,” Reviews
in Mathematical Physics, vol. 33, no. 1. World Scientific, 2021.
ista: Benedikter NP. 2021. Bosonic collective excitations in Fermi gases. Reviews
in Mathematical Physics. 33(1), 2060009.
mla: Benedikter, Niels P. “Bosonic Collective Excitations in Fermi Gases.” Reviews
in Mathematical Physics, vol. 33, no. 1, 2060009, World Scientific, 2021,
doi:10.1142/s0129055x20600090.
short: N.P. Benedikter, Reviews in Mathematical Physics 33 (2021).
date_created: 2020-05-28T16:47:55Z
date_published: 2021-01-01T00:00:00Z
date_updated: 2023-09-05T16:07:40Z
day: '01'
department:
- _id: RoSe
doi: 10.1142/s0129055x20600090
ec_funded: 1
external_id:
arxiv:
- '1910.08190'
isi:
- '000613313200010'
intvolume: ' 33'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1910.08190
month: '01'
oa: 1
oa_version: Preprint
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication: Reviews in Mathematical Physics
publication_identifier:
eissn:
- 1793-6659
issn:
- 0129-055X
publication_status: published
publisher: World Scientific
quality_controlled: '1'
scopus_import: '1'
status: public
title: Bosonic collective excitations in Fermi gases
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 33
year: '2021'
...
---
_id: '7901'
abstract:
- lang: eng
text: We derive rigorously the leading order of the correlation energy of a Fermi
gas in a scaling regime of high density and weak interaction. The result verifies
the prediction of the random-phase approximation. Our proof refines the method
of collective bosonization in three dimensions. We approximately diagonalize an
effective Hamiltonian describing approximately bosonic collective excitations
around the Hartree–Fock state, while showing that gapless and non-collective excitations
have only a negligible effect on the ground state energy.
acknowledgement: We thank Christian Hainzl for helpful discussions and a referee for
very careful reading of the paper and many helpful suggestions. NB and RS were supported
by the European Research Council (ERC) under the European Union’s Horizon 2020 research
and innovation programme (grant agreement No. 694227). Part of the research of NB
was conducted on the RZD18 Nice–Milan–Vienna–Moscow. NB thanks Elliott H. Lieb and
Peter Otte for explanations about the Luttinger model. PTN has received funding
from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under
Germany’s Excellence Strategy (EXC-2111-390814868). MP acknowledges financial support
from the European Research Council (ERC) under the European Union’s Horizon 2020
research and innovation programme (ERC StG MaMBoQ, grant agreement No. 802901).
BS gratefully acknowledges financial support from the NCCR SwissMAP, from the Swiss
National Science Foundation through the Grant “Dynamical and energetic properties
of Bose-Einstein condensates” and from the European Research Council through the
ERC-AdG CLaQS (grant agreement No. 834782). All authors acknowledge support for
workshop participation from Mathematisches Forschungsinstitut Oberwolfach (Leibniz
Association). NB, PTN, BS, and RS acknowledge support for workshop participation
from Fondation des Treilles.
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Niels P
full_name: Benedikter, Niels P
id: 3DE6C32A-F248-11E8-B48F-1D18A9856A87
last_name: Benedikter
orcid: 0000-0002-1071-6091
- first_name: Phan Thành
full_name: Nam, Phan Thành
last_name: Nam
- first_name: Marcello
full_name: Porta, Marcello
last_name: Porta
- first_name: Benjamin
full_name: Schlein, Benjamin
last_name: Schlein
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Benedikter NP, Nam PT, Porta M, Schlein B, Seiringer R. Correlation energy
of a weakly interacting Fermi gas. Inventiones Mathematicae. 2021;225:885-979.
doi:10.1007/s00222-021-01041-5
apa: Benedikter, N. P., Nam, P. T., Porta, M., Schlein, B., & Seiringer, R.
(2021). Correlation energy of a weakly interacting Fermi gas. Inventiones Mathematicae.
Springer. https://doi.org/10.1007/s00222-021-01041-5
chicago: Benedikter, Niels P, Phan Thành Nam, Marcello Porta, Benjamin Schlein,
and Robert Seiringer. “Correlation Energy of a Weakly Interacting Fermi Gas.”
Inventiones Mathematicae. Springer, 2021. https://doi.org/10.1007/s00222-021-01041-5.
ieee: N. P. Benedikter, P. T. Nam, M. Porta, B. Schlein, and R. Seiringer, “Correlation
energy of a weakly interacting Fermi gas,” Inventiones Mathematicae, vol.
225. Springer, pp. 885–979, 2021.
ista: Benedikter NP, Nam PT, Porta M, Schlein B, Seiringer R. 2021. Correlation
energy of a weakly interacting Fermi gas. Inventiones Mathematicae. 225, 885–979.
mla: Benedikter, Niels P., et al. “Correlation Energy of a Weakly Interacting Fermi
Gas.” Inventiones Mathematicae, vol. 225, Springer, 2021, pp. 885–979,
doi:10.1007/s00222-021-01041-5.
short: N.P. Benedikter, P.T. Nam, M. Porta, B. Schlein, R. Seiringer, Inventiones
Mathematicae 225 (2021) 885–979.
date_created: 2020-05-28T16:48:20Z
date_published: 2021-05-03T00:00:00Z
date_updated: 2023-08-21T06:30:30Z
day: '03'
ddc:
- '510'
department:
- _id: RoSe
doi: 10.1007/s00222-021-01041-5
ec_funded: 1
external_id:
arxiv:
- '2005.08933'
isi:
- '000646573600001'
file:
- access_level: open_access
checksum: f38c79dfd828cdc7f49a34b37b83d376
content_type: application/pdf
creator: dernst
date_created: 2022-05-16T12:23:40Z
date_updated: 2022-05-16T12:23:40Z
file_id: '11386'
file_name: 2021_InventMath_Benedikter.pdf
file_size: 1089319
relation: main_file
success: 1
file_date_updated: 2022-05-16T12:23:40Z
has_accepted_license: '1'
intvolume: ' 225'
isi: 1
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 885-979
project:
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication: Inventiones Mathematicae
publication_identifier:
eissn:
- 1432-1297
issn:
- 0020-9910
publication_status: published
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
status: public
title: Correlation energy of a weakly interacting Fermi gas
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 225
year: '2021'
...
---
_id: '7905'
abstract:
- lang: eng
text: We investigate a sheaf-theoretic interpretation of stratification learning
from geometric and topological perspectives. Our main result is the construction
of stratification learning algorithms framed in terms of a sheaf on a partially
ordered set with the Alexandroff topology. We prove that the resulting decomposition
is the unique minimal stratification for which the strata are homogeneous and
the given sheaf is constructible. In particular, when we choose to work with the
local homology sheaf, our algorithm gives an alternative to the local homology
transfer algorithm given in Bendich et al. (Proceedings of the 23rd Annual ACM-SIAM
Symposium on Discrete Algorithms, pp. 1355–1370, ACM, New York, 2012), and the
cohomology stratification algorithm given in Nanda (Found. Comput. Math. 20(2),
195–222, 2020). Additionally, we give examples of stratifications based on the
geometric techniques of Breiding et al. (Rev. Mat. Complut. 31(3), 545–593, 2018),
illustrating how the sheaf-theoretic approach can be used to study stratifications
from both topological and geometric perspectives. This approach also points toward
future applications of sheaf theory in the study of topological data analysis
by illustrating the utility of the language of sheaf theory in generalizing existing
algorithms.
acknowledgement: Open access funding provided by Institute of Science and Technology
(IST Austria). This work was partially supported by NSF IIS-1513616 and NSF ABI-1661375.
The authors would like to thank the anonymous referees for their insightful comments.
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Adam
full_name: Brown, Adam
id: 70B7FDF6-608D-11E9-9333-8535E6697425
last_name: Brown
- first_name: Bei
full_name: Wang, Bei
last_name: Wang
citation:
ama: Brown A, Wang B. Sheaf-theoretic stratification learning from geometric and
topological perspectives. Discrete and Computational Geometry. 2021;65:1166-1198.
doi:10.1007/s00454-020-00206-y
apa: Brown, A., & Wang, B. (2021). Sheaf-theoretic stratification learning from
geometric and topological perspectives. Discrete and Computational Geometry.
Springer Nature. https://doi.org/10.1007/s00454-020-00206-y
chicago: Brown, Adam, and Bei Wang. “Sheaf-Theoretic Stratification Learning from
Geometric and Topological Perspectives.” Discrete and Computational Geometry.
Springer Nature, 2021. https://doi.org/10.1007/s00454-020-00206-y.
ieee: A. Brown and B. Wang, “Sheaf-theoretic stratification learning from geometric
and topological perspectives,” Discrete and Computational Geometry, vol.
65. Springer Nature, pp. 1166–1198, 2021.
ista: Brown A, Wang B. 2021. Sheaf-theoretic stratification learning from geometric
and topological perspectives. Discrete and Computational Geometry. 65, 1166–1198.
mla: Brown, Adam, and Bei Wang. “Sheaf-Theoretic Stratification Learning from Geometric
and Topological Perspectives.” Discrete and Computational Geometry, vol.
65, Springer Nature, 2021, pp. 1166–98, doi:10.1007/s00454-020-00206-y.
short: A. Brown, B. Wang, Discrete and Computational Geometry 65 (2021) 1166–1198.
date_created: 2020-05-30T10:26:04Z
date_published: 2021-06-01T00:00:00Z
date_updated: 2024-03-07T15:01:58Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1007/s00454-020-00206-y
external_id:
arxiv:
- '1712.07734'
isi:
- '000536324700001'
file:
- access_level: open_access
checksum: 487a84ea5841b75f04f66d7ebd71b67e
content_type: application/pdf
creator: dernst
date_created: 2020-11-25T09:06:41Z
date_updated: 2020-11-25T09:06:41Z
file_id: '8803'
file_name: 2020_DiscreteCompGeometry_Brown.pdf
file_size: 1013730
relation: main_file
success: 1
file_date_updated: 2020-11-25T09:06:41Z
has_accepted_license: '1'
intvolume: ' 65'
isi: 1
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 1166-1198
project:
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Discrete and Computational Geometry
publication_identifier:
eissn:
- 1432-0444
issn:
- 0179-5376
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Sheaf-theoretic stratification learning from geometric and topological perspectives
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 65
year: '2021'
...
---
_id: '7925'
abstract:
- lang: eng
text: In this paper, we introduce a relaxed CQ method with alternated inertial step
for solving split feasibility problems. We give convergence of the sequence generated
by our method under some suitable assumptions. Some numerical implementations
from sparse signal and image deblurring are reported to show the efficiency of
our method.
acknowledgement: Open access funding provided by Institute of Science and Technology
(IST Austria). The authors are grateful to the referees for their insightful comments
which have improved the earlier version of the manuscript greatly. The first author
has received funding from the European Research Council (ERC) under the European
Union’s Seventh Framework Program (FP7-2007-2013) (Grant agreement No. 616160).
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Yekini
full_name: Shehu, Yekini
id: 3FC7CB58-F248-11E8-B48F-1D18A9856A87
last_name: Shehu
orcid: 0000-0001-9224-7139
- first_name: Aviv
full_name: Gibali, Aviv
last_name: Gibali
citation:
ama: Shehu Y, Gibali A. New inertial relaxed method for solving split feasibilities.
Optimization Letters. 2021;15:2109-2126. doi:10.1007/s11590-020-01603-1
apa: Shehu, Y., & Gibali, A. (2021). New inertial relaxed method for solving
split feasibilities. Optimization Letters. Springer Nature. https://doi.org/10.1007/s11590-020-01603-1
chicago: Shehu, Yekini, and Aviv Gibali. “New Inertial Relaxed Method for Solving
Split Feasibilities.” Optimization Letters. Springer Nature, 2021. https://doi.org/10.1007/s11590-020-01603-1.
ieee: Y. Shehu and A. Gibali, “New inertial relaxed method for solving split feasibilities,”
Optimization Letters, vol. 15. Springer Nature, pp. 2109–2126, 2021.
ista: Shehu Y, Gibali A. 2021. New inertial relaxed method for solving split feasibilities.
Optimization Letters. 15, 2109–2126.
mla: Shehu, Yekini, and Aviv Gibali. “New Inertial Relaxed Method for Solving Split
Feasibilities.” Optimization Letters, vol. 15, Springer Nature, 2021, pp.
2109–26, doi:10.1007/s11590-020-01603-1.
short: Y. Shehu, A. Gibali, Optimization Letters 15 (2021) 2109–2126.
date_created: 2020-06-04T11:28:33Z
date_published: 2021-09-01T00:00:00Z
date_updated: 2024-03-07T15:00:43Z
day: '01'
ddc:
- '510'
department:
- _id: VlKo
doi: 10.1007/s11590-020-01603-1
ec_funded: 1
external_id:
isi:
- '000537342300001'
file:
- access_level: open_access
checksum: 63c5f31cd04626152a19f97a2476281b
content_type: application/pdf
creator: kschuh
date_created: 2024-03-07T14:58:51Z
date_updated: 2024-03-07T14:58:51Z
file_id: '15089'
file_name: 2021_OptimizationLetters_Shehu.pdf
file_size: 2148882
relation: main_file
success: 1
file_date_updated: 2024-03-07T14:58:51Z
has_accepted_license: '1'
intvolume: ' 15'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 2109-2126
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Optimization Letters
publication_identifier:
eissn:
- 1862-4480
issn:
- 1862-4472
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: New inertial relaxed method for solving split feasibilities
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 15
year: '2021'
...
---
_id: '7939'
abstract:
- lang: eng
text: "We design fast deterministic algorithms for distance computation in the Congested
Clique model. Our key contributions include:\r\n A (2+ϵ)-approximation for
all-pairs shortest paths in O(log2n/ϵ) rounds on unweighted undirected graphs.
With a small additional additive factor, this also applies for weighted graphs.
This is the first sub-polynomial constant-factor approximation for APSP in this
model.\r\n A (1+ϵ)-approximation for multi-source shortest paths from O(n−−√)
sources in O(log2n/ϵ) rounds on weighted undirected graphs. This is the first
sub-polynomial algorithm obtaining this approximation for a set of sources of
polynomial size.\r\n\r\nOur main techniques are new distance tools that are obtained
via improved algorithms for sparse matrix multiplication, which we leverage to
construct efficient hopsets and shortest paths. Furthermore, our techniques extend
to additional distance problems for which we improve upon the state-of-the-art,
including diameter approximation, and an exact single-source shortest paths algorithm
for weighted undirected graphs in O~(n1/6) rounds. "
acknowledgement: Open access funding provided by Institute of Science and Technology
(IST Austria). We thank Mohsen Ghaffari, Michael Elkin and Merav Parter for fruitful
discussions. This project has received funding from the European Union’s Horizon
2020 Research And Innovation Program under Grant Agreement No. 755839.
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Keren
full_name: Censor-Hillel, Keren
last_name: Censor-Hillel
- first_name: Michal
full_name: Dory, Michal
last_name: Dory
- first_name: Janne
full_name: Korhonen, Janne
id: C5402D42-15BC-11E9-A202-CA2BE6697425
last_name: Korhonen
- first_name: Dean
full_name: Leitersdorf, Dean
last_name: Leitersdorf
citation:
ama: Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. Fast approximate shortest
paths in the congested clique. Distributed Computing. 2021;34:463-487.
doi:10.1007/s00446-020-00380-5
apa: Censor-Hillel, K., Dory, M., Korhonen, J., & Leitersdorf, D. (2021). Fast
approximate shortest paths in the congested clique. Distributed Computing.
Springer Nature. https://doi.org/10.1007/s00446-020-00380-5
chicago: Censor-Hillel, Keren, Michal Dory, Janne Korhonen, and Dean Leitersdorf.
“Fast Approximate Shortest Paths in the Congested Clique.” Distributed Computing.
Springer Nature, 2021. https://doi.org/10.1007/s00446-020-00380-5.
ieee: K. Censor-Hillel, M. Dory, J. Korhonen, and D. Leitersdorf, “Fast approximate
shortest paths in the congested clique,” Distributed Computing, vol. 34.
Springer Nature, pp. 463–487, 2021.
ista: Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. 2021. Fast approximate
shortest paths in the congested clique. Distributed Computing. 34, 463–487.
mla: Censor-Hillel, Keren, et al. “Fast Approximate Shortest Paths in the Congested
Clique.” Distributed Computing, vol. 34, Springer Nature, 2021, pp. 463–87,
doi:10.1007/s00446-020-00380-5.
short: K. Censor-Hillel, M. Dory, J. Korhonen, D. Leitersdorf, Distributed Computing
34 (2021) 463–487.
date_created: 2020-06-07T22:00:54Z
date_published: 2021-12-01T00:00:00Z
date_updated: 2024-03-07T14:43:39Z
day: '01'
department:
- _id: DaAl
doi: 10.1007/s00446-020-00380-5
external_id:
arxiv:
- '1903.05956'
isi:
- '000556444600001'
intvolume: ' 34'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1007/s00446-020-00380-5
month: '12'
oa: 1
oa_version: Published Version
page: 463-487
project:
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Distributed Computing
publication_identifier:
eissn:
- 1432-0452
issn:
- 0178-2770
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '6933'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Fast approximate shortest paths in the congested clique
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2021'
...
---
_id: '8196'
abstract:
- lang: eng
text: This paper aims to obtain a strong convergence result for a Douglas–Rachford
splitting method with inertial extrapolation step for finding a zero of the sum
of two set-valued maximal monotone operators without any further assumption of
uniform monotonicity on any of the involved maximal monotone operators. Furthermore,
our proposed method is easy to implement and the inertial factor in our proposed
method is a natural choice. Our method of proof is of independent interest. Finally,
some numerical implementations are given to confirm the theoretical analysis.
acknowledgement: Open access funding provided by Institute of Science and Technology
(IST Austria). The project of Yekini Shehu has received funding from the European
Research Council (ERC) under the European Union’s Seventh Framework Program (FP7—2007–2013)
(Grant Agreement No. 616160). The authors are grateful to the anonymous referees
and the handling Editor for their comments and suggestions which have improved the
earlier version of the manuscript greatly.
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Yekini
full_name: Shehu, Yekini
id: 3FC7CB58-F248-11E8-B48F-1D18A9856A87
last_name: Shehu
orcid: 0000-0001-9224-7139
- first_name: Qiao-Li
full_name: Dong, Qiao-Li
last_name: Dong
- first_name: Lu-Lu
full_name: Liu, Lu-Lu
last_name: Liu
- first_name: Jen-Chih
full_name: Yao, Jen-Chih
last_name: Yao
citation:
ama: Shehu Y, Dong Q-L, Liu L-L, Yao J-C. New strong convergence method for the
sum of two maximal monotone operators. Optimization and Engineering. 2021;22:2627-2653.
doi:10.1007/s11081-020-09544-5
apa: Shehu, Y., Dong, Q.-L., Liu, L.-L., & Yao, J.-C. (2021). New strong convergence
method for the sum of two maximal monotone operators. Optimization and Engineering.
Springer Nature. https://doi.org/10.1007/s11081-020-09544-5
chicago: Shehu, Yekini, Qiao-Li Dong, Lu-Lu Liu, and Jen-Chih Yao. “New Strong Convergence
Method for the Sum of Two Maximal Monotone Operators.” Optimization and Engineering.
Springer Nature, 2021. https://doi.org/10.1007/s11081-020-09544-5.
ieee: Y. Shehu, Q.-L. Dong, L.-L. Liu, and J.-C. Yao, “New strong convergence method
for the sum of two maximal monotone operators,” Optimization and Engineering,
vol. 22. Springer Nature, pp. 2627–2653, 2021.
ista: Shehu Y, Dong Q-L, Liu L-L, Yao J-C. 2021. New strong convergence method for
the sum of two maximal monotone operators. Optimization and Engineering. 22, 2627–2653.
mla: Shehu, Yekini, et al. “New Strong Convergence Method for the Sum of Two Maximal
Monotone Operators.” Optimization and Engineering, vol. 22, Springer Nature,
2021, pp. 2627–53, doi:10.1007/s11081-020-09544-5.
short: Y. Shehu, Q.-L. Dong, L.-L. Liu, J.-C. Yao, Optimization and Engineering
22 (2021) 2627–2653.
date_created: 2020-08-03T14:29:57Z
date_published: 2021-02-25T00:00:00Z
date_updated: 2024-03-07T14:39:29Z
day: '25'
ddc:
- '510'
department:
- _id: VlKo
doi: 10.1007/s11081-020-09544-5
ec_funded: 1
external_id:
isi:
- '000559345400001'
file:
- access_level: open_access
content_type: application/pdf
creator: dernst
date_created: 2020-08-03T15:24:39Z
date_updated: 2020-08-03T15:24:39Z
file_id: '8197'
file_name: 2020_OptimizationEngineering_Shehu.pdf
file_size: 2137860
relation: main_file
success: 1
file_date_updated: 2020-08-03T15:24:39Z
has_accepted_license: '1'
intvolume: ' 22'
isi: 1
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 2627-2653
project:
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: Optimization and Engineering
publication_identifier:
eissn:
- 1573-2924
issn:
- 1389-4420
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: New strong convergence method for the sum of two maximal monotone operators
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 22
year: '2021'
...
---
_id: '8198'
abstract:
- lang: eng
text: We investigate how the critical driving amplitude at the Floquet many-body
localized (MBL) to ergodic phase transition differs between smooth and nonsmooth
drives. To this end, we numerically study a disordered spin-1/2 chain which is
periodically driven by a sine or square-wave drive over a wide range of driving
frequencies. In both cases the critical driving amplitude increases monotonically
with the frequency, and at large frequencies it is identical for the two drives.
However, at low and intermediate frequencies the critical amplitude of the square-wave
drive depends strongly on the frequency, while that of the sinusoidal drive is
almost constant over a wide frequency range. By analyzing the density of drive-induced
resonances we conclude that this difference is due to resonances induced by the
higher harmonics which are present (absent) in the Fourier spectrum of the square-wave
(sine) drive. Furthermore, we suggest a numerically efficient method for estimating
the frequency dependence of the critical driving amplitudes for different drives
which is based on calculating the density of drive-induced resonances. We conclude
that delocalization occurs once the density of drive-induced resonances reaches
a critical value determined only by the static system.
acknowledgement: We thank Y. Bar Lev, T. Biadse, and, particularly, E. Bairey and
B. Katzir for illuminating discussions and their many insights and help. The authors
thank N. Lindner for his support throughout this project. We are further grateful
to M. Serbyn, A. Kamenev, A. Turner, and S. de Nicola for reading the manuscript
and providing good feedback and suggestions. We acknowledge financial support from
the Defense Advanced Research Projects Agency through the DRINQS program, Grant
No. D18AC00025. T.G. was in part supported by an Aly Kaufman Fellowship at the Technion.
T.G. acknowledges funding from the Institute of Science and Technology (IST) Austria
and from the European Union’s Horizon 2020 research and innovation program under
Marie SkłodowskaCurie Grant Agreement No. 754411.under the Marie Skłodowska-Curie
Grant Agreement No.754411.
article_number: '214204'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Asaf A.
full_name: Diringer, Asaf A.
last_name: Diringer
- first_name: Tobias
full_name: Gulden, Tobias
id: 1083E038-9F73-11E9-A4B5-532AE6697425
last_name: Gulden
orcid: 0000-0001-6814-7541
citation:
ama: Diringer AA, Gulden T. Impact of drive harmonics on the stability of Floquet
many-body localization. Physical Review B. 2021;103(21). doi:10.1103/PhysRevB.103.214204
apa: Diringer, A. A., & Gulden, T. (2021). Impact of drive harmonics on the
stability of Floquet many-body localization. Physical Review B. American
Physical Society. https://doi.org/10.1103/PhysRevB.103.214204
chicago: Diringer, Asaf A., and Tobias Gulden. “Impact of Drive Harmonics on the
Stability of Floquet Many-Body Localization.” Physical Review B. American
Physical Society, 2021. https://doi.org/10.1103/PhysRevB.103.214204.
ieee: A. A. Diringer and T. Gulden, “Impact of drive harmonics on the stability
of Floquet many-body localization,” Physical Review B, vol. 103, no. 21.
American Physical Society, 2021.
ista: Diringer AA, Gulden T. 2021. Impact of drive harmonics on the stability of
Floquet many-body localization. Physical Review B. 103(21), 214204.
mla: Diringer, Asaf A., and Tobias Gulden. “Impact of Drive Harmonics on the Stability
of Floquet Many-Body Localization.” Physical Review B, vol. 103, no. 21,
214204, American Physical Society, 2021, doi:10.1103/PhysRevB.103.214204.
short: A.A. Diringer, T. Gulden, Physical Review B 103 (2021).
date_created: 2020-08-04T13:03:40Z
date_published: 2021-06-21T00:00:00Z
date_updated: 2023-08-04T10:56:33Z
day: '21'
department:
- _id: MaSe
doi: 10.1103/PhysRevB.103.214204
ec_funded: 1
external_id:
arxiv:
- '2007.14879'
isi:
- '000664429700005'
intvolume: ' 103'
isi: 1
issue: '21'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2007.14879
month: '06'
oa: 1
oa_version: Preprint
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Physical Review B
publication_identifier:
eissn:
- '24699969'
issn:
- '24699950'
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
status: public
title: Impact of drive harmonics on the stability of Floquet many-body localization
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 103
year: '2021'
...
---
_id: '8248'
abstract:
- lang: eng
text: 'We consider the following setting: suppose that we are given a manifold M
in Rd with positive reach. Moreover assume that we have an embedded simplical
complex A without boundary, whose vertex set lies on the manifold, is sufficiently
dense and such that all simplices in A have sufficient quality. We prove that
if, locally, interiors of the projection of the simplices onto the tangent space
do not intersect, then A is a triangulation of the manifold, that is, they are
homeomorphic.'
acknowledgement: "Open access funding provided by the Institute of Science and Technology
(IST Austria). Arijit Ghosh is supported by the Ramanujan Fellowship (No. SB/S2/RJN-064/2015),
India.\r\nThis work has been funded by the European Research Council under the European
Union’s ERC Grant Agreement number 339025 GUDHI (Algorithmic Foundations of Geometric
Understanding in Higher Dimensions). The third author is supported by Ramanujan
Fellowship (No. SB/S2/RJN-064/2015), India. The fifth author also received funding
from the European Union’s Horizon 2020 research and innovation programme under the
Marie Skłodowska-Curie Grant Agreement No. 754411."
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Jean-Daniel
full_name: Boissonnat, Jean-Daniel
last_name: Boissonnat
- first_name: Ramsay
full_name: Dyer, Ramsay
last_name: Dyer
- first_name: Arijit
full_name: Ghosh, Arijit
last_name: Ghosh
- first_name: Andre
full_name: Lieutier, Andre
last_name: Lieutier
- first_name: Mathijs
full_name: Wintraecken, Mathijs
id: 307CFBC8-F248-11E8-B48F-1D18A9856A87
last_name: Wintraecken
orcid: 0000-0002-7472-2220
citation:
ama: Boissonnat J-D, Dyer R, Ghosh A, Lieutier A, Wintraecken M. Local conditions
for triangulating submanifolds of Euclidean space. Discrete and Computational
Geometry. 2021;66:666-686. doi:10.1007/s00454-020-00233-9
apa: Boissonnat, J.-D., Dyer, R., Ghosh, A., Lieutier, A., & Wintraecken, M.
(2021). Local conditions for triangulating submanifolds of Euclidean space. Discrete
and Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-020-00233-9
chicago: Boissonnat, Jean-Daniel, Ramsay Dyer, Arijit Ghosh, Andre Lieutier, and
Mathijs Wintraecken. “Local Conditions for Triangulating Submanifolds of Euclidean
Space.” Discrete and Computational Geometry. Springer Nature, 2021. https://doi.org/10.1007/s00454-020-00233-9.
ieee: J.-D. Boissonnat, R. Dyer, A. Ghosh, A. Lieutier, and M. Wintraecken, “Local
conditions for triangulating submanifolds of Euclidean space,” Discrete and
Computational Geometry, vol. 66. Springer Nature, pp. 666–686, 2021.
ista: Boissonnat J-D, Dyer R, Ghosh A, Lieutier A, Wintraecken M. 2021. Local conditions
for triangulating submanifolds of Euclidean space. Discrete and Computational
Geometry. 66, 666–686.
mla: Boissonnat, Jean-Daniel, et al. “Local Conditions for Triangulating Submanifolds
of Euclidean Space.” Discrete and Computational Geometry, vol. 66, Springer
Nature, 2021, pp. 666–86, doi:10.1007/s00454-020-00233-9.
short: J.-D. Boissonnat, R. Dyer, A. Ghosh, A. Lieutier, M. Wintraecken, Discrete
and Computational Geometry 66 (2021) 666–686.
date_created: 2020-08-11T07:11:51Z
date_published: 2021-09-01T00:00:00Z
date_updated: 2024-03-07T14:54:59Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1007/s00454-020-00233-9
ec_funded: 1
external_id:
isi:
- '000558119300001'
has_accepted_license: '1'
intvolume: ' 66'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1007/s00454-020-00233-9
month: '09'
oa: 1
oa_version: Published Version
page: 666-686
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Discrete and Computational Geometry
publication_identifier:
eissn:
- 1432-0444
issn:
- 0179-5376
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Local conditions for triangulating submanifolds of Euclidean space
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 66
year: '2021'
...
---
_id: '8253'
abstract:
- lang: eng
text: Brains process information in spiking neural networks. Their intricate connections
shape the diverse functions these networks perform. In comparison, the functional
capabilities of models of spiking networks are still rudimentary. This shortcoming
is mainly due to the lack of insight and practical algorithms to construct the
necessary connectivity. Any such algorithm typically attempts to build networks
by iteratively reducing the error compared to a desired output. But assigning
credit to hidden units in multi-layered spiking networks has remained challenging
due to the non-differentiable nonlinearity of spikes. To avoid this issue, one
can employ surrogate gradients to discover the required connectivity in spiking
network models. However, the choice of a surrogate is not unique, raising the
question of how its implementation influences the effectiveness of the method.
Here, we use numerical simulations to systematically study how essential design
parameters of surrogate gradients impact learning performance on a range of classification
problems. We show that surrogate gradient learning is robust to different shapes
of underlying surrogate derivatives, but the choice of the derivative’s scale
can substantially affect learning performance. When we combine surrogate gradients
with a suitable activity regularization technique, robust information processing
can be achieved in spiking networks even at the sparse activity limit. Our study
provides a systematic account of the remarkable robustness of surrogate gradient
learning and serves as a practical guide to model functional spiking neural networks.
acknowledgement: F.Z. was supported by the Wellcome Trust (110124/Z/15/Z) and the
Novartis Research Foundation. T.P.V. was supported by a Wellcome Trust Sir Henry
Dale Research fellowship (WT100000), a Wellcome Trust Senior Research Fellowship
(214316/Z/18/Z), and an ERC Consolidator Grant SYNAPSEEK.
article_processing_charge: No
article_type: original
author:
- first_name: Friedemann
full_name: Zenke, Friedemann
last_name: Zenke
orcid: 0000-0003-1883-644X
- first_name: Tim P
full_name: Vogels, Tim P
id: CB6FF8D2-008F-11EA-8E08-2637E6697425
last_name: Vogels
orcid: 0000-0003-3295-6181
citation:
ama: Zenke F, Vogels TP. The remarkable robustness of surrogate gradient learning
for instilling complex function in spiking neural networks. Neural Computation.
2021;33(4):899-925. doi:10.1162/neco_a_01367
apa: Zenke, F., & Vogels, T. P. (2021). The remarkable robustness of surrogate
gradient learning for instilling complex function in spiking neural networks.
Neural Computation. MIT Press. https://doi.org/10.1162/neco_a_01367
chicago: Zenke, Friedemann, and Tim P Vogels. “The Remarkable Robustness of Surrogate
Gradient Learning for Instilling Complex Function in Spiking Neural Networks.”
Neural Computation. MIT Press, 2021. https://doi.org/10.1162/neco_a_01367.
ieee: F. Zenke and T. P. Vogels, “The remarkable robustness of surrogate gradient
learning for instilling complex function in spiking neural networks,” Neural
Computation, vol. 33, no. 4. MIT Press, pp. 899–925, 2021.
ista: Zenke F, Vogels TP. 2021. The remarkable robustness of surrogate gradient
learning for instilling complex function in spiking neural networks. Neural Computation.
33(4), 899–925.
mla: Zenke, Friedemann, and Tim P. Vogels. “The Remarkable Robustness of Surrogate
Gradient Learning for Instilling Complex Function in Spiking Neural Networks.”
Neural Computation, vol. 33, no. 4, MIT Press, 2021, pp. 899–925, doi:10.1162/neco_a_01367.
short: F. Zenke, T.P. Vogels, Neural Computation 33 (2021) 899–925.
date_created: 2020-08-12T12:08:24Z
date_published: 2021-03-01T00:00:00Z
date_updated: 2023-08-04T10:53:14Z
day: '01'
ddc:
- '000'
- '570'
department:
- _id: TiVo
doi: 10.1162/neco_a_01367
ec_funded: 1
external_id:
isi:
- '000663433900003'
pmid:
- '33513328'
file:
- access_level: open_access
checksum: eac5a51c24c8989ae7cf9ae32ec3bc95
content_type: application/pdf
creator: dernst
date_created: 2022-04-08T06:05:39Z
date_updated: 2022-04-08T06:05:39Z
file_id: '11131'
file_name: 2021_NeuralComputation_Zenke.pdf
file_size: 1611614
relation: main_file
success: 1
file_date_updated: 2022-04-08T06:05:39Z
has_accepted_license: '1'
intvolume: ' 33'
isi: 1
issue: '4'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: 899-925
pmid: 1
project:
- _id: 0aacfa84-070f-11eb-9043-d7eb2c709234
call_identifier: H2020
grant_number: '819603'
name: Learning the shape of synaptic plasticity rules for neuronal architectures
and function through machine learning.
- _id: c084a126-5a5b-11eb-8a69-d75314a70a87
grant_number: 214316/Z/18/Z
name: What’s in a memory? Spatiotemporal dynamics in strongly coupled recurrent
neuronal networks.
publication: Neural Computation
publication_identifier:
eissn:
- 1530-888X
issn:
- 0899-7667
publication_status: published
publisher: MIT Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: The remarkable robustness of surrogate gradient learning for instilling complex
function in spiking neural networks
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 33
year: '2021'
...
---
_id: '8286'
abstract:
- lang: eng
text: "We consider the following dynamic load-balancing process: given an underlying
graph G with n nodes, in each step t≥ 0, one unit of load is created, and placed
at a randomly chosen graph node. In the same step, the chosen node picks a random
neighbor, and the two nodes balance their loads by averaging them. We are interested
in the expected gap between the minimum and maximum loads at nodes as the process
progresses, and its dependence on n and on the graph structure. Variants of the
above graphical balanced allocation process have been studied previously by Peres,
Talwar, and Wieder [Peres et al., 2015], and by Sauerwald and Sun [Sauerwald and
Sun, 2015]. These authors left as open the question of characterizing the gap
in the case of cycle graphs in the dynamic case, where weights are created during
the algorithm’s execution. For this case, the only known upper bound is of \U0001D4AA(n
log n), following from a majorization argument due to [Peres et al., 2015], which
analyzes a related graphical allocation process. In this paper, we provide an
upper bound of \U0001D4AA (√n log n) on the expected gap of the above process
for cycles of length n. We introduce a new potential analysis technique, which
enables us to bound the difference in load between k-hop neighbors on the cycle,
for any k ≤ n/2. We complement this with a \"gap covering\" argument, which bounds
the maximum value of the gap by bounding its value across all possible subsets
of a certain structure, and recursively bounding the gaps within each subset.
We provide analytical and experimental evidence that our upper bound on the gap
is tight up to a logarithmic factor. "
acknowledgement: The authors sincerely thank Thomas Sauerwald and George Giakkoupis
for insightful discussions, and Mohsen Ghaffari, Yuval Peres, and Udi Wieder for
feedback on earlier versions of this draft. We also thank the ICALP anonymous reviewers
for their very useful comments. Open access funding provided by Institute of Science
and Technology (IST Austria). Funding was provided by European Research Council
(Grant No. PR1042ERC01).
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Giorgi
full_name: Nadiradze, Giorgi
id: 3279A00C-F248-11E8-B48F-1D18A9856A87
last_name: Nadiradze
orcid: 0000-0001-5634-0731
- first_name: Amirmojtaba
full_name: Sabour, Amirmojtaba
id: bcc145fd-e77f-11ea-ae8b-80d661dbff67
last_name: Sabour
citation:
ama: Alistarh D-A, Nadiradze G, Sabour A. Dynamic averaging load balancing on cycles.
Algorithmica. 2021. doi:10.1007/s00453-021-00905-9
apa: 'Alistarh, D.-A., Nadiradze, G., & Sabour, A. (2021). Dynamic averaging
load balancing on cycles. Algorithmica. Virtual, Online; Germany: Springer
Nature. https://doi.org/10.1007/s00453-021-00905-9'
chicago: Alistarh, Dan-Adrian, Giorgi Nadiradze, and Amirmojtaba Sabour. “Dynamic
Averaging Load Balancing on Cycles.” Algorithmica. Springer Nature, 2021.
https://doi.org/10.1007/s00453-021-00905-9.
ieee: D.-A. Alistarh, G. Nadiradze, and A. Sabour, “Dynamic averaging load balancing
on cycles,” Algorithmica. Springer Nature, 2021.
ista: Alistarh D-A, Nadiradze G, Sabour A. 2021. Dynamic averaging load balancing
on cycles. Algorithmica.
mla: Alistarh, Dan-Adrian, et al. “Dynamic Averaging Load Balancing on Cycles.”
Algorithmica, Springer Nature, 2021, doi:10.1007/s00453-021-00905-9.
short: D.-A. Alistarh, G. Nadiradze, A. Sabour, Algorithmica (2021).
conference:
end_date: 2020-07-11
location: Virtual, Online; Germany
name: 'ICALP: International Colloquium on Automata, Languages, and Programming '
start_date: 2020-07-08
date_created: 2020-08-24T06:24:04Z
date_published: 2021-12-24T00:00:00Z
date_updated: 2024-03-05T07:35:53Z
day: '24'
ddc:
- '000'
department:
- _id: DaAl
doi: 10.1007/s00453-021-00905-9
ec_funded: 1
external_id:
arxiv:
- '2003.09297'
isi:
- '000734004600001'
file:
- access_level: open_access
checksum: 21169b25b0c8e17b21e12af22bff9870
content_type: application/pdf
creator: cchlebak
date_created: 2021-12-27T10:36:40Z
date_updated: 2021-12-27T10:36:40Z
file_id: '10577'
file_name: 2021_Algorithmica_Alistarh.pdf
file_size: 525950
relation: main_file
success: 1
file_date_updated: 2021-12-27T10:36:40Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Algorithmica
publication_identifier:
eissn:
- 1432-0541
issn:
- 0178-4617
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- relation: earlier_version
url: https://doi.org/10.4230/LIPIcs.ICALP.2020.7
record:
- id: '15077'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Dynamic averaging load balancing on cycles
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2021'
...
---
_id: '8317'
abstract:
- lang: eng
text: When can a polyomino piece of paper be folded into a unit cube? Prior work
studied tree-like polyominoes, but polyominoes with holes remain an intriguing
open problem. We present sufficient conditions for a polyomino with one or several
holes to fold into a cube, and conditions under which cube folding is impossible.
In particular, we show that all but five special “basic” holes guarantee foldability.
acknowledgement: This research was performed in part at the 33rd Bellairs Winter Workshop
on Computational Geometry. We thank all other participants for a fruitful atmosphere.
H. Akitaya was supported by NSF CCF-1422311 & 1423615. Z. Masárová was partially
funded by Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31.
article_number: '101700'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Oswin
full_name: Aichholzer, Oswin
last_name: Aichholzer
- first_name: Hugo A.
full_name: Akitaya, Hugo A.
last_name: Akitaya
- first_name: Kenneth C.
full_name: Cheung, Kenneth C.
last_name: Cheung
- first_name: Erik D.
full_name: Demaine, Erik D.
last_name: Demaine
- first_name: Martin L.
full_name: Demaine, Martin L.
last_name: Demaine
- first_name: Sándor P.
full_name: Fekete, Sándor P.
last_name: Fekete
- first_name: Linda
full_name: Kleist, Linda
last_name: Kleist
- first_name: Irina
full_name: Kostitsyna, Irina
last_name: Kostitsyna
- first_name: Maarten
full_name: Löffler, Maarten
last_name: Löffler
- first_name: Zuzana
full_name: Masárová, Zuzana
id: 45CFE238-F248-11E8-B48F-1D18A9856A87
last_name: Masárová
orcid: 0000-0002-6660-1322
- first_name: Klara
full_name: Mundilova, Klara
last_name: Mundilova
- first_name: Christiane
full_name: Schmidt, Christiane
last_name: Schmidt
citation:
ama: 'Aichholzer O, Akitaya HA, Cheung KC, et al. Folding polyominoes with holes
into a cube. Computational Geometry: Theory and Applications. 2021;93.
doi:10.1016/j.comgeo.2020.101700'
apa: 'Aichholzer, O., Akitaya, H. A., Cheung, K. C., Demaine, E. D., Demaine, M.
L., Fekete, S. P., … Schmidt, C. (2021). Folding polyominoes with holes into a
cube. Computational Geometry: Theory and Applications. Elsevier. https://doi.org/10.1016/j.comgeo.2020.101700'
chicago: 'Aichholzer, Oswin, Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine,
Martin L. Demaine, Sándor P. Fekete, Linda Kleist, et al. “Folding Polyominoes
with Holes into a Cube.” Computational Geometry: Theory and Applications.
Elsevier, 2021. https://doi.org/10.1016/j.comgeo.2020.101700.'
ieee: 'O. Aichholzer et al., “Folding polyominoes with holes into a cube,”
Computational Geometry: Theory and Applications, vol. 93. Elsevier, 2021.'
ista: 'Aichholzer O, Akitaya HA, Cheung KC, Demaine ED, Demaine ML, Fekete SP, Kleist
L, Kostitsyna I, Löffler M, Masárová Z, Mundilova K, Schmidt C. 2021. Folding
polyominoes with holes into a cube. Computational Geometry: Theory and Applications.
93, 101700.'
mla: 'Aichholzer, Oswin, et al. “Folding Polyominoes with Holes into a Cube.” Computational
Geometry: Theory and Applications, vol. 93, 101700, Elsevier, 2021, doi:10.1016/j.comgeo.2020.101700.'
short: 'O. Aichholzer, H.A. Akitaya, K.C. Cheung, E.D. Demaine, M.L. Demaine, S.P.
Fekete, L. Kleist, I. Kostitsyna, M. Löffler, Z. Masárová, K. Mundilova, C. Schmidt,
Computational Geometry: Theory and Applications 93 (2021).'
date_created: 2020-08-30T22:01:09Z
date_published: 2021-02-01T00:00:00Z
date_updated: 2023-08-04T10:57:42Z
day: '01'
department:
- _id: HeEd
doi: 10.1016/j.comgeo.2020.101700
external_id:
arxiv:
- '1910.09917'
isi:
- '000579185100004'
intvolume: ' 93'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1910.09917v3
month: '02'
oa: 1
oa_version: Preprint
project:
- _id: 268116B8-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00342
name: The Wittgenstein Prize
publication: 'Computational Geometry: Theory and Applications'
publication_identifier:
issn:
- '09257721'
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
record:
- id: '6989'
relation: shorter_version
status: public
scopus_import: '1'
status: public
title: Folding polyominoes with holes into a cube
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 93
year: '2021'
...
---
_id: '8338'
abstract:
- lang: eng
text: Canonical parametrisations of classical confocal coordinate systems are introduced
and exploited to construct non-planar analogues of incircular (IC) nets on individual
quadrics and systems of confocal quadrics. Intimate connections with classical
deformations of quadrics that are isometric along asymptotic lines and circular
cross-sections of quadrics are revealed. The existence of octahedral webs of surfaces
of Blaschke type generated by asymptotic and characteristic lines that are diagonally
related to lines of curvature is proved theoretically and established constructively.
Appropriate samplings (grids) of these webs lead to three-dimensional extensions
of non-planar IC nets. Three-dimensional octahedral grids composed of planes and
spatially extending (checkerboard) IC-nets are shown to arise in connection with
systems of confocal quadrics in Minkowski space. In this context, the Laguerre
geometric notion of conical octahedral grids of planes is introduced. The latter
generalise the octahedral grids derived from systems of confocal quadrics in Minkowski
space. An explicit construction of conical octahedral grids is presented. The
results are accompanied by various illustrations which are based on the explicit
formulae provided by the theory.
acknowledgement: This research was supported by the DFG Collaborative Research Center
TRR 109 “Discretization in Geometry and Dynamics”. W.K.S. was also supported by
the Australian Research Council (DP1401000851). A.V.A. was also supported by the
European Research Council (ERC) under the European Union’s Horizon 2020 research
and innovation programme (Grant Agreement No. 78818 Alpha).
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
- first_name: Alexander I.
full_name: Bobenko, Alexander I.
last_name: Bobenko
- first_name: Wolfgang K.
full_name: Schief, Wolfgang K.
last_name: Schief
- first_name: Jan
full_name: Techter, Jan
last_name: Techter
citation:
ama: Akopyan A, Bobenko AI, Schief WK, Techter J. On mutually diagonal nets on (confocal)
quadrics and 3-dimensional webs. Discrete and Computational Geometry. 2021;66:938-976.
doi:10.1007/s00454-020-00240-w
apa: Akopyan, A., Bobenko, A. I., Schief, W. K., & Techter, J. (2021). On mutually
diagonal nets on (confocal) quadrics and 3-dimensional webs. Discrete and Computational
Geometry. Springer Nature. https://doi.org/10.1007/s00454-020-00240-w
chicago: Akopyan, Arseniy, Alexander I. Bobenko, Wolfgang K. Schief, and Jan Techter.
“On Mutually Diagonal Nets on (Confocal) Quadrics and 3-Dimensional Webs.” Discrete
and Computational Geometry. Springer Nature, 2021. https://doi.org/10.1007/s00454-020-00240-w.
ieee: A. Akopyan, A. I. Bobenko, W. K. Schief, and J. Techter, “On mutually diagonal
nets on (confocal) quadrics and 3-dimensional webs,” Discrete and Computational
Geometry, vol. 66. Springer Nature, pp. 938–976, 2021.
ista: Akopyan A, Bobenko AI, Schief WK, Techter J. 2021. On mutually diagonal nets
on (confocal) quadrics and 3-dimensional webs. Discrete and Computational Geometry.
66, 938–976.
mla: Akopyan, Arseniy, et al. “On Mutually Diagonal Nets on (Confocal) Quadrics
and 3-Dimensional Webs.” Discrete and Computational Geometry, vol. 66,
Springer Nature, 2021, pp. 938–76, doi:10.1007/s00454-020-00240-w.
short: A. Akopyan, A.I. Bobenko, W.K. Schief, J. Techter, Discrete and Computational
Geometry 66 (2021) 938–976.
date_created: 2020-09-06T22:01:13Z
date_published: 2021-10-01T00:00:00Z
date_updated: 2024-03-07T14:51:11Z
day: '01'
department:
- _id: HeEd
doi: 10.1007/s00454-020-00240-w
ec_funded: 1
external_id:
arxiv:
- '1908.00856'
isi:
- '000564488500002'
intvolume: ' 66'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1908.00856
month: '10'
oa: 1
oa_version: Preprint
page: 938-976
project:
- _id: 266A2E9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '788183'
name: Alpha Shape Theory Extended
publication: Discrete and Computational Geometry
publication_identifier:
eissn:
- 1432-0444
issn:
- 0179-5376
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 66
year: '2021'
...