Recent publications by Winfried Just

Preprints

1. G. A. Enciso and W. Just; Large attractors in cooperative bi-quadratic Boolean networks. Part I..
   arXiv:0711.2799v2

   Abstract
   Link to preprint

2. W. Just and G. A. Enciso; Large attractors in cooperative bi-quadratic Boolean networks. Part II..
   arXiv:0801.4556v1

   Abstract
   Link to preprint

3. W. Just; The steady state system problem is NP-hard even for monotone quadratic Boolean dynamical systems.

   Abstract
   Preprint

Submitted

1. W. Just and A. Nevai; A Kolmogorov-type Competition Model with Finitely Supported Allocation Profiles and its Applications to Plant Competition for Sunlight.
   MBI Technical Report No. 70.
   Submitted to Journal of Biological Dynamics.

   Abstract
   Link to preprint

2. W. Just and G. A. Enciso; Analogues of the Smale and Hirsch Theorems for Cooperative Boolean and Other Discrete Systems.
   arXiv:0711.0138v2
   Submitted to Journal of Difference Equations and Applications.

   Abstract
   Link to preprint

3. W. Just and B. Stigler; Efficiently Computing Groebner Bases of Ideals of Points.
   arXiv:0711.3475v1
   Submitted to Applicable Algebra in Engineering, Communication and Computing.

   Abstract
   Link to preprint

To appear

1. W. Just, S. Ahn, and D. Terman; Minimal attractors in digraph system models of neuronal networks.
   To appear in Physica D.

   Abstract
   Link to preprint

2. W. Just and A. Nevai; A Kolmogorov-type Competition Model with Multiple Coexistence States and its Applications to Plant Competition for Sunlight.
   To appear in Journal of Mathematical Analysis and its Applications.

   Abstract
   Link to preprint

Recent articles

1. D. Terman, S. Ahn, X. Wang, and W. Just; Reducing neuronal networks to discrete dynamics.
   Physica D 237(3) (2008) 324-338.

   Abstract
   Link to preprint

2. W. Just; Data requirements of reverse-engineering algorithms.
   Annals of the New York Academy of Sciences 1115 (2007) 142-153.

   Abstract
   Preprint

3. W. Just, M. R. Morris, and X. Sun; The evolution of aggressive losers.
   Behavioural Processes 74(3) (2007) 342-350.

   Abstract
   

4. W. Just and B. Stigler; Computing Groebner Bases of Ideals of Few Points in High Dimensions..
   Communications in Computer Algebra 40(3) (2006) 65-76.

   Abstract
   Link to paper on arXiv

5. W. Just; Reverse engineering discrete dynamical systems from data sets with random input vectors.
   Journal of Computational Biology 13(8) (2006) 1435-1456.

   Abstract
   Link to preprint

6. W. Just and G. Della Vedova; Multiple Sequence Alignment as a Facility Location Problem.
   INFORMS Journal on Computing 16(4) (2004) 430-440.

   Abstract

7. W. Just, I. Shmulevich, and J. Konvalina; The number and probability of canalizing functions.
   Physica D 197(3-4) (2004) 211-221.

   Abstract
   Link to the paper on arXiv

8. W. Just and X. Sun; Is the Predicted ESS in the Sequential Assessment Game Evolvable?
   Proceedings of GECCO 2004 (Genetic and Evolutionary Computation Conference 2004), Kalyanmoy Deb et al. (eds.), Lecture Notes in Computer Science 3102, Springer Verlag: Berlin, 499-500.

   Abstract

9. X. Sun and W. Just; Evolution of Strategies in Modified Sequential Assessment Games.
   Proceedings of CEC 2004 (2004 Congress on Evolutionary Computation), Garrison W. Greenwood (ed.), IEEE Press, 388-394.

   Abstract

10. W. Just and F. Zhu; Individual-Based Simulations of the War of Attrition.
    Behavioural Processes 66(1) (2004) 53-62.

    Abstract

11. W. Just and M. R. Morris; The Napoleon Complex: Why Smaller Males Pick Fights.
    Evolutionary Ecology 17(5) (2003) 509-522.

    Abstract

12. Y. Xiao and W. Just; A Possible Mechanism of Repressing Cheating Mutants in Myxobacteria.
    E. Cantú-Paz et al. (Eds.): Genetic and Evolutionary Computation Conference - GECCO 2003. LNCS 2723, Springer Verlag: Berlin, 154-155.

    Abstract
    Companion web page

13. W. Just and X. Sun; Simulating the Evolution of Contest Escalation.
    Alwyn Barry (Ed.): Workshop Program for GECCO 2003 (Genetic and Evolutionary Computation Conference), 75-77.

    Abstract
    pdf file
    A slightly expanded version of the paper
    Companion web page

14. W. Just and F. Zhu; Effects of Genetic Architecture on Simultaneous Evolution of Multiple Traits.
    Alwyn Barry (Ed.): Workshop Program for GECCO 2003 (Genetic and Evolutionary Computation Conference), 22-26.

    Abstract
    pdf file

15. W. Just; Computational complexity of multiple sequence alignment with SP-score.
    Journal of Computational Biology Vol. 8 No. 6 (2001) 615-623.

    Abstract

16. W. Just; $\clubsuit$-like principles under CH.
    Fundamenta Mathematicae 170 (2001) 247-256.

    Abstract
    

17. J. Brendle, W. Just, and C. Laflamme; On the refinement and countable refinement numbers.
    Questions and Answers in General Topology 18 (2000) 123-128.

    Abstract
    

18. Z. T. Balogh, S. W. Davis, W. Just, S. Shelah, and P. J. Szeptycki; Strongly almost disjoint sets and weakly uniform bases.
    Transactions of the AMS 352 number 11 (2000) 4971-4987.

    Abstract
    

19. W. Just and G. Della Vedova; Multiple Sequence Alignment as a Facility Location Problem.
    Proceedings of Prague Stringology Club Workshop '2000, Collaborative Report DC-2000-03, M. Balik and M. Simanek, eds., Department of Computer Science and Engineering, Czech Technical University, 60-70.

    Abstract
    DVI-file
    postscript file

20. W. Just, M. Wu, and J. Holt; How to Evolve a Napoleon Complex.
    Proceedings of 2000 Congress on Evolutionary Computation, Vol. 2, IEEE Press 2000, 851-856.

    Abstract
    Word file

21. W. Just, M. V. Matveev, and P. J. Szeptycki; Some results on property (a).
    Topology and its Applications 100 (2000) 67-83.

    Abstract
    

22. A. V. Arhangel'skii, W. Just, E. A. Reznichenko, and P. J. Szeptycki; Sharp bases and weakly uniform bases versus point-countable bases.
    Topology and its Applications 100 (2000) 39-46.

    Abstract
    

23. W. Just, S. Shelah, and S. Thomas; The Automorphism Tower Problem Revisited.
    Advances in Mathematics 148(2) (1999) 243-265.

    Abstract

24. P. DeLaney and W. Just; Two remarks on weaker connected topologies.
    Commentationes Mathematicae Universitatis Carolinae (CMUC) 40,2 (1999) 327-329.

    Abstract
    

25. S. Garcia-Ferreira and W. Just; Some remarks on the $\gamma_p$-property.
    Questions and Answers in General Topology 17 (1999) 1-8.

    Abstract
    

26. S. Garcia-Ferreira and W. Just; Two examples of relatively pseudocompact spaces.
    Questions and Answers in General Topology 17 (1999) 35-45.

    Abstract
    

27. W. Just and J. Tartir; A $\kappa$-normal, not densely normal Tychonoff space.
    Proceedings of the AMS 127 Number 3 (1999) 901-905.

    Abstract

28. W. Just and P. Vojtas; On matrix rapid filters.
    Fundamenta Mathematicae 154 (1997) 177-182.

    Abstract

29. W. Just and A. Tanner; Splitting $\omega$-covers.
    Comment. Math. Univ. Carolinae 38,2 (1997) 375-378.

    Abstract.

30. W. Just, M. Scheepers, J. Steprans, and P. J. Szeptycki; $G_\delta$-sets in topological spaces and games.
    Fundamenta Mathematicae 153 (1997) 41-58.

    Abstract

31. A. V. Arhangel'skii, W. Just, and G. Plebanek; Sequential continuity on dyadic compacta and topological groups.
    Comment. Math. Univ. Carolinae 37,4 (1996) 775-790.

    Abstract

32. W. Just, A. W. Miller, M. Scheepers, and P. J. Szeptycki; The combinatorics of open covers II.
    Topology and its Applications 73 (1996) 241-266.

    Abstract

33. W. Just; The sizes of relatively compact $T_1$-spaces.
    Comment. Math. Univ. Carolinae 37,2 (1996) 379-380.

    Abstract

34. W. Just, O. Sipacheva, and P. J. Szeptycki; Nonnormal spaces $C_p(X)$ with countable extent.
    Proceedings of the AMS vol. 124(4) (1996) 1227-1235.

    Abstract

Recent Books

1. W. Just and M. Weese; Discovering Modern Set Theory. I: The Basics. Graduate Studies in Mathematics vol. 8, American Mathematical Society, Providence, RI, 1996.

2. W. Just and M. Weese; Discovering Modern Set Theory. II: Set-Theoretic Tools for Every Mathematician. Graduate Studies in Mathematics vol. 18, American Mathematical Society, Providence, RI, 1997.

Recent Reviews

1. Review of Set theory for the working mathematician, by KRZYSZTOF CIESIELSKI, Journal of Symbolic Logic 63(3) (1998) 1193-1194.

Recent abstracts

1. W. Just and G. A. Enciso; Dynamics of cooperative discrete systems. Abstracts AMS 29(1) (2008) 122. Abstract number 1035-39-1302.
2. W. Just and M. R. Morris; The Napoleon Complex: Why Smaller Males Pick Fights. Theory and Mathematics in Biology and Medicine 1999, Abstracts, Vrije Universiteit Amsterdam, June 29 - July 3, 1999.

3. W. Just, M. V. Matveev, and P. J. Szeptycki; Matveev's variations on the theme of compactness and countable compactness. AMS, Abstract number 926-54-124.

4. A. V. Arhangel'skii, W. Just, E. A. Rezniczenko, and P. J. Szeptycki; Sharp bases and weakly uniform bases versus point-countable bases. AMS, Abstract number 926-54-238.

Recent talks, lectures, and poster presentations

1. Dynamics of cooperative discrete systems Invited special session at 2008 Annual Meeting of the AMS, San Diego, 01/07/08, 20 min (joint work with German A. Enciso).
2. Mathematical Tools for the Understanding of Life, Mathematical Snapshots Lecture Series, Ohio University, 11/01/07, 50 min.
3. Discrete vs. continuous dynamics of certain neuronal networks, Max Planck Institute for Mathematics in the Sciences, Leipzig, Germany, 07/02/07, 60 min (joint work with Sungwoo Ahn, Xueying Wang and David Terman).
4. Discrete vs. continuous dynamics of certain neuronal networks, Universitaet Leipzig, Leipzig, Germany, 06/26/07, 45 min (joint work with Sungwoo Ahn, Xueying Wang and David Terman).
5. ODE models and discrete models in biology, Advanced School on Mathematical Tools for Complex Systems in Science and Technology, Technical University of Denmark, Lyngby, Denmark, 06/10/07, 7 min.
6. Dynamics in digraph system models for networks of neurons, Applied and Computational Mathematics Seminar, Ohio University, 02/26/07, 50 min (joint work with Sungwoo Ahn, Xueying Wang and David Terman).
7. Hard questions about simple finite dynamical systems, Applied and Computational Mathematics Seminar, Ohio University, 10/09/06, 50 min.
8. Data requirements of reverse-engineering algorithms, DIMACS Workshop on Dialogue on Reverse Engineering Assessment and Methods (DREAM), New York City, 09/07/06, 20 min.
   An eBriefing of the New York Academy of Sciences.
9. Using Groebner bases to reverse-engineer biochemical networks, ACA 2006 (12th International Conference on Applications of Computer Algebra), Varna, Bulgaria, 06/27/06, 30 min (joint work with Brandilyn Stigler).
10. Hard questions about simple finite dynamical systems, MBI Postdoctoral Seminar, Ohio State University, 05/25/06, 50 min.
11. Computing Groebner Bases when m << n, ECCAD 2006 (East Coast Computer Algebra Day 2006), Drexel University, Philadelphia, PA, May 6, 2006, poster presentation given by Brandilyn Stigler on joint work with me.
12. An algebraic approach to reverse engineering of biochemical networks, Data Mining & Statistical Learning Study Group, Ohio State University, 01/26/06,60 min (joint talk with Brandilyn Stigler).
13. Games digital animals play, Biophysics Seminar, Ohio State University, 10/19/05, 50 min.
14. Games digital animals play, MBI Seminar, Mathematical Biosciences Institute, Ohio State University, 10/11/05, 50 min.
15. A combinatorial problem in gene regulation, Bioinformatics Seminar, School of Electrical Engineering and Computer Science, Ohio University, 04/18/05, 50 min (joint work with I. Shmulevich and J. Konvalina).
16. Complexity of the Multiple Sequence Alignment Problem, Bioinformatics Seminar, School of Electrical Engineering and Computer Science, Ohio University, 04/06/05, 50 min (joint work with G. Della Vedova).
17. A combinatorial problem in gene regulation, Applied and Computational Mathematics Seminar, Ohio University, 01/18/05, 50 min (joint work with I. Shmulevich and J. Konvalina).
18. Is the Predicted ESS in the Sequential Assessment Game Evolvable? GECCO 2004 (Genetic and Evolutionary Computation Conference 2004), Seattle, WA, June 29, 2004, poster presentation (joint work with Xiaolu Sun).
19. Evolution of Strategies in Modified Sequential Assessment Games, CEC2004 (2004 Congress on Evolutionary Computation), Portland, OR, June 20, 2004, contributed talk, 20 min (joint work with Xiaolu Sun).
20. An introduction to black-box complexity , Applied and Computational Mathematics Seminar, Ohio University, 04/27/04, 50 min.
21. LINKED-The New Science of Networks, Invited presentation for Math Day 2004, Ohio University, 04/21/04, 90 min.
22. Effects of Genetic Architecture on Simultaneous Evolution of Multiple Traits, Applied and Computational Mathematics Seminar, Ohio Unversity, 10/07/03, 50 min (joint work with Fang Zhu).
23. A Possible Mechanism of Repressing Cheating Mutants in Myxobacteria, Poster presentation at "Biocomplexity V: Multiscale Modeling in Biology" workshop, South Bend, IN, 08/15/03, poster presentation (joint work with Ying Xiao).
24. A Possible Mechanism of Repressing Cheating Mutants in Myxobacteria, Poster presentation at GECCO'03 (Genetic and Evolutionary Computation Conference), Chicago, 07/15/03, poster presentation (joint work with Ying Xiao).
25. Simulating the Evolution of Contest Escalation, Workshop talk at BioGEC 2003 (Biological Applications for Genetic and Evolutionary Computation), Chicago, 07/12/03, 15 min (joint work with Xiaolu Sun).
26. Effects of Genetic Architecture on Evolution of Multiple Traits, Workshop talk at ADoRo 2003 (Analysis and Design of Representations and Operators), Chicago, 07/12/03, 25 min (joint work with Fang Zhu).
27. Testing the War of Attrition Model with Computer Simulations, Ecolunch, Ohio University, 01/15/03, 50 min (joint work with Fang Zhu).
28. Complexity of Multiple Sequence Alignment, Applied and Computational Mathematics Seminar, Ohio Unversity, 11/05/02, 50 min.
29. Testing the Sequential assessment Game with Computer Simulations, 2002 Annual Meeting of the Animal Behavior Society, Indiana University, Bloomington, contributed talk, 07/14/02, 15 min (joint work with Xiaolu Sun).
30. Testing the Sequential Assessment Model with Computer Simulations, 5th ESTMB Conference on Mathematical Modelling and Computing in Biology and Medicine, Milano, Italy, contributed talk, 07/03/02, 15 min (joint work with Xiaolu Sun).
31. Effects of pleiotropy on simultaneous evolution of multiple traits, Evolution 2002, University of Illinois at Urbana-Champaign, contributed talk, 06/29/02, 15 min (joint work with Fang Zhu).
32. Complexity issues in bioinformatics, colloquium talk, Department of Physics and Astronomy, Ohio University, 04/26/02, 50 min.
33. Mathematics and the Genome, public lecture in celebration of Mathematics Awareness Month, Ohio University, 04/05/02, 50 min.
34. Coding Multiple Thresholds in a Genome and the Power of Selection, 53rd Annual Meeting of the AIBS, 03/22/02, poster presentation (joint work with Fang Zhu).
35. The Mathematics of the Genome, West Virginia University, invited colloquium talk, 03/19/02, 50 min.
36. Simulated evolution of fighting rituals, 2001 Annual Meeting of the Animal Behavior Society, Oregon State University, contributed talk, 07/16/01, 15 min.
37. Simulated evolution of fighting rituals, invited seminar talk, Bowling Green State University, 03/23/01, 50 min.
38. Simulated evolution of fighting rituals, 2001 Midwest regional meeting of the Animal Behavior Society, contributed talk, 03/17/01, 15 min.
39. The new science of bioinformatics, ACM sponsored lecture, Ohio University, 03/07/01, 75 min.
40. Some computational challenges in functional genomics, Molecular Biology Seminar, Ohio University, 01/26/01, 50 min.
41. What is bioinformatics and what can it do for the rest of biology? Invited talk at the University of Kentucky, Lexington, KY, 12/06/00, 50 min.
42. Simuated Evolution of Fighting Rituals, Invited talk at the University of Kentucky, Lexington, KY, 12/05/00, 50 min.
43. Multiple Sequence Alignment as a Facility Location Problem, Prague Stringology Club Workshop '2000, Bratislava, Slovakia, 09/02/00, 40 min.
44. How to evolve a Napoleon Complex, Special session talk, 2000 Congress on Evolutionary Computation, San Diego, CA, 07/18/00, 20 min.
45. A connection between multiple sequence alignment and facility location problems (continued), Algorithms and Computational Biology Seminar, Ohio University, 03/01/00, 50 min.
46. What is bioinformatics and what can it do for neuroscience? Seminar talk at Neurolunch, Ohio University, 02/25/00, 50 min.
47. A connection between multiple sequence alignment and facility location problems, Algorithms and Computational Biology Seminar, Ohio University, 02/02/00, 50 min.
48. Is multiple sequence alignment with SP-score really computationally intractable? Poster presented at the Third Annual Conference on Computational Genomics organized by The Institute for Genomic Research, Baltimore, Maryland, November 18-21, 1999.
49. The new science of bioinformatics - why should mathematicians care? Colloquium talk, Department of Mathematics, Ohio University, 10/14/99, 50 min.
50. Complexity of multiple sequence alignment with fixed gap penalties, Seminars in Computational Biology, Ohio University, 09/29/99, 50 min.
51. More on computational complexity of multiple alignment with SP-score, Seminars in Computational Biology, Ohio University, 09/22/99, 50 min.
52. Computational complexity of multiple alignment with SP-score revisited, Seminars in Computational Biology, Ohio University, 09/15/99, 50 min.
53. The Napoleon Complex: Why Smaller Males Pick Fights, Conference talk, Theory and Mathematics in Biology and Medicine 1999, Amsterdam, 07/01/99, 20 min.
54. Reducing the gap-0 multiple alignment problem to the multiple alignment problem, Algorithms and Computation Theory Seminar, Ohio University, 06/03/99, 50 min.
55. Heuristic alignment algorithms: BLAST and FASTA, Algorithms and Computation Theory Seminar, Ohio University, 05/19/99, 50 min.
56. Gap-0 multiple alignment is NP-hard, Algorithms and Computation Theory Seminar, Ohio University, 04/21/99, 50 min.
57. The Napoleon Complex: why smaller males pick fights, Ecolunch, Ohio University, 04/21/99, invited seminar talk, 50 min.
58. A short primer in molecular biology, Algorithms and Computation Theory Seminar, Ohio University, 04/15/99, 50 min.
59. Applications of elementary submodels in topology and set theory, series of invited lectures given at 2nd Summer School on Set Theory and Topology organized by students of Warsaw University, held in Szumin, Poland, July 5 - July 9, 1998.
60. An application of elementary submodels to topology, Universität Potsdam, Germany, 07/02/98, invited seminar talk, 50 min.
61. A square-like combinatorial principle, Freie Universität Berlin, Germany, 07/01/98, invited seminar talk, 90 min.
62. Two challenging problems about cardinal invariants of the continuum, The Hebrew University, Jerusalem, Israel, 01/14/98, seminar talk, 120 min.
63. Applications of elementary submodels of set theory to topology, Ben Gurion University, Beer Sheva, Israel, 12/09/97, invited colloquium talk, 50 min.
64. Relative topological properties, Bir Zeit University, Palestine, 11/24/97, invited colloquium talk, 50 min.
65. Some applications of elementary submodels to topology, The Hebrew University, Jerusalem, Israel, 11/12/97, seminar talk, 120 min.
66. Matveev's variations on the theme of compactness and countable compactness, Special session talk, AMS meeting, Georgia Institute of Technology, Atlanta, Georgia, 10/18/97, 20 min.
67. An application of elementary submodels in topology, Connecticut Logic Seminar, Wesleyan University, 09/29/97, invited talk, 75 min.
68. Variants of countable compactness, MAMLS, Rutgers University, 09/20/97, invited conference talk, 50 min.
69. The use of elementary submodels in topology, CUNY, New York City, 09/19/97, invited seminar talk, 120 min.