---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '22752'
abstract:
- lang: eng
text: "In this note we outline a new and simple approach to proving central limit
theorems for various ‘global’ graph parameters that have robust ‘local’ approximations,
using the Efron–Stein inequality, which relies on a combinatorial analysis of
the stability of these approximations under resampling an edge. As an application,
we give short proofs of a central limit theorem for the order of the giant component
and of the \U0001D458\r\n-core for sparse random graphs."
acknowledgement: This research was funded in whole or in part by the Austrian Science
Fund (FWF) [10.55776/P36131 (Joshua Erde), 10.55776/I6502 (Mihyun Kang), 10.55776/ESP3863424
(Michael Anastos)] and by the Swiss National Science Foundation (SNSF) [P500-2_235474]
(Vincent Pfenninger). For open access purposes, the authors have applied a CC BY
public copyright license to any author accepted manuscript version arising from
this submission. The authors thank the reviewers for helpful comments on the paper,
and for bringing the particular form of Theorem 2.2 to our attention.
article_number: e70464
article_processing_charge: Yes (in subscription journal)
article_type: original
arxiv: 1
author:
- first_name: Michael
full_name: Anastos, Michael
id: 0b2a4358-bb35-11ec-b7b9-e3279b593dbb
last_name: Anastos
- first_name: Joshua
full_name: Erde, Joshua
last_name: Erde
- first_name: Mihyun
full_name: Kang, Mihyun
last_name: Kang
- first_name: Vincent
full_name: Pfenninger, Vincent
last_name: Pfenninger
citation:
ama: Anastos M, Erde J, Kang M, Pfenninger V. A short proof of a central limit theorem
for the order of the giant component and k-core. Bulletin of the London Mathematical
Society. 2026;58(8). doi:10.1112/blms.70464
apa: Anastos, M., Erde, J., Kang, M., & Pfenninger, V. (2026). A short proof
of a central limit theorem for the order of the giant component and k-core. Bulletin
of the London Mathematical Society. Wiley. https://doi.org/10.1112/blms.70464
chicago: Anastos, Michael, Joshua Erde, Mihyun Kang, and Vincent Pfenninger. “A
Short Proof of a Central Limit Theorem for the Order of the Giant Component and
K-Core.” Bulletin of the London Mathematical Society. Wiley, 2026. https://doi.org/10.1112/blms.70464.
ieee: M. Anastos, J. Erde, M. Kang, and V. Pfenninger, “A short proof of a central
limit theorem for the order of the giant component and k-core,” Bulletin of
the London Mathematical Society, vol. 58, no. 8. Wiley, 2026.
ista: Anastos M, Erde J, Kang M, Pfenninger V. 2026. A short proof of a central
limit theorem for the order of the giant component and k-core. Bulletin of the
London Mathematical Society. 58(8), e70464.
mla: Anastos, Michael, et al. “A Short Proof of a Central Limit Theorem for the
Order of the Giant Component and K-Core.” Bulletin of the London Mathematical
Society, vol. 58, no. 8, e70464, Wiley, 2026, doi:10.1112/blms.70464.
short: M. Anastos, J. Erde, M. Kang, V. Pfenninger, Bulletin of the London Mathematical
Society 58 (2026).
das_tickbox: '0'
date_created: 2026-08-23T22:01:47Z
date_published: 2026-08-01T00:00:00Z
date_updated: 2026-09-07T13:56:17Z
day: '01'
ddc:
- '510'
department:
- _id: MaKw
doi: 10.1112/blms.70464
external_id:
arxiv:
- '2506.11651'
file:
- access_level: open_access
checksum: b4b21f05c3fc62fde243a5ddd46cef49
content_type: application/pdf
creator: dernst
date_created: 2026-09-07T13:53:26Z
date_updated: 2026-09-07T13:53:26Z
file_id: '22845'
file_name: 2026_BulletinLondonMathSoc_Anastos.pdf
file_size: 248641
relation: main_file
success: 1
file_date_updated: 2026-09-07T13:53:26Z
fulldoi: https://doi.org/10.1112/blms.70464
has_accepted_license: '1'
intvolume: ' 58'
issue: '8'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
mathsc:
- 05C80
- 60F05
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 8f906bd2-16d5-11f0-9cad-e07be8aa9ac9
grant_number: ESP3863424
name: Combinatorial Optimisation Problems on Sparse Random Graphs
publication: Bulletin of the London Mathematical Society
publication_identifier:
eissn:
- 1469-2120
issn:
- 0024-6093
publication_status: published
publisher: Wiley
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: A short proof of a central limit theorem for the order of the giant component
and k-core
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: 58
year: '2026'
...
---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '23123'
abstract:
- lang: eng
text: "How many points can be placed in an \U0001D45B × \U0001D45B grid sothat every
(affine) line contains at most \U0001D458 points? Weprove that for \U0001D45B
⩾ \U0001D458 ⩾ 1037 the maximum number ofpoints is exactly \U0001D458\U0001D45B.
Our proof builds on the recent workof Kovács, Nagy and Szabó (who proved an analogousresult
when \U0001D458 is at least about √\U0001D45B log \U0001D45B), incorporat-ing
ideas of Jain and Pham. Using the same approach,we also obtain new bounds for
higher-dimensionalextensions of this problem"
acknowledgement: We would like to thank Huy Pham for insightful discussions about
the proof approach, and wewould like to thank the anonymous referees for their careful
reading and helpful comments. Bothauthors are supported by ERC Starting Grant “RANDSTRUCT”
No. 101076777.Open Access funding provided by Institute of Science and Technology
Austria.
article_number: e70510
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Aleksandr
full_name: Grebennikov, Aleksandr
id: 776468ec-50b0-11ef-861e-96ad19e894f3
last_name: Grebennikov
- first_name: Matthew Alan
full_name: Kwan, Matthew Alan
id: 5fca0887-a1db-11eb-95d1-ca9d5e0453b3
last_name: Kwan
orcid: 0000-0002-4003-7567
citation:
ama: Grebennikov A, Kwan MA. No‐(k+1)‐in‐line problem for large constant k. Bulletin
of the London Mathematical Society. 2026;58(10). doi:10.1112/blms.70510
apa: Grebennikov, A., & Kwan, M. A. (2026). No‐(k+1)‐in‐line problem for large
constant k. Bulletin of the London Mathematical Society. Wiley. https://doi.org/10.1112/blms.70510
chicago: Grebennikov, Aleksandr, and Matthew Alan Kwan. “No‐(K+1)‐in‐line Problem
for Large Constant K.” Bulletin of the London Mathematical Society. Wiley,
2026. https://doi.org/10.1112/blms.70510.
ieee: A. Grebennikov and M. A. Kwan, “No‐(k+1)‐in‐line problem for large constant
k,” Bulletin of the London Mathematical Society, vol. 58, no. 10. Wiley,
2026.
ista: Grebennikov A, Kwan MA. 2026. No‐(k+1)‐in‐line problem for large constant
k. Bulletin of the London Mathematical Society. 58(10), e70510.
mla: Grebennikov, Aleksandr, and Matthew Alan Kwan. “No‐(K+1)‐in‐line Problem for
Large Constant K.” Bulletin of the London Mathematical Society, vol. 58,
no. 10, e70510, Wiley, 2026, doi:10.1112/blms.70510.
short: A. Grebennikov, M.A. Kwan, Bulletin of the London Mathematical Society 58
(2026).
corr_author: '1'
das_tickbox: '0'
date_created: 2026-10-12T13:57:47Z
date_published: 2026-10-01T00:00:00Z
date_updated: 2026-10-14T08:41:00Z
day: '01'
ddc:
- '510'
department:
- _id: MaKw
- _id: GradSch
doi: 10.1112/blms.70510
file:
- access_level: open_access
checksum: cce830e3fc66174803b91103f5b88a29
content_type: application/pdf
creator: dernst
date_created: 2026-10-14T08:37:16Z
date_updated: 2026-10-14T08:37:16Z
file_id: '23139'
file_name: 2026_BulletinLondonMathSoc_Grebennikov.pdf
file_size: 284851
relation: main_file
success: 1
file_date_updated: 2026-10-14T08:37:16Z
fulldoi: https://doi.org/10.1112/blms.70510
has_accepted_license: '1'
intvolume: ' 58'
issue: '10'
language:
- iso: eng
mathsc:
- 05D40
- 52C10
- 52C35
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: bd95085b-d553-11ed-ba76-e55d3349be45
grant_number: '101076777'
name: Randomness and structure in combinatorics
publication: Bulletin of the London Mathematical Society
publication_identifier:
eissn:
- 1469-2120
issn:
- 0024-6093
publication_status: published
publisher: Wiley
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: No‐(k+1)‐in‐line problem for large constant k
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: 58
year: '2026'
...
---
OA_place: publisher
OA_type: hybrid
_id: '22154'
abstract:
- lang: eng
text: 'The inertia bound and ratio bound (also known as the Cvetković bound and
Hoffman bound) are two fundamental inequalities in spectral graph theory, giving
upper bounds on the independence number a(G) of a graph G in terms of spectral
information about a weighted adjacency matrix of G. For both inequalities, given
a graph G, one needs to make a judicious choice of weighted adjacency matrix to
obtain as strong a bound as possible. While there is a well‐established theory
surrounding the ratio bound, the inertia bound is much more mysterious, and its
limits are rather unclear. In fact, only recently did Sinkovic find the first
example of a graph for which the inertia bound is not tight (for any weighted
adjacency matrix), answering a longstanding question of Godsil. We show that the
inertia bound can be extremely far from tight, and in fact can significantly underperform
the ratio bound: for example, one of our results is that for infinitely many n,
there is an n‐vertex graph for which even the unweighted ratio bound can prove
a(G)<4n^3/4, but the inertia bound is always at least n/4. In particular, these
results address questions of Rooney, Sinkovic, and Wocjan–Elphick–Abiad.'
acknowledgement: Open access funding provided by Eidgenossische Technische Hochschule
Zurich.
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Matthew
full_name: Kwan, Matthew
last_name: Kwan
- first_name: Yuval
full_name: Wigderson, Yuval
id: 2d0023a0-1567-11f0-833d-d5c1e476d4b5
last_name: Wigderson
citation:
ama: Kwan M, Wigderson Y. The inertia bound is far from tight. Bulletin of the
London Mathematical Society. 2024;56(10):3196-3208. doi:10.1112/blms.13127
apa: Kwan, M., & Wigderson, Y. (2024). The inertia bound is far from tight.
Bulletin of the London Mathematical Society. Wiley. https://doi.org/10.1112/blms.13127
chicago: Kwan, Matthew, and Yuval Wigderson. “The Inertia Bound Is Far from Tight.”
Bulletin of the London Mathematical Society. Wiley, 2024. https://doi.org/10.1112/blms.13127.
ieee: M. Kwan and Y. Wigderson, “The inertia bound is far from tight,” Bulletin
of the London Mathematical Society, vol. 56, no. 10. Wiley, pp. 3196–3208,
2024.
ista: Kwan M, Wigderson Y. 2024. The inertia bound is far from tight. Bulletin of
the London Mathematical Society. 56(10), 3196–3208.
mla: Kwan, Matthew, and Yuval Wigderson. “The Inertia Bound Is Far from Tight.”
Bulletin of the London Mathematical Society, vol. 56, no. 10, Wiley, 2024,
pp. 3196–208, doi:10.1112/blms.13127.
short: M. Kwan, Y. Wigderson, Bulletin of the London Mathematical Society 56 (2024)
3196–3208.
date_created: 2026-06-29T10:49:18Z
date_published: 2024-10-01T00:00:00Z
date_updated: 2026-07-08T07:34:36Z
day: '01'
ddc:
- '500'
doi: 10.1112/blms.13127
extern: '1'
external_id:
arxiv:
- '2312.04925'
fulldoi: https://doi.org/10.1112/blms.13127
intvolume: ' 56'
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1112/blms.13127
month: '10'
oa: 1
oa_version: Published Version
page: 3196-3208
publication: Bulletin of the London Mathematical Society
publication_identifier:
eissn:
- 1469-2120
issn:
- 0024-6093
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: The inertia bound is far from tight
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: 56
year: '2024'
...
---
OA_place: publisher
OA_type: hybrid
_id: '17376'
abstract:
- lang: eng
text: "The inertia bound and ratio bound (also known as the Cvetković bound and
Hoffman bound) are two fundamental inequalities in spectral graph theory, giving
upper bounds on the independence number α(G) of a graph G in terms of spectral
information about a weighted adjacency matrix of G. For both inequalities, given
a graph G, one needs to make a judicious choice of weighted adjacency matrix to
obtain as strong a bound as possible.\r\nWhile there is a well-established theory
surrounding the ratio bound, the inertia bound is much more mysterious, and its
limits are rather unclear. In fact, only recently did Sinkovic find the first
example of a graph for which the inertia bound is not tight (for any weighted
adjacency matrix), answering a longstanding question of Godsil. We show that the
inertia bound can be extremely far from tight, and in fact can significantly underperform
the ratio bound: for example, one of our results is that for infinitely many n,
there is an n-vertex graph for which even the unweighted ratio bound can prove
α(G)≤4n3/4, but the inertia bound is always at least n/4. In particular, these
results address questions of Rooney, Sinkovic, and Wocjan--Elphick--Abiad."
acknowledgement: "The authors are grateful to Noga Alon, Anurag Bishnoi, Clive Elphick,
and Ferdinand Ihringer for helpful comments and interesting discussions on earlier
drafts of this paper. Matthew Kwan is supported by ERC Starting Grant “RANDSTRUCT”
No. 101076777. Yuval Wigderson is supported by Dr. Max Rössler, the Walter Haefner
Foundation, and the ETH Zürich Foundation.\r\nOpen access funding provided by Eidgenossische
Technische Hochschule Zurich."
article_processing_charge: Yes (via OA deal)
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: Yuval
full_name: Wigderson, Yuval
last_name: Wigderson
citation:
ama: Kwan MA, Wigderson Y. The inertia bound is far from tight. Bulletin of the
London Mathematical Society. 2024;56(10):3196-3208. doi:10.1112/blms.13127
apa: Kwan, M. A., & Wigderson, Y. (2024). The inertia bound is far from tight.
Bulletin of the London Mathematical Society. London Mathematical Society.
https://doi.org/10.1112/blms.13127
chicago: Kwan, Matthew Alan, and Yuval Wigderson. “The Inertia Bound Is Far from
Tight.” Bulletin of the London Mathematical Society. London Mathematical
Society, 2024. https://doi.org/10.1112/blms.13127.
ieee: M. A. Kwan and Y. Wigderson, “The inertia bound is far from tight,” Bulletin
of the London Mathematical Society, vol. 56, no. 10. London Mathematical Society,
pp. 3196–3208, 2024.
ista: Kwan MA, Wigderson Y. 2024. The inertia bound is far from tight. Bulletin
of the London Mathematical Society. 56(10), 3196–3208.
mla: Kwan, Matthew Alan, and Yuval Wigderson. “The Inertia Bound Is Far from Tight.”
Bulletin of the London Mathematical Society, vol. 56, no. 10, London Mathematical
Society, 2024, pp. 3196–208, doi:10.1112/blms.13127.
short: M.A. Kwan, Y. Wigderson, Bulletin of the London Mathematical Society 56 (2024)
3196–3208.
das_tickbox: '0'
date_created: 2024-08-04T22:01:22Z
date_published: 2024-10-01T00:00:00Z
date_updated: 2026-10-16T10:14:06Z
day: '01'
ddc:
- '510'
department:
- _id: MaKw
doi: 10.1112/blms.13127
external_id:
arxiv:
- '2312.04925'
isi:
- '001279563300001'
file:
- access_level: open_access
checksum: 7117f9819eaeb45eef1b0a226f9c2709
content_type: application/pdf
creator: dernst
date_created: 2025-01-09T13:36:53Z
date_updated: 2025-01-09T13:36:53Z
file_id: '18814'
file_name: 2024_BulletinLondonMathSoc_Kwan.pdf
file_size: 175966
relation: main_file
success: 1
file_date_updated: 2025-01-09T13:36:53Z
fulldoi: https://doi.org/10.1112/blms.13127
has_accepted_license: '1'
intvolume: ' 56'
isi: 1
issue: '10'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 3196-3208
project:
- _id: bd95085b-d553-11ed-ba76-e55d3349be45
grant_number: '101076777'
name: Randomness and structure in combinatorics
publication: Bulletin of the London Mathematical Society
publication_identifier:
eissn:
- 1469-2120
issn:
- 0024-6093
publication_status: published
publisher: London Mathematical Society
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: The inertia bound is far from tight
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: 56
year: '2024'
...
---
_id: '17127'
abstract:
- lang: eng
text: "Let P(x)∈Z[x] be a polynomial with at least two distinct complex roots.
We prove that the number of solutions (x1,…,xk,y1,…,yk)∈[N]2k to the equation\r\n∏1≤i≤kP(xi)=∏1≤j≤kP(yj)≠0\r\n(for
any k≥1 ) is asymptotically k!Nk as N→+∞. This solves a question first proposed
and studied by Najnudel. The result can also be interpreted as saying that all
even moments of random partial sums 1N√∑n≤Nf(P(n)) match standard complex Gaussian
moments as N→+∞\r\n , where f is the Steinhaus random multiplicative function."
acknowledgement: 'We thank Oleksiy Klurman, Ilya Shkredov, and Igor Shparlinski for
helpful comments on earlier versions of the paper, and thank Yotam Hendel for providing
a reference for Lemma 2.1. We also thank the anonymous referee for their generous
corrections and comments. The first author has received funding from the European
Union''s Horizon 2020 Research and Innovation Program under the Marie Skłodowska-Curie
Grant Agreement Number: 101034413. The second author is partially supported by the
Cuthbert C. Hurd Graduate Fellowship in the Mathematical Sciences, Stanford.'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Victor
full_name: Wang, Victor
id: 76096395-aea4-11ed-a680-ab8ebbd3f1b9
last_name: Wang
orcid: 0000-0002-0704-7026
- first_name: Max Wenqiang
full_name: Xu, Max Wenqiang
last_name: Xu
citation:
ama: Wang V, Xu MW. Paucity phenomena for polynomial products. Bulletin of the
London Mathematical Society. 2024;56(8):2718-2726. doi:10.1112/blms.13095
apa: Wang, V., & Xu, M. W. (2024). Paucity phenomena for polynomial products.
Bulletin of the London Mathematical Society. London Mathematical Society.
https://doi.org/10.1112/blms.13095
chicago: Wang, Victor, and Max Wenqiang Xu. “Paucity Phenomena for Polynomial Products.”
Bulletin of the London Mathematical Society. London Mathematical Society,
2024. https://doi.org/10.1112/blms.13095.
ieee: V. Wang and M. W. Xu, “Paucity phenomena for polynomial products,” Bulletin
of the London Mathematical Society, vol. 56, no. 8. London Mathematical Society,
pp. 2718–2726, 2024.
ista: Wang V, Xu MW. 2024. Paucity phenomena for polynomial products. Bulletin of
the London Mathematical Society. 56(8), 2718–2726.
mla: Wang, Victor, and Max Wenqiang Xu. “Paucity Phenomena for Polynomial Products.”
Bulletin of the London Mathematical Society, vol. 56, no. 8, London Mathematical
Society, 2024, pp. 2718–26, doi:10.1112/blms.13095.
short: V. Wang, M.W. Xu, Bulletin of the London Mathematical Society 56 (2024) 2718–2726.
das_tickbox: '0'
date_created: 2024-06-09T22:01:03Z
date_published: 2024-08-01T00:00:00Z
date_updated: 2026-10-21T11:01:07Z
day: '01'
ddc:
- '512'
department:
- _id: TiBr
doi: 10.1112/blms.13095
ec_funded: 1
external_id:
arxiv:
- '2211.02908'
isi:
- '001235729900001'
file:
- access_level: open_access
checksum: ae386a4031856efac23c7cdcb53b559b
content_type: application/pdf
creator: vwang
date_created: 2024-08-20T08:36:32Z
date_updated: 2024-08-20T08:36:32Z
file_id: '17446'
file_name: Paucity_phenomena_for_polynomial_products__Wang_Xu_ (7).pdf
file_size: 331775
relation: main_file
success: 1
file_date_updated: 2024-08-20T08:36:32Z
fulldoi: https://doi.org/10.1112/blms.13095
has_accepted_license: '1'
intvolume: ' 56'
isi: 1
issue: '8'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2211.02908
month: '08'
oa: 1
oa_version: Submitted Version
page: 2718-2726
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
publication: Bulletin of the London Mathematical Society
publication_identifier:
eissn:
- 1469-2120
issn:
- 0024-6093
publication_status: published
publisher: London Mathematical Society
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Paucity phenomena for polynomial products
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 56
year: '2024'
...
---
_id: '14660'
abstract:
- lang: eng
text: "The classical Steinitz theorem states that if the origin belongs to the interior
of the convex hull of a set \U0001D446⊂ℝ\U0001D451, then there are at most 2\U0001D451
points of \U0001D446 whose convex hull contains the origin in the interior. Bárány,
Katchalski,and Pach proved the following quantitative version of Steinitz’s theorem.
Let \U0001D444 be a convex polytope in ℝ\U0001D451 containing the standard Euclidean
unit ball \U0001D401\U0001D451. Then there exist at most 2\U0001D451 vertices
of \U0001D444 whose convex hull \U0001D444′ satisfies \U0001D45F\U0001D401\U0001D451⊂\U0001D444′
with \U0001D45F⩾\U0001D451−2\U0001D451. They conjectured that \U0001D45F⩾\U0001D450\U0001D451−1∕2
holds with a universal constant \U0001D450>0. We prove \U0001D45F⩾15\U0001D4512,
the first polynomial lower bound on \U0001D45F. Furthermore, we show that \U0001D45F
is not greater than 2/√\U0001D451."
acknowledgement: M.N. was supported by the János Bolyai Scholarship of the Hungarian
Academy of Sciences aswell as the National Research, Development and Innovation
Fund (NRDI) grants K119670 andK131529, and the ÚNKP-22-5 New National Excellence
Program of the Ministry for Innovationand Technology from the source of the NRDI
as well as the ELTE TKP 2021-NKTA-62 fundingscheme
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Grigory
full_name: Ivanov, Grigory
id: 87744F66-5C6F-11EA-AFE0-D16B3DDC885E
last_name: Ivanov
orcid: 0000-0002-5021-3982
- first_name: Márton
full_name: Naszódi, Márton
last_name: Naszódi
citation:
ama: 'Ivanov G, Naszódi M. Quantitative Steinitz theorem: A polynomial bound. Bulletin
of the London Mathematical Society. 2024;56(2):796-802. doi:10.1112/blms.12965'
apa: 'Ivanov, G., & Naszódi, M. (2024). Quantitative Steinitz theorem: A polynomial
bound. Bulletin of the London Mathematical Society. London Mathematical
Society. https://doi.org/10.1112/blms.12965'
chicago: 'Ivanov, Grigory, and Márton Naszódi. “Quantitative Steinitz Theorem: A
Polynomial Bound.” Bulletin of the London Mathematical Society. London
Mathematical Society, 2024. https://doi.org/10.1112/blms.12965.'
ieee: 'G. Ivanov and M. Naszódi, “Quantitative Steinitz theorem: A polynomial bound,”
Bulletin of the London Mathematical Society, vol. 56, no. 2. London Mathematical
Society, pp. 796–802, 2024.'
ista: 'Ivanov G, Naszódi M. 2024. Quantitative Steinitz theorem: A polynomial bound.
Bulletin of the London Mathematical Society. 56(2), 796–802.'
mla: 'Ivanov, Grigory, and Márton Naszódi. “Quantitative Steinitz Theorem: A Polynomial
Bound.” Bulletin of the London Mathematical Society, vol. 56, no. 2, London
Mathematical Society, 2024, pp. 796–802, doi:10.1112/blms.12965.'
short: G. Ivanov, M. Naszódi, Bulletin of the London Mathematical Society 56 (2024)
796–802.
corr_author: '1'
das_tickbox: '0'
date_created: 2023-12-10T23:00:58Z
date_published: 2024-02-01T00:00:00Z
date_updated: 2026-10-21T13:23:20Z
day: '01'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.1112/blms.12965
external_id:
arxiv:
- '2212.04308'
isi:
- '001113277100001'
file:
- access_level: open_access
checksum: 30ea0694757bc668cf7cd15ae357b35e
content_type: application/pdf
creator: dernst
date_created: 2024-07-16T10:35:10Z
date_updated: 2024-07-16T10:35:10Z
file_id: '17259'
file_name: 2024_BulletinLondonMathSoc_Ivanov.pdf
file_size: 111756
relation: main_file
success: 1
file_date_updated: 2024-07-16T10:35:10Z
fulldoi: https://doi.org/10.1112/blms.12965
has_accepted_license: '1'
intvolume: ' 56'
isi: 1
issue: '2'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 796-802
publication: Bulletin of the London Mathematical Society
publication_identifier:
eissn:
- 1469-2120
issn:
- 0024-6093
publication_status: published
publisher: London Mathematical Society
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: 'Quantitative Steinitz theorem: A polynomial bound'
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: 56
year: '2024'
...
---
_id: '11186'
abstract:
- lang: eng
text: "In this note, we study large deviations of the number \U0001D40D of intercalates
( 2×2 combinatorial subsquares which are themselves Latin squares) in a random
\ \U0001D45B×\U0001D45B Latin square. In particular, for constant \U0001D6FF>0
\ we prove that exp(−\U0001D442(\U0001D45B2log\U0001D45B))⩽Pr(\U0001D40D⩽(1−\U0001D6FF)\U0001D45B2/4)⩽exp(−Ω(\U0001D45B2))
\ and exp(−\U0001D442(\U0001D45B4/3(log\U0001D45B)))⩽Pr(\U0001D40D⩾(1+\U0001D6FF)\U0001D45B2/4)⩽exp(−Ω(\U0001D45B4/3(log\U0001D45B)2/3))
. As a consequence, we deduce that a typical order- \U0001D45B Latin square has
\ (1+\U0001D45C(1))\U0001D45B2/4 intercalates, matching a lower bound due to
Kwan and Sudakov and resolving an old conjecture of McKay and Wanless."
acknowledgement: "We thank Zach Hunter for pointing out some important typographical
errors. We also thank the referee for several remarks which helped improve the paper
substantially.\r\nKwan was supported by NSF grant DMS-1953990. Sah and Sawhney were
supported by NSF Graduate Research Fellowship Program DGE-1745302."
article_processing_charge: No
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: Mehtaab
full_name: Sawhney, Mehtaab
last_name: Sawhney
citation:
ama: Kwan MA, Sah A, Sawhney M. Large deviations in random latin squares. Bulletin
of the London Mathematical Society. 2022;54(4):1420-1438. doi:10.1112/blms.12638
apa: Kwan, M. A., Sah, A., & Sawhney, M. (2022). Large deviations in random
latin squares. Bulletin of the London Mathematical Society. Wiley. https://doi.org/10.1112/blms.12638
chicago: Kwan, Matthew Alan, Ashwin Sah, and Mehtaab Sawhney. “Large Deviations
in Random Latin Squares.” Bulletin of the London Mathematical Society.
Wiley, 2022. https://doi.org/10.1112/blms.12638.
ieee: M. A. Kwan, A. Sah, and M. Sawhney, “Large deviations in random latin squares,”
Bulletin of the London Mathematical Society, vol. 54, no. 4. Wiley, pp.
1420–1438, 2022.
ista: Kwan MA, Sah A, Sawhney M. 2022. Large deviations in random latin squares.
Bulletin of the London Mathematical Society. 54(4), 1420–1438.
mla: Kwan, Matthew Alan, et al. “Large Deviations in Random Latin Squares.” Bulletin
of the London Mathematical Society, vol. 54, no. 4, Wiley, 2022, pp. 1420–38,
doi:10.1112/blms.12638.
short: M.A. Kwan, A. Sah, M. Sawhney, Bulletin of the London Mathematical Society
54 (2022) 1420–1438.
corr_author: '1'
date_created: 2022-04-17T22:01:48Z
date_published: 2022-08-01T00:00:00Z
date_updated: 2024-10-09T21:02:21Z
day: '01'
ddc:
- '510'
department:
- _id: MaKw
doi: 10.1112/blms.12638
external_id:
arxiv:
- '2106.11932'
isi:
- '000779920900001'
file:
- access_level: open_access
checksum: 02d74e7ae955ba3c808e2a8aebe6ef98
content_type: application/pdf
creator: dernst
date_created: 2023-02-03T09:43:38Z
date_updated: 2023-02-03T09:43:38Z
file_id: '12499'
file_name: 2022_BulletinMathSociety_Kwan.pdf
file_size: 233758
relation: main_file
success: 1
file_date_updated: 2023-02-03T09:43:38Z
fulldoi: https://doi.org/10.1112/blms.12638
has_accepted_license: '1'
intvolume: ' 54'
isi: 1
issue: '4'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc/4.0/
month: '08'
oa: 1
oa_version: Published Version
page: 1420-1438
publication: Bulletin of the London Mathematical Society
publication_identifier:
eissn:
- 1469-2120
issn:
- 0024-6093
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Large deviations in random latin squares
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 54
year: '2022'
...
---
_id: '9037'
abstract:
- lang: eng
text: "We continue our study of ‘no‐dimension’ analogues of basic theorems in combinatorial
and convex geometry in Banach spaces. We generalize some results of the paper
(Adiprasito, Bárány and Mustafa, ‘Theorems of Carathéodory, Helly, and Tverberg
without dimension’, Proceedings of the Thirtieth Annual ACM‐SIAM Symposium on
Discrete Algorithms (Society for Industrial and Applied Mathematics, San Diego,
California, 2019) 2350–2360) and prove no‐dimension versions of the colored Tverberg
theorem, the selection lemma and the weak \U0001D700 ‐net theorem in Banach spaces
of type \U0001D45D>1 . To prove these results, we use the original ideas of Adiprasito,
Bárány and Mustafa for the Euclidean case, our no‐dimension version of the Radon
theorem and slightly modified version of the celebrated Maurey lemma."
acknowledgement: "I wish to thank Imre Bárány for bringing the problem to my attention.
I am grateful to Marton Naszódi and Igor Tsiutsiurupa for useful remarks and help
with the text.\r\nThe author acknowledges the financial support from the Ministry
of Educational and Science of the Russian Federation in the framework of MegaGrant
no 075‐15‐2019‐1926."
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Grigory
full_name: Ivanov, Grigory
id: 87744F66-5C6F-11EA-AFE0-D16B3DDC885E
last_name: Ivanov
citation:
ama: Ivanov G. No-dimension Tverberg’s theorem and its corollaries in Banach spaces
of type p. Bulletin of the London Mathematical Society. 2021;53(2):631-641.
doi:10.1112/blms.12449
apa: Ivanov, G. (2021). No-dimension Tverberg’s theorem and its corollaries in Banach
spaces of type p. Bulletin of the London Mathematical Society. London Mathematical
Society. https://doi.org/10.1112/blms.12449
chicago: Ivanov, Grigory. “No-Dimension Tverberg’s Theorem and Its Corollaries in
Banach Spaces of Type P.” Bulletin of the London Mathematical Society.
London Mathematical Society, 2021. https://doi.org/10.1112/blms.12449.
ieee: G. Ivanov, “No-dimension Tverberg’s theorem and its corollaries in Banach
spaces of type p,” Bulletin of the London Mathematical Society, vol. 53,
no. 2. London Mathematical Society, pp. 631–641, 2021.
ista: Ivanov G. 2021. No-dimension Tverberg’s theorem and its corollaries in Banach
spaces of type p. Bulletin of the London Mathematical Society. 53(2), 631–641.
mla: Ivanov, Grigory. “No-Dimension Tverberg’s Theorem and Its Corollaries in Banach
Spaces of Type P.” Bulletin of the London Mathematical Society, vol. 53,
no. 2, London Mathematical Society, 2021, pp. 631–41, doi:10.1112/blms.12449.
short: G. Ivanov, Bulletin of the London Mathematical Society 53 (2021) 631–641.
date_created: 2021-01-24T23:01:08Z
date_published: 2021-04-01T00:00:00Z
date_updated: 2025-07-10T12:01:31Z
day: '01'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.1112/blms.12449
external_id:
arxiv:
- '1912.08561'
isi:
- '000607265100001'
file:
- access_level: open_access
checksum: e6ceaa6470d835eb4c211cbdd38fdfd1
content_type: application/pdf
creator: kschuh
date_created: 2021-08-06T09:59:45Z
date_updated: 2021-08-06T09:59:45Z
file_id: '9796'
file_name: 2021_BLMS_Ivanov.pdf
file_size: 194550
relation: main_file
success: 1
file_date_updated: 2021-08-06T09:59:45Z
fulldoi: https://doi.org/10.1112/blms.12449
has_accepted_license: '1'
intvolume: ' 53'
isi: 1
issue: '2'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 631-641
publication: Bulletin of the London Mathematical Society
publication_identifier:
eissn:
- 1469-2120
issn:
- 0024-6093
publication_status: published
publisher: London Mathematical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: No-dimension Tverberg's theorem and its corollaries in Banach spaces of type
p
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 53
year: '2021'
...
---
_id: '9572'
abstract:
- lang: eng
text: We prove that every n-vertex tournament G has an acyclic subgraph with chromatic
number at least n5/9−o(1), while there exists an n-vertex tournament G whose every
acyclic subgraph has chromatic number at most n3/4+o(1). This establishes in a
strong form a conjecture of Nassar and Yuster and improves on another result of
theirs. Our proof combines probabilistic and spectral techniques together with
some additional ideas. In particular, we prove a lemma showing that every tournament
with many transitive subtournaments has a large subtournament that is almost transitive.
This may be of independent interest.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Jacob
full_name: Fox, Jacob
last_name: Fox
- 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: Benny
full_name: Sudakov, Benny
last_name: Sudakov
citation:
ama: Fox J, Kwan MA, Sudakov B. Acyclic subgraphs of tournaments with high chromatic
number. Bulletin of the London Mathematical Society. 2021;53(2):619-630.
doi:10.1112/blms.12446
apa: Fox, J., Kwan, M. A., & Sudakov, B. (2021). Acyclic subgraphs of tournaments
with high chromatic number. Bulletin of the London Mathematical Society.
Wiley. https://doi.org/10.1112/blms.12446
chicago: Fox, Jacob, Matthew Alan Kwan, and Benny Sudakov. “Acyclic Subgraphs of
Tournaments with High Chromatic Number.” Bulletin of the London Mathematical
Society. Wiley, 2021. https://doi.org/10.1112/blms.12446.
ieee: J. Fox, M. A. Kwan, and B. Sudakov, “Acyclic subgraphs of tournaments with
high chromatic number,” Bulletin of the London Mathematical Society, vol.
53, no. 2. Wiley, pp. 619–630, 2021.
ista: Fox J, Kwan MA, Sudakov B. 2021. Acyclic subgraphs of tournaments with high
chromatic number. Bulletin of the London Mathematical Society. 53(2), 619–630.
mla: Fox, Jacob, et al. “Acyclic Subgraphs of Tournaments with High Chromatic Number.”
Bulletin of the London Mathematical Society, vol. 53, no. 2, Wiley, 2021,
pp. 619–30, doi:10.1112/blms.12446.
short: J. Fox, M.A. Kwan, B. Sudakov, Bulletin of the London Mathematical Society
53 (2021) 619–630.
date_created: 2021-06-21T06:11:56Z
date_published: 2021-04-03T00:00:00Z
date_updated: 2023-02-23T14:01:21Z
day: '03'
doi: 10.1112/blms.12446
extern: '1'
external_id:
arxiv:
- '1912.07722'
fulldoi: https://doi.org/10.1112/blms.12446
intvolume: ' 53'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1912.07722
month: '04'
oa: 1
oa_version: Preprint
page: 619-630
publication: Bulletin of the London Mathematical Society
publication_identifier:
eissn:
- 1469-2120
issn:
- 0024-6093
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Acyclic subgraphs of tournaments with high chromatic number
type: journal_article
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
volume: 53
year: '2021'
...
---
_id: '6965'
abstract:
- lang: eng
text: The central object of investigation of this paper is the Hirzebruch class,
a deformation of the Todd class, given by Hirzebruch (for smooth varieties). The
generalization for singular varieties is due to Brasselet–Schürmann–Yokura. Following
the work of Weber, we investigate its equivariant version for (possibly singular)
toric varieties. The local decomposition of the Hirzebruch class to the fixed
points of the torus action and a formula for the local class in terms of the defining
fan are recalled. After this review part, we prove the positivity of local Hirzebruch
classes for all toric varieties, thus proving false the alleged counterexample
given by Weber.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Kamil P
full_name: Rychlewicz, Kamil P
id: 85A07246-A8BF-11E9-B4FA-D9E3E5697425
last_name: Rychlewicz
citation:
ama: Rychlewicz KP. The positivity of local equivariant Hirzebruch class for toric
varieties. Bulletin of the London Mathematical Society. 2021;53(2):560-574.
doi:10.1112/blms.12442
apa: Rychlewicz, K. P. (2021). The positivity of local equivariant Hirzebruch class
for toric varieties. Bulletin of the London Mathematical Society. Wiley.
https://doi.org/10.1112/blms.12442
chicago: Rychlewicz, Kamil P. “The Positivity of Local Equivariant Hirzebruch Class
for Toric Varieties.” Bulletin of the London Mathematical Society. Wiley,
2021. https://doi.org/10.1112/blms.12442.
ieee: K. P. Rychlewicz, “The positivity of local equivariant Hirzebruch class for
toric varieties,” Bulletin of the London Mathematical Society, vol. 53,
no. 2. Wiley, pp. 560–574, 2021.
ista: Rychlewicz KP. 2021. The positivity of local equivariant Hirzebruch class
for toric varieties. Bulletin of the London Mathematical Society. 53(2), 560–574.
mla: Rychlewicz, Kamil P. “The Positivity of Local Equivariant Hirzebruch Class
for Toric Varieties.” Bulletin of the London Mathematical Society, vol.
53, no. 2, Wiley, 2021, pp. 560–74, doi:10.1112/blms.12442.
short: K.P. Rychlewicz, Bulletin of the London Mathematical Society 53 (2021) 560–574.
corr_author: '1'
date_created: 2019-10-24T08:04:09Z
date_published: 2021-04-01T00:00:00Z
date_updated: 2024-10-09T20:59:03Z
day: '01'
department:
- _id: TaHa
doi: 10.1112/blms.12442
external_id:
arxiv:
- '1910.10435'
isi:
- '000594805800001'
fulldoi: https://doi.org/10.1112/blms.12442
intvolume: ' 53'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1910.10435
month: '04'
oa: 1
oa_version: Preprint
page: 560-574
publication: Bulletin of the London Mathematical Society
publication_identifier:
eissn:
- 1469-2120
issn:
- 0024-6093
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: The positivity of local equivariant Hirzebruch class for toric varieties
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 53
year: '2021'
...
---
_id: '9573'
abstract:
- lang: eng
text: It is a classical fact that for any ε>0, a random permutation of length n=(1+ε)k2/4
typically contains a monotone subsequence of length k. As a far-reaching generalization,
Alon conjectured that a random permutation of this same length n is typically
k-universal, meaning that it simultaneously contains every pattern of length k.
He also made the simple observation that for n=O(k2logk), a random length-n permutation
is typically k-universal. We make the first significant progress towards Alon's
conjecture by showing that n=2000k2loglogk suffices.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Xiaoyu
full_name: He, Xiaoyu
last_name: He
- first_name: Matthew Alan
full_name: Kwan, Matthew Alan
id: 5fca0887-a1db-11eb-95d1-ca9d5e0453b3
last_name: Kwan
orcid: 0000-0002-4003-7567
citation:
ama: He X, Kwan MA. Universality of random permutations. Bulletin of the London
Mathematical Society. 2020;52(3):515-529. doi:10.1112/blms.12345
apa: He, X., & Kwan, M. A. (2020). Universality of random permutations. Bulletin
of the London Mathematical Society. Wiley. https://doi.org/10.1112/blms.12345
chicago: He, Xiaoyu, and Matthew Alan Kwan. “Universality of Random Permutations.”
Bulletin of the London Mathematical Society. Wiley, 2020. https://doi.org/10.1112/blms.12345.
ieee: X. He and M. A. Kwan, “Universality of random permutations,” Bulletin of
the London Mathematical Society, vol. 52, no. 3. Wiley, pp. 515–529, 2020.
ista: He X, Kwan MA. 2020. Universality of random permutations. Bulletin of the
London Mathematical Society. 52(3), 515–529.
mla: He, Xiaoyu, and Matthew Alan Kwan. “Universality of Random Permutations.” Bulletin
of the London Mathematical Society, vol. 52, no. 3, Wiley, 2020, pp. 515–29,
doi:10.1112/blms.12345.
short: X. He, M.A. Kwan, Bulletin of the London Mathematical Society 52 (2020) 515–529.
date_created: 2021-06-21T06:23:42Z
date_published: 2020-06-01T00:00:00Z
date_updated: 2023-02-23T14:01:23Z
day: '01'
doi: 10.1112/blms.12345
extern: '1'
external_id:
arxiv:
- '1911.12878'
fulldoi: https://doi.org/10.1112/blms.12345
intvolume: ' 52'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1911.12878
month: '06'
oa: 1
oa_version: Preprint
page: 515-529
publication: Bulletin of the London Mathematical Society
publication_identifier:
eissn:
- 1469-2120
issn:
- 0024-6093
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Universality of random permutations
type: journal_article
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
volume: 52
year: '2020'
...
---
_id: '6793'
abstract:
- lang: eng
text: The Regge symmetry is a set of remarkable relations between two tetrahedra
whose edge lengths are related in a simple fashion. It was first discovered as
a consequence of an asymptotic formula in mathematical physics. Here, we give
a simple geometric proof of Regge symmetries in Euclidean, spherical, and hyperbolic
geometry.
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: Ivan
full_name: Izmestiev, Ivan
last_name: Izmestiev
citation:
ama: Akopyan A, Izmestiev I. The Regge symmetry, confocal conics, and the Schläfli
formula. Bulletin of the London Mathematical Society. 2019;51(5):765-775.
doi:10.1112/blms.12276
apa: Akopyan, A., & Izmestiev, I. (2019). The Regge symmetry, confocal conics,
and the Schläfli formula. Bulletin of the London Mathematical Society.
London Mathematical Society. https://doi.org/10.1112/blms.12276
chicago: Akopyan, Arseniy, and Ivan Izmestiev. “The Regge Symmetry, Confocal Conics,
and the Schläfli Formula.” Bulletin of the London Mathematical Society.
London Mathematical Society, 2019. https://doi.org/10.1112/blms.12276.
ieee: A. Akopyan and I. Izmestiev, “The Regge symmetry, confocal conics, and the
Schläfli formula,” Bulletin of the London Mathematical Society, vol. 51,
no. 5. London Mathematical Society, pp. 765–775, 2019.
ista: Akopyan A, Izmestiev I. 2019. The Regge symmetry, confocal conics, and the
Schläfli formula. Bulletin of the London Mathematical Society. 51(5), 765–775.
mla: Akopyan, Arseniy, and Ivan Izmestiev. “The Regge Symmetry, Confocal Conics,
and the Schläfli Formula.” Bulletin of the London Mathematical Society,
vol. 51, no. 5, London Mathematical Society, 2019, pp. 765–75, doi:10.1112/blms.12276.
short: A. Akopyan, I. Izmestiev, Bulletin of the London Mathematical Society 51
(2019) 765–775.
date_created: 2019-08-11T21:59:23Z
date_published: 2019-10-01T00:00:00Z
date_updated: 2025-07-10T11:53:52Z
day: '01'
department:
- _id: HeEd
doi: 10.1112/blms.12276
ec_funded: 1
external_id:
arxiv:
- '1903.04929'
isi:
- '000478560200001'
fulldoi: https://doi.org/10.1112/blms.12276
intvolume: ' 51'
isi: 1
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1903.04929
month: '10'
oa: 1
oa_version: Preprint
page: 765-775
project:
- _id: 266A2E9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '788183'
name: Alpha Shape Theory Extended
publication: Bulletin of the London Mathematical Society
publication_identifier:
eissn:
- 1469-2120
issn:
- 0024-6093
publication_status: published
publisher: London Mathematical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: The Regge symmetry, confocal conics, and the Schläfli formula
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 51
year: '2019'
...
---
OA_place: repository
OA_type: green
_id: '211'
abstract:
- lang: eng
text: Let f ∈ ℤ[x] be a polynomial of degree d. The paucity of non-trivial positive
integer solutions to the equation f(x1)+f(x 2)=f(x3)+f(x4) is established, provided
that d ≤ 7$. Also the corresponding situation is investigated for equal sums of
three like polynomials.
acknowledgement: grant number GR/R93155/01
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
citation:
ama: Browning TD. Equal sums of like polynomials. Bulletin of the London Mathematical
Society. 2005;37(6):801-808. doi:10.1112/S0024609305004741
apa: Browning, T. D. (2005). Equal sums of like polynomials. Bulletin of the
London Mathematical Society. John Wiley and Sons Ltd. https://doi.org/10.1112/S0024609305004741
chicago: Browning, Timothy D. “Equal Sums of like Polynomials.” Bulletin of the
London Mathematical Society. John Wiley and Sons Ltd, 2005. https://doi.org/10.1112/S0024609305004741.
ieee: T. D. Browning, “Equal sums of like polynomials,” Bulletin of the London
Mathematical Society, vol. 37, no. 6. John Wiley and Sons Ltd, pp. 801–808,
2005.
ista: Browning TD. 2005. Equal sums of like polynomials. Bulletin of the London
Mathematical Society. 37(6), 801–808.
mla: Browning, Timothy D. “Equal Sums of like Polynomials.” Bulletin of the London
Mathematical Society, vol. 37, no. 6, John Wiley and Sons Ltd, 2005, pp. 801–08,
doi:10.1112/S0024609305004741.
short: T.D. Browning, Bulletin of the London Mathematical Society 37 (2005) 801–808.
date_created: 2018-12-11T11:45:14Z
date_published: 2005-12-01T00:00:00Z
date_updated: 2026-08-21T09:28:45Z
day: '01'
doi: 10.1112/S0024609305004741
extern: '1'
external_id:
arxiv:
- abs/math/0507541
fulldoi: https://doi.org/10.1112/S0024609305004741
intvolume: ' 37'
issue: '6'
language:
- iso: eng
month: '12'
oa_version: None
page: 801 - 808
publication: Bulletin of the London Mathematical Society
publication_identifier:
eissn:
- 1469-2120
issn:
- 0024-6093
publication_status: published
publisher: John Wiley and Sons Ltd
publist_id: '7700'
status: public
title: Equal sums of like polynomials
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 37
year: '2005'
...