![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Dan Saracino
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j30]Jonathan S. Bloom, Dan Saracino:
Strictly increasing and decreasing sequences in subintervals of words and a conjecture of Guo and Poznanović. Eur. J. Comb. 118: 103898 (2024)
2010 – 2019
- 2019
- [j29]Jonathan Bloom
, Dan Saracino:
On criteria for rook equivalence of Ferrers boards. Eur. J. Comb. 76: 199-207 (2019) - 2018
- [j28]Jonathan Bloom
, Dan Saracino:
Rook and Wilf equivalence of integer partitions. Eur. J. Comb. 71: 246-267 (2018) - 2016
- [j27]Dan Saracino:
The 2-color Rado number of x1+x2+...+xn = y1+y2+...+yk. Ars Comb. 129: 315-321 (2016) - [j26]Jonathan Bloom, Oliver Pechenik
, Dan Saracino:
Proofs and generalizations of a homomesy conjecture of Propp and Roby. Discret. Math. 339(1): 194-206 (2016) - [j25]Jonathan Bloom, Dan Saracino:
Pattern avoidance for set partitions à la Klazar. Discret. Math. Theor. Comput. Sci. 18(2) (2016) - 2015
- [j24]Dan Saracino:
The 2-color Rado Number of x1 + x2 + ... + xm-1 = axm, II. Ars Comb. 119: 193-210 (2015) - 2014
- [j23]Dan Saracino:
The 2-color Rado Number of x1 + x2 + ... + xm-1 = axm. Ars Comb. 113: 81-95 (2014) - 2013
- [j22]Adam Doss, Dan Saracino, Donald L. Vestal Jr.:
An Excursion into Nonlinear Ramsey Theory. Graphs Comb. 29(3): 407-415 (2013) - 2012
- [j21]Jonathan Bloom, Dan Saracino:
Modified growth diagrams, permutation pivots, and the BWX map φ*. J. Comb. Theory A 119(6): 1280-1298 (2012) - 2011
- [j20]Dan Saracino:
On Two Bijections from Sn(321) to Sn(132). Ars Comb. 101: 65-74 (2011) - 2010
- [j19]Jonathan Bloom, Dan Saracino:
Another look at bijections for pattern-avoiding permutations. Adv. Appl. Math. 45(3): 395-409 (2010)
2000 – 2009
- 2009
- [j18]Dan Saracino, Brian Wynne:
The 2-color Rado Number of x + y + kz = 3w. Ars Comb. 90 (2009) - [j17]Jonathan Bloom, Dan Saracino:
On bijections for pattern-avoiding permutations. J. Comb. Theory A 116(8): 1271-1284 (2009) - 2008
- [j16]Pablo A. Parrilo
, Aaron Robertson, Dan Saracino:
On the asymptotic minimum number of monochromatic 3-term arithmetic progressions. J. Comb. Theory A 115(1): 185-192 (2008) - 2007
- [j15]Emeric Deutsch
, Aaron Robertson, Dan Saracino:
Refined restricted involutions. Eur. J. Comb. 28(1): 481-498 (2007) - 2005
- [j14]Sebastian M. Cioaba, Tim LeSaulnier, Dan Saracino:
A Sufficient Condition for Commutativity: 11066. Am. Math. Mon. 112(10): 932-933 (2005) - 2003
- [j13]Greg Martin, Jonathan Bloom, Dan Saracino:
Three Proper Subgroups Covering a Group: 10911. Am. Math. Mon. 110(8): 743-744 (2003) - 2000
- [j12]Dan Saracino:
On a Combinatorial Problem from the Model Theory of Wreath Products, III. J. Comb. Theory A 89(2): 231-269 (2000) - [j11]Mihály Bencze, Dan Saracino, Allen Stenger, S. Amghibech, Jean Anglesio, R. Bauer, A. Siegel, David M. Bloom, G. L. Body, David Callan, Robin J. Chapman, Kevin Ford, Stephen M. Gagola Jr., N. Gauthier, W. V. Grounds, T. Hagedorn, R. T. Koether, N. Komanda, R. N. Krishnan, K.-W. Lau, John H. Lindsey II, L. E. Mattics, C. A. Minh, H. N. Ozsoylev, C. Y. Yildirim, P. G. Poonacha, N. R. Sanjeev, C. Popescu, J. Robertson, H.-J. Sieffert, Jeffrey O. Shallit, N. C. Singer, Albert Stadler, D. C. Terr, T. V. Triff, T. Trimble, Pavel Trojovský:
A Recurrence Generating Multiples of Primes: 10655. Am. Math. Mon. 107(3): 281-282 (2000)
1990 – 1999
- 1999
- [j10]Dan Saracino:
On a Combinatorial Problem from the Model Theory of Wreath Products, I. J. Comb. Theory A 86(2): 281-305 (1999) - [j9]Dan Saracino:
On a Combinatorial Problem from the Model Theory of Wreath Products, II. J. Comb. Theory A 86(2): 306-322 (1999) - [j8]Dan Saracino:
Prime E.C. Commutative Rings in Characteristic n bigger equal to 2. J. Symb. Log. 64(2): 629-633 (1999) - 1996
- [j7]Gregory L. Cherlin, Gary A. Martin, Dan Saracino:
Arities of Permutation Groups: Wreath Products and k-Sets. J. Comb. Theory A 74(2): 249-286 (1996) - 1993
- [j6]Dan Saracino, Carol Wood:
Partially Homogeneous Partially Ordered Sets. J. Comb. Theory A 62(2): 216-224 (1993)
1980 – 1989
- 1988
- [j5]Dan Saracino, Carol Wood:
Homogeneous finite rings in characteristic 2n. Ann. Pure Appl. Log. 40(1): 11-28 (1988) - 1985
- [j4]Dan Saracino, Carol Wood:
Finite QE rings in characteristic p2. Ann. Pure Appl. Log. 28(1): 13-31 (1985) - 1984
- [j3]Dan Saracino, Carol Wood:
QE Commutative Nilrings. J. Symb. Log. 49(2): 644-651 (1984)
1970 – 1979
- 1978
- [j2]Dan Saracino:
Existentially Complete Torsion-Free Nilpotent Groups. J. Symb. Log. 43(1): 126-134 (1978) - 1975
- [j1]Dan Saracino:
A Counterexample in the Theory of Model Companions. J. Symb. Log. 40(1): 31-34 (1975)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint