Improved Lower Bounds for Multiplicative Square-Free Sequences

Improved Lower Bounds for Multiplicative Square-Free Sequences

In this short paper we improve an almost 30 years old result of Erdős, Sárközy and Sós on lower bounds for the size of multiplicative square-free sequences. Our construction uses Berge-cycle free hypergraphs that is interesting in its own right.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:The Electronic journal of combinatorics 2023-12, Vol.30 (4)
Hauptverfasser: Pach, Péter Pál, Vizer, Máté
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue 4
container_start_page
container_title The Electronic journal of combinatorics
container_volume 30
creator Pach, Péter Pál
Vizer, Máté
description In this short paper we improve an almost 30 years old result of Erdős, Sárközy and Sós on lower bounds for the size of multiplicative square-free sequences. Our construction uses Berge-cycle free hypergraphs that is interesting in its own right.
doi_str_mv 10.37236/11477
format Article
fullrecord <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_37236_11477</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_37236_11477</sourcerecordid><originalsourceid>FETCH-LOGICAL-c186t-325bc779a616ce20120a1f42cad77a3d399a065a781c16d4e0cc0827c3c1af693</originalsourceid><addsrcrecordid>eNpNj0FLw0AQRhdRsFb9DTl5i-7sJjvZi6DFaiHiQT2HcTKBSNqku0nFf2-pHjx97_Q9nlKXoK8tGutuADLEIzUDjZgW3rjjf3yqzmL81BqM9_lM3a7WQ-h3Uidl_yUhue-nTR2Tpg_J89SN7dC1TGO7k-R1O1GQdBlkz7KdZMMSz9VJQ12Ui7-dq_flw9viKS1fHleLuzJlKNyYWpN_MKInB47F7OWaoMkMU41Itrbek3Y5YQEMrs5EM-vCIFsGapy3c3X1-8uhjzFIUw2hXVP4rkBXh-rqUG1_AN_oSLs</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Improved Lower Bounds for Multiplicative Square-Free Sequences</title><source>DOAJ Directory of Open Access Journals</source><source>EZB-FREE-00999 freely available EZB journals</source><creator>Pach, Péter Pál ; Vizer, Máté</creator><creatorcontrib>Pach, Péter Pál ; Vizer, Máté</creatorcontrib><description>In this short paper we improve an almost 30 years old result of Erdős, Sárközy and Sós on lower bounds for the size of multiplicative square-free sequences. Our construction uses Berge-cycle free hypergraphs that is interesting in its own right.</description><identifier>ISSN: 1077-8926</identifier><identifier>EISSN: 1077-8926</identifier><identifier>DOI: 10.37236/11477</identifier><language>eng</language><ispartof>The Electronic journal of combinatorics, 2023-12, Vol.30 (4)</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,864,27923,27924</link.rule.ids></links><search><creatorcontrib>Pach, Péter Pál</creatorcontrib><creatorcontrib>Vizer, Máté</creatorcontrib><title>Improved Lower Bounds for Multiplicative Square-Free Sequences</title><title>The Electronic journal of combinatorics</title><description>In this short paper we improve an almost 30 years old result of Erdős, Sárközy and Sós on lower bounds for the size of multiplicative square-free sequences. Our construction uses Berge-cycle free hypergraphs that is interesting in its own right.</description><issn>1077-8926</issn><issn>1077-8926</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><recordid>eNpNj0FLw0AQRhdRsFb9DTl5i-7sJjvZi6DFaiHiQT2HcTKBSNqku0nFf2-pHjx97_Q9nlKXoK8tGutuADLEIzUDjZgW3rjjf3yqzmL81BqM9_lM3a7WQ-h3Uidl_yUhue-nTR2Tpg_J89SN7dC1TGO7k-R1O1GQdBlkz7KdZMMSz9VJQ12Ui7-dq_flw9viKS1fHleLuzJlKNyYWpN_MKInB47F7OWaoMkMU41Itrbek3Y5YQEMrs5EM-vCIFsGapy3c3X1-8uhjzFIUw2hXVP4rkBXh-rqUG1_AN_oSLs</recordid><startdate>20231201</startdate><enddate>20231201</enddate><creator>Pach, Péter Pál</creator><creator>Vizer, Máté</creator><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20231201</creationdate><title>Improved Lower Bounds for Multiplicative Square-Free Sequences</title><author>Pach, Péter Pál ; Vizer, Máté</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c186t-325bc779a616ce20120a1f42cad77a3d399a065a781c16d4e0cc0827c3c1af693</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Pach, Péter Pál</creatorcontrib><creatorcontrib>Vizer, Máté</creatorcontrib><collection>CrossRef</collection><jtitle>The Electronic journal of combinatorics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Pach, Péter Pál</au><au>Vizer, Máté</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Improved Lower Bounds for Multiplicative Square-Free Sequences</atitle><jtitle>The Electronic journal of combinatorics</jtitle><date>2023-12-01</date><risdate>2023</risdate><volume>30</volume><issue>4</issue><issn>1077-8926</issn><eissn>1077-8926</eissn><abstract>In this short paper we improve an almost 30 years old result of Erdős, Sárközy and Sós on lower bounds for the size of multiplicative square-free sequences. Our construction uses Berge-cycle free hypergraphs that is interesting in its own right.</abstract><doi>10.37236/11477</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1077-8926
ispartof The Electronic journal of combinatorics, 2023-12, Vol.30 (4)
issn 1077-8926
1077-8926
language eng
recordid cdi_crossref_primary_10_37236_11477
source DOAJ Directory of Open Access Journals; EZB-FREE-00999 freely available EZB journals
title Improved Lower Bounds for Multiplicative Square-Free Sequences
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T12%3A03%3A04IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Improved%20Lower%20Bounds%20for%20Multiplicative%20Square-Free%20Sequences&rft.jtitle=The%20Electronic%20journal%20of%20combinatorics&rft.au=Pach,%20P%C3%A9ter%20P%C3%A1l&rft.date=2023-12-01&rft.volume=30&rft.issue=4&rft.issn=1077-8926&rft.eissn=1077-8926&rft_id=info:doi/10.37236/11477&rft_dat=%3Ccrossref%3E10_37236_11477%3C/crossref%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true