Abstract
Decomposing the domain of a function into parts has many uses in mathematics. A domain may naturally be a union of pieces, a function may be defined by cases, or different boundary conditions may hold on different regions. For any particular problem the domain can be given explicitly, but when dealing with a family of problems given in terms of symbolic parameters, matters become more difficult. This article shows how hybrid sets, that is multisets allowing negative multiplicity, may be used to express symbolic domain decompositions in an efficient, elegant and uniform way, simplifying both computation and reasoning. We apply this theory to the arithmetic of piecewise functions and symbolic matrices and show how certain operations may be reduced from exponential to linear complexity.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Blizard, W.D.: Multiset theory. Notre Dame Journal of Formal Logic 30(1), 36–66 (Winter 1989)
Blizard, W.D.: Negative membership. Notre Dame Journal of Formal Logic 31(3), 346–368 (1990)
Boole, G.: An investigation of the laws of thought, on which are founded the mathematical theories of logic and probabilities. Walton and Maberly, London (1854), http://www.gutenberg.org/etext/15114
Burgin, M.S.: Concept of multisets in cybernetics. Cybernetics and Systems Analysis 28(3), 371–469 (1992)
Carette, J.: A canonical form for piecewise defined functions. In: Proc. of ISSAC 2007, pp. 77–84. ACM Press, New York (2007)
Hailperin, T.: Boole’s Logic and Probability, 1st/2nd edn. North-Holland Publishing Company, Amsterdam (1976)
Kahl, W.: Compositional syntax and semantics of tables. SQRL Report 15, Department of Computing and Software, McMaster University (2003), http://www.cas.mcmaster.ca/sqrl/sqrl_reports.html
Karr, M.: Summation in finite terms. J. ACM 28(2), 305–350 (1981)
Loeb, D.: Sets with a negative number of elements. Advances in Mathematics 91(1), 64–74 (1992)
Sexton, A.P., Sorge, V., Watt, S.M.: Computing with abstract matrix structures. In: Proc. of ISSAC 2009, pp. 325–332. ACM Press, New York (2009)
Sexton, A.P., Sorge, V., Watt, S.M.: Reasoning with generic cases in the arithmetic of abstract matrices. In: Carette, J., Dixon, L., Coen, C.S., Watt, S.M. (eds.) Calculemus 2009. LNCS (LNAI), vol. 5625, pp. 138–153. Springer, Heidelberg (2009)
Syropoulos, A.: Mathematics of multisets. In: Calude, C.S., Pun, G., Rozenberg, G., Salomaa, A. (eds.) Multiset Processing. LNCS, vol. 2235, pp. 347–358. Springer, Heidelberg (2001)
Whitney, H.: A logical expansion in mathematics. Bulletin of the American Mathematical Society 34(8), 572–579 (1932)
Whitney, H.: Characteristic functions and the algebra of logic. Annals of Mathematics 34(3), 405–414 (1933), http://www.jstor.org/stable/1968168
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Carette, J., Sexton, A.P., Sorge, V., Watt, S.M. (2010). Symbolic Domain Decomposition. In: Autexier, S., et al. Intelligent Computer Mathematics. CICM 2010. Lecture Notes in Computer Science(), vol 6167. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14128-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-14128-7_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14127-0
Online ISBN: 978-3-642-14128-7
eBook Packages: Computer ScienceComputer Science (R0)