Mathematics Publications of Kenneth Paul Baclawski

1. K. Baclawski. Some regular unitary polygons in AG(2,q²). J. Undergraduate Math. 2:55-62. (1970)

2. K. Baclawski and K.M. Kapp. Topisms and induced non-associative systems. Pac. J. Math. 36:45-54. (1971) [pdf]

3. K. Baclawski. Automorphisms and derivations of incidence algebras. Proc. Amer. Math. Soc. 36:351-356. (1972)

4. K. Baclawski and K.M. Kapp. Induced topologies for quasigroups and loops. Pac. J. Math. 45:393-402. (1973) [pdf]

5. K. Baclawski. Whitney numbers of geometric lattices. Advan. in Math. 16:125-138. (1975) [pdf]

6. K. Baclawski. Homology and graphs. In Proc. Int. Colloq. C. N. R. S., Problèmes Combinatoires et Théorie des Graphes 17-18. (1976)

7. K. Baclawski. Homology and Combinatorics of Ordered Sets. Harvard University. (1976)

8. K. Baclawski. Whitney numbers of geometric lattices. In Surveys in Applied Mathematics, Essays dedicated to S. M. Ulam, N. Metropolis, S. Orszag and G.-C. Rota (Ed), 103-116. Academic Press, New York. (1976)

9. K. Baclawski. Galois connections and the Leray spectral sequence. Advan. in Math. 25:191-215. (1977)

10. K. Baclawski and M. Donsker. Mark Kac: Probability, Number Theory and Statistical Physics selected papers. M.I.T. Press, Cambridge. (1978)

11. K. Baclawski and N.L. White. Higher order independence in matroids. J. London Math. Soc. (2)19:193-202. (1979)

12. K. Baclawski. The Möbius algebra as a Grothendieck ring. J. Alg. 57:167-179. (1979) [pdf]

13. K. Baclawski and A. Björner. Fixed points in partially ordered sets. Advan. in Math. 31:263-287. (1979) [pdf]

14. K. Baclawski. Cohen-Macaulay ordered sets. J. Alg. 63:226-258. (1980) [pdf]

15. K. Baclawski. Combinatorial Algorithms for Young Tableaux. Available on request. University of California, San Diego. (1980)

16. K. Baclawski. Nonpositive Cohen-Macaulay connectivity. Haverford College. (1980)

17. K. Baclawski. Algorithms for Young Tableaux. University of California, San Diego. (1980)

18. K. Baclawski and A. Garsia. Combinatorial decompositions of a class of rings. Advan. in Math. 39(2):155-184. (1981) [pdf]

19. K. Baclawski. Rings with lexicographic straightening law. Advan. in Math. 39(2):185-213. (1981) [pdf]

20. K. Baclawski and A. Björner. Fixed points and complements in finite lattices. J. Combinatorial Theory A30:335-338. (1981)

21. K. Baclawski. Canonical modules of partially ordered sets. 8. Institut Mittag-Leffler, Djursholm, Sweden. (1981)

22. K. Baclawski. Lexicographic straightening algorithms. Haverford College. (1981)

23. K. Baclawski. Combinatorics: trends and examples. In Proc. of Case Western Reserve University Centennial Conf. “New Directions in Applied Mathematics” 1-10. (1982)

24. K. Baclawski. Cohen-Macaulay connectivity and geometric lattices. European J. of Combinatorics 3:293-305. (1982)

25. K. Baclawski. Recursive algorithms for unitary and symplectic group representations. SIAM J. Alg. Disc. Meth. 3:592-605. (1982)

26. K. Baclawski. Centennial Medal. Case Western Reserve University. (1982)

27. K. Baclawski. Algorithms for unitary and symplectic group representations. Haverford College. (1982)

28. K. Baclawski. Combinatorial decompositions for rings and almost Cohen-Macaulay complexes. J. Alg. 83:6-19. (1983) [pdf]

29. K. Baclawski. Canonical modules of partially ordered sets. J. Alg. 83:1-5. (1983) [pdf]

30. K. Baclawski. Character generators of unitary and symplectic groups. J. Math. Phys. 24:1688-1694. (1983)

31. K. Baclawski. Algorithms for character generators for unitary and symplectic groups. Haverford College. (1983)

32. K. Baclawski and J. Towber. The shape-algebra and standard bases for G₂. Amer. J. Math. 106:1107-1134. (1984)

33. K. Baclawski. A new rule for computing Clebsch-Gordan series. Advan. in Applied Math. 5:416-432. (1984)

34. K. Baclawski, M. Cerasoli and G.-C. Rota. Introduction to Probability and Random Processes. Unione Matematica Italiana, Bologna, Italy. (1984)

35. K. Baclawski and J. Towber. Algorithms for G₂ representations. Massachusetts Institute of Technology. (1984)

36. K. Baclawski. Algorithms for computing Clebsch-Gordan series. Massachusetts Institute of Technology. (1984)

37. K. Baclawski. A note on Clebsch-Gordan series. Advan. in Applied Math. 7:381-384. (1986)

38. K. Alexander, K. Baclawski and G.-C. Rota. A stochastic interpretation of the Riemann Zeta function. Proc. Nat. Acad. Sci. 90:697-699. (January 1993) [pdf]

39. K. Baclawski, D. Simovici and W. White. A categorical approach to database semantics. Math. Structures in Comp. Sci. 4:147-183. (1994)

40. K. Baclawski and D. Simovici. A characterization of the information content of a classification. Information Processing Letters 57:211-214. (1996)

41. K. Baclawski. Toolkit for tensor operators. Software Amplification. (1997)

42. J. Smith, M. Kokar, K. Baclawski and S. DeLoach. Category Theoretic Approaches of Representing Precise UML Semantics. In Proceedings of the Precise UML Workshop at ECOOP 2000 . (2000) [pdf]

43. M. Kokar, K. Baclawski and H. Gao. Category Theory Based Synthesis of a Higher-Level Fusion Algorithm: An Example. In Fusion'06 . (2006) [pdf]

44. K. Baclawski. A combinatorial proof of a fixed point property. J. of Combin. Theory Ser. A 119(5):994-1013. (July 2012) [pdf]

45. K. Baclawski. Northeastern University Pseudo Cone Facility (NUPCF) Version 1. Northeastern University, College of Computer and Information Sciences. https://bit.ly/3Sz9NNw (2011)

46. K. Baclawski. Northeastern University Pseudo Cone Facility (NUPCF) Version 2. Northeastern University, College of Computer and Information Sciences. NUPCF (2012)

47. K. Baclawski. Proof as Explanation and Narrative. Ontology Summit 2019: Explanations . http://bit.ly/2RqQJQ5 (January 2019) [links]

48. K. Baclawski. A Knowledge Graph Data Model and Query Language. J. Wash. Acad. Sci. 107(3):59-90. (2021) [links]

49. K. Baclawski. Knowledge Graph System Query Language (KGSQL). (2021) [links]

50. K. Baclawski. What is Risk?. https://bit.ly/36yOiZA (March 23, 2022) [pdf]

51. K. Baclawski. The Shape of Planck's Law. J. Wash. Acad. Sci. 108(3):57-63. (2022)

52. K. Baclawski. Finding Transition Points: Zero Crossings, Maxima, Minima and Inflections. J. Wash. Acad. Sci. 108(4):45-58. (2023)