---
_id: '14499'
abstract:
- lang: eng
text: "An n-vertex graph is called C-Ramsey if it has no clique or independent set
of size Clog2n (i.e., if it has near-optimal Ramsey behavior). In this paper,
we study edge statistics in Ramsey graphs, in particular obtaining very precise
control of the distribution of the number of edges in a random vertex subset of
a C-Ramsey graph. This brings together two ongoing lines of research: the study
of ‘random-like’ properties of Ramsey graphs and the study of small-ball probability
for low-degree polynomials of independent random variables.\r\n\r\nThe proof proceeds
via an ‘additive structure’ dichotomy on the degree sequence and involves a wide
range of different tools from Fourier analysis, random matrix theory, the theory
of Boolean functions, probabilistic combinatorics and low-rank approximation.
In particular, a key ingredient is a new sharpened version of the quadratic Carbery–Wright
theorem on small-ball probability for polynomials of Gaussians, which we believe
is of independent interest. One of the consequences of our result is the resolution
of an old conjecture of Erdős and McKay, for which Erdős reiterated in several
of his open problem collections and for which he offered one of his notorious
monetary prizes."
acknowledgement: Kwan was supported for part of this work by ERC Starting Grant ‘RANDSTRUCT’
No. 101076777. Sah and Sawhney were supported by NSF Graduate Research Fellowship
Program DGE-2141064. Sah was supported by the PD Soros Fellowship. Sauermann was
supported by NSF Award DMS-2100157, and for part of this work by a Sloan Research
Fellowship.
article_number: e21
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Matthew Alan
full_name: Kwan, Matthew Alan
id: 5fca0887-a1db-11eb-95d1-ca9d5e0453b3
last_name: Kwan
orcid: 0000-0002-4003-7567
- first_name: Ashwin
full_name: Sah, Ashwin
last_name: Sah
- first_name: Lisa
full_name: Sauermann, Lisa
last_name: Sauermann
- first_name: Mehtaab
full_name: Sawhney, Mehtaab
last_name: Sawhney
citation:
ama: Kwan MA, Sah A, Sauermann L, Sawhney M. Anticoncentration in Ramsey graphs
and a proof of the Erdős–McKay conjecture. Forum of Mathematics, Pi. 2023;11.
doi:10.1017/fmp.2023.17
apa: Kwan, M. A., Sah, A., Sauermann, L., & Sawhney, M. (2023). Anticoncentration
in Ramsey graphs and a proof of the Erdős–McKay conjecture. Forum of Mathematics,
Pi. Cambridge University Press. https://doi.org/10.1017/fmp.2023.17
chicago: Kwan, Matthew Alan, Ashwin Sah, Lisa Sauermann, and Mehtaab Sawhney. “Anticoncentration
in Ramsey Graphs and a Proof of the Erdős–McKay Conjecture.” Forum of Mathematics,
Pi. Cambridge University Press, 2023. https://doi.org/10.1017/fmp.2023.17.
ieee: M. A. Kwan, A. Sah, L. Sauermann, and M. Sawhney, “Anticoncentration in Ramsey
graphs and a proof of the Erdős–McKay conjecture,” Forum of Mathematics, Pi,
vol. 11. Cambridge University Press, 2023.
ista: Kwan MA, Sah A, Sauermann L, Sawhney M. 2023. Anticoncentration in Ramsey
graphs and a proof of the Erdős–McKay conjecture. Forum of Mathematics, Pi. 11,
e21.
mla: Kwan, Matthew Alan, et al. “Anticoncentration in Ramsey Graphs and a Proof
of the Erdős–McKay Conjecture.” Forum of Mathematics, Pi, vol. 11, e21,
Cambridge University Press, 2023, doi:10.1017/fmp.2023.17.
short: M.A. Kwan, A. Sah, L. Sauermann, M. Sawhney, Forum of Mathematics, Pi 11
(2023).
corr_author: '1'
date_created: 2023-11-07T09:02:48Z
date_published: 2023-08-24T00:00:00Z
date_updated: 2025-09-09T13:16:15Z
day: '24'
ddc:
- '510'
department:
- _id: MaKw
doi: 10.1017/fmp.2023.17
external_id:
arxiv:
- '2208.02874'
isi:
- '001123866200001'
file:
- access_level: open_access
checksum: 54b824098d59073cc87a308d458b0a3e
content_type: application/pdf
creator: dernst
date_created: 2023-11-07T09:16:23Z
date_updated: 2023-11-07T09:16:23Z
file_id: '14500'
file_name: 2023_ForumMathematics_Kwan.pdf
file_size: 1218719
relation: main_file
success: 1
file_date_updated: 2023-11-07T09:16:23Z
has_accepted_license: '1'
intvolume: ' 11'
isi: 1
keyword:
- Discrete Mathematics and Combinatorics
- Geometry and Topology
- Mathematical Physics
- Statistics and Probability
- Algebra and Number Theory
- Analysis
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: bd95085b-d553-11ed-ba76-e55d3349be45
grant_number: '101076777'
name: Randomness and structure in combinatorics
publication: Forum of Mathematics, Pi
publication_identifier:
issn:
- 2050-5086
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 11
year: '2023'
...
---
_id: '12287'
abstract:
- lang: eng
text: We present criteria for establishing a triangulation of a manifold. Given
a manifold M, a simplicial complex A, and a map H from the underlying space of
A to M, our criteria are presented in local coordinate charts for M, and ensure
that H is a homeomorphism. These criteria do not require a differentiable structure,
or even an explicit metric on M. No Delaunay property of A is assumed. The result
provides a triangulation guarantee for algorithms that construct a simplicial
complex by working in local coordinate patches. Because the criteria are easily
verified in such a setting, they are expected to be of general use.
acknowledgement: "This 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). Arijit Ghosh is supported by Ramanujan
Fellowship (No. SB/S2/RJN-064/2015). Part of this work was done when Arijit Ghosh
was a Researcher at Max-Planck-Institute for Informatics, Germany, supported by
the IndoGerman Max Planck Center for Computer Science (IMPECS). 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 and the Austrian
Science Fund (FWF): M-3073. A part of the results described in this paper were presented
at SoCG 2018 and in [3]. \r\nOpen access funding provided by the Austrian Science
Fund (FWF)."
article_processing_charge: No
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: 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, Wintraecken M. Local criteria for triangulating
general manifolds. Discrete & Computational Geometry. 2023;69:156-191.
doi:10.1007/s00454-022-00431-7
apa: Boissonnat, J.-D., Dyer, R., Ghosh, A., & Wintraecken, M. (2023). Local
criteria for triangulating general manifolds. Discrete & Computational
Geometry. Springer Nature. https://doi.org/10.1007/s00454-022-00431-7
chicago: Boissonnat, Jean-Daniel, Ramsay Dyer, Arijit Ghosh, and Mathijs Wintraecken.
“Local Criteria for Triangulating General Manifolds.” Discrete & Computational
Geometry. Springer Nature, 2023. https://doi.org/10.1007/s00454-022-00431-7.
ieee: J.-D. Boissonnat, R. Dyer, A. Ghosh, and M. Wintraecken, “Local criteria for
triangulating general manifolds,” Discrete & Computational Geometry,
vol. 69. Springer Nature, pp. 156–191, 2023.
ista: Boissonnat J-D, Dyer R, Ghosh A, Wintraecken M. 2023. Local criteria for triangulating
general manifolds. Discrete & Computational Geometry. 69, 156–191.
mla: Boissonnat, Jean-Daniel, et al. “Local Criteria for Triangulating General Manifolds.”
Discrete & Computational Geometry, vol. 69, Springer Nature, 2023,
pp. 156–91, doi:10.1007/s00454-022-00431-7.
short: J.-D. Boissonnat, R. Dyer, A. Ghosh, M. Wintraecken, Discrete & Computational
Geometry 69 (2023) 156–191.
corr_author: '1'
date_created: 2023-01-16T10:04:06Z
date_published: 2023-01-01T00:00:00Z
date_updated: 2025-04-14T07:44:00Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1007/s00454-022-00431-7
ec_funded: 1
external_id:
isi:
- '000862193600001'
file:
- access_level: open_access
checksum: 46352e0ee71e460848f88685ca852681
content_type: application/pdf
creator: dernst
date_created: 2023-02-02T11:01:10Z
date_updated: 2023-02-02T11:01:10Z
file_id: '12488'
file_name: 2023_DiscreteCompGeometry_Boissonnat.pdf
file_size: 582850
relation: main_file
success: 1
file_date_updated: 2023-02-02T11:01:10Z
has_accepted_license: '1'
intvolume: ' 69'
isi: 1
keyword:
- Computational Theory and Mathematics
- Discrete Mathematics and Combinatorics
- Geometry and Topology
- Theoretical Computer Science
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 156-191
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: fc390959-9c52-11eb-aca3-afa58bd282b2
grant_number: M03073
name: Learning and triangulating manifolds via collapses
publication: Discrete & 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 criteria for triangulating general manifolds
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: 69
year: '2023'
...
---
_id: '12129'
abstract:
- lang: eng
text: 'Given a finite point set P in general position in the plane, a full triangulation
of P is a maximal straight-line embedded plane graph on P. A partial triangulation
of P is a full triangulation of some subset P′ of P containing all extreme points
in P. A bistellar flip on a partial triangulation either flips an edge (called
edge flip), removes a non-extreme point of degree 3, or adds a point in P∖P′ as
vertex of degree 3. The bistellar flip graph has all partial triangulations as
vertices, and a pair of partial triangulations is adjacent if they can be obtained
from one another by a bistellar flip. The edge flip graph is defined with full
triangulations as vertices, and edge flips determining the adjacencies. Lawson
showed in the early seventies that these graphs are connected. The goal of this
paper is to investigate the structure of these graphs, with emphasis on their
vertex connectivity. For sets P of n points in the plane in general position,
we show that the edge flip graph is ⌈n/2−2⌉-vertex connected, and the bistellar
flip graph is (n−3)-vertex connected; both results are tight. The latter bound
matches the situation for the subfamily of regular triangulations (i.e., partial
triangulations obtained by lifting the points to 3-space and projecting back the
lower convex hull), where (n−3)-vertex connectivity has been known since the late
eighties through the secondary polytope due to Gelfand, Kapranov, & Zelevinsky
and Balinski’s Theorem. For the edge flip-graph, we additionally show that the
vertex connectivity is at least as large as (and hence equal to) the minimum degree
(i.e., the minimum number of flippable edges in any full triangulation), provided
that n is large enough. Our methods also yield several other results: (i) The
edge flip graph can be covered by graphs of polytopes of dimension ⌈n/2−2⌉ (products
of associahedra) and the bistellar flip graph can be covered by graphs of polytopes
of dimension n−3 (products of secondary polytopes). (ii) A partial triangulation
is regular, if it has distance n−3 in the Hasse diagram of the partial order of
partial subdivisions from the trivial subdivision. (iii) All partial triangulations
of a point set are regular iff the partial order of partial subdivisions has height
n−3. (iv) There are arbitrarily large sets P with non-regular partial triangulations
and such that every proper subset has only regular triangulations, i.e., there
are no small certificates for the existence of non-regular triangulations.'
acknowledgement: "This is a full and revised version of [38] (on partial triangulations)
in Proceedings of the 36th Annual International Symposium on Computational Geometry
(SoCG‘20) and of some of the results in [37] (on full triangulations) in Proceedings
of the 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA‘20).\r\nThis
research started at the 11th Gremo’s Workshop on Open Problems (GWOP), Alp Sellamatt,
Switzerland, June 24–28, 2013, motivated by a question posed by Filip Mori´c on
full triangulations. Research was supported by the Swiss National Science Foundation
within the collaborative DACH project Arrangements and Drawings as SNSF Project
200021E-171681, and by IST Austria and Berlin Free University during a sabbatical
stay of the second author. We thank Michael Joswig, Jesús De Loera, and Francisco
Santos for helpful discussions on the topics of this paper, and Daniel Bertschinger
and Valentin Stoppiello for carefully reading earlier versions and for many helpful
comments.\r\nOpen access funding provided by the Swiss Federal Institute of Technology
Zürich"
article_processing_charge: No
article_type: original
author:
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
- first_name: Emo
full_name: Welzl, Emo
last_name: Welzl
citation:
ama: Wagner U, Welzl E. Connectivity of triangulation flip graphs in the plane.
Discrete & Computational Geometry. 2022;68(4):1227-1284. doi:10.1007/s00454-022-00436-2
apa: Wagner, U., & Welzl, E. (2022). Connectivity of triangulation flip graphs
in the plane. Discrete & Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-022-00436-2
chicago: Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs
in the Plane.” Discrete & Computational Geometry. Springer Nature,
2022. https://doi.org/10.1007/s00454-022-00436-2.
ieee: U. Wagner and E. Welzl, “Connectivity of triangulation flip graphs in the
plane,” Discrete & Computational Geometry, vol. 68, no. 4. Springer
Nature, pp. 1227–1284, 2022.
ista: Wagner U, Welzl E. 2022. Connectivity of triangulation flip graphs in the
plane. Discrete & Computational Geometry. 68(4), 1227–1284.
mla: Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the
Plane.” Discrete & Computational Geometry, vol. 68, no. 4, Springer
Nature, 2022, pp. 1227–84, doi:10.1007/s00454-022-00436-2.
short: U. Wagner, E. Welzl, Discrete & Computational Geometry 68 (2022) 1227–1284.
corr_author: '1'
date_created: 2023-01-12T12:02:28Z
date_published: 2022-11-14T00:00:00Z
date_updated: 2025-07-10T11:54:56Z
day: '14'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.1007/s00454-022-00436-2
external_id:
isi:
- '000883222200003'
file:
- access_level: open_access
checksum: 307e879d09e52eddf5b225d0aaa9213a
content_type: application/pdf
creator: dernst
date_created: 2023-01-23T11:10:03Z
date_updated: 2023-01-23T11:10:03Z
file_id: '12345'
file_name: 2022_DiscreteCompGeometry_Wagner.pdf
file_size: 1747581
relation: main_file
success: 1
file_date_updated: 2023-01-23T11:10:03Z
has_accepted_license: '1'
intvolume: ' 68'
isi: 1
issue: '4'
keyword:
- Computational Theory and Mathematics
- Discrete Mathematics and Combinatorics
- Geometry and Topology
- Theoretical Computer Science
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 1227-1284
publication: Discrete & Computational Geometry
publication_identifier:
eissn:
- 1432-0444
issn:
- 0179-5376
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '7807'
relation: earlier_version
status: public
- id: '7990'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Connectivity of triangulation flip graphs in the plane
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: 68
year: '2022'
...
---
_id: '12148'
abstract:
- lang: eng
text: 'We prove a general local law for Wigner matrices that optimally handles observables
of arbitrary rank and thus unifies the well-known averaged and isotropic local
laws. As an application, we prove a central limit theorem in quantum unique ergodicity
(QUE): that is, we show that the quadratic forms of a general deterministic matrix
A on the bulk eigenvectors of a Wigner matrix have approximately Gaussian fluctuation.
For the bulk spectrum, we thus generalise our previous result [17] as valid for
test matrices A of large rank as well as the result of Benigni and Lopatto [7]
as valid for specific small-rank observables.'
acknowledgement: L.E. acknowledges support by ERC Advanced Grant ‘RMTBeyond’ No. 101020331.
D.S. acknowledges the support of Dr. Max Rössler, the Walter Haefner Foundation
and the ETH Zürich Foundation.
article_number: e96
article_processing_charge: No
article_type: original
author:
- first_name: Giorgio
full_name: Cipolloni, Giorgio
id: 42198EFA-F248-11E8-B48F-1D18A9856A87
last_name: Cipolloni
orcid: 0000-0002-4901-7992
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Dominik J
full_name: Schröder, Dominik J
id: 408ED176-F248-11E8-B48F-1D18A9856A87
last_name: Schröder
orcid: 0000-0002-2904-1856
citation:
ama: Cipolloni G, Erdös L, Schröder DJ. Rank-uniform local law for Wigner matrices.
Forum of Mathematics, Sigma. 2022;10. doi:10.1017/fms.2022.86
apa: Cipolloni, G., Erdös, L., & Schröder, D. J. (2022). Rank-uniform local
law for Wigner matrices. Forum of Mathematics, Sigma. Cambridge University
Press. https://doi.org/10.1017/fms.2022.86
chicago: Cipolloni, Giorgio, László Erdös, and Dominik J Schröder. “Rank-Uniform
Local Law for Wigner Matrices.” Forum of Mathematics, Sigma. Cambridge
University Press, 2022. https://doi.org/10.1017/fms.2022.86.
ieee: G. Cipolloni, L. Erdös, and D. J. Schröder, “Rank-uniform local law for Wigner
matrices,” Forum of Mathematics, Sigma, vol. 10. Cambridge University Press,
2022.
ista: Cipolloni G, Erdös L, Schröder DJ. 2022. Rank-uniform local law for Wigner
matrices. Forum of Mathematics, Sigma. 10, e96.
mla: Cipolloni, Giorgio, et al. “Rank-Uniform Local Law for Wigner Matrices.” Forum
of Mathematics, Sigma, vol. 10, e96, Cambridge University Press, 2022, doi:10.1017/fms.2022.86.
short: G. Cipolloni, L. Erdös, D.J. Schröder, Forum of Mathematics, Sigma 10 (2022).
corr_author: '1'
date_created: 2023-01-12T12:07:30Z
date_published: 2022-10-27T00:00:00Z
date_updated: 2025-04-14T07:57:18Z
day: '27'
ddc:
- '510'
department:
- _id: LaEr
doi: 10.1017/fms.2022.86
ec_funded: 1
external_id:
isi:
- '000873719200001'
file:
- access_level: open_access
checksum: 94a049aeb1eea5497aa097712a73c400
content_type: application/pdf
creator: dernst
date_created: 2023-01-24T10:02:40Z
date_updated: 2023-01-24T10:02:40Z
file_id: '12356'
file_name: 2022_ForumMath_Cipolloni.pdf
file_size: 817089
relation: main_file
success: 1
file_date_updated: 2023-01-24T10:02:40Z
has_accepted_license: '1'
intvolume: ' 10'
isi: 1
keyword:
- Computational Mathematics
- Discrete Mathematics and Combinatorics
- Geometry and Topology
- Mathematical Physics
- Statistics and Probability
- Algebra and Number Theory
- Theoretical Computer Science
- Analysis
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: 62796744-2b32-11ec-9570-940b20777f1d
call_identifier: H2020
grant_number: '101020331'
name: Random matrices beyond Wigner-Dyson-Mehta
publication: Forum of Mathematics, Sigma
publication_identifier:
issn:
- 2050-5094
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Rank-uniform local law for Wigner matrices
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: 10
year: '2022'
...
---
_id: '12216'
abstract:
- lang: eng
text: Many trace inequalities can be expressed either as concavity/convexity theorems
or as monotonicity theorems. A classic example is the joint convexity of the quantum
relative entropy which is equivalent to the Data Processing Inequality. The latter
says that quantum operations can never increase the relative entropy. The monotonicity
versions often have many advantages, and often have direct physical application,
as in the example just mentioned. Moreover, the monotonicity results are often
valid for a larger class of maps than, say, quantum operations (which are completely
positive). In this paper we prove several new monotonicity results, the first
of which is a monotonicity theorem that has as a simple corollary a celebrated
concavity theorem of Epstein. Our starting points are the monotonicity versions
of the Lieb Concavity and the Lieb Convexity Theorems. We also give two new proofs
of these in their general forms using interpolation. We then prove our new monotonicity
theorems by several duality arguments.
acknowledgement: Work partially supported by the Lise Meitner fellowship, Austrian
Science Fund (FWF) M3337.
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Eric A.
full_name: Carlen, Eric A.
last_name: Carlen
- first_name: Haonan
full_name: Zhang, Haonan
id: D8F41E38-9E66-11E9-A9E2-65C2E5697425
last_name: Zhang
citation:
ama: Carlen EA, Zhang H. Monotonicity versions of Epstein’s concavity theorem and
related inequalities. Linear Algebra and its Applications. 2022;654:289-310.
doi:10.1016/j.laa.2022.09.001
apa: Carlen, E. A., & Zhang, H. (2022). Monotonicity versions of Epstein’s concavity
theorem and related inequalities. Linear Algebra and Its Applications.
Elsevier. https://doi.org/10.1016/j.laa.2022.09.001
chicago: Carlen, Eric A., and Haonan Zhang. “Monotonicity Versions of Epstein’s
Concavity Theorem and Related Inequalities.” Linear Algebra and Its Applications.
Elsevier, 2022. https://doi.org/10.1016/j.laa.2022.09.001.
ieee: E. A. Carlen and H. Zhang, “Monotonicity versions of Epstein’s concavity theorem
and related inequalities,” Linear Algebra and its Applications, vol. 654.
Elsevier, pp. 289–310, 2022.
ista: Carlen EA, Zhang H. 2022. Monotonicity versions of Epstein’s concavity theorem
and related inequalities. Linear Algebra and its Applications. 654, 289–310.
mla: Carlen, Eric A., and Haonan Zhang. “Monotonicity Versions of Epstein’s Concavity
Theorem and Related Inequalities.” Linear Algebra and Its Applications,
vol. 654, Elsevier, 2022, pp. 289–310, doi:10.1016/j.laa.2022.09.001.
short: E.A. Carlen, H. Zhang, Linear Algebra and Its Applications 654 (2022) 289–310.
corr_author: '1'
date_created: 2023-01-16T09:46:38Z
date_published: 2022-12-01T00:00:00Z
date_updated: 2025-04-14T13:05:27Z
day: '01'
ddc:
- '510'
department:
- _id: JaMa
doi: 10.1016/j.laa.2022.09.001
external_id:
isi:
- '000860689600014'
file:
- access_level: open_access
checksum: cf3cb7e7e34baa967849f01d8f0c1ae4
content_type: application/pdf
creator: dernst
date_created: 2023-01-27T08:08:39Z
date_updated: 2023-01-27T08:08:39Z
file_id: '12415'
file_name: 2022_LinearAlgebra_Carlen.pdf
file_size: 441184
relation: main_file
success: 1
file_date_updated: 2023-01-27T08:08:39Z
has_accepted_license: '1'
intvolume: ' 654'
isi: 1
keyword:
- Discrete Mathematics and Combinatorics
- Geometry and Topology
- Numerical Analysis
- Algebra and Number Theory
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 289-310
project:
- _id: eb958bca-77a9-11ec-83b8-c565cb50d8d6
grant_number: M03337
name: Curvature-dimension in noncommutative analysis
publication: Linear Algebra and its Applications
publication_identifier:
issn:
- 0024-3795
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Monotonicity versions of Epstein's concavity theorem and related inequalities
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: 654
year: '2022'
...
---
_id: '12286'
abstract:
- lang: eng
text: "Inspired by the study of loose cycles in hypergraphs, we define the loose
core in hypergraphs as a structurewhich mirrors the close relationship between
cycles and $2$-cores in graphs. We prove that in the $r$-uniform binomial random
hypergraph $H^r(n,p)$, the order of the loose core undergoes a phase transition
at a certain critical threshold and determine this order, as well as the number
of edges, asymptotically in the subcritical and supercritical regimes.
\r\nOur
main tool is an algorithm called CoreConstruct, which enables us to analyse a
peeling process for the loose core. By analysing this algorithm we determine the
asymptotic degree distribution of vertices in the loose core and in particular
how many vertices and edges the loose core contains. As a corollary we obtain
an improved upper bound on the length of the longest loose cycle in $H^r(n,p)$."
acknowledgement: 'Supported by Austrian Science Fund (FWF): I3747, W1230.'
article_number: P4.13
article_processing_charge: No
article_type: original
author:
- first_name: Oliver
full_name: Cooley, Oliver
id: 43f4ddd0-a46b-11ec-8df6-ef3703bd721d
last_name: Cooley
- first_name: Mihyun
full_name: Kang, Mihyun
last_name: Kang
- first_name: Julian
full_name: Zalla, Julian
last_name: Zalla
citation:
ama: Cooley O, Kang M, Zalla J. Loose cores and cycles in random hypergraphs. The
Electronic Journal of Combinatorics. 2022;29(4). doi:10.37236/10794
apa: Cooley, O., Kang, M., & Zalla, J. (2022). Loose cores and cycles in random
hypergraphs. The Electronic Journal of Combinatorics. The Electronic Journal
of Combinatorics. https://doi.org/10.37236/10794
chicago: Cooley, Oliver, Mihyun Kang, and Julian Zalla. “Loose Cores and Cycles
in Random Hypergraphs.” The Electronic Journal of Combinatorics. The Electronic
Journal of Combinatorics, 2022. https://doi.org/10.37236/10794.
ieee: O. Cooley, M. Kang, and J. Zalla, “Loose cores and cycles in random hypergraphs,”
The Electronic Journal of Combinatorics, vol. 29, no. 4. The Electronic
Journal of Combinatorics, 2022.
ista: Cooley O, Kang M, Zalla J. 2022. Loose cores and cycles in random hypergraphs.
The Electronic Journal of Combinatorics. 29(4), P4.13.
mla: Cooley, Oliver, et al. “Loose Cores and Cycles in Random Hypergraphs.” The
Electronic Journal of Combinatorics, vol. 29, no. 4, P4.13, The Electronic
Journal of Combinatorics, 2022, doi:10.37236/10794.
short: O. Cooley, M. Kang, J. Zalla, The Electronic Journal of Combinatorics 29
(2022).
date_created: 2023-01-16T10:03:57Z
date_published: 2022-10-21T00:00:00Z
date_updated: 2023-08-04T10:29:18Z
day: '21'
ddc:
- '510'
department:
- _id: MaKw
doi: 10.37236/10794
external_id:
isi:
- '000876763300001'
file:
- access_level: open_access
checksum: 00122b2459f09b5ae43073bfba565e94
content_type: application/pdf
creator: dernst
date_created: 2023-01-30T11:45:13Z
date_updated: 2023-01-30T11:45:13Z
file_id: '12462'
file_name: 2022_ElecJournCombinatorics_Cooley_Kang_Zalla.pdf
file_size: 626953
relation: main_file
success: 1
file_date_updated: 2023-01-30T11:45:13Z
has_accepted_license: '1'
intvolume: ' 29'
isi: 1
issue: '4'
keyword:
- Computational Theory and Mathematics
- Geometry and Topology
- Theoretical Computer Science
- Applied Mathematics
- Discrete Mathematics and Combinatorics
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nd/4.0/
month: '10'
oa: 1
oa_version: Published Version
publication: The Electronic Journal of Combinatorics
publication_identifier:
eissn:
- 1077-8926
publication_status: published
publisher: The Electronic Journal of Combinatorics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Loose cores and cycles in random hypergraphs
tmp:
image: /image/cc_by_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
short: CC BY-ND (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 29
year: '2022'
...
---
_id: '10643'
abstract:
- lang: eng
text: "We prove a generalised super-adiabatic theorem for extended fermionic systems
assuming a spectral gap only in the bulk. More precisely, we assume that the infinite
system has a unique ground state and that the corresponding Gelfand–Naimark–Segal
Hamiltonian has a spectral gap above its eigenvalue zero. Moreover, we show that
a similar adiabatic theorem also holds in the bulk of finite systems up to errors
that vanish faster than any inverse power of the system size, although the corresponding
finite-volume Hamiltonians need not have a spectral gap.\r\n\r\n"
acknowledgement: J.H. acknowledges partial financial support by the ERC Advanced Grant
‘RMTBeyond’ No. 101020331. Support for publication costs from the Deutsche Forschungsgemeinschaft
and the Open Access Publishing Fund of the University of Tübingen is gratefully
acknowledged.
article_number: e4
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Sven Joscha
full_name: Henheik, Sven Joscha
id: 31d731d7-d235-11ea-ad11-b50331c8d7fb
last_name: Henheik
orcid: 0000-0003-1106-327X
- first_name: Stefan
full_name: Teufel, Stefan
last_name: Teufel
citation:
ama: 'Henheik SJ, Teufel S. Adiabatic theorem in the thermodynamic limit: Systems
with a gap in the bulk. Forum of Mathematics, Sigma. 2022;10. doi:10.1017/fms.2021.80'
apa: 'Henheik, S. J., & Teufel, S. (2022). Adiabatic theorem in the thermodynamic
limit: Systems with a gap in the bulk. Forum of Mathematics, Sigma. Cambridge
University Press. https://doi.org/10.1017/fms.2021.80'
chicago: 'Henheik, Sven Joscha, and Stefan Teufel. “Adiabatic Theorem in the Thermodynamic
Limit: Systems with a Gap in the Bulk.” Forum of Mathematics, Sigma. Cambridge
University Press, 2022. https://doi.org/10.1017/fms.2021.80.'
ieee: 'S. J. Henheik and S. Teufel, “Adiabatic theorem in the thermodynamic limit:
Systems with a gap in the bulk,” Forum of Mathematics, Sigma, vol. 10.
Cambridge University Press, 2022.'
ista: 'Henheik SJ, Teufel S. 2022. Adiabatic theorem in the thermodynamic limit:
Systems with a gap in the bulk. Forum of Mathematics, Sigma. 10, e4.'
mla: 'Henheik, Sven Joscha, and Stefan Teufel. “Adiabatic Theorem in the Thermodynamic
Limit: Systems with a Gap in the Bulk.” Forum of Mathematics, Sigma, vol.
10, e4, Cambridge University Press, 2022, doi:10.1017/fms.2021.80.'
short: S.J. Henheik, S. Teufel, Forum of Mathematics, Sigma 10 (2022).
corr_author: '1'
date_created: 2022-01-18T16:18:51Z
date_published: 2022-01-18T00:00:00Z
date_updated: 2025-04-14T07:57:17Z
day: '18'
ddc:
- '510'
department:
- _id: GradSch
- _id: LaEr
doi: 10.1017/fms.2021.80
ec_funded: 1
external_id:
arxiv:
- '2012.15239'
isi:
- '000743615000001'
file:
- access_level: open_access
checksum: 87592a755adcef22ea590a99dc728dd3
content_type: application/pdf
creator: cchlebak
date_created: 2022-01-19T09:27:43Z
date_updated: 2022-01-19T09:27:43Z
file_id: '10646'
file_name: 2022_ForumMathSigma_Henheik.pdf
file_size: 705323
relation: main_file
success: 1
file_date_updated: 2022-01-19T09:27:43Z
has_accepted_license: '1'
intvolume: ' 10'
isi: 1
keyword:
- computational mathematics
- discrete mathematics and combinatorics
- geometry and topology
- mathematical physics
- statistics and probability
- algebra and number theory
- theoretical computer science
- analysis
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 62796744-2b32-11ec-9570-940b20777f1d
call_identifier: H2020
grant_number: '101020331'
name: Random matrices beyond Wigner-Dyson-Mehta
publication: Forum of Mathematics, Sigma
publication_identifier:
eissn:
- 2050-5094
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Adiabatic theorem in the thermodynamic limit: Systems with a gap in the bulk'
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: 10
year: '2022'
...
---
_id: '11135'
abstract:
- lang: eng
text: We consider a correlated NxN Hermitian random matrix with a polynomially decaying
metric correlation structure. By calculating the trace of the moments of the matrix
and using the summable decay of the cumulants, we show that its operator norm
is stochastically dominated by one.
article_number: '2250036'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Jana
full_name: Reker, Jana
id: e796e4f9-dc8d-11ea-abe3-97e26a0323e9
last_name: Reker
citation:
ama: 'Reker J. On the operator norm of a Hermitian random matrix with correlated
entries. Random Matrices: Theory and Applications. 2022;11(4). doi:10.1142/s2010326322500368'
apa: 'Reker, J. (2022). On the operator norm of a Hermitian random matrix with correlated
entries. Random Matrices: Theory and Applications. World Scientific Publishing.
https://doi.org/10.1142/s2010326322500368'
chicago: 'Reker, Jana. “On the Operator Norm of a Hermitian Random Matrix with Correlated
Entries.” Random Matrices: Theory and Applications. World Scientific Publishing,
2022. https://doi.org/10.1142/s2010326322500368.'
ieee: 'J. Reker, “On the operator norm of a Hermitian random matrix with correlated
entries,” Random Matrices: Theory and Applications, vol. 11, no. 4. World
Scientific Publishing, 2022.'
ista: 'Reker J. 2022. On the operator norm of a Hermitian random matrix with correlated
entries. Random Matrices: Theory and Applications. 11(4), 2250036.'
mla: 'Reker, Jana. “On the Operator Norm of a Hermitian Random Matrix with Correlated
Entries.” Random Matrices: Theory and Applications, vol. 11, no. 4, 2250036,
World Scientific Publishing, 2022, doi:10.1142/s2010326322500368.'
short: 'J. Reker, Random Matrices: Theory and Applications 11 (2022).'
corr_author: '1'
date_created: 2022-04-08T07:11:12Z
date_published: 2022-10-01T00:00:00Z
date_updated: 2026-04-07T13:02:12Z
day: '01'
department:
- _id: GradSch
- _id: LaEr
doi: 10.1142/s2010326322500368
external_id:
arxiv:
- '2103.03906'
isi:
- '000848873800001'
intvolume: ' 11'
isi: 1
issue: '4'
keyword:
- Discrete Mathematics and Combinatorics
- Statistics
- Probability and Uncertainty
- Statistics and Probability
- Algebra and Number Theory
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.2103.03906'
month: '10'
oa: 1
oa_version: Preprint
publication: 'Random Matrices: Theory and Applications'
publication_identifier:
eissn:
- 2010-3271
issn:
- 2010-3263
publication_status: published
publisher: World Scientific Publishing
quality_controlled: '1'
related_material:
record:
- id: '17164'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: On the operator norm of a Hermitian random matrix with correlated entries
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 11
year: '2022'
...
---
_id: '11446'
abstract:
- lang: eng
text: Suppose that n is not a prime power and not twice a prime power. We prove
that for any Hausdorff compactum X with a free action of the symmetric group Sn,
there exists an Sn-equivariant map X→Rn whose image avoids the diagonal {(x,x,…,x)∈Rn∣x∈R}.
Previously, the special cases of this statement for certain X were usually proved
using the equivartiant obstruction theory. Such calculations are difficult and
may become infeasible past the first (primary) obstruction. We take a different
approach which allows us to prove the vanishing of all obstructions simultaneously.
The essential step in the proof is classifying the possible degrees of Sn-equivariant
maps from the boundary ∂Δn−1 of (n−1)-simplex to itself. Existence of equivariant
maps between spaces is important for many questions arising from discrete mathematics
and geometry, such as Kneser’s conjecture, the Square Peg conjecture, the Splitting
Necklace problem, and the Topological Tverberg conjecture, etc. We demonstrate
the utility of our result applying it to one such question, a specific instance
of envy-free division problem.
acknowledgement: S. Avvakumov has received funding from the European Research Council
under the European Union’s Seventh Framework Programme ERC Grant agreement ERC StG
716424–CASe. S. Kudrya was supported by the Austrian Academic Exchange Service (OeAD),
ICM-2019-13577.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Sergey
full_name: Avvakumov, Sergey
id: 3827DAC8-F248-11E8-B48F-1D18A9856A87
last_name: Avvakumov
orcid: 0000-0002-7840-5062
- first_name: Sergey
full_name: Kudrya, Sergey
id: ecf01965-d252-11ea-95a5-8ada5f6c6a67
last_name: Kudrya
citation:
ama: Avvakumov S, Kudrya S. Vanishing of all equivariant obstructions and the mapping
degree. Discrete & Computational Geometry. 2021;66(3):1202-1216. doi:10.1007/s00454-021-00299-z
apa: Avvakumov, S., & Kudrya, S. (2021). Vanishing of all equivariant obstructions
and the mapping degree. Discrete & Computational Geometry. Springer
Nature. https://doi.org/10.1007/s00454-021-00299-z
chicago: Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions
and the Mapping Degree.” Discrete & Computational Geometry. Springer
Nature, 2021. https://doi.org/10.1007/s00454-021-00299-z.
ieee: S. Avvakumov and S. Kudrya, “Vanishing of all equivariant obstructions and
the mapping degree,” Discrete & Computational Geometry, vol. 66, no.
3. Springer Nature, pp. 1202–1216, 2021.
ista: Avvakumov S, Kudrya S. 2021. Vanishing of all equivariant obstructions and
the mapping degree. Discrete & Computational Geometry. 66(3), 1202–1216.
mla: Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions
and the Mapping Degree.” Discrete & Computational Geometry, vol. 66,
no. 3, Springer Nature, 2021, pp. 1202–16, doi:10.1007/s00454-021-00299-z.
short: S. Avvakumov, S. Kudrya, Discrete & Computational Geometry 66 (2021)
1202–1216.
corr_author: '1'
date_created: 2022-06-17T08:45:15Z
date_published: 2021-10-01T00:00:00Z
date_updated: 2025-04-14T09:10:06Z
day: '01'
doi: 10.1007/s00454-021-00299-z
extern: '1'
external_id:
arxiv:
- '1910.12628'
intvolume: ' 66'
issue: '3'
keyword:
- Computational Theory and Mathematics
- Discrete Mathematics and Combinatorics
- Geometry and Topology
- Theoretical Computer Science
language:
- iso: eng
month: '10'
oa_version: Preprint
page: 1202-1216
publication: Discrete & Computational Geometry
publication_identifier:
eissn:
- 1432-0444
issn:
- 0179-5376
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '8182'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Vanishing of all equivariant obstructions and the mapping degree
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 66
year: '2021'
...
---
_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: '8940'
abstract:
- lang: eng
text: We quantise Whitney’s construction to prove the existence of a triangulation
for any C^2 manifold, so that we get an algorithm with explicit bounds. We also
give a new elementary proof, which is completely geometric.
acknowledgement: This 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 also received
funding from the European Union’s Horizon 2020 research and innovation programme
under the Marie Skłodowska-Curie Grant Agreement No. 754411. 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: Jean-Daniel
full_name: Boissonnat, Jean-Daniel
last_name: Boissonnat
- first_name: Siargey
full_name: Kachanovich, Siargey
last_name: Kachanovich
- 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, Kachanovich S, Wintraecken M. Triangulating submanifolds:
An elementary and quantified version of Whitney’s method. Discrete & Computational
Geometry. 2021;66(1):386-434. doi:10.1007/s00454-020-00250-8'
apa: 'Boissonnat, J.-D., Kachanovich, S., & Wintraecken, M. (2021). Triangulating
submanifolds: An elementary and quantified version of Whitney’s method. Discrete
& Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-020-00250-8'
chicago: 'Boissonnat, Jean-Daniel, Siargey Kachanovich, and Mathijs Wintraecken.
“Triangulating Submanifolds: An Elementary and Quantified Version of Whitney’s
Method.” Discrete & Computational Geometry. Springer Nature, 2021.
https://doi.org/10.1007/s00454-020-00250-8.'
ieee: 'J.-D. Boissonnat, S. Kachanovich, and M. Wintraecken, “Triangulating submanifolds:
An elementary and quantified version of Whitney’s method,” Discrete & Computational
Geometry, vol. 66, no. 1. Springer Nature, pp. 386–434, 2021.'
ista: 'Boissonnat J-D, Kachanovich S, Wintraecken M. 2021. Triangulating submanifolds:
An elementary and quantified version of Whitney’s method. Discrete & Computational
Geometry. 66(1), 386–434.'
mla: 'Boissonnat, Jean-Daniel, et al. “Triangulating Submanifolds: An Elementary
and Quantified Version of Whitney’s Method.” Discrete & Computational Geometry,
vol. 66, no. 1, Springer Nature, 2021, pp. 386–434, doi:10.1007/s00454-020-00250-8.'
short: J.-D. Boissonnat, S. Kachanovich, M. Wintraecken, Discrete & Computational
Geometry 66 (2021) 386–434.
corr_author: '1'
date_created: 2020-12-12T11:07:02Z
date_published: 2021-07-01T00:00:00Z
date_updated: 2025-04-14T07:43:50Z
day: '01'
ddc:
- '516'
department:
- _id: HeEd
doi: 10.1007/s00454-020-00250-8
ec_funded: 1
external_id:
isi:
- '000597770300001'
file:
- access_level: open_access
checksum: c848986091e56699dc12de85adb1e39c
content_type: application/pdf
creator: kschuh
date_created: 2021-08-06T09:52:29Z
date_updated: 2021-08-06T09:52:29Z
file_id: '9795'
file_name: 2021_DescreteCompGeopmetry_Boissonnat.pdf
file_size: 983307
relation: main_file
success: 1
file_date_updated: 2021-08-06T09:52:29Z
has_accepted_license: '1'
intvolume: ' 66'
isi: 1
issue: '1'
keyword:
- Theoretical Computer Science
- Computational Theory and Mathematics
- Geometry and Topology
- Discrete Mathematics and Combinatorics
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 386-434
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Discrete & 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: 'Triangulating submanifolds: An elementary and quantified version of Whitney’s
method'
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 66
year: '2021'
...
---
_id: '10878'
abstract:
- lang: eng
text: Starting from a microscopic model for a system of neurons evolving in time
which individually follow a stochastic integrate-and-fire type model, we study
a mean-field limit of the system. Our model is described by a system of SDEs with
discontinuous coefficients for the action potential of each neuron and takes into
account the (random) spatial configuration of neurons allowing the interaction
to depend on it. In the limit as the number of particles tends to infinity, we
obtain a nonlinear Fokker-Planck type PDE in two variables, with derivatives only
with respect to one variable and discontinuous coefficients. We also study strong
well-posedness of the system of SDEs and prove the existence and uniqueness of
a weak measure-valued solution to the PDE, obtained as the limit of the laws of
the empirical measures for the system of particles.
acknowledgement: "The second author has been partially supported by INdAM through
the GNAMPA Research\r\nProject (2017) “Sistemi stocastici singolari: buona posizione
e problemi di controllo”. The third\r\nauthor was partly funded by the Austrian
Science Fund (FWF) project F 65."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Franco
full_name: Flandoli, Franco
last_name: Flandoli
- first_name: Enrico
full_name: Priola, Enrico
last_name: Priola
- first_name: Giovanni A
full_name: Zanco, Giovanni A
id: 47491882-F248-11E8-B48F-1D18A9856A87
last_name: Zanco
citation:
ama: Flandoli F, Priola E, Zanco GA. A mean-field model with discontinuous coefficients
for neurons with spatial interaction. Discrete and Continuous Dynamical Systems.
2019;39(6):3037-3067. doi:10.3934/dcds.2019126
apa: Flandoli, F., Priola, E., & Zanco, G. A. (2019). A mean-field model with
discontinuous coefficients for neurons with spatial interaction. Discrete and
Continuous Dynamical Systems. American Institute of Mathematical Sciences.
https://doi.org/10.3934/dcds.2019126
chicago: Flandoli, Franco, Enrico Priola, and Giovanni A Zanco. “A Mean-Field Model
with Discontinuous Coefficients for Neurons with Spatial Interaction.” Discrete
and Continuous Dynamical Systems. American Institute of Mathematical Sciences,
2019. https://doi.org/10.3934/dcds.2019126.
ieee: F. Flandoli, E. Priola, and G. A. Zanco, “A mean-field model with discontinuous
coefficients for neurons with spatial interaction,” Discrete and Continuous
Dynamical Systems, vol. 39, no. 6. American Institute of Mathematical Sciences,
pp. 3037–3067, 2019.
ista: Flandoli F, Priola E, Zanco GA. 2019. A mean-field model with discontinuous
coefficients for neurons with spatial interaction. Discrete and Continuous Dynamical
Systems. 39(6), 3037–3067.
mla: Flandoli, Franco, et al. “A Mean-Field Model with Discontinuous Coefficients
for Neurons with Spatial Interaction.” Discrete and Continuous Dynamical Systems,
vol. 39, no. 6, American Institute of Mathematical Sciences, 2019, pp. 3037–67,
doi:10.3934/dcds.2019126.
short: F. Flandoli, E. Priola, G.A. Zanco, Discrete and Continuous Dynamical Systems
39 (2019) 3037–3067.
corr_author: '1'
date_created: 2022-03-18T12:33:34Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2025-04-15T08:31:32Z
day: '01'
department:
- _id: JaMa
doi: 10.3934/dcds.2019126
external_id:
arxiv:
- '1708.04156'
isi:
- '000459954800003'
intvolume: ' 39'
isi: 1
issue: '6'
keyword:
- Applied Mathematics
- Discrete Mathematics and Combinatorics
- Analysis
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1708.04156
month: '06'
oa: 1
oa_version: Preprint
page: 3037-3067
project:
- _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2
grant_number: F6504
name: Taming Complexity in Partial Differential Systems
publication: Discrete and Continuous Dynamical Systems
publication_identifier:
issn:
- 1553-5231
publication_status: published
publisher: American Institute of Mathematical Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: A mean-field model with discontinuous coefficients for neurons with spatial
interaction
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 39
year: '2019'
...