---
OA_place: publisher
OA_type: gold
_id: '19433'
abstract:
- lang: eng
  text: An ordered r-matching is an r-uniform hypergraph matching equipped with an
    ordering on its vertices. These objects can be viewed as natural generalisations
    of r-dimensional orders. The theory of ordered 2-matchings is well developed and
    has connections and applications to extremal and enumerative combinatorics, probability
    and geometry. On the other hand, in the case  r≥3 much less is known, largely
    due to a lack of powerful bijective tools. Recently, Dudek, Grytczuk and Ruciński
    made some first steps towards a general theory of ordered r-matchings, and in
    this paper we substantially improve several of their results and introduce some
    new directions of study. Many intriguing open questions remain.
acknowledgement: We would like to thank Timo Seppäläinen for some illuminating discussion
  about random high-dimensional orders and for bringing our attention to [59]. We
  would also like to thank the referees for helpful feedback. Michael Anastos is supported
  by the European Union’s Horizon 2020 research and innovation programme under the
  Marie Skłodowska-Curie grant agreement No. 101034413. Matthew Kwan is supported
  by ERC Starting Grant ‘RANDSTRUCT’ No. 101076777, also funded by the European Union.
  Zhihan Jin and Benny Sudakov are supported by SNSF grant 200021-228014.
article_number: e55
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Michael
  full_name: Anastos, Michael
  id: 0b2a4358-bb35-11ec-b7b9-e3279b593dbb
  last_name: Anastos
- first_name: Zhihan
  full_name: Jin, Zhihan
  last_name: Jin
- 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: Anastos M, Jin Z, Kwan MA, Sudakov B. Extremal, enumerative and probabilistic
    results on ordered hypergraph matchings. <i>Forum of Mathematics, Sigma</i>. 2025;13.
    doi:<a href="https://doi.org/10.1017/fms.2024.144">10.1017/fms.2024.144</a>
  apa: Anastos, M., Jin, Z., Kwan, M. A., &#38; Sudakov, B. (2025). Extremal, enumerative
    and probabilistic results on ordered hypergraph matchings. <i>Forum of Mathematics,
    Sigma</i>. Cambridge University Press. <a href="https://doi.org/10.1017/fms.2024.144">https://doi.org/10.1017/fms.2024.144</a>
  chicago: Anastos, Michael, Zhihan Jin, Matthew Alan Kwan, and Benny Sudakov. “Extremal,
    Enumerative and Probabilistic Results on Ordered Hypergraph Matchings.” <i>Forum
    of Mathematics, Sigma</i>. Cambridge University Press, 2025. <a href="https://doi.org/10.1017/fms.2024.144">https://doi.org/10.1017/fms.2024.144</a>.
  ieee: M. Anastos, Z. Jin, M. A. Kwan, and B. Sudakov, “Extremal, enumerative and
    probabilistic results on ordered hypergraph matchings,” <i>Forum of Mathematics,
    Sigma</i>, vol. 13. Cambridge University Press, 2025.
  ista: Anastos M, Jin Z, Kwan MA, Sudakov B. 2025. Extremal, enumerative and probabilistic
    results on ordered hypergraph matchings. Forum of Mathematics, Sigma. 13, e55.
  mla: Anastos, Michael, et al. “Extremal, Enumerative and Probabilistic Results on
    Ordered Hypergraph Matchings.” <i>Forum of Mathematics, Sigma</i>, vol. 13, e55,
    Cambridge University Press, 2025, doi:<a href="https://doi.org/10.1017/fms.2024.144">10.1017/fms.2024.144</a>.
  short: M. Anastos, Z. Jin, M.A. Kwan, B. Sudakov, Forum of Mathematics, Sigma 13
    (2025).
corr_author: '1'
date_created: 2025-03-20T12:59:14Z
date_published: 2025-03-14T00:00:00Z
date_updated: 2025-09-30T11:18:57Z
day: '14'
ddc:
- '510'
department:
- _id: MaKw
doi: 10.1017/fms.2024.144
ec_funded: 1
external_id:
  arxiv:
  - '2308.12268'
  isi:
  - '001444429200001'
file:
- access_level: open_access
  checksum: f396270ad78c1ed67095c8e5a66fca26
  content_type: application/pdf
  creator: dernst
  date_created: 2025-04-03T11:24:35Z
  date_updated: 2025-04-03T11:24:35Z
  file_id: '19468'
  file_name: 2025_ForumMathSigma_Anastos.pdf
  file_size: 630297
  relation: main_file
  success: 1
file_date_updated: 2025-04-03T11:24:35Z
has_accepted_license: '1'
intvolume: '        13'
isi: 1
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '03'
oa: 1
oa_version: Published Version
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
  call_identifier: H2020
  grant_number: '101034413'
  name: 'IST-BRIDGE: International postdoctoral program'
- _id: bd95085b-d553-11ed-ba76-e55d3349be45
  grant_number: '101076777'
  name: Randomness and structure in combinatorics
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: Extremal, enumerative and probabilistic results on ordered hypergraph matchings
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 13
year: '2025'
...
---
OA_place: repository
OA_type: green
_id: '22158'
abstract:
- lang: eng
  text: "The triangle removal states that if G contains  edge-disjoint triangles,
    then G contains  triangles. Unfortunately, there are no sensible bounds on the
    order of growth of , and at any rate, it is known that  is not polynomial in .
    Csaba recently obtained an asymmetric variant of the triangle removal, stating
    that if G contains  edge-disjoint triangles, then G contains  copies of . To this
    end, he devised a new variant of Szemerédi’s regularity lemma. We obtain the following
    results:\r\n\r\n• We first give a regularity-free proof of Csaba’s theorem, which
    improves the number of copies of  to the optimal number .\r\n\r\n• We say that
    H is -abundant if every graph containing  edge-disjoint triangles has  copies
    of H. It is easy to see that a -abundant graph must be triangle-free and tripartite.
    Given our first result, it is natural to ask if all triangle-free tripartite graphs
    are -abundant. Our second result is that assuming a well-known conjecture of Ruzsa
    in additive number theory, the answer to this question is negative.\r\n\r\nOur
    proofs use a mix of combinatorial, number-theoretic, probabilistic and Ramsey-type
    arguments."
article_number: e38
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Lior
  full_name: Gishboliner, Lior
  last_name: Gishboliner
- first_name: Asaf
  full_name: Shapira, Asaf
  last_name: Shapira
- first_name: Yuval
  full_name: Wigderson, Yuval
  id: 2d0023a0-1567-11f0-833d-d5c1e476d4b5
  last_name: Wigderson
citation:
  ama: Gishboliner L, Shapira A, Wigderson Y. An efficient asymmetric removal lemma
    and its limitations. <i>Forum of Mathematics, Sigma</i>. 2025;13. doi:<a href="https://doi.org/10.1017/fms.2024.68">10.1017/fms.2024.68</a>
  apa: Gishboliner, L., Shapira, A., &#38; Wigderson, Y. (2025). An efficient asymmetric
    removal lemma and its limitations. <i>Forum of Mathematics, Sigma</i>. Cambridge
    University Press. <a href="https://doi.org/10.1017/fms.2024.68">https://doi.org/10.1017/fms.2024.68</a>
  chicago: Gishboliner, Lior, Asaf Shapira, and Yuval Wigderson. “An Efficient Asymmetric
    Removal Lemma and Its Limitations.” <i>Forum of Mathematics, Sigma</i>. Cambridge
    University Press, 2025. <a href="https://doi.org/10.1017/fms.2024.68">https://doi.org/10.1017/fms.2024.68</a>.
  ieee: L. Gishboliner, A. Shapira, and Y. Wigderson, “An efficient asymmetric removal
    lemma and its limitations,” <i>Forum of Mathematics, Sigma</i>, vol. 13. Cambridge
    University Press, 2025.
  ista: Gishboliner L, Shapira A, Wigderson Y. 2025. An efficient asymmetric removal
    lemma and its limitations. Forum of Mathematics, Sigma. 13, e38.
  mla: Gishboliner, Lior, et al. “An Efficient Asymmetric Removal Lemma and Its Limitations.”
    <i>Forum of Mathematics, Sigma</i>, vol. 13, e38, Cambridge University Press,
    2025, doi:<a href="https://doi.org/10.1017/fms.2024.68">10.1017/fms.2024.68</a>.
  short: L. Gishboliner, A. Shapira, Y. Wigderson, Forum of Mathematics, Sigma 13
    (2025).
date_created: 2026-06-29T10:51:07Z
date_published: 2025-02-10T00:00:00Z
date_updated: 2026-07-08T10:31:22Z
day: '10'
doi: 10.1017/fms.2024.68
extern: '1'
external_id:
  arxiv:
  - '2301.07693'
intvolume: '        13'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2301.07693
mathsc:
- 05C35
- 11B75
month: '02'
oa: 1
oa_version: Preprint
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: An efficient asymmetric removal lemma and its limitations
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13
year: '2025'
...
---
_id: '18107'
abstract:
- lang: eng
  text: We consider a dilute fully spin-polarized Fermi gas at positive temperature
    in dimensions  d∈{1,2,3} . We show that the pressure of the interacting gas is
    bounded from below by that of the free gas plus, to leading order, an explicit
    term of order  adρ2+2/d, where a is the p-wave scattering length of the repulsive
    interaction and  ρ  is the particle density. The results are valid for a wide
    range of repulsive interactions, including that of a hard core, and uniform in
    temperatures at most of the order of the Fermi temperature. A central ingredient
    in the proof is a rigorous implementation of the fermionic cluster expansion of
    Gaudin, Gillespie and Ripka (Nucl. Phys. A, 176.2 (1971), pp. 237–260).
acknowledgement: 'Financial support by the Austrian Science Fund (FWF) through grant
  DOI: 10.55776/I6427 (as part of the SFB/TRR 352) is gratefully acknowledged.'
article_number: e78
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Asbjørn Bækgaard
  full_name: Lauritsen, Asbjørn Bækgaard
  id: e1a2682f-dc8d-11ea-abe3-81da9ac728f1
  last_name: Lauritsen
  orcid: 0000-0003-4476-2288
- first_name: Robert
  full_name: Seiringer, Robert
  id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
  last_name: Seiringer
  orcid: 0000-0002-6781-0521
citation:
  ama: 'Lauritsen AB, Seiringer R. Pressure of a dilute spin-polarized Fermi gas:
    Lower bound. <i>Forum of Mathematics, Sigma</i>. 2024;12. doi:<a href="https://doi.org/10.1017/fms.2024.56">10.1017/fms.2024.56</a>'
  apa: 'Lauritsen, A. B., &#38; Seiringer, R. (2024). Pressure of a dilute spin-polarized
    Fermi gas: Lower bound. <i>Forum of Mathematics, Sigma</i>. Cambridge University
    Press. <a href="https://doi.org/10.1017/fms.2024.56">https://doi.org/10.1017/fms.2024.56</a>'
  chicago: 'Lauritsen, Asbjørn Bækgaard, and Robert Seiringer. “Pressure of a Dilute
    Spin-Polarized Fermi Gas: Lower Bound.” <i>Forum of Mathematics, Sigma</i>. Cambridge
    University Press, 2024. <a href="https://doi.org/10.1017/fms.2024.56">https://doi.org/10.1017/fms.2024.56</a>.'
  ieee: 'A. B. Lauritsen and R. Seiringer, “Pressure of a dilute spin-polarized Fermi
    gas: Lower bound,” <i>Forum of Mathematics, Sigma</i>, vol. 12. Cambridge University
    Press, 2024.'
  ista: 'Lauritsen AB, Seiringer R. 2024. Pressure of a dilute spin-polarized Fermi
    gas: Lower bound. Forum of Mathematics, Sigma. 12, e78.'
  mla: 'Lauritsen, Asbjørn Bækgaard, and Robert Seiringer. “Pressure of a Dilute Spin-Polarized
    Fermi Gas: Lower Bound.” <i>Forum of Mathematics, Sigma</i>, vol. 12, e78, Cambridge
    University Press, 2024, doi:<a href="https://doi.org/10.1017/fms.2024.56">10.1017/fms.2024.56</a>.'
  short: A.B. Lauritsen, R. Seiringer, Forum of Mathematics, Sigma 12 (2024).
corr_author: '1'
date_created: 2024-09-20T12:25:25Z
date_published: 2024-09-09T00:00:00Z
date_updated: 2026-04-07T13:01:40Z
day: '09'
ddc:
- '510'
department:
- _id: GradSch
- _id: RoSe
doi: 10.1017/fms.2024.56
external_id:
  arxiv:
  - '2407.05990'
  isi:
  - '001307817400001'
file:
- access_level: open_access
  checksum: 330b881240013213a8e08538fec13d29
  content_type: application/pdf
  creator: dernst
  date_created: 2024-09-23T09:56:17Z
  date_updated: 2024-09-23T09:56:17Z
  file_id: '18126'
  file_name: 2024_ForumMath_Lauritsen.pdf
  file_size: 599886
  relation: main_file
  success: 1
file_date_updated: 2024-09-23T09:56:17Z
has_accepted_license: '1'
intvolume: '        12'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: bda63fe5-d553-11ed-ba76-a16e3d2f256b
  grant_number: I06427
  name: Mathematical Challenges in BCS Theory of Superconductivity
publication: Forum of Mathematics, Sigma
publication_identifier:
  issn:
  - 2050-5094
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
related_material:
  record:
  - id: '18135'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: 'Pressure of a dilute spin-polarized Fermi gas: Lower 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: 12
year: '2024'
...
---
_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.
    <i>Forum of Mathematics, Sigma</i>. 2022;10. doi:<a href="https://doi.org/10.1017/fms.2022.86">10.1017/fms.2022.86</a>
  apa: Cipolloni, G., Erdös, L., &#38; Schröder, D. J. (2022). Rank-uniform local
    law for Wigner matrices. <i>Forum of Mathematics, Sigma</i>. Cambridge University
    Press. <a href="https://doi.org/10.1017/fms.2022.86">https://doi.org/10.1017/fms.2022.86</a>
  chicago: Cipolloni, Giorgio, László Erdös, and Dominik J Schröder. “Rank-Uniform
    Local Law for Wigner Matrices.” <i>Forum of Mathematics, Sigma</i>. Cambridge
    University Press, 2022. <a href="https://doi.org/10.1017/fms.2022.86">https://doi.org/10.1017/fms.2022.86</a>.
  ieee: G. Cipolloni, L. Erdös, and D. J. Schröder, “Rank-uniform local law for Wigner
    matrices,” <i>Forum of Mathematics, Sigma</i>, 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.” <i>Forum
    of Mathematics, Sigma</i>, vol. 10, e96, Cambridge University Press, 2022, doi:<a
    href="https://doi.org/10.1017/fms.2022.86">10.1017/fms.2022.86</a>.
  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'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '19491'
abstract:
- lang: eng
  text: Using a recent breakthrough of Smith [18], we improve the results of Fouvry
    and Klüners [4, 5] on the solubility of the negative Pell equation. Let D denote
    the set of positive squarefree integers having no prime factors congruent to 3
    modulo 4 . Stevenhagen [19] conjectured that the density of d in D such that the
    negative Pell equation x2−dy2=−1 is solvable with x,y∈Z is 58.1% , to the nearest
    tenth of a percent. By studying the distribution of the 8 -rank of narrow class
    groups Cl+(d) of Q(√d) , we prove that the infimum of this density is at least
    53.8% .
article_number: e46
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Yik Tung
  full_name: Chan, Yik Tung
  id: c4c0afc8-9262-11ed-9231-d8b0bc743af1
  last_name: Chan
  orcid: 0000-0001-8467-4106
- first_name: Peter
  full_name: Koymans, Peter
  last_name: Koymans
- first_name: Djordjo
  full_name: Milovic, Djordjo
  last_name: Milovic
- first_name: Carlo
  full_name: Pagano, Carlo
  last_name: Pagano
citation:
  ama: Chan S, Koymans P, Milovic D, Pagano C. The 8-rank of the narrow class group
    and the negative Pell equation. <i>Forum of Mathematics, Sigma</i>. 2022;10. doi:<a
    href="https://doi.org/10.1017/fms.2022.40">10.1017/fms.2022.40</a>
  apa: Chan, S., Koymans, P., Milovic, D., &#38; Pagano, C. (2022). The 8-rank of
    the narrow class group and the negative Pell equation. <i>Forum of Mathematics,
    Sigma</i>. Cambridge University Press. <a href="https://doi.org/10.1017/fms.2022.40">https://doi.org/10.1017/fms.2022.40</a>
  chicago: Chan, Stephanie, Peter Koymans, Djordjo Milovic, and Carlo Pagano. “The
    8-Rank of the Narrow Class Group and the Negative Pell Equation.” <i>Forum of
    Mathematics, Sigma</i>. Cambridge University Press, 2022. <a href="https://doi.org/10.1017/fms.2022.40">https://doi.org/10.1017/fms.2022.40</a>.
  ieee: S. Chan, P. Koymans, D. Milovic, and C. Pagano, “The 8-rank of the narrow
    class group and the negative Pell equation,” <i>Forum of Mathematics, Sigma</i>,
    vol. 10. Cambridge University Press, 2022.
  ista: Chan S, Koymans P, Milovic D, Pagano C. 2022. The 8-rank of the narrow class
    group and the negative Pell equation. Forum of Mathematics, Sigma. 10, e46.
  mla: Chan, Stephanie, et al. “The 8-Rank of the Narrow Class Group and the Negative
    Pell Equation.” <i>Forum of Mathematics, Sigma</i>, vol. 10, e46, Cambridge University
    Press, 2022, doi:<a href="https://doi.org/10.1017/fms.2022.40">10.1017/fms.2022.40</a>.
  short: S. Chan, P. Koymans, D. Milovic, C. Pagano, Forum of Mathematics, Sigma 10
    (2022).
date_created: 2025-04-05T10:51:00Z
date_published: 2022-05-17T00:00:00Z
date_updated: 2025-07-10T11:51:47Z
day: '17'
ddc:
- '510'
doi: 10.1017/fms.2022.40
extern: '1'
external_id:
  arxiv:
  - '1908.01752'
has_accepted_license: '1'
intvolume: '        10'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1017/fms.2022.40
month: '05'
oa: 1
oa_version: Published Version
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: The 8-rank of the narrow class group and the negative Pell equation
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: 10
year: '2022'
...
---
_id: '6355'
abstract:
- lang: eng
  text: We  prove  that  any  cyclic  quadrilateral  can  be  inscribed  in  any  closed  convex
    C1-curve.  The smoothness condition is not required if the quadrilateral is a
    rectangle.
article_number: e7
article_processing_charge: No
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: Sergey
  full_name: Avvakumov, Sergey
  id: 3827DAC8-F248-11E8-B48F-1D18A9856A87
  last_name: Avvakumov
  orcid: 0000-0002-7840-5062
citation:
  ama: Akopyan A, Avvakumov S. Any cyclic quadrilateral can be inscribed in any closed
    convex smooth curve. <i>Forum of Mathematics, Sigma</i>. 2018;6. doi:<a href="https://doi.org/10.1017/fms.2018.7">10.1017/fms.2018.7</a>
  apa: Akopyan, A., &#38; Avvakumov, S. (2018). Any cyclic quadrilateral can be inscribed
    in any closed convex smooth curve. <i>Forum of Mathematics, Sigma</i>. Cambridge
    University Press. <a href="https://doi.org/10.1017/fms.2018.7">https://doi.org/10.1017/fms.2018.7</a>
  chicago: Akopyan, Arseniy, and Sergey Avvakumov. “Any Cyclic Quadrilateral Can Be
    Inscribed in Any Closed Convex Smooth Curve.” <i>Forum of Mathematics, Sigma</i>.
    Cambridge University Press, 2018. <a href="https://doi.org/10.1017/fms.2018.7">https://doi.org/10.1017/fms.2018.7</a>.
  ieee: A. Akopyan and S. Avvakumov, “Any cyclic quadrilateral can be inscribed in
    any closed convex smooth curve,” <i>Forum of Mathematics, Sigma</i>, vol. 6. Cambridge
    University Press, 2018.
  ista: Akopyan A, Avvakumov S. 2018. Any cyclic quadrilateral can be inscribed in
    any closed convex smooth curve. Forum of Mathematics, Sigma. 6, e7.
  mla: Akopyan, Arseniy, and Sergey Avvakumov. “Any Cyclic Quadrilateral Can Be Inscribed
    in Any Closed Convex Smooth Curve.” <i>Forum of Mathematics, Sigma</i>, vol. 6,
    e7, Cambridge University Press, 2018, doi:<a href="https://doi.org/10.1017/fms.2018.7">10.1017/fms.2018.7</a>.
  short: A. Akopyan, S. Avvakumov, Forum of Mathematics, Sigma 6 (2018).
corr_author: '1'
date_created: 2019-04-30T06:09:57Z
date_published: 2018-05-31T00:00:00Z
date_updated: 2026-04-08T07:25:54Z
day: '31'
ddc:
- '510'
department:
- _id: UlWa
- _id: HeEd
- _id: JaMa
doi: 10.1017/fms.2018.7
ec_funded: 1
external_id:
  arxiv:
  - '1712.10205'
  isi:
  - '000433915500001'
file:
- access_level: open_access
  checksum: 5a71b24ba712a3eb2e46165a38fbc30a
  content_type: application/pdf
  creator: dernst
  date_created: 2019-04-30T06:14:58Z
  date_updated: 2020-07-14T12:47:28Z
  file_id: '6356'
  file_name: 2018_ForumMahtematics_Akopyan.pdf
  file_size: 249246
  relation: main_file
file_date_updated: 2020-07-14T12:47:28Z
has_accepted_license: '1'
intvolume: '         6'
isi: 1
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
project:
- _id: 256E75B8-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '716117'
  name: Optimal Transport and Stochastic Dynamics
publication: Forum of Mathematics, Sigma
publication_identifier:
  issn:
  - 2050-5094
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
related_material:
  record:
  - id: '8156'
    relation: dissertation_contains
    status: public
status: public
title: Any cyclic quadrilateral can be inscribed in any closed convex smooth curve
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: 6
year: '2018'
...
