Open Access. Powered by Scholars. Published by Universities.®

Mathematics Commons™

Open Access. Powered by Scholars. Published by Universities.®

2017

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 391 - 420 of 1334

Full-Text Articles in Mathematics

Domains And Probability Measures: A Topological Retrospective, Michael Mislove Jun 2017

Domains And Probability Measures: A Topological Retrospective, Michael Mislove

Summer Conference on Topology and Its Applications

Domain theory has seen success as a semantic model for high-level programming languages, having devised a range of constructs to support various effects that arise in programming. One of the most interesting - and problematic - is probabilistic choice, which traditionally has been modeled using a domain-theoretic rendering of sub-probability measures as valuations. In this talk, I will place the domain-theoretic approach in context, by showing how it relates to the more traditional approaches such as functional analysis and set theory. In particular, we show how the topologies that arise in the classic approaches relate to the domain-theoretic rendering. We …


Extension Theorems For Large Scale Spaces Via Neighbourhood Operators, Thomas Weighill, Jerzy Dydak Jun 2017

Extension Theorems For Large Scale Spaces Via Neighbourhood Operators, Thomas Weighill, Jerzy Dydak

Summer Conference on Topology and Its Applications

Coarse geometry is the study of the large scale behaviour of spaces. The motivation for studying such behaviour comes mainly from index theory and geometric group theory. In this talk we introduce the notion of (hybrid) large scale normality for large scale spaces and prove analogues of Urysohn’s Lemma and the Tietze Extension Theorem for spaces with this property, where continuous maps are replaced by (continuous and) slowly oscillating maps. To do so, we first prove a general form of each of these results in the context of a set equipped with a neighbourhood operator satisfying certain axioms, from which …


Braid Group Actions On Rational Maps, Eriko Hironaka, Sarah Koch Jun 2017

Braid Group Actions On Rational Maps, Eriko Hironaka, Sarah Koch

Summer Conference on Topology and Its Applications

Rational maps are maps from the Riemann sphere to itself that are defined by ratios of polynomials. A special type of rational map is the ones where the forward orbit of the critical points is finite. That is, under iteration, the critical points all eventually cycle in some periodic orbit. In the 1980s Thurston proved the surprising result that (except for a well-understood set of exceptions) when the post-critical set is finite the rational map is determined by the “combinatorics” of how the map behaves on the post-critical set. Recently, there has been interest in the question: what happens if …


How Accurate Are Expert Estimations Of Correlation?, Michael Beer, Zitong Gong, Francisco Alejandro Diaz De La O, Vladik Kreinovich Jun 2017

How Accurate Are Expert Estimations Of Correlation?, Michael Beer, Zitong Gong, Francisco Alejandro Diaz De La O, Vladik Kreinovich

Departmental Technical Reports (CS)

In many practical situations, it is important to know the correlation between different quantities -- finding correlations helps find the causes of different phenomena, and helps to find way to improve the situation. Often, there is not enough empirical data to experimentally determine all possible correlation. In such cases, a natural idea is to supplement this situation with expert estimates. Expert estimates are rather crude. So, to decide whether to act based on these estimates, it is desirable to know how accurate are expert estimates. In this paper, we propose several techniques for gauging this accuracy.


In Memoriam : Elart Von Collan, Boyan N. Dimitrov Jun 2017

In Memoriam : Elart Von Collan, Boyan N. Dimitrov

Mathematics Publications

No abstract provided.


In Education, Delayed Feedback Is Often More Efficient Than Immediate Feedback: A Geometric Explanation, Francisco Zapata, Olga Kosheleva, Vladik Kreinovich Jun 2017

In Education, Delayed Feedback Is Often More Efficient Than Immediate Feedback: A Geometric Explanation, Francisco Zapata, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

Feedback is important in education. It is commonly believed that immediate feedback is very important. That is why instructors stay often late at night grading students' assignments -- to make sure that the students get their feedback as early as possible. However, surprisingly, experiments show that in many cases, delayed feedback is more efficient that the immediate one. In this paper, we provide a simple geometric explanation of this seemingly counter-intuitive empirical phenomenon.


Quantitative Justification For The Gravity Model In Economics, Vladik Kreinovich, Songsak Sriboonchitta Jun 2017

Quantitative Justification For The Gravity Model In Economics, Vladik Kreinovich, Songsak Sriboonchitta

Departmental Technical Reports (CS)

The gravity model in economics describes the trade flow between two countries as a function of their Gross Domestic Products (GDPs) and the distance between them. This model is motivated by the qualitative similarity between the desired dependence and the dependence of the gravity force (or potential energy) between the two bodies on their masses and on the distance between them. In this paper, we provide a quantitative justification for this economic formula.


How To Get Beyond Uniform When Applying Maxent To Interval Uncertainty, Songsak Sriboonchitta, Vladik Kreinovich Jun 2017

How To Get Beyond Uniform When Applying Maxent To Interval Uncertainty, Songsak Sriboonchitta, Vladik Kreinovich

Departmental Technical Reports (CS)

In many practical situations, the Maximum Entropy (MaxEnt) approach leads to reasonable distributions. However, in an important case when all we know is that the value of a random variable is somewhere within the interval, this approach leads to a uniform distribution on this interval -- while our intuition says that we should have a distribution whose probability density tends to 0 when we approach the interval's endpoints. In this paper, we show that in most cases of interval uncertainty, we have additional information, and if we account for this additional information when applying MaxEnt, we get distributions which are …


Efficient Algorithms For Synchroning Localization Sensors Under Interval Uncertainty, Raphael Voges, Bernardo Wagner, Vladik Kreinovich Jun 2017

Efficient Algorithms For Synchroning Localization Sensors Under Interval Uncertainty, Raphael Voges, Bernardo Wagner, Vladik Kreinovich

Departmental Technical Reports (CS)

In this paper, we show that a practical need for synchronization of localization sensors leads to an interval-uncertainty problem. In principle, this problem can be solved by using the general linear programming algorithms, but this would take a long time -- and this time is not easy to decrease, e.g., by parallelization since linear programming is known to be provably hard to parallelize. To solve the corresponding problem, we propose more efficient and easy-to-parallelize algorithms.


Maximum Entropy As A Feasible Way To Describe Joint Distributions In Expert Systems, Thongchai Dumrongpokaphan, Vladik Kreinovich, Hung T. Nguyen Jun 2017

Maximum Entropy As A Feasible Way To Describe Joint Distributions In Expert Systems, Thongchai Dumrongpokaphan, Vladik Kreinovich, Hung T. Nguyen

Departmental Technical Reports (CS)

In expert systems, we elicit the probabilities of different statements from the experts. However, to adequately use the expert system, we also need to know the probabilities of different propositional combinations of the experts' statements -- i.e., we need to know the corresponding joint distribution. The problem is that there are exponentially many such combinations, and it is not practically possible to elicit all their probabilities from the experts. So, we need to estimate this joint distribution based on the available information. For this purpose, many practitioners use heuristic approaches -- e.g., the t-norm approach of fuzzy logic. However, this …


Math Department Newsletter, 2016-2017, Mathematics Department Jun 2017

Math Department Newsletter, 2016-2017, Mathematics Department

Mathematics Newsletter

No abstract provided.


Entropy In Topological Groups, Part 1, Dikran Dikranjan Jun 2017

Entropy In Topological Groups, Part 1, Dikran Dikranjan

Summer Conference on Topology and Its Applications

Entropy was introduced first in thermodynamics and statistical mechanics, as well as information theory. In the last sixty years entropy made its way also in topology, ergodic theory, as well as other branches of mathematics as algebra, geometry and number theory where dynamical systems appear in one way or another.

Roughly speaking, entropy is a non-negative real number or infinity assigned to a "selfmap" T of a "space" X, where the "space" X can be a topological or uniform space, a measure space, an abstract or topological group (or vector space) or just a set. The "selfmap" T can be, …


Introduction (2017), Association Of Christians In The Mathematical Sciences Jun 2017

Introduction (2017), Association Of Christians In The Mathematical Sciences

ACMS Conference Proceedings 2017

No abstract provided.


Klein Four Actions On Graphs And Sets, Darren B. Glass Jun 2017

Klein Four Actions On Graphs And Sets, Darren B. Glass

Math Faculty Publications

We consider how a standard theorem in algebraic geometry relating properties of a curve with a (ℤ/2ℤ)2-action to the properties of its quotients generalizes to results about sets and graphs that admit (ℤ/2ℤ)2-actions.


Are Permanent Or Temporary Teams More Efficient: A Possible Explanation Of The Empirical Data, Francisco Zapata, Olga Kosheleva, Vladik Kreinovich Jun 2017

Are Permanent Or Temporary Teams More Efficient: A Possible Explanation Of The Empirical Data, Francisco Zapata, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

It is known that in education, stable (long-term) student teams are more effective than temporary (short-term) ones. It turned out that the same phenomenon is true for workers working on a long-term project. However, somewhat surprisingly, for small-scale projects, the opposite is true: teams without any prior collaboration experience are more successful. Moreover, it turns out that if combine in a team members with prior collaboration experience and members without such experience, the efficiency of the team gets even lower. In this paper, we provide a possible explanation for this strange empirical phenomenon.


Generalized Differential Calculus And Applications To Optimization, R. Blake Rector Jun 2017

Generalized Differential Calculus And Applications To Optimization, R. Blake Rector

Dissertations and Theses

This thesis contains contributions in three areas: the theory of generalized calculus, numerical algorithms for operations research, and applications of optimization to problems in modern electric power systems. A geometric approach is used to advance the theory and tools used for studying generalized notions of derivatives for nonsmooth functions. These advances specifically pertain to methods for calculating subdifferentials and to expanding our understanding of a certain notion of derivative of set-valued maps, called the coderivative, in infinite dimensions. A strong understanding of the subdifferential is essential for numerical optimization algorithms, which are developed and applied to nonsmooth problems in operations …


Pseudo-Contractibility, Felix Capulín, Leonardo Juarez-Villa, Fernando Orozco Jun 2017

Pseudo-Contractibility, Felix Capulín, Leonardo Juarez-Villa, Fernando Orozco

Summer Conference on Topology and Its Applications

Let X, Y be topological spaces and let f, g:X→ Y be mappings, we say that f is pseudo-homotopic to g if there exist a continuum C, points a, b ∈ C and a mapping H:X ×C → Y such that H(x, a)=f(x) and H(x, b)=g(x) for each x ∈ X. The mapping H is called a pseudo-homotopy between f and g. A topological space X is said to be pseudo-contractible if the identity mapping is pseudo-homotopic to a constant mapping in X. i.e., if there exist a continuum C, points a, b ∈ C, x0 ∈ X and …


Normal Images Of A Product And Countably Paracompact Condensation, Jila Niknejad Jun 2017

Normal Images Of A Product And Countably Paracompact Condensation, Jila Niknejad

Summer Conference on Topology and Its Applications

In 1997, Buzjakova proved that for a pseudocompact Tychonoff space X and λ = | βX|+, X condenses onto a compact space if and only if X×(λ+1) condenses onto a normal space. This is a condensation form of Tamano's theorem. An interesting problem is to determine how much of Buzjakova's result will hold if "pseudocompact" is removed from the hypothesis.

In this talk, I am going to show for a Tychonoff space X, there is a cardinal λ such that if X×(λ+1) condenses onto a normal space, then X condenses onto a countably paracompact space.


On The Tightness And Long Directed Limits Of Free Topological Algebras, Gábor Lukács, Rafael Dahmen Jun 2017

On The Tightness And Long Directed Limits Of Free Topological Algebras, Gábor Lukács, Rafael Dahmen

Summer Conference on Topology and Its Applications

For a limit ordinal λ, let (Aα)α < λ be a system of topological algebras (e.g., groups or vector spaces) with bonding maps that are embeddings of topological algebras, and put A = ∪α < λ Aα. Let (A, T) and (A, A) denote the direct limit (colimit) of the system in the category of topological spaces and topological algebras, respectively. One always has T ⊇ A, but the inclusion may be strict; however, if the tightness of A is smaller than the cofinality of λ, then A=T.

In 1988, Tkachenko proved …


A New Class Of Dendrites Having Unique Second Symmetric Product, David Maya, José G. Anaya, Fernando Orozco Zitli Jun 2017

A New Class Of Dendrites Having Unique Second Symmetric Product, David Maya, José G. Anaya, Fernando Orozco Zitli

Summer Conference on Topology and Its Applications

The second symmetric product of a continuum X, F2(X), is the hyperspace consisting of all nonempty subsets of X having at most two points. A continuum X has unique hyperspace F2(X) provided that each continuum Y satisfying that F2(X) and F2(Y) are homeomorphic must be homeomorphic to X. In this talk, a new class of dendrites having unique F2(X) will be presented.


On The Axiomatic Systems Of Steenrod Homology Theory Of Compact Spaces, Leonard Mdzinarishvili, Anzor Beridze Jun 2017

On The Axiomatic Systems Of Steenrod Homology Theory Of Compact Spaces, Leonard Mdzinarishvili, Anzor Beridze

Summer Conference on Topology and Its Applications

The Steenrod homology theory on the category of compact metric pairs was axiomatically described by J.Milnor. In Milnor, the uniqueness theorem is proved using the Eilenberg-Steenrod axioms and as well as relative homeomorphism and clusres axioms. J. Milnor constructed the homology theory on the category Top2C of compact Hausdorff pairs and proved that on the given category it satisfies nine axioms - the Eilenberg-Steenrod, relative homeomorphis and cluster axioms (see theorem 5 in Milnor). Besides, he proved that constructed homology theory satisfies partial continuity property on the subcategory Top2CM (see theorem 4 in Milnor) and the …


On Roitman's Principle For Box Products, Hector Alonso Barriga-Acosta Jun 2017

On Roitman's Principle For Box Products, Hector Alonso Barriga-Acosta

Summer Conference on Topology and Its Applications

One of the oldest problems in box products is if the countable box product of the convergent sequence is normal. It is known that consistenly (e.g., b=d, d=c) the answer is affirmative. A recent progress is due to Judy Roitman that states a combinatorial principle which also implies the normality and holds in many models.

Although the countable box product of the convergent sequence is normal in some models of b < d < c, Roitman asked what happen with her principle in this models. We answer that Roitman's principle is true in some models of b < d < c.


A Compact Minimal Space Whose Cartesian Square Is Not Minimal, Jan P. Boronski, Alex Clark, Piotr Oprocha Jun 2017

A Compact Minimal Space Whose Cartesian Square Is Not Minimal, Jan P. Boronski, Alex Clark, Piotr Oprocha

Summer Conference on Topology and Its Applications

A compact metric space X is called minimal if it admits a minimal homeomorphism; i.e. a homeomorphism h:X→ X such that the forward orbit {hn(x):n=1, 2, ...} is dense in X, for every x ∈ X. In my talk I shall outline a construction of a family of 1-dimensional minimal spaces from "A compact minimal space Y such that its square YxY is not minimal" whose existence answer the following long standing problem in the negative.

Problem. Is minimality preserved under Cartesian product in the class of compact spaces?

Note that for the fixed point property this question …


Liouville Numbers And One-Sided Ergodic Hilbert Transformations, David Constantine, Joanna Furno Jun 2017

Liouville Numbers And One-Sided Ergodic Hilbert Transformations, David Constantine, Joanna Furno

Summer Conference on Topology and Its Applications

We examine one-sided ergodic Hilbert transforms for irrational circle rotations and some mean-zero functions. Our approach uses continued fraction expansions to specify rotations by Liouville numbers for which the transformation has everywhere convergence or divergence.


Relationships Between Topological Properties Of X And Algebraic Properties Of Intermediate Rings A(X), Joshua Sack Jun 2017

Relationships Between Topological Properties Of X And Algebraic Properties Of Intermediate Rings A(X), Joshua Sack

Summer Conference on Topology and Its Applications

A topological property is a property invariant under homeomorphism, and an algebraic property of a ring is a property invariant under ring isomorphism. Let C(X) be the ring of real-valued continuous functions on a Tychonoff space X, let C*(X) ⊆ C(X) be the subring of those functions that are bounded, and call a ring A(X) an intermediate ring if C*(X) ⊆ A(X) ⊆ C(X). For a class Q of intermediate rings, an algebraic property P describes a topological property T among Q if for all A(X), B(Y) ∈ Q if A(X) and B(Y) both satisfy P, …


Fiber Strong Shape Theory For Topological Spaces, Ruslan Tsinaridze, Vladimer Baladze Jun 2017

Fiber Strong Shape Theory For Topological Spaces, Ruslan Tsinaridze, Vladimer Baladze

Summer Conference on Topology and Its Applications

The purpose of this paper is the construction and investigation of fiber strong shape theory for compact metrizable spaces over a fixed base space B0 , using the fiber versions of cotelescop, fibrant space and SSDR-map. In the paper obtained results containing the characterizations of fiber strong shape equivalences, based on the notion of double mapping cylinder over a fixed space B0. Besides, in the paper we construct and develop a fiber strong shape theory for arbitrary spaces over fixed metrizable space B0. Our approach is based on the method of Mardešić-Lisica and instead of …


Application Of Kudryashov Method For The Ito Equations, Mozhgan Akbari Jun 2017

Application Of Kudryashov Method For The Ito Equations, Mozhgan Akbari

Applications and Applied Mathematics: An International Journal (AAM)

In this present work, the Kudryashov method is used to construct exact solutions of the (1+1)- dimensional and the (1+2)-dimensional form of the generalized Ito integro-differential equation. The Kudryashov method is a powerful method for obtaining exact solutions of nonlinear evolution equations. This method can be applied to non-integrable equations as well as integrable ones.


Representation And Decomposition Of An Intuitionistic Fuzzy Matrix Using Some (Α, Α') Cuts, T. Muthuraji, S. Sriram Jun 2017

Representation And Decomposition Of An Intuitionistic Fuzzy Matrix Using Some (Α, Α') Cuts, T. Muthuraji, S. Sriram

Applications and Applied Mathematics: An International Journal (AAM)

The aim of this paper is to study the properties of various (α, α') cuts on Intuitionistic Fuzzy Matrices. Here we introduce different kinds of cuts on Intuitionistic Fuzzy Sets. We discuss some properties of the cuts with some other existing operators on Intuitionistic Fuzzy Matrix. Finally some representation and decomposition of an Intuitionistic Fuzzy Matrix using (α, α') cuts are given.


On Circulant-Like Rhotrices Over Finite Fields, P. L. Sharma, Shalini Gupta, Mansi Rehan Jun 2017

On Circulant-Like Rhotrices Over Finite Fields, P. L. Sharma, Shalini Gupta, Mansi Rehan

Applications and Applied Mathematics: An International Journal (AAM)

Circulant matrices over finite fields are widely used in cryptographic hash functions, Lattice based cryptographic functions and Advanced Encryption Standard (AES). Maximum distance separable codes over finite field GF2 have vital a role for error control in both digital communication and storage systems whereas maximum distance separable matrices over finite field GF2 are used in block ciphers due to their properties of diffusion. Rhotrices are represented in the form of coupled matrices. In the present paper, we discuss the circulant- like rhotrices and then construct the maximum distance separable rhotrices over finite fields.


Private Absorbant Of Generalized De Bruijn Digraphs, B. Johnson Jun 2017

Private Absorbant Of Generalized De Bruijn Digraphs, B. Johnson

Applications and Applied Mathematics: An International Journal (AAM)

No abstract provided.