---
_id: '11440'
abstract:
- lang: eng
text: To compute the persistent homology of a grayscale digital image one needs
to build a simplicial or cubical complex from it. For cubical complexes, the two
commonly used constructions (corresponding to direct and indirect digital adjacencies)
can give different results for the same image. The two constructions are almost
dual to each other, and we use this relationship to extend and modify the cubical
complexes to become dual filtered cell complexes. We derive a general relationship
between the persistent homology of two dual filtered cell complexes, and also
establish how various modifications to a filtered complex change the persistence
diagram. Applying these results to images, we derive a method to transform the
persistence diagram computed using one type of cubical complex into a persistence
diagram for the other construction. This means software for computing persistent
homology from images can now be easily adapted to produce results for either of
the two cubical complex constructions without additional low-level code implementation.
acknowledgement: This project started during the Women in Computational Topology workshop
held in Canberra in July of 2019. All authors are very grateful for its organisation
and the financial support for the workshop from the Mathematical Sciences Institute
at ANU, the US National Science Foundation through the award CCF-1841455, the Australian
Mathematical Sciences Institute and the Association for Women in Mathematics. AG
is supported by the Swiss National Science Foundation grant CRSII5_177237. TH is
supported by the European Research Council (ERC) Horizon 2020 project “Alpha Shape
Theory Extended” No. 788183. KM is supported by the ERC Horizon 2020 research and
innovation programme under the Marie Sklodowska-Curie grant agreement No. 859860.
VR was supported by Australian Research Council Future Fellowship FT140100604 during
the early stages of this project.
alternative_title:
- Association for Women in Mathematics Series
article_processing_charge: No
arxiv: 1
author:
- first_name: Bea
full_name: Bleile, Bea
last_name: Bleile
- first_name: Adélie
full_name: Garin, Adélie
last_name: Garin
- first_name: Teresa
full_name: Heiss, Teresa
id: 4879BB4E-F248-11E8-B48F-1D18A9856A87
last_name: Heiss
orcid: 0000-0002-1780-2689
- first_name: Kelly
full_name: Maggs, Kelly
last_name: Maggs
- first_name: Vanessa
full_name: Robins, Vanessa
last_name: Robins
citation:
ama: 'Bleile B, Garin A, Heiss T, Maggs K, Robins V. The persistent homology of
dual digital image constructions. In: Gasparovic E, Robins V, Turner K, eds. Research
in Computational Topology 2. Vol 30. 1st ed. AWMS. Cham: Springer Nature;
2022:1-26. doi:10.1007/978-3-030-95519-9_1'
apa: 'Bleile, B., Garin, A., Heiss, T., Maggs, K., & Robins, V. (2022). The
persistent homology of dual digital image constructions. In E. Gasparovic, V.
Robins, & K. Turner (Eds.), Research in Computational Topology 2 (1st
ed., Vol. 30, pp. 1–26). Cham: Springer Nature. https://doi.org/10.1007/978-3-030-95519-9_1'
chicago: 'Bleile, Bea, Adélie Garin, Teresa Heiss, Kelly Maggs, and Vanessa Robins.
“The Persistent Homology of Dual Digital Image Constructions.” In Research
in Computational Topology 2, edited by Ellen Gasparovic, Vanessa Robins, and
Katharine Turner, 1st ed., 30:1–26. AWMS. Cham: Springer Nature, 2022. https://doi.org/10.1007/978-3-030-95519-9_1.'
ieee: 'B. Bleile, A. Garin, T. Heiss, K. Maggs, and V. Robins, “The persistent homology
of dual digital image constructions,” in Research in Computational Topology
2, 1st ed., vol. 30, E. Gasparovic, V. Robins, and K. Turner, Eds. Cham: Springer
Nature, 2022, pp. 1–26.'
ista: 'Bleile B, Garin A, Heiss T, Maggs K, Robins V. 2022.The persistent homology
of dual digital image constructions. In: Research in Computational Topology 2.
Association for Women in Mathematics Series, vol. 30, 1–26.'
mla: Bleile, Bea, et al. “The Persistent Homology of Dual Digital Image Constructions.”
Research in Computational Topology 2, edited by Ellen Gasparovic et al.,
1st ed., vol. 30, Springer Nature, 2022, pp. 1–26, doi:10.1007/978-3-030-95519-9_1.
short: B. Bleile, A. Garin, T. Heiss, K. Maggs, V. Robins, in:, E. Gasparovic, V.
Robins, K. Turner (Eds.), Research in Computational Topology 2, 1st ed., Springer
Nature, Cham, 2022, pp. 1–26.
date_created: 2022-06-07T08:21:11Z
date_published: 2022-01-27T00:00:00Z
date_updated: 2026-04-07T12:54:09Z
day: '27'
department:
- _id: HeEd
doi: 10.1007/978-3-030-95519-9_1
ec_funded: 1
edition: '1'
editor:
- first_name: Ellen
full_name: Gasparovic, Ellen
last_name: Gasparovic
- first_name: Vanessa
full_name: Robins, Vanessa
last_name: Robins
- first_name: Katharine
full_name: Turner, Katharine
last_name: Turner
external_id:
arxiv:
- '2102.11397'
intvolume: ' 30'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.2102.11397'
month: '01'
oa: 1
oa_version: Preprint
page: 1-26
place: Cham
project:
- _id: 266A2E9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '788183'
name: Alpha Shape Theory Extended
publication: Research in Computational Topology 2
publication_identifier:
eisbn:
- '9783030955199'
isbn:
- '9783030955182'
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '18667'
relation: dissertation_contains
status: public
scopus_import: '1'
series_title: AWMS
status: public
title: The persistent homology of dual digital image constructions
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 30
year: '2022'
...
---
_id: '11545'
abstract:
- lang: eng
text: "We classify contravariant pairings between standard Whittaker modules and
Verma modules over a complex semisimple Lie algebra. These contravariant pairings
are useful in extending several classical techniques for category O to the Miličić–Soergel
category N . We introduce a class of costandard modules which generalize dual
Verma modules, and describe canonical maps from standard to costandard modules
in terms of contravariant pairings.\r\nWe show that costandard modules have unique
irreducible submodules and share the same composition factors as the corresponding
standard Whittaker modules. We show that costandard modules give an algebraic
characterization of the global sections of costandard twisted Harish-Chandra sheaves
on the associated flag variety, which are defined using holonomic duality of D-modules.
We prove that with these costandard modules, blocks of category\r\nN have the
structure of highest weight categories and we establish a BGG reciprocity theorem
for N ."
acknowledgement: We thank Catharina Stroppel and Jens Niklas Eberhardt for interesting
discussions. The first author acknowledges the support of the European Union's Horizon
2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement
No. 754411. The second author is supported by the National Science Foundation Award
No. 1803059 and the Australian Research Council grant DP170101579.
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Adam
full_name: Brown, Adam
id: 70B7FDF6-608D-11E9-9333-8535E6697425
last_name: Brown
- first_name: Anna
full_name: Romanov, Anna
last_name: Romanov
citation:
ama: Brown A, Romanov A. Contravariant pairings between standard Whittaker modules
and Verma modules. Journal of Algebra. 2022;609(11):145-179. doi:10.1016/j.jalgebra.2022.06.017
apa: Brown, A., & Romanov, A. (2022). Contravariant pairings between standard
Whittaker modules and Verma modules. Journal of Algebra. Elsevier. https://doi.org/10.1016/j.jalgebra.2022.06.017
chicago: Brown, Adam, and Anna Romanov. “Contravariant Pairings between Standard
Whittaker Modules and Verma Modules.” Journal of Algebra. Elsevier, 2022.
https://doi.org/10.1016/j.jalgebra.2022.06.017.
ieee: A. Brown and A. Romanov, “Contravariant pairings between standard Whittaker
modules and Verma modules,” Journal of Algebra, vol. 609, no. 11. Elsevier,
pp. 145–179, 2022.
ista: Brown A, Romanov A. 2022. Contravariant pairings between standard Whittaker
modules and Verma modules. Journal of Algebra. 609(11), 145–179.
mla: Brown, Adam, and Anna Romanov. “Contravariant Pairings between Standard Whittaker
Modules and Verma Modules.” Journal of Algebra, vol. 609, no. 11, Elsevier,
2022, pp. 145–79, doi:10.1016/j.jalgebra.2022.06.017.
short: A. Brown, A. Romanov, Journal of Algebra 609 (2022) 145–179.
corr_author: '1'
date_created: 2022-07-08T11:40:07Z
date_published: 2022-11-01T00:00:00Z
date_updated: 2025-04-14T07:43:58Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1016/j.jalgebra.2022.06.017
ec_funded: 1
external_id:
isi:
- '000861841100004'
file:
- access_level: open_access
checksum: 82abaee3d7837f703e499a9ecbb25b7c
content_type: application/pdf
creator: dernst
date_created: 2023-02-02T07:32:48Z
date_updated: 2023-02-02T07:32:48Z
file_id: '12473'
file_name: 2022_JournalAlgebra_Brown.pdf
file_size: 582962
relation: main_file
success: 1
file_date_updated: 2023-02-02T07:32:48Z
has_accepted_license: '1'
intvolume: ' 609'
isi: 1
issue: '11'
keyword:
- Algebra and Number Theory
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 145-179
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Journal of Algebra
publication_identifier:
issn:
- 0021-8693
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Contravariant pairings between standard Whittaker modules and Verma modules
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: 609
year: '2022'
...
---
_id: '11658'
abstract:
- lang: eng
text: The depth of a cell in an arrangement of n (non-vertical) great-spheres in
Sd is the number of great-spheres that pass above the cell. We prove Euler-type
relations, which imply extensions of the classic Dehn–Sommerville relations for
convex polytopes to sublevel sets of the depth function, and we use the relations
to extend the expressions for the number of faces of neighborly polytopes to the
number of cells of levels in neighborly arrangements.
acknowledgement: This project has received funding from the European Research Council
(ERC) under the European Union’s Horizon 2020 research and innovation programme,
grant no. 788183, from the Wittgenstein Prize, Austrian Science Fund (FWF), grant
no. Z 342-N31, and from the DFG Collaborative Research Center TRR 109, ‘Discretization
in Geometry and Dynamics’, Austrian Science Fund (FWF), grant no. I 02979-N35.
article_processing_charge: No
author:
- first_name: Ranita
full_name: Biswas, Ranita
id: 3C2B033E-F248-11E8-B48F-1D18A9856A87
last_name: Biswas
orcid: 0000-0002-5372-7890
- first_name: Sebastiano
full_name: Cultrera di Montesano, Sebastiano
id: 34D2A09C-F248-11E8-B48F-1D18A9856A87
last_name: Cultrera di Montesano
orcid: 0000-0001-6249-0832
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Morteza
full_name: Saghafian, Morteza
id: f86f7148-b140-11ec-9577-95435b8df824
last_name: Saghafian
citation:
ama: 'Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. Depth in arrangements:
Dehn–Sommerville–Euler relations with applications. Leibniz International Proceedings
on Mathematics.'
apa: 'Biswas, R., Cultrera di Montesano, S., Edelsbrunner, H., & Saghafian,
M. (n.d.). Depth in arrangements: Dehn–Sommerville–Euler relations with applications.
Leibniz International Proceedings on Mathematics. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik.'
chicago: 'Biswas, Ranita, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner,
and Morteza Saghafian. “Depth in Arrangements: Dehn–Sommerville–Euler Relations
with Applications.” Leibniz International Proceedings on Mathematics. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, n.d.'
ieee: 'R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, and M. Saghafian, “Depth
in arrangements: Dehn–Sommerville–Euler relations with applications,” Leibniz
International Proceedings on Mathematics. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik.'
ista: 'Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. Depth in
arrangements: Dehn–Sommerville–Euler relations with applications. Leibniz International
Proceedings on Mathematics.'
mla: 'Biswas, Ranita, et al. “Depth in Arrangements: Dehn–Sommerville–Euler Relations
with Applications.” Leibniz International Proceedings on Mathematics, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik.'
short: R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, M. Saghafian, Leibniz
International Proceedings on Mathematics (n.d.).
corr_author: '1'
date_created: 2022-07-27T09:27:34Z
date_published: 2022-07-27T00:00:00Z
date_updated: 2026-04-07T12:58:48Z
day: '27'
ddc:
- '510'
department:
- _id: GradSch
- _id: HeEd
ec_funded: 1
file:
- access_level: open_access
checksum: b2f511e8b1cae5f1892b0cdec341acac
content_type: application/pdf
creator: scultrer
date_created: 2022-07-27T09:25:53Z
date_updated: 2022-07-27T09:25:53Z
file_id: '11659'
file_name: D-S-E.pdf
file_size: 639266
relation: main_file
file_date_updated: 2022-07-27T09:25:53Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
project:
- _id: 266A2E9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '788183'
name: Alpha Shape Theory Extended
- _id: 268116B8-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00342
name: Mathematics, Computer Science
- _id: 2561EBF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I02979-N35
name: Persistence and stability of geometric complexes
publication: Leibniz International Proceedings on Mathematics
publication_status: draft
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
record:
- id: '15380'
relation: later_version
status: public
- id: '15094'
relation: dissertation_contains
status: public
status: public
title: 'Depth in arrangements: Dehn–Sommerville–Euler relations with applications'
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '11938'
abstract:
- lang: eng
text: A matching is compatible to two or more labeled point sets of size n with
labels {1, . . . , n} if its straight-line drawing on each of these point sets
is crossing-free. We study the maximum number of edges in a matching compatible
to two or more labeled point sets in general position in the plane. We show that
for any two labeled sets of n points in convex position there exists a compatible
matching with ⌊√2n + 1 − 1⌋ edges. More generally, for any ℓ labeled point sets
we construct compatible matchings of size Ω(n1/ℓ). As a corresponding upper bound,
we use probabilistic arguments to show that for any ℓ given sets of n points there
exists a labeling of each set such that the largest compatible matching has O(n2/(ℓ+1))
edges. Finally, we show that Θ(log n) copies of any set of n points are necessary
and sufficient for the existence of labelings of these point sets such that any
compatible matching consists only of a single edge.
acknowledgement: 'A.A. funded by the Marie Sklodowska-Curie grant agreement No 754411.
Z.M. partially funded by Wittgenstein Prize, Austrian Science Fund (FWF), grant
no. Z 342-N31. I.P., D.P., and B.V. partially supported by FWF within the collaborative
DACH project Arrangements and Drawings as FWF project I 3340-N35. A.P. supported
by a Schrödinger fellowship of the FWF: J-3847-N35. J.T. partially supported by
ERC Start grant no. (279307: Graph Games), FWF grant no. P23499-N23 and S11407-N23
(RiSE).'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Oswin
full_name: Aichholzer, Oswin
last_name: Aichholzer
- first_name: Alan M
full_name: Arroyo Guevara, Alan M
id: 3207FDC6-F248-11E8-B48F-1D18A9856A87
last_name: Arroyo Guevara
orcid: 0000-0003-2401-8670
- 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: Irene
full_name: Parada, Irene
last_name: Parada
- first_name: Daniel
full_name: Perz, Daniel
last_name: Perz
- first_name: Alexander
full_name: Pilz, Alexander
last_name: Pilz
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- first_name: Birgit
full_name: Vogtenhuber, Birgit
last_name: Vogtenhuber
citation:
ama: Aichholzer O, Arroyo Guevara AM, Masárová Z, et al. On compatible matchings.
Journal of Graph Algorithms and Applications. 2022;26(2):225-240. doi:10.7155/jgaa.00591
apa: Aichholzer, O., Arroyo Guevara, A. M., Masárová, Z., Parada, I., Perz, D.,
Pilz, A., … Vogtenhuber, B. (2022). On compatible matchings. Journal of Graph
Algorithms and Applications. Brown University. https://doi.org/10.7155/jgaa.00591
chicago: Aichholzer, Oswin, Alan M Arroyo Guevara, Zuzana Masárová, Irene Parada,
Daniel Perz, Alexander Pilz, Josef Tkadlec, and Birgit Vogtenhuber. “On Compatible
Matchings.” Journal of Graph Algorithms and Applications. Brown University,
2022. https://doi.org/10.7155/jgaa.00591.
ieee: O. Aichholzer et al., “On compatible matchings,” Journal of Graph
Algorithms and Applications, vol. 26, no. 2. Brown University, pp. 225–240,
2022.
ista: Aichholzer O, Arroyo Guevara AM, Masárová Z, Parada I, Perz D, Pilz A, Tkadlec
J, Vogtenhuber B. 2022. On compatible matchings. Journal of Graph Algorithms and
Applications. 26(2), 225–240.
mla: Aichholzer, Oswin, et al. “On Compatible Matchings.” Journal of Graph Algorithms
and Applications, vol. 26, no. 2, Brown University, 2022, pp. 225–40, doi:10.7155/jgaa.00591.
short: O. Aichholzer, A.M. Arroyo Guevara, Z. Masárová, I. Parada, D. Perz, A. Pilz,
J. Tkadlec, B. Vogtenhuber, Journal of Graph Algorithms and Applications 26 (2022)
225–240.
corr_author: '1'
date_created: 2022-08-21T22:01:56Z
date_published: 2022-06-01T00:00:00Z
date_updated: 2026-04-16T09:18:20Z
day: '01'
ddc:
- '000'
department:
- _id: UlWa
- _id: HeEd
- _id: KrCh
doi: 10.7155/jgaa.00591
ec_funded: 1
external_id:
arxiv:
- '2101.03928'
file:
- access_level: open_access
checksum: dc6e255e3558faff924fd9e370886c11
content_type: application/pdf
creator: dernst
date_created: 2022-08-22T06:42:42Z
date_updated: 2022-08-22T06:42:42Z
file_id: '11940'
file_name: 2022_JourGraphAlgorithmsApplic_Aichholzer.pdf
file_size: 694538
relation: main_file
success: 1
file_date_updated: 2022-08-22T06:42:42Z
has_accepted_license: '1'
intvolume: ' 26'
issue: '2'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 225-240
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: 268116B8-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00342
name: Mathematics, Computer Science
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
publication: Journal of Graph Algorithms and Applications
publication_identifier:
issn:
- 1526-1719
publication_status: published
publisher: Brown University
quality_controlled: '1'
related_material:
record:
- id: '9296'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: On compatible matchings
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 26
year: '2022'
...
---
_id: '12307'
abstract:
- lang: eng
text: Point-set topology is among the most abstract branches of mathematics in that
it lacks tangible notions of distance, length, magnitude, order, and size. There
is no shape, no geometry, no algebra, and no direction. Everything we are used
to visualizing is gone. In the teaching and learning of mathematics, this can
present a conundrum. Yet, this very property makes point set topology perfect
for teaching and learning abstract mathematical concepts. It clears our minds
of preconceived intuitions and expectations and forces us to think in new and
creative ways. In this paper, we present guided investigations into topology through
questions and thinking strategies that open up fascinating problems. They are
intended for faculty who already teach or are thinking about teaching a class
in topology or abstract mathematical reasoning for undergraduates. They can be
used to build simple to challenging projects in topology, proofs, honors programs,
and research experiences.
article_processing_charge: No
article_type: original
author:
- first_name: Barbara A.
full_name: Shipman, Barbara A.
last_name: Shipman
- first_name: Elizabeth R
full_name: Stephenson, Elizabeth R
id: 2D04F932-F248-11E8-B48F-1D18A9856A87
last_name: Stephenson
orcid: 0000-0002-6862-208X
citation:
ama: Shipman BA, Stephenson ER. Tangible topology through the lens of limits. PRIMUS.
2022;32(5):593-609. doi:10.1080/10511970.2021.1872750
apa: Shipman, B. A., & Stephenson, E. R. (2022). Tangible topology through the
lens of limits. PRIMUS. Taylor & Francis. https://doi.org/10.1080/10511970.2021.1872750
chicago: Shipman, Barbara A., and Elizabeth R Stephenson. “Tangible Topology through
the Lens of Limits.” PRIMUS. Taylor & Francis, 2022. https://doi.org/10.1080/10511970.2021.1872750.
ieee: B. A. Shipman and E. R. Stephenson, “Tangible topology through the lens of
limits,” PRIMUS, vol. 32, no. 5. Taylor & Francis, pp. 593–609, 2022.
ista: Shipman BA, Stephenson ER. 2022. Tangible topology through the lens of limits.
PRIMUS. 32(5), 593–609.
mla: Shipman, Barbara A., and Elizabeth R. Stephenson. “Tangible Topology through
the Lens of Limits.” PRIMUS, vol. 32, no. 5, Taylor & Francis, 2022,
pp. 593–609, doi:10.1080/10511970.2021.1872750.
short: B.A. Shipman, E.R. Stephenson, PRIMUS 32 (2022) 593–609.
corr_author: '1'
date_created: 2023-01-16T10:07:21Z
date_published: 2022-05-28T00:00:00Z
date_updated: 2024-10-09T21:03:58Z
day: '28'
department:
- _id: HeEd
- _id: GradSch
doi: 10.1080/10511970.2021.1872750
intvolume: ' 32'
issue: '5'
keyword:
- Education
- General Mathematics
language:
- iso: eng
month: '05'
oa_version: None
page: 593-609
publication: PRIMUS
publication_identifier:
eissn:
- 1935-4053
issn:
- 1051-1970
publication_status: published
publisher: Taylor & Francis
quality_controlled: '1'
scopus_import: '1'
status: public
title: Tangible topology through the lens of limits
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 32
year: '2022'
...
---
OA_place: repository
_id: '15090'
abstract:
- lang: eng
text: Given a locally finite set A⊆Rd and a coloring χ:A→{0,1,…,s}, we introduce
the chromatic Delaunay mosaic of χ, which is a Delaunay mosaic in Rs+d that represents
how points of different colors mingle. Our main results are bounds on the size
of the chromatic Delaunay mosaic, in which we assume that d and s are constants.
For example, if A is finite with n=#A, and the coloring is random, then the chromatic
Delaunay mosaic has O(n⌈d/2⌉) cells in expectation. In contrast, for Delone sets
and Poisson point processes in Rd, the expected number of cells within a closed
ball is only a constant times the number of points in this ball. Furthermore,
in R2 all colorings of a dense set of n points have chromatic Delaunay mosaics
of size O(n). This encourages the use of chromatic Delaunay mosaics in applications.
article_number: '2212.03121'
article_processing_charge: No
arxiv: 1
author:
- first_name: Ranita
full_name: Biswas, Ranita
id: 3C2B033E-F248-11E8-B48F-1D18A9856A87
last_name: Biswas
orcid: 0000-0002-5372-7890
- first_name: Sebastiano
full_name: Cultrera di Montesano, Sebastiano
id: 34D2A09C-F248-11E8-B48F-1D18A9856A87
last_name: Cultrera di Montesano
orcid: 0000-0001-6249-0832
- first_name: Ondrej
full_name: Draganov, Ondrej
id: 2B23F01E-F248-11E8-B48F-1D18A9856A87
last_name: Draganov
orcid: 0000-0003-0464-3823
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Morteza
full_name: Saghafian, Morteza
id: f86f7148-b140-11ec-9577-95435b8df824
last_name: Saghafian
citation:
ama: Biswas R, Cultrera di Montesano S, Draganov O, Edelsbrunner H, Saghafian M.
On the size of chromatic Delaunay mosaics. arXiv.
apa: Biswas, R., Cultrera di Montesano, S., Draganov, O., Edelsbrunner, H., &
Saghafian, M. (n.d.). On the size of chromatic Delaunay mosaics. arXiv.
chicago: Biswas, Ranita, Sebastiano Cultrera di Montesano, Ondrej Draganov, Herbert
Edelsbrunner, and Morteza Saghafian. “On the Size of Chromatic Delaunay Mosaics.”
ArXiv, n.d.
ieee: R. Biswas, S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner, and M.
Saghafian, “On the size of chromatic Delaunay mosaics,” arXiv. .
ista: Biswas R, Cultrera di Montesano S, Draganov O, Edelsbrunner H, Saghafian M.
On the size of chromatic Delaunay mosaics. arXiv, 2212.03121.
mla: Biswas, Ranita, et al. “On the Size of Chromatic Delaunay Mosaics.” ArXiv,
2212.03121.
short: R. Biswas, S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner, M. Saghafian,
ArXiv (n.d.).
corr_author: '1'
date_created: 2024-03-08T09:54:20Z
date_published: 2022-12-06T00:00:00Z
date_updated: 2026-04-07T12:58:47Z
day: '06'
department:
- _id: HeEd
ec_funded: 1
external_id:
arxiv:
- '2212.03121'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2212.03121
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: 266A2E9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '788183'
name: Alpha Shape Theory Extended
- _id: 0aa4bc98-070f-11eb-9043-e6fff9c6a316
grant_number: I4887
name: Persistent Homology, Algorithms and Stochastic Geometry
- _id: 268116B8-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00342
name: Mathematics, Computer Science
publication: arXiv
publication_status: draft
related_material:
record:
- id: '20456'
relation: later_version
status: public
- id: '15094'
relation: dissertation_contains
status: public
status: public
title: On the size of chromatic Delaunay mosaics
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: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '17084'
abstract:
- lang: eng
text: 'Given a graph where every vertex has exactly one labeled token, how can we
most quickly execute a given permutation on the tokens? In (sequential) token
swapping, the goal is to use the shortest possible sequence of swaps, each of
which exchanges the tokens at the two endpoints of an edge of the graph. In parallel
token swapping, the goal is to use the fewest rounds, each of which consists of
one or more swaps on the edges of a matching. We prove that both of these problems
remain NP-hard when the graph is restricted to be a tree. These token swapping
problems have been studied by disparate groups of researchers in discrete mathematics,
theoretical computer science, robot motion planning, game theory, and engineering.
Previous work establishes NP-completeness on general graphs (for both problems),
constant-factor approximation algorithms, and some poly-time exact algorithms
for simple graph classes such as cliques, stars, paths, and cycles. Sequential
and parallel token swapping on trees were first studied over thirty years ago
(as "sorting with a transposition tree") and over twenty-five years ago (as "routing
permutations via matchings"), yet their complexities were previously unknown.
We also show limitations on approximation of sequential token swapping on trees:
we identify a broad class of algorithms that encompass all three known polynomial-time
algorithms that achieve the best known approximation factor (which is 2) and show
that no such algorithm can achieve an approximation factor less than 2.'
acknowledgement: "g Anna Lubiw: Supported by the Natural Sciences and Engineering
Research Council of\r\nCanada (NSERC). Jayson Lynch: Supported by the Natural Sciences
and Engineering Research Council of Canada (NSERC). Zuzana Masárová: Supported by
Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31. Virginia Vassilevska
Williams: Supported by an NSF CAREER Award, NSF Grants CCF-1528078, CCF-1514339
and CCF-1909429, a BSF Grant BSF:2012338, a Google Research Fellowship and a Sloan
Research Fellowship.\r\nNicole Wein: Supported by a grant to DIMACS from the Simons
Foundation (820931). This work was done while the author was at MIT.\r\nThis research
was initiated at the 34th Bellairs Winter Workshop on Computational Geometry, co-organized
by Erik Demaine and Godfried Toussaint, held on March 22–29,\r\n2019 in Holetown,
Barbados. We thank the other participants of that workshop for providing a\r\nstimulating
research environment."
alternative_title:
- LIPIcs
article_number: '3'
article_processing_charge: Yes
arxiv: 1
author:
- first_name: Oswin
full_name: Aichholzer, Oswin
last_name: Aichholzer
- first_name: Erik D.
full_name: Demaine, Erik D.
last_name: Demaine
- first_name: Matias
full_name: Korman, Matias
last_name: Korman
- first_name: Anna
full_name: Lubiw, Anna
last_name: Lubiw
- first_name: Jayson
full_name: Lynch, Jayson
last_name: Lynch
- 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: Mikhail
full_name: Rudoy, Mikhail
last_name: Rudoy
- first_name: Virginia
full_name: Vassilevska Williams, Virginia
last_name: Vassilevska Williams
- first_name: Nicole
full_name: Wein, Nicole
last_name: Wein
citation:
ama: 'Aichholzer O, Demaine ED, Korman M, et al. Hardness of token swapping on trees.
In: 30th Annual European Symposium on Algorithms. Vol 244. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.ESA.2022.3'
apa: 'Aichholzer, O., Demaine, E. D., Korman, M., Lubiw, A., Lynch, J., Masárová,
Z., … Wein, N. (2022). Hardness of token swapping on trees. In 30th Annual
European Symposium on Algorithms (Vol. 244). Berlin/Potsdam, Germany: Schloss
Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2022.3'
chicago: Aichholzer, Oswin, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch,
Zuzana Masárová, Mikhail Rudoy, Virginia Vassilevska Williams, and Nicole Wein.
“Hardness of Token Swapping on Trees.” In 30th Annual European Symposium on
Algorithms, Vol. 244. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
https://doi.org/10.4230/LIPIcs.ESA.2022.3.
ieee: O. Aichholzer et al., “Hardness of token swapping on trees,” in 30th
Annual European Symposium on Algorithms, Berlin/Potsdam, Germany, 2022, vol.
244.
ista: 'Aichholzer O, Demaine ED, Korman M, Lubiw A, Lynch J, Masárová Z, Rudoy M,
Vassilevska Williams V, Wein N. 2022. Hardness of token swapping on trees. 30th
Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms,
LIPIcs, vol. 244, 3.'
mla: Aichholzer, Oswin, et al. “Hardness of Token Swapping on Trees.” 30th Annual
European Symposium on Algorithms, vol. 244, 3, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2022, doi:10.4230/LIPIcs.ESA.2022.3.
short: O. Aichholzer, E.D. Demaine, M. Korman, A. Lubiw, J. Lynch, Z. Masárová,
M. Rudoy, V. Vassilevska Williams, N. Wein, in:, 30th Annual European Symposium
on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
conference:
end_date: 2022-09-09
location: Berlin/Potsdam, Germany
name: 'ESA: European Symposium on Algorithms'
start_date: 2022-09-05
corr_author: '1'
date_created: 2024-05-29T06:27:16Z
date_published: 2022-09-01T00:00:00Z
date_updated: 2025-04-15T07:16:56Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
- _id: UlWa
doi: 10.4230/LIPIcs.ESA.2022.3
external_id:
arxiv:
- '2103.06707'
file:
- access_level: open_access
checksum: a1fbd3e7baad510fbcb998cf4a7d9f7f
content_type: application/pdf
creator: dernst
date_created: 2024-08-12T08:51:44Z
date_updated: 2024-08-12T08:51:44Z
file_id: '17420'
file_name: 2022_LIPIcS_Aichholzer.pdf
file_size: 1406071
relation: main_file
success: 1
file_date_updated: 2024-08-12T08:51:44Z
has_accepted_license: '1'
intvolume: ' 244'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 268116B8-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00342
name: Mathematics, Computer Science
publication: 30th Annual European Symposium on Algorithms
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Hardness of token swapping on trees
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: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 244
year: '2022'
...
---
_id: '10413'
abstract:
- lang: eng
text: Motivated by the recent introduction of the intrinsic semilattice entropy,
we study generalized quasi-metric semilattices and their categories. We investigate
the relationship between these objects and generalized semivaluations, extending
Nakamura and Schellekens' approach. Finally, we use this correspondence to compare
the intrinsic semilattice entropy and the semigroup entropy induced in particular
situations, like sets, torsion abelian groups and vector spaces.
acknowledgement: Dedicated to the memory of Hans-Peter Künzi.
article_number: '107916'
article_processing_charge: No
article_type: original
author:
- first_name: Dikran
full_name: Dikranjan, Dikran
last_name: Dikranjan
- first_name: Anna
full_name: Giordano Bruno, Anna
last_name: Giordano Bruno
- first_name: Hans Peter
full_name: Künzi, Hans Peter
last_name: Künzi
- first_name: Nicolò
full_name: Zava, Nicolò
id: c8b3499c-7a77-11eb-b046-aa368cbbf2ad
last_name: Zava
orcid: 0000-0001-8686-1888
- first_name: Daniele
full_name: Toller, Daniele
last_name: Toller
citation:
ama: Dikranjan D, Giordano Bruno A, Künzi HP, Zava N, Toller D. Generalized quasi-metric
semilattices. Topology and its Applications. 2022;309. doi:10.1016/j.topol.2021.107916
apa: Dikranjan, D., Giordano Bruno, A., Künzi, H. P., Zava, N., & Toller, D.
(2022). Generalized quasi-metric semilattices. Topology and Its Applications.
Elsevier. https://doi.org/10.1016/j.topol.2021.107916
chicago: Dikranjan, Dikran, Anna Giordano Bruno, Hans Peter Künzi, Nicolò Zava,
and Daniele Toller. “Generalized Quasi-Metric Semilattices.” Topology and Its
Applications. Elsevier, 2022. https://doi.org/10.1016/j.topol.2021.107916.
ieee: D. Dikranjan, A. Giordano Bruno, H. P. Künzi, N. Zava, and D. Toller, “Generalized
quasi-metric semilattices,” Topology and its Applications, vol. 309. Elsevier,
2022.
ista: Dikranjan D, Giordano Bruno A, Künzi HP, Zava N, Toller D. 2022. Generalized
quasi-metric semilattices. Topology and its Applications. 309, 107916.
mla: Dikranjan, Dikran, et al. “Generalized Quasi-Metric Semilattices.” Topology
and Its Applications, vol. 309, 107916, Elsevier, 2022, doi:10.1016/j.topol.2021.107916.
short: D. Dikranjan, A. Giordano Bruno, H.P. Künzi, N. Zava, D. Toller, Topology
and Its Applications 309 (2022).
corr_author: '1'
date_created: 2021-12-05T23:01:44Z
date_published: 2022-03-15T00:00:00Z
date_updated: 2024-10-09T21:01:16Z
day: '15'
department:
- _id: HeEd
doi: 10.1016/j.topol.2021.107916
external_id:
isi:
- '000791838800012'
intvolume: ' 309'
isi: 1
language:
- iso: eng
month: '03'
oa_version: None
publication: Topology and its Applications
publication_identifier:
issn:
- 0166-8641
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Generalized quasi-metric semilattices
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 309
year: '2022'
...
---
_id: '10608'
abstract:
- lang: eng
text: We consider infinite-dimensional properties in coarse geometry for hyperspaces
consisting of finite subsets of metric spaces with the Hausdorff metric. We see
that several infinite-dimensional properties are preserved by taking the hyperspace
of subsets with at most n points. On the other hand, we prove that, if a metric
space contains a sequence of long intervals coarsely, then its hyperspace of finite
subsets is not coarsely embeddable into any uniformly convex Banach space. As
a corollary, the hyperspace of finite subsets of the real line is not coarsely
embeddable into any uniformly convex Banach space. It is also shown that every
(not necessarily bounded geometry) metric space with straight finite decomposition
complexity has metric sparsification property.
acknowledgement: We would like to thank the referees for their careful reading and
the comments that improved our work. The third named author would like to thank
the Division of Mathematics, Physics and Earth Sciences of the Graduate School of
Science and Engineering of Ehime University and the second named author for hosting
his visit in June 2018. Open access funding provided by Institute of Science and
Technology (IST Austria).
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Thomas
full_name: Weighill, Thomas
last_name: Weighill
- first_name: Takamitsu
full_name: Yamauchi, Takamitsu
last_name: Yamauchi
- first_name: Nicolò
full_name: Zava, Nicolò
id: c8b3499c-7a77-11eb-b046-aa368cbbf2ad
last_name: Zava
orcid: 0000-0001-8686-1888
citation:
ama: Weighill T, Yamauchi T, Zava N. Coarse infinite-dimensionality of hyperspaces
of finite subsets. European Journal of Mathematics. 2022;8(1):335-355.
doi:10.1007/s40879-021-00515-3
apa: Weighill, T., Yamauchi, T., & Zava, N. (2022). Coarse infinite-dimensionality
of hyperspaces of finite subsets. European Journal of Mathematics. Springer
Nature. https://doi.org/10.1007/s40879-021-00515-3
chicago: Weighill, Thomas, Takamitsu Yamauchi, and Nicolò Zava. “Coarse Infinite-Dimensionality
of Hyperspaces of Finite Subsets.” European Journal of Mathematics. Springer
Nature, 2022. https://doi.org/10.1007/s40879-021-00515-3.
ieee: T. Weighill, T. Yamauchi, and N. Zava, “Coarse infinite-dimensionality of
hyperspaces of finite subsets,” European Journal of Mathematics, vol. 8,
no. 1. Springer Nature, pp. 335–355, 2022.
ista: Weighill T, Yamauchi T, Zava N. 2022. Coarse infinite-dimensionality of hyperspaces
of finite subsets. European Journal of Mathematics. 8(1), 335–355.
mla: Weighill, Thomas, et al. “Coarse Infinite-Dimensionality of Hyperspaces of
Finite Subsets.” European Journal of Mathematics, vol. 8, no. 1, Springer
Nature, 2022, pp. 335–55, doi:10.1007/s40879-021-00515-3.
short: T. Weighill, T. Yamauchi, N. Zava, European Journal of Mathematics 8 (2022)
335–355.
date_created: 2022-01-09T23:01:27Z
date_published: 2022-03-01T00:00:00Z
date_updated: 2024-05-22T11:10:22Z
day: '01'
ddc:
- '500'
department:
- _id: HeEd
doi: 10.1007/s40879-021-00515-3
file:
- access_level: open_access
checksum: ce35cbb2d8c889dc7750719972634ed4
content_type: application/pdf
creator: kschuh
date_created: 2024-05-22T11:10:10Z
date_updated: 2024-05-22T11:10:10Z
file_id: '17036'
file_name: 2022_EuJournalMath_Weighill.pdf
file_size: 371515
relation: main_file
success: 1
file_date_updated: 2024-05-22T11:10:10Z
has_accepted_license: '1'
intvolume: ' 8'
issue: '1'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: 335-355
publication: European Journal of Mathematics
publication_identifier:
eissn:
- 2199-6768
issn:
- 2199-675X
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Coarse infinite-dimensionality of hyperspaces of finite subsets
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: 8
year: '2022'
...
---
_id: '10754'
abstract:
- lang: eng
text: Targeting dysregulated Ca2+ signaling in cancer cells is an emerging chemotherapy
approach. We previously reported that store-operated Ca2+ entry (SOCE) blockers,
such as RP4010, are promising antitumor drugs for esophageal cancer. As a tyrosine
kinase inhibitor (TKI), afatinib received FDA approval to be used in targeted
therapy for patients with EGFR mutation-positive cancers. While preclinical studies
and clinical trials have shown that afatinib has benefits for esophageal cancer
patients, it is not known whether a combination of afatinib and RP4010 could achieve
better anticancer effects. Since TKI can alter intracellular Ca2+ dynamics through
EGFR/phospholipase C-γ pathway, in this study, we evaluated the inhibitory effect
of afatinib and RP4010 on intracellular Ca2+ oscillations in KYSE-150, a human
esophageal squamous cell carcinoma cell line, using both experimental and mathematical
simulations. Our mathematical simulation of Ca2+ oscillations could fit well with
experimental data responding to afatinib or RP4010, both separately or in combination.
Guided by simulation, we were able to identify a proper ratio of afatinib and
RP4010 for combined treatment, and such a combination presented synergistic anticancer-effect
evidence by experimental measurement of intracellular Ca2+ and cell proliferation.
This intracellular Ca2+ dynamic-based mathematical simulation approach could be
useful for a rapid and cost-effective evaluation of combined targeting therapy
drugs.
acknowledgement: "This work was partially supported by grants from National Institutes
of Health (NIH) (R01 CA185055, S10OD0252300) and The University of Texas System
STARs Award (to Z.P.),\r\nThe University of Texas at Arlington Interdisciplinary
Research Program (to B.C., H.V.K. and Z.P.). "
article_number: '1763'
article_processing_charge: Yes
article_type: original
author:
- first_name: Yan
full_name: Chang, Yan
last_name: Chang
- first_name: Marah
full_name: Funk, Marah
last_name: Funk
- first_name: Souvik
full_name: Roy, Souvik
last_name: Roy
- first_name: Elizabeth R
full_name: Stephenson, Elizabeth R
id: 2D04F932-F248-11E8-B48F-1D18A9856A87
last_name: Stephenson
orcid: 0000-0002-6862-208X
- first_name: Sangyong
full_name: Choi, Sangyong
last_name: Choi
- first_name: Hristo V.
full_name: Kojouharov, Hristo V.
last_name: Kojouharov
- first_name: Benito
full_name: Chen, Benito
last_name: Chen
- first_name: Zui
full_name: Pan, Zui
last_name: Pan
citation:
ama: Chang Y, Funk M, Roy S, et al. Developing a mathematical model of intracellular
Calcium dynamics for evaluating combined anticancer effects of afatinib and RP4010
in esophageal cancer. International Journal of Molecular Sciences. 2022;23(3).
doi:10.3390/ijms23031763
apa: Chang, Y., Funk, M., Roy, S., Stephenson, E. R., Choi, S., Kojouharov, H. V.,
… Pan, Z. (2022). Developing a mathematical model of intracellular Calcium dynamics
for evaluating combined anticancer effects of afatinib and RP4010 in esophageal
cancer. International Journal of Molecular Sciences. MDPI. https://doi.org/10.3390/ijms23031763
chicago: Chang, Yan, Marah Funk, Souvik Roy, Elizabeth R Stephenson, Sangyong Choi,
Hristo V. Kojouharov, Benito Chen, and Zui Pan. “Developing a Mathematical Model
of Intracellular Calcium Dynamics for Evaluating Combined Anticancer Effects of
Afatinib and RP4010 in Esophageal Cancer.” International Journal of Molecular
Sciences. MDPI, 2022. https://doi.org/10.3390/ijms23031763.
ieee: Y. Chang et al., “Developing a mathematical model of intracellular
Calcium dynamics for evaluating combined anticancer effects of afatinib and RP4010
in esophageal cancer,” International Journal of Molecular Sciences, vol.
23, no. 3. MDPI, 2022.
ista: Chang Y, Funk M, Roy S, Stephenson ER, Choi S, Kojouharov HV, Chen B, Pan
Z. 2022. Developing a mathematical model of intracellular Calcium dynamics for
evaluating combined anticancer effects of afatinib and RP4010 in esophageal cancer.
International Journal of Molecular Sciences. 23(3), 1763.
mla: Chang, Yan, et al. “Developing a Mathematical Model of Intracellular Calcium
Dynamics for Evaluating Combined Anticancer Effects of Afatinib and RP4010 in
Esophageal Cancer.” International Journal of Molecular Sciences, vol. 23,
no. 3, 1763, MDPI, 2022, doi:10.3390/ijms23031763.
short: Y. Chang, M. Funk, S. Roy, E.R. Stephenson, S. Choi, H.V. Kojouharov, B.
Chen, Z. Pan, International Journal of Molecular Sciences 23 (2022).
date_created: 2022-02-13T23:01:35Z
date_published: 2022-02-01T00:00:00Z
date_updated: 2025-06-11T13:46:46Z
day: '01'
ddc:
- '510'
- '576'
department:
- _id: HeEd
doi: 10.3390/ijms23031763
external_id:
isi:
- '000754773500001'
pmid:
- '35163685'
file:
- access_level: open_access
checksum: 8890ad20c54e90dc58ad5ea97c902998
content_type: application/pdf
creator: dernst
date_created: 2022-02-14T07:46:30Z
date_updated: 2022-02-14T07:46:30Z
file_id: '10756'
file_name: 2022_IJMS_Chang.pdf
file_size: 24416183
relation: main_file
success: 1
file_date_updated: 2022-02-14T07:46:30Z
has_accepted_license: '1'
intvolume: ' 23'
isi: 1
issue: '3'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
pmid: 1
publication: International Journal of Molecular Sciences
publication_identifier:
eissn:
- 1422-0067
issn:
- 1661-6596
publication_status: published
publisher: MDPI
quality_controlled: '1'
scopus_import: '1'
status: public
title: Developing a mathematical model of intracellular Calcium dynamics for evaluating
combined anticancer effects of afatinib and RP4010 in esophageal cancer
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2022'
...
---
_id: '10773'
abstract:
- lang: eng
text: The Voronoi tessellation in Rd is defined by locally minimizing the power
distance to given weighted points. Symmetrically, the Delaunay mosaic can be defined
by locally maximizing the negative power distance to other such points. We prove
that the average of the two piecewise quadratic functions is piecewise linear,
and that all three functions have the same critical points and values. Discretizing
the two piecewise quadratic functions, we get the alpha shapes as sublevel sets
of the discrete function on the Delaunay mosaic, and analogous shapes as superlevel
sets of the discrete function on the Voronoi tessellation. For the same non-critical
value, the corresponding shapes are disjoint, separated by a narrow channel that
contains no critical points but the entire level set of the piecewise linear function.
acknowledgement: Open access funding provided by the Institute of Science and Technology
(IST Austria).
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Ranita
full_name: Biswas, Ranita
id: 3C2B033E-F248-11E8-B48F-1D18A9856A87
last_name: Biswas
orcid: 0000-0002-5372-7890
- first_name: Sebastiano
full_name: Cultrera Di Montesano, Sebastiano
id: 34D2A09C-F248-11E8-B48F-1D18A9856A87
last_name: Cultrera Di Montesano
orcid: 0000-0001-6249-0832
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Morteza
full_name: Saghafian, Morteza
last_name: Saghafian
citation:
ama: Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. Continuous
and discrete radius functions on Voronoi tessellations and Delaunay mosaics. Discrete
and Computational Geometry. 2022;67:811-842. doi:10.1007/s00454-022-00371-2
apa: Biswas, R., Cultrera di Montesano, S., Edelsbrunner, H., & Saghafian, M.
(2022). Continuous and discrete radius functions on Voronoi tessellations and
Delaunay mosaics. Discrete and Computational Geometry. Springer Nature.
https://doi.org/10.1007/s00454-022-00371-2
chicago: Biswas, Ranita, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner,
and Morteza Saghafian. “Continuous and Discrete Radius Functions on Voronoi Tessellations
and Delaunay Mosaics.” Discrete and Computational Geometry. Springer Nature,
2022. https://doi.org/10.1007/s00454-022-00371-2.
ieee: R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, and M. Saghafian, “Continuous
and discrete radius functions on Voronoi tessellations and Delaunay mosaics,”
Discrete and Computational Geometry, vol. 67. Springer Nature, pp. 811–842,
2022.
ista: Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. 2022. Continuous
and discrete radius functions on Voronoi tessellations and Delaunay mosaics. Discrete
and Computational Geometry. 67, 811–842.
mla: Biswas, Ranita, et al. “Continuous and Discrete Radius Functions on Voronoi
Tessellations and Delaunay Mosaics.” Discrete and Computational Geometry,
vol. 67, Springer Nature, 2022, pp. 811–42, doi:10.1007/s00454-022-00371-2.
short: R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, M. Saghafian, Discrete
and Computational Geometry 67 (2022) 811–842.
corr_author: '1'
date_created: 2022-02-20T23:01:34Z
date_published: 2022-04-01T00:00:00Z
date_updated: 2024-10-09T21:01:38Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1007/s00454-022-00371-2
external_id:
isi:
- '000752175300002'
file:
- access_level: open_access
checksum: 9383d3b70561bacee905e335dc922680
content_type: application/pdf
creator: dernst
date_created: 2022-08-02T06:07:55Z
date_updated: 2022-08-02T06:07:55Z
file_id: '11718'
file_name: 2022_DiscreteCompGeometry_Biswas.pdf
file_size: 2518111
relation: main_file
success: 1
file_date_updated: 2022-08-02T06:07:55Z
has_accepted_license: '1'
intvolume: ' 67'
isi: 1
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 811-842
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: Continuous and discrete radius functions on Voronoi tessellations and Delaunay
mosaics
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: 67
year: '2022'
...
---
_id: '7791'
abstract:
- lang: eng
text: Extending a result of Milena Radnovic and Serge Tabachnikov, we establish
conditionsfor two different non-symmetric norms to define the same billiard reflection
law.
acknowledgement: AA was supported by European Research Council (ERC) under the European
Union’s Horizon 2020 research and innovation programme (Grant Agreement No. 78818
Alpha). RK was supported by the Federal professorship program Grant 1.456.2016/1.4
and the Russian Foundation for Basic Research Grants 18-01-00036 and 19-01-00169.
Open access funding provided by Institute of Science and Technology (IST Austria).
The authors thank Alexey Balitskiy, Milena Radnović, and Serge Tabachnikov for useful
discussions.
article_processing_charge: Yes (via OA deal)
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: Roman
full_name: Karasev, Roman
last_name: Karasev
citation:
ama: Akopyan A, Karasev R. When different norms lead to same billiard trajectories?
European Journal of Mathematics. 2022;8(4):1309-1312. doi:10.1007/s40879-020-00405-0
apa: Akopyan, A., & Karasev, R. (2022). When different norms lead to same billiard
trajectories? European Journal of Mathematics. Springer Nature. https://doi.org/10.1007/s40879-020-00405-0
chicago: Akopyan, Arseniy, and Roman Karasev. “When Different Norms Lead to Same
Billiard Trajectories?” European Journal of Mathematics. Springer Nature,
2022. https://doi.org/10.1007/s40879-020-00405-0.
ieee: A. Akopyan and R. Karasev, “When different norms lead to same billiard trajectories?,”
European Journal of Mathematics, vol. 8, no. 4. Springer Nature, pp. 1309–1312,
2022.
ista: Akopyan A, Karasev R. 2022. When different norms lead to same billiard trajectories?
European Journal of Mathematics. 8(4), 1309–1312.
mla: Akopyan, Arseniy, and Roman Karasev. “When Different Norms Lead to Same Billiard
Trajectories?” European Journal of Mathematics, vol. 8, no. 4, Springer
Nature, 2022, pp. 1309–12, doi:10.1007/s40879-020-00405-0.
short: A. Akopyan, R. Karasev, European Journal of Mathematics 8 (2022) 1309–1312.
corr_author: '1'
date_created: 2020-05-03T22:00:48Z
date_published: 2022-12-01T00:00:00Z
date_updated: 2025-04-14T07:48:36Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1007/s40879-020-00405-0
ec_funded: 1
external_id:
arxiv:
- '1912.12685'
file:
- access_level: open_access
checksum: f53e71fd03744075adcd0b8fc1b8423d
content_type: application/pdf
creator: dernst
date_created: 2020-05-04T10:33:42Z
date_updated: 2020-07-14T12:48:03Z
file_id: '7796'
file_name: 2020_EuropMathematics_Akopyan.pdf
file_size: 263926
relation: main_file
file_date_updated: 2020-07-14T12:48:03Z
has_accepted_license: '1'
intvolume: ' 8'
issue: '4'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 1309 - 1312
project:
- _id: 266A2E9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '788183'
name: Alpha Shape Theory Extended
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: European Journal of Mathematics
publication_identifier:
eissn:
- 2199-6768
issn:
- 2199-675X
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: When different norms lead to same billiard trajectories?
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: 8
year: '2022'
...
---
_id: '8538'
abstract:
- lang: eng
text: We prove some recent experimental observations of Dan Reznik concerning periodic
billiard orbits in ellipses. For example, the sum of cosines of the angles of
a periodic billiard polygon remains constant in the 1-parameter family of such
polygons (that exist due to the Poncelet porism). In our proofs, we use geometric
and complex analytic methods.
acknowledgement: " This paper would not be written if not for Dan Reznik’s curiosity
and persistence; we are very grateful to him. We also thank R. Garcia and J. Koiller
for interesting discussions. It is a pleasure to thank the Mathematical Institute
of the University of Heidelberg for its stimulating atmosphere. ST thanks M. Bialy
for interesting discussions and the Tel Aviv\r\nUniversity for its invariable hospitality.
AA was supported by European Research Council (ERC) under the European Union’s Horizon
2020 research and innovation programme (grant agreement No 78818 Alpha). RS is supported
by NSF Grant DMS-1807320. ST was supported by NSF grant DMS-1510055 and SFB/TRR
191."
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: Richard
full_name: Schwartz, Richard
last_name: Schwartz
- first_name: Serge
full_name: Tabachnikov, Serge
last_name: Tabachnikov
citation:
ama: Akopyan A, Schwartz R, Tabachnikov S. Billiards in ellipses revisited. European
Journal of Mathematics. 2022;8(4):1313-1327. doi:10.1007/s40879-020-00426-9
apa: Akopyan, A., Schwartz, R., & Tabachnikov, S. (2022). Billiards in ellipses
revisited. European Journal of Mathematics. Springer Nature. https://doi.org/10.1007/s40879-020-00426-9
chicago: Akopyan, Arseniy, Richard Schwartz, and Serge Tabachnikov. “Billiards in
Ellipses Revisited.” European Journal of Mathematics. Springer Nature,
2022. https://doi.org/10.1007/s40879-020-00426-9.
ieee: A. Akopyan, R. Schwartz, and S. Tabachnikov, “Billiards in ellipses revisited,”
European Journal of Mathematics, vol. 8, no. 4. Springer Nature, pp. 1313–1327,
2022.
ista: Akopyan A, Schwartz R, Tabachnikov S. 2022. Billiards in ellipses revisited.
European Journal of Mathematics. 8(4), 1313–1327.
mla: Akopyan, Arseniy, et al. “Billiards in Ellipses Revisited.” European Journal
of Mathematics, vol. 8, no. 4, Springer Nature, 2022, pp. 1313–27, doi:10.1007/s40879-020-00426-9.
short: A. Akopyan, R. Schwartz, S. Tabachnikov, European Journal of Mathematics
8 (2022) 1313–1327.
date_created: 2020-09-20T22:01:38Z
date_published: 2022-12-01T00:00:00Z
date_updated: 2025-04-14T07:48:34Z
day: '01'
department:
- _id: HeEd
doi: 10.1007/s40879-020-00426-9
ec_funded: 1
external_id:
arxiv:
- '2001.02934'
intvolume: ' 8'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2001.02934
month: '12'
oa: 1
oa_version: Preprint
page: 1313-1327
project:
- _id: 266A2E9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '788183'
name: Alpha Shape Theory Extended
publication: European Journal of Mathematics
publication_identifier:
eissn:
- 2199-6768
issn:
- 2199-675X
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Billiards in ellipses revisited
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2022'
...
---
_id: '9649'
abstract:
- lang: eng
text: "Isomanifolds are the generalization of isosurfaces to arbitrary dimension
and codimension, i.e. manifolds defined as the zero set of some multivariate vector-valued
smooth function f : Rd → Rd−n. A natural (and efficient) way to approximate an
isomanifold is to consider its Piecewise-Linear (PL) approximation based on a
triangulation T of the ambient space Rd. In this paper, we give conditions under
which the PL-approximation of an isomanifold is topologically equivalent to the
isomanifold. The conditions are easy to satisfy in the sense that they can always
be met by taking a sufficiently\r\nfine triangulation T . This contrasts with
previous results on the triangulation of manifolds where, in arbitrary dimensions,
delicate perturbations are needed to guarantee topological correctness, which
leads to strong limitations in practice. We further give a bound on the Fréchet
distance between the original isomanifold and its PL-approximation. Finally we
show analogous results for the PL-approximation of an isomanifold with boundary."
acknowledgement: "First and foremost, we acknowledge Siargey Kachanovich for discussions.
We thank Herbert Edelsbrunner and all members of his group, all former and current
members of the Datashape team (formerly known as Geometrica), and André Lieutier
for encouragement. We further thank the reviewers of Foundations of Computational
Mathematics and the reviewers and program committee of the Symposium on Computational
Geometry for their feedback, which improved the exposition.\r\nThis work was 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). This work was also supported by the French government, through the
3IA Côte d’Azur Investments in the Future project managed by the National Research
Agency (ANR) with the reference number ANR-19-P3IA-0002. Mathijs Wintraecken 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: Mathijs
full_name: Wintraecken, Mathijs
id: 307CFBC8-F248-11E8-B48F-1D18A9856A87
last_name: Wintraecken
orcid: 0000-0002-7472-2220
citation:
ama: Boissonnat J-D, Wintraecken M. The topological correctness of PL approximations
of isomanifolds. Foundations of Computational Mathematics . 2022;22:967-1012.
doi:10.1007/s10208-021-09520-0
apa: Boissonnat, J.-D., & Wintraecken, M. (2022). The topological correctness
of PL approximations of isomanifolds. Foundations of Computational Mathematics
. Springer Nature. https://doi.org/10.1007/s10208-021-09520-0
chicago: Boissonnat, Jean-Daniel, and Mathijs Wintraecken. “The Topological Correctness
of PL Approximations of Isomanifolds.” Foundations of Computational Mathematics
. Springer Nature, 2022. https://doi.org/10.1007/s10208-021-09520-0.
ieee: J.-D. Boissonnat and M. Wintraecken, “The topological correctness of PL approximations
of isomanifolds,” Foundations of Computational Mathematics , vol. 22. Springer
Nature, pp. 967–1012, 2022.
ista: Boissonnat J-D, Wintraecken M. 2022. The topological correctness of PL approximations
of isomanifolds. Foundations of Computational Mathematics . 22, 967–1012.
mla: Boissonnat, Jean-Daniel, and Mathijs Wintraecken. “The Topological Correctness
of PL Approximations of Isomanifolds.” Foundations of Computational Mathematics
, vol. 22, Springer Nature, 2022, pp. 967–1012, doi:10.1007/s10208-021-09520-0.
short: J.-D. Boissonnat, M. Wintraecken, Foundations of Computational Mathematics 22
(2022) 967–1012.
corr_author: '1'
date_created: 2021-07-14T06:44:53Z
date_published: 2022-01-01T00:00:00Z
date_updated: 2025-04-22T13:45:18Z
day: '01'
ddc:
- '516'
department:
- _id: HeEd
doi: 10.1007/s10208-021-09520-0
ec_funded: 1
external_id:
isi:
- '000673039600001'
file:
- access_level: open_access
checksum: f1d372ec3c08ec22e84f8e93e1126b8c
content_type: application/pdf
creator: mwintrae
date_created: 2021-07-14T06:44:36Z
date_updated: 2021-07-14T06:44:36Z
file_id: '9650'
file_name: Boissonnat-Wintraecken2021_Article_TheTopologicalCorrectnessOfPLA.pdf
file_size: 1455699
relation: main_file
file_date_updated: 2021-07-14T06:44:36Z
has_accepted_license: '1'
intvolume: ' 22'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 967-1012
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: 'Foundations of Computational Mathematics '
publication_identifier:
eissn:
- 1615-3383
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '7952'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: The topological correctness of PL approximations of isomanifolds
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 22
year: '2022'
...
---
_id: '11660'
abstract:
- lang: eng
text: 'We characterize critical points of 1-dimensional maps paired in persistent
homology geometrically and this way get elementary proofs of theorems about the
symmetry of persistence diagrams and the variation of such maps. In particular,
we identify branching points and endpoints of networks as the sole source of asymmetry
and relate the cycle basis in persistent homology with a version of the stable
marriage problem. Our analysis provides the foundations of fast algorithms for
maintaining collections of interrelated sorted lists together with their persistence
diagrams. '
acknowledgement: 'This project has received funding from the European Research Council
(ERC) under the European Union’s Horizon 2020 research and innovation programme,
grant no. 788183, from the Wittgenstein Prize, Austrian Science Fund (FWF), grant
no. Z 342-N31, and from the DFG Collaborative Research Center TRR 109, ‘Discretization
in Geometry and Dynamics’, Austrian Science Fund (FWF), grant no. I 02979-N35. '
alternative_title:
- LIPIcs
article_processing_charge: No
author:
- first_name: Ranita
full_name: Biswas, Ranita
id: 3C2B033E-F248-11E8-B48F-1D18A9856A87
last_name: Biswas
orcid: 0000-0002-5372-7890
- first_name: Sebastiano
full_name: Cultrera di Montesano, Sebastiano
id: 34D2A09C-F248-11E8-B48F-1D18A9856A87
last_name: Cultrera di Montesano
orcid: 0000-0001-6249-0832
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Morteza
full_name: Saghafian, Morteza
last_name: Saghafian
citation:
ama: 'Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. A window to
the persistence of 1D maps. I: Geometric characterization of critical point pairs.
LIPIcs.'
apa: 'Biswas, R., Cultrera di Montesano, S., Edelsbrunner, H., & Saghafian,
M. (n.d.). A window to the persistence of 1D maps. I: Geometric characterization
of critical point pairs. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik.'
chicago: 'Biswas, Ranita, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner,
and Morteza Saghafian. “A Window to the Persistence of 1D Maps. I: Geometric Characterization
of Critical Point Pairs.” LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, n.d.'
ieee: 'R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, and M. Saghafian, “A
window to the persistence of 1D maps. I: Geometric characterization of critical
point pairs,” LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.'
ista: 'Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. A window
to the persistence of 1D maps. I: Geometric characterization of critical point
pairs. LIPIcs.'
mla: 'Biswas, Ranita, et al. “A Window to the Persistence of 1D Maps. I: Geometric
Characterization of Critical Point Pairs.” LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik.'
short: R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, M. Saghafian, LIPIcs
(n.d.).
corr_author: '1'
date_created: 2022-07-27T09:31:15Z
date_published: 2022-07-25T00:00:00Z
date_updated: 2026-08-13T09:41:58Z
day: '25'
ddc:
- '510'
department:
- _id: GradSch
- _id: HeEd
ec_funded: 1
file:
- access_level: open_access
checksum: 95903f9d1649e8e437a967b6f2f64730
content_type: application/pdf
creator: scultrer
date_created: 2022-07-27T09:30:30Z
date_updated: 2022-07-27T09:30:30Z
file_id: '11661'
file_name: window 1.pdf
file_size: 564836
relation: main_file
file_date_updated: 2022-07-27T09:30:30Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
project:
- _id: 266A2E9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '788183'
name: Alpha Shape Theory Extended
- _id: 268116B8-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00342
name: Mathematics, Computer Science
- _id: 2561EBF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I02979-N35
name: Persistence and stability of geometric complexes
publication: LIPIcs
publication_status: submitted
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
record:
- id: '15094'
relation: dissertation_contains
status: public
- id: '13182'
relation: later_version
status: public
status: public
title: 'A window to the persistence of 1D maps. I: Geometric characterization of critical
point pairs'
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '10208'
abstract:
- lang: eng
text: It is practical to collect a huge amount of movement data and environmental
context information along with the health signals of individuals because there
is the emergence of new generations of positioning and tracking technologies and
rapid advancements of health sensors. The study of the relations between these
datasets and their sequence similarity analysis is of interest to many applications
such as health monitoring and recommender systems. However, entering all movement
parameters and health signals can lead to the complexity of the problem and an
increase in its computational load. In this situation, dimension reduction techniques
can be used to avoid consideration of simultaneous dependent parameters in the
process of similarity measurement of the trajectories. The present study provides
a framework, named CaDRAW, to use spatial–temporal data and movement parameters
along with independent context information in the process of measuring the similarity
of trajectories. In this regard, the omission of dependent movement characteristic
signals is conducted by using an unsupervised feature selection dimension reduction
technique. To evaluate the effectiveness of the proposed framework, it was applied
to a real contextualized movement and related health signal datasets of individuals.
The results indicated the capability of the proposed framework in measuring the
similarity and in decreasing the characteristic signals in such a way that the
similarity results -before and after reduction of dependent characteristic signals-
have small differences. The mean differences between the obtained results before
and after reducing the dimension were 0.029 and 0.023 for the round path, respectively.
acknowledgement: The third author acknowledges the funding received from the Wittgenstein
Prize, Austrian Science Fund (FWF), grant no. Z 342-N31.
article_processing_charge: No
article_type: original
author:
- first_name: Samira
full_name: Goudarzi, Samira
last_name: Goudarzi
- first_name: Mohammad
full_name: Sharif, Mohammad
last_name: Sharif
- first_name: Farid
full_name: Karimipour, Farid
id: 2A2BCDC4-CF62-11E9-BE5E-3B1EE6697425
last_name: Karimipour
orcid: 0000-0001-6746-4174
citation:
ama: Goudarzi S, Sharif M, Karimipour F. A context-aware dimension reduction framework
for trajectory and health signal analyses. Journal of Ambient Intelligence
and Humanized Computing. 2022;13:2621–2635. doi:10.1007/s12652-021-03569-z
apa: Goudarzi, S., Sharif, M., & Karimipour, F. (2022). A context-aware dimension
reduction framework for trajectory and health signal analyses. Journal of Ambient
Intelligence and Humanized Computing. Springer Nature. https://doi.org/10.1007/s12652-021-03569-z
chicago: Goudarzi, Samira, Mohammad Sharif, and Farid Karimipour. “A Context-Aware
Dimension Reduction Framework for Trajectory and Health Signal Analyses.” Journal
of Ambient Intelligence and Humanized Computing. Springer Nature, 2022. https://doi.org/10.1007/s12652-021-03569-z.
ieee: S. Goudarzi, M. Sharif, and F. Karimipour, “A context-aware dimension reduction
framework for trajectory and health signal analyses,” Journal of Ambient Intelligence
and Humanized Computing, vol. 13. Springer Nature, pp. 2621–2635, 2022.
ista: Goudarzi S, Sharif M, Karimipour F. 2022. A context-aware dimension reduction
framework for trajectory and health signal analyses. Journal of Ambient Intelligence
and Humanized Computing. 13, 2621–2635.
mla: Goudarzi, Samira, et al. “A Context-Aware Dimension Reduction Framework for
Trajectory and Health Signal Analyses.” Journal of Ambient Intelligence and
Humanized Computing, vol. 13, Springer Nature, 2022, pp. 2621–2635, doi:10.1007/s12652-021-03569-z.
short: S. Goudarzi, M. Sharif, F. Karimipour, Journal of Ambient Intelligence and
Humanized Computing 13 (2022) 2621–2635.
date_created: 2021-11-02T09:28:55Z
date_published: 2022-05-01T00:00:00Z
date_updated: 2025-04-15T07:16:55Z
day: '01'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.1007/s12652-021-03569-z
external_id:
isi:
- '000712198000001'
file:
- access_level: open_access
checksum: 0a8961416a9bb2be5a1cebda65468bcf
content_type: application/pdf
creator: fkarimip
date_created: 2021-11-12T19:38:05Z
date_updated: 2022-12-20T23:30:08Z
embargo: 2022-11-12
file_id: '10279'
file_name: A Context‑aware Dimension Reduction Framework - Journal of Ambient Intelligence
2021 (Preprint version).pdf
file_size: 1634958
relation: main_file
file_date_updated: 2022-12-20T23:30:08Z
has_accepted_license: '1'
intvolume: ' 13'
isi: 1
keyword:
- general computer science
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 2621–2635
project:
- _id: 268116B8-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00342
name: Mathematics, Computer Science
publication: Journal of Ambient Intelligence and Humanized Computing
publication_identifier:
eissn:
- 1868-5145
issn:
- 1868-5137
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: A context-aware dimension reduction framework for trajectory and health signal
analyses
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 13
year: '2022'
...
---
_id: '15275'
abstract:
- lang: eng
text: In 1916, Schur introduced the Ramsey number r(3; m), which is the minimum
integer n > 1 such that for any m-coloring of the edges of the complete graph
Kn, there is a monochromatic copy of K3. He showed that r(3; m) ≤ O(m!), and a
simple construction demonstrates that r(3; m) ≥ 2Ω(m). An old conjecture of Erdős
states that r(3; m) = 2Θ(m). In this note, we prove the conjecture for m-colorings
with bounded VC-dimension, that is, for m-colorings with the property that the
set system induced by the neighborhoods of the vertices with respect to each color
class has bounded VC-dimension.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Jacob
full_name: Fox, Jacob
last_name: Fox
- first_name: János
full_name: Pach, János
id: E62E3130-B088-11EA-B919-BF823C25FEA4
last_name: Pach
- first_name: Andrew
full_name: Suk, Andrew
last_name: Suk
citation:
ama: Fox J, Pach J, Suk A. Bounded VC-dimension implies the Schur-Erdős conjecture.
Combinatorica. 2021;41(6):803-813. doi:10.1007/s00493-021-4530-9
apa: Fox, J., Pach, J., & Suk, A. (2021). Bounded VC-dimension implies the Schur-Erdős
conjecture. Combinatorica. Springer Nature. https://doi.org/10.1007/s00493-021-4530-9
chicago: Fox, Jacob, János Pach, and Andrew Suk. “Bounded VC-Dimension Implies the
Schur-Erdős Conjecture.” Combinatorica. Springer Nature, 2021. https://doi.org/10.1007/s00493-021-4530-9.
ieee: J. Fox, J. Pach, and A. Suk, “Bounded VC-dimension implies the Schur-Erdős
conjecture,” Combinatorica, vol. 41, no. 6. Springer Nature, pp. 803–813,
2021.
ista: Fox J, Pach J, Suk A. 2021. Bounded VC-dimension implies the Schur-Erdős conjecture.
Combinatorica. 41(6), 803–813.
mla: Fox, Jacob, et al. “Bounded VC-Dimension Implies the Schur-Erdős Conjecture.”
Combinatorica, vol. 41, no. 6, Springer Nature, 2021, pp. 803–13, doi:10.1007/s00493-021-4530-9.
short: J. Fox, J. Pach, A. Suk, Combinatorica 41 (2021) 803–813.
date_created: 2024-04-03T07:59:57Z
date_published: 2021-11-20T00:00:00Z
date_updated: 2024-04-09T10:40:08Z
day: '20'
department:
- _id: HeEd
doi: 10.1007/s00493-021-4530-9
external_id:
arxiv:
- '1912.02342'
intvolume: ' 41'
issue: '6'
keyword:
- Computational Mathematics
- Discrete Mathematics and Combinatorics
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1912.02342
month: '11'
oa: 1
oa_version: Preprint
page: 803-813
publication: Combinatorica
publication_identifier:
eissn:
- 1439-6912
issn:
- 0209-9683
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Bounded VC-dimension implies the Schur-Erdős conjecture
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 41
year: '2021'
...
---
_id: '10071'
alternative_title:
- Early Career
article_processing_charge: No
article_type: letter_note
author:
- first_name: Henry
full_name: Adams, Henry
last_name: Adams
- first_name: Hana
full_name: Kourimska, Hana
id: D9B8E14C-3C26-11EA-98F5-1F833DDC885E
last_name: Kourimska
orcid: 0000-0001-7841-0091
- first_name: Teresa
full_name: Heiss, Teresa
id: 4879BB4E-F248-11E8-B48F-1D18A9856A87
last_name: Heiss
orcid: 0000-0002-1780-2689
- first_name: Sarah
full_name: Percival, Sarah
last_name: Percival
- first_name: Lori
full_name: Ziegelmeier, Lori
last_name: Ziegelmeier
citation:
ama: Adams H, Kourimska H, Heiss T, Percival S, Ziegelmeier L. How to tutorial-a-thon.
Notices of the American Mathematical Society. 2021;68(9):1511-1514. doi:10.1090/noti2349
apa: Adams, H., Kourimska, H., Heiss, T., Percival, S., & Ziegelmeier, L. (2021).
How to tutorial-a-thon. Notices of the American Mathematical Society. American
Mathematical Society. https://doi.org/10.1090/noti2349
chicago: Adams, Henry, Hana Kourimska, Teresa Heiss, Sarah Percival, and Lori Ziegelmeier.
“How to Tutorial-a-Thon.” Notices of the American Mathematical Society.
American Mathematical Society, 2021. https://doi.org/10.1090/noti2349.
ieee: H. Adams, H. Kourimska, T. Heiss, S. Percival, and L. Ziegelmeier, “How to
tutorial-a-thon,” Notices of the American Mathematical Society, vol. 68,
no. 9. American Mathematical Society, pp. 1511–1514, 2021.
ista: Adams H, Kourimska H, Heiss T, Percival S, Ziegelmeier L. 2021. How to tutorial-a-thon.
Notices of the American Mathematical Society. 68(9), 1511–1514.
mla: Adams, Henry, et al. “How to Tutorial-a-Thon.” Notices of the American Mathematical
Society, vol. 68, no. 9, American Mathematical Society, 2021, pp. 1511–14,
doi:10.1090/noti2349.
short: H. Adams, H. Kourimska, T. Heiss, S. Percival, L. Ziegelmeier, Notices of
the American Mathematical Society 68 (2021) 1511–1514.
date_created: 2021-10-03T22:01:22Z
date_published: 2021-10-01T00:00:00Z
date_updated: 2026-06-18T08:36:13Z
day: '01'
ddc:
- '500'
department:
- _id: HeEd
doi: 10.1090/noti2349
intvolume: ' 68'
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ams.org/notices/
month: '10'
oa: 1
oa_version: Published Version
page: 1511-1514
publication: Notices of the American Mathematical Society
publication_identifier:
eissn:
- 1088-9477
issn:
- 0002-9920
publication_status: published
publisher: American Mathematical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: How to tutorial-a-thon
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 68
year: '2021'
...
---
_id: '10367'
abstract:
- lang: eng
text: How information is created, shared and consumed has changed rapidly in recent
decades, in part thanks to new social platforms and technologies on the web. With
ever-larger amounts of unstructured and limited labels, organizing and reconciling
information from different sources and modalities is a central challenge in machine
learning. This cutting-edge tutorial aims to introduce the multimodal entailment
task, which can be useful for detecting semantic alignments when a single modality
alone does not suffice for a whole content understanding. Starting with a brief
overview of natural language processing, computer vision, structured data and
neural graph learning, we lay the foundations for the multimodal sections to follow.
We then discuss recent multimodal learning literature covering visual, audio and
language streams, and explore case studies focusing on tasks which require fine-grained
understanding of visual and linguistic semantics question answering, veracity
and hatred classification. Finally, we introduce a new dataset for recognizing
multimodal entailment, exploring it in a hands-on collaborative section. Overall,
this tutorial gives an overview of multimodal learning, introduces a multimodal
entailment dataset, and encourages future research in the topic.
acknowledgement: "We would like to thank Abby Schantz, Abe Ittycheriah, Aliaksei Severyn,
Allan Heydon, Aly\r\nGrealish, Andrey Vlasov, Arkaitz Zubiaga, Ashwin Kakarla, Chen
Sun, Clayton Williams, Cong\r\nYu, Cordelia Schmid, Da-Cheng Juan, Dan Finnie, Dani
Valevski, Daniel Rocha, David Price, David Sklar, Devi Krishna, Elena Kochkina,
Enrique Alfonseca, Franc¸oise Beaufays, Isabelle Augenstein, Jialu Liu, John Cantwell,
John Palowitch, Jordan Boyd-Graber, Lei Shi, Luis Valente, Maria Voitovich, Mehmet
Aktuna, Mogan Brown, Mor Naaman, Natalia P, Nidhi Hebbar, Pete Aykroyd, Rahul Sukthankar,
Richa Dixit, Steve Pucci, Tania Bedrax-Weiss, Tobias Kaufmann, Tom Boulos, Tu Tsao,
Vladimir Chtchetkine, Yair Kurzion, Yifan Xu and Zach Hynes."
article_processing_charge: No
author:
- first_name: Cesar
full_name: Ilharco, Cesar
last_name: Ilharco
- first_name: Afsaneh
full_name: Shirazi, Afsaneh
last_name: Shirazi
- first_name: Arjun
full_name: Gopalan, Arjun
last_name: Gopalan
- first_name: Arsha
full_name: Nagrani, Arsha
last_name: Nagrani
- first_name: Blaž
full_name: Bratanič, Blaž
last_name: Bratanič
- first_name: Chris
full_name: Bregler, Chris
last_name: Bregler
- first_name: Christina
full_name: Liu, Christina
last_name: Liu
- first_name: Felipe
full_name: Ferreira, Felipe
last_name: Ferreira
- first_name: Gabriek
full_name: Barcik, Gabriek
last_name: Barcik
- first_name: Gabriel
full_name: Ilharco, Gabriel
last_name: Ilharco
- first_name: Georg F
full_name: Osang, Georg F
id: 464B40D6-F248-11E8-B48F-1D18A9856A87
last_name: Osang
- first_name: Jannis
full_name: Bulian, Jannis
last_name: Bulian
- first_name: Jared
full_name: Frank, Jared
last_name: Frank
- first_name: Lucas
full_name: Smaira, Lucas
last_name: Smaira
- first_name: Qin
full_name: Cao, Qin
last_name: Cao
- first_name: Ricardo
full_name: Marino, Ricardo
last_name: Marino
- first_name: Roma
full_name: Patel, Roma
last_name: Patel
- first_name: Thomas
full_name: Leung, Thomas
last_name: Leung
- first_name: Vaiva
full_name: Imbrasaite, Vaiva
last_name: Imbrasaite
citation:
ama: 'Ilharco C, Shirazi A, Gopalan A, et al. Recognizing multimodal entailment.
In: 59th Annual Meeting of the Association for Computational Linguistics and
the 11th International Joint Conference on Natural Language Processing, Tutorial
Abstracts. Association for Computational Linguistics; 2021:29-30. doi:10.18653/v1/2021.acl-tutorials.6'
apa: 'Ilharco, C., Shirazi, A., Gopalan, A., Nagrani, A., Bratanič, B., Bregler,
C., … Imbrasaite, V. (2021). Recognizing multimodal entailment. In 59th Annual
Meeting of the Association for Computational Linguistics and the 11th International
Joint Conference on Natural Language Processing, Tutorial Abstracts (pp. 29–30).
Bangkok, Thailand: Association for Computational Linguistics. https://doi.org/10.18653/v1/2021.acl-tutorials.6'
chicago: Ilharco, Cesar, Afsaneh Shirazi, Arjun Gopalan, Arsha Nagrani, Blaž Bratanič,
Chris Bregler, Christina Liu, et al. “Recognizing Multimodal Entailment.” In 59th
Annual Meeting of the Association for Computational Linguistics and the 11th International
Joint Conference on Natural Language Processing, Tutorial Abstracts, 29–30.
Association for Computational Linguistics, 2021. https://doi.org/10.18653/v1/2021.acl-tutorials.6.
ieee: C. Ilharco et al., “Recognizing multimodal entailment,” in 59th
Annual Meeting of the Association for Computational Linguistics and the 11th International
Joint Conference on Natural Language Processing, Tutorial Abstracts, Bangkok,
Thailand, 2021, pp. 29–30.
ista: 'Ilharco C, Shirazi A, Gopalan A, Nagrani A, Bratanič B, Bregler C, Liu C,
Ferreira F, Barcik G, Ilharco G, Osang GF, Bulian J, Frank J, Smaira L, Cao Q,
Marino R, Patel R, Leung T, Imbrasaite V. 2021. Recognizing multimodal entailment.
59th Annual Meeting of the Association for Computational Linguistics and the 11th
International Joint Conference on Natural Language Processing, Tutorial Abstracts.
ACL: Association for Computational Linguistics ; IJCNLP: International Joint Conference
on Natural Language Processing, 29–30.'
mla: Ilharco, Cesar, et al. “Recognizing Multimodal Entailment.” 59th Annual
Meeting of the Association for Computational Linguistics and the 11th International
Joint Conference on Natural Language Processing, Tutorial Abstracts, Association
for Computational Linguistics, 2021, pp. 29–30, doi:10.18653/v1/2021.acl-tutorials.6.
short: C. Ilharco, A. Shirazi, A. Gopalan, A. Nagrani, B. Bratanič, C. Bregler,
C. Liu, F. Ferreira, G. Barcik, G. Ilharco, G.F. Osang, J. Bulian, J. Frank, L.
Smaira, Q. Cao, R. Marino, R. Patel, T. Leung, V. Imbrasaite, in:, 59th Annual
Meeting of the Association for Computational Linguistics and the 11th International
Joint Conference on Natural Language Processing, Tutorial Abstracts, Association
for Computational Linguistics, 2021, pp. 29–30.
conference:
end_date: 2021-08-06
location: Bangkok, Thailand
name: 'ACL: Association for Computational Linguistics ; IJCNLP: International Joint
Conference on Natural Language Processing'
start_date: 2021-08-01
date_created: 2021-11-28T23:01:30Z
date_published: 2021-08-01T00:00:00Z
date_updated: 2022-01-26T14:26:36Z
day: '01'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.18653/v1/2021.acl-tutorials.6
file:
- access_level: open_access
checksum: b14052a025a6ecf675bdfe51db98c0d7
content_type: application/pdf
creator: cchlebak
date_created: 2021-11-29T08:41:00Z
date_updated: 2021-11-29T08:41:00Z
file_id: '10368'
file_name: 2021_ACL_Ilharco.pdf
file_size: 1227703
relation: main_file
success: 1
file_date_updated: 2021-11-29T08:41:00Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://aclanthology.org/2021.acl-tutorials.6/
month: '08'
oa: 1
oa_version: Published Version
page: 29-30
publication: 59th Annual Meeting of the Association for Computational Linguistics
and the 11th International Joint Conference on Natural Language Processing, Tutorial
Abstracts
publication_identifier:
isbn:
- 9-781-9540-8557-2
publication_status: published
publisher: Association for Computational Linguistics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Recognizing multimodal entailment
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: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
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.
corr_author: '1'
date_created: 2020-05-30T10:26:04Z
date_published: 2021-06-01T00:00:00Z
date_updated: 2025-04-15T06:53:15Z
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'
...