Finite Product of Semiring of Sets

AbstractWe formalize that the image of a semiring of sets [17] by an injective function is a semiring of sets.We offer a non-trivial example of a semiring of sets in a topological space [21]. Finally, we show that the finite product of a semiring of sets is also a semiring of sets [21] and that the finite product of a classical semiring of sets [8] is a classical semiring of sets. In this case, we use here the notation from the book of Aliprantis and Border [1].Rue de la Brasserie 5 7100 La Louvière, BelgiumCharalambos D. Aliprantis and Kim C. Border. Infinite dimensional analysis. Springer- Verlag, Berlin, Heidelberg, 2006.Grzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377-382, 1990.Grzegorz Bancerek. König’s theorem. Formalized Mathematics, 1(3):589-593, 1990.Grzegorz Bancerek. Tarski’s classes and ranks. Formalized Mathematics, 1(3):563-567, 1990.Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41-46, 1990.Grzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91-96, 1990.Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107-114, 1990.Vladimir Igorevich Bogachev and Maria Aparecida Soares Ruas. Measure theory, volume 1. Springer, 2007.Czesław Bylinski. Binary operations. Formalized Mathematics, 1(1):175-180, 1990.Czesław Bylinski. Functions and their basic properties. Formalized Mathematics, 1(1): 55-65, 1990.Czesław Bylinski. Functions from a set to a set. Formalized Mathematics, 1(1):153-164, 1990.Czesław Bylinski. Partial functions. Formalized Mathematics, 1(2):357-367, 1990.Czesław Bylinski. Some basic properties of sets. Formalized Mathematics, 1(1):47-53, 1990.Roland Coghetto. Semiring of sets. Formalized Mathematics, 22(1):79-84, 2014. doi:10.2478/forma-2014-0008. [Crossref]Agata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165-167, 1990.Noboru Endou, Kazuhisa Nakasho, and Yasunari Shidama. σ-ring and σ-algebra of sets. Formalized Mathematics, 23(1):51-57, 2015. doi:10.2478/forma-2015-0004. [Crossref]D.F. Goguadze. About the notion of semiring of sets. Mathematical Notes, 74:346-351, 2003. ISSN 0001-4346. doi:10.1023/A:1026102701631. [Crossref]Zbigniew Karno. On discrete and almost discrete topological spaces. Formalized Mathematics, 3(2):305-310, 1992.Beata Padlewska. Families of sets. Formalized Mathematics, 1(1):147-152, 1990.Beata Padlewska and Agata Darmochwał. Topological spaces and continuous functions. Formalized Mathematics, 1(1):223-230, 1990.Jean Schmets. Théorie de la mesure. Notes de cours, Université de Liège, 146 pages, 2004.Andrzej Trybulec. Enumerated sets. Formalized Mathematics, 1(1):25-34, 1990.Andrzej Trybulec and Agata Darmochwał. Boolean domains. Formalized Mathematics, 1 (1):187-190, 1990.Wojciech A. Trybulec. Non-contiguous substrings and one-to-one finite sequences. Formalized Mathematics, 1(3):569-573, 1990.Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1 (1):73-83, 1990.Edmund Woronowicz. Relations defined on sets. Formalized Mathematics, 1(1):181-186, 1990

Automated Discharging Arguments for Density Problems in Grids

Discharging arguments demonstrate a connection between local structure and global averages. This makes it an effective tool for proving lower bounds on the density of special sets in infinite grids. However, the minimum density of an identifying code in the hexagonal grid remains open, with an upper bound of $\frac{3}{7} \approx 0.428571$ and a lower bound of $\frac{5}{12}\approx 0.416666$. We present a new, experimental framework for producing discharging arguments using an algorithm. This algorithm replaces the lengthy case analysis of human-written discharging arguments with a linear program that produces the best possible lower bound using the specified set of discharging rules. We use this framework to present a lower bound of $\frac{23}{55} \approx 0.418181$ on the density of an identifying code in the hexagonal grid, and also find several sharp lower bounds for variations on identifying codes in the hexagonal, square, and triangular grids.Comment: This is an extended abstract, with 10 pages, 2 appendices, 5 tables, and 2 figure

An Introduction to Gerbes on Orbifolds

This paper is a gentle introduction to some recent results involving the theory of gerbes over orbifolds for topologists, geometers and physicists. We introduce gerbes on manifolds, orbifolds, the Dixmier-Douady class, Beilinson-Deligne orbifold cohomology, Cheeger-Simons orbifold cohomology and string connections.Comment: To appear in the Annales Mathematiques Blaise Pasca

Symmetric angular momentum coupling, the quantum volume operator and the 7-spin network: a computational perspective

A unified vision of the symmetric coupling of angular momenta and of the quantum mechanical volume operator is illustrated. The focus is on the quantum mechanical angular momentum theory of Wigner's 6j symbols and on the volume operator of the symmetric coupling in spin network approaches: here, crucial to our presentation are an appreciation of the role of the Racah sum rule and the simplification arising from the use of Regge symmetry. The projective geometry approach permits the introduction of a symmetric representation of a network of seven spins or angular momenta. Results of extensive computational investigations are summarized, presented and briefly discussed.Comment: 15 pages, 10 figures, presented at ICCSA 2014, 14th International Conference on Computational Science and Application

Hybrid finite difference/finite element immersed boundary method

The immersed boundary method is an approach to fluid-structure interaction that uses a Lagrangian description of the structural deformations, stresses, and forces along with an Eulerian description of the momentum, viscosity, and incompressibility of the fluid-structure system. The original immersed boundary methods described immersed elastic structures using systems of flexible fibers, and even now, most immersed boundary methods still require Lagrangian meshes that are finer than the Eulerian grid. This work introduces a coupling scheme for the immersed boundary method to link the Lagrangian and Eulerian variables that facilitates independent spatial discretizations for the structure and background grid. This approach employs a finite element discretization of the structure while retaining a finite difference scheme for the Eulerian variables. We apply this method to benchmark problems involving elastic, rigid, and actively contracting structures, including an idealized model of the left ventricle of the heart. Our tests include cases in which, for a fixed Eulerian grid spacing, coarser Lagrangian structural meshes yield discretization errors that are as much as several orders of magnitude smaller than errors obtained using finer structural meshes. The Lagrangian-Eulerian coupling approach developed in this work enables the effective use of these coarse structural meshes with the immersed boundary method. This work also contrasts two different weak forms of the equations, one of which is demonstrated to be more effective for the coarse structural discretizations facilitated by our coupling approach