Relevant bibliographies by topics / Path homomorphism

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters

Academic literature on the topic 'Path homomorphism'

Author: Grafiati
Published: 5 September 2021
Last updated: 14 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Path homomorphism.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Path homomorphism"

1

Nešetřil, Jaroslav, and Xuding Zhu. "Path homomorphisms." Mathematical Proceedings of the Cambridge Philosophical Society 120, no. 2 (1996): 207–20. http://dx.doi.org/10.1017/s0305004100074806.

Full text
Abstract:
AbstractWe investigate homomorphisms between finite oriented paths. We demonstrate the surprising richness of this perhaps simplest case of homomorphism between graphs by proving the density theorem for oriented paths. As a consequence every two dimensional countable poset is represented finite paths and their homomorphisms, and every finite dimensional poset is represented finite oriented trees and their homomorphisms. We then consider related problems of universal representability and extendability and on-line representability.
APA, Harvard, Vancouver, ISO, and other styles
2

Bagchi, Susmit. "Interactions between Homotopy and Topological Groups in Covering (C, R) Space Embeddings." Symmetry 13, no. 8 (2021): 1421. http://dx.doi.org/10.3390/sym13081421.

Full text
Abstract:
The interactions between topological covering spaces, homotopy and group structures in a fibered space exhibit an array of interesting properties. This paper proposes the formulation of finite covering space components of compact Lindelof variety in topological (C, R) spaces. The covering spaces form a Noetherian structure under topological injective embeddings. The locally path-connected components of covering spaces establish a set of finite topological groups, maintaining group homomorphism. The homeomorphic topological embedding of covering spaces and base space into a fibered non-compact
APA, Harvard, Vancouver, ISO, and other styles
3

Hazrat, Roozbeh, and Lia Vaš. "K-theory classification of graded ultramatricial algebras with involution." Forum Mathematicum 31, no. 2 (2019): 419–63. http://dx.doi.org/10.1515/forum-2017-0268.

Full text
Abstract:
AbstractWe consider a generalization {K_{0}^{\operatorname{gr}}(R)} of the standard Grothendieck group {K_{0}(R)} of a graded ring R with involution. If Γ is an abelian group, we show that {K_{0}^{\operatorname{gr}}} completely classifies graded ultramatricial {*}-algebras over a Γ-graded {*}-field A such that (1) each nontrivial graded component of A has a unitary element in which case we say that A has enough unitaries, and (2) the zero-component {A_{0}} is 2-proper ({aa^{*}+bb^{*}=0} implies {a=b=0} for any {a,b\in A_{0}}) and {*}-pythagorean (for any {a,b\in A_{0}} one has {aa^{*}+bb^{*}=c
APA, Harvard, Vancouver, ISO, and other styles
4

Pakdaman, Ali, Hamid Torabi, and Behrooz Mashayekhy. "On locally 1-connectedness of quotient spaces and its applications to fundamental groups." Filomat 28, no. 1 (2014): 27–35. http://dx.doi.org/10.2298/fil1401027p.

Full text
Abstract:
Let X be a locally 1-connected metric space and A1,A2,...,An be connected, locally path connected and compact pairwise disjoint subspaces of X. In this paper, we show that the quotient space X/(A1,A2,..., An) obtained from X by collapsing each of the sets Ai?s to a point, is also locally 1-connected. Moreover, we prove that the induced continuous homomorphism of quasitopological fundamental groups is surjective. Finally, we give some applications to find out some properties of the fundamental group of the quotient space X/(A1,A2,...,An).
APA, Harvard, Vancouver, ISO, and other styles
5

Bridges, Douglas, and Matthew Hendtlass. "Continuous isomorphisms from R onto a complete abelian group." Journal of Symbolic Logic 75, no. 3 (2010): 930–44. http://dx.doi.org/10.2178/jsl/1278682208.

Full text
Abstract:
AbstractThis paper provides a Bishop-style constructive analysis of the contrapositive of the statement that a continuous homomorphism of R onto a compact abelian group is periodic. It is shown that, subject to a weak locatedness hypothesis, if G is a complete (metric) abelian group that is the range of a continuous isomorphism from R, then G is noncompact. A special case occurs when G satisfies a certain local path-connectedness condition at 0. A number of results about one-one and injective mappings are proved en route to the main theorem. A Brouwerian example shows that some of our results
APA, Harvard, Vancouver, ISO, and other styles
6

Phillips, John. "Self-Adjoint Fredholm Operators And Spectral Flow." Canadian Mathematical Bulletin 39, no. 4 (1996): 460–67. http://dx.doi.org/10.4153/cmb-1996-054-4.

Full text
Abstract:
AbstractWe study the topology of the nontrivial component, , of self-adjoint Fredholm operators on a separable Hilbert space. In particular, if {Bt} is a path of such operators, we can associate to {Bt} an integer, sf({Bt}), called the spectral flow of the path. This notion, due to M. Atiyah and G. Lusztig, assigns to the path {Bt} the net number of eigenvalues (counted with multiplicities) which pass through 0 in the positive direction. There are difficulties in making this precise — the usual argument involves looking at the graph of the spectrum of the family (after a suitable perturbation)
APA, Harvard, Vancouver, ISO, and other styles
7

EVANS, DAVID E., and JEREMY D. GOULD. "DIMENSION GROUPS AND EMBEDDINGS OF GRAPH ALGEBRAS." International Journal of Mathematics 05, no. 03 (1994): 291–327. http://dx.doi.org/10.1142/s0129167x94000188.

Full text
Abstract:
If Γ is a graph, with distinguished vertex *, let A(Γ) denote the non-commutative path algebra on the space [Formula: see text] of semi-infinite paths in Γ beginning at *. We discuss embeddings A(Γ1) → A(Γ2) of AF algebras associated with graphs Γ1 and Γ2 from a dimension group point of view. For certain infinite T-shaped graphs, we have K0(A(Γ)) ≅ ℤ [t], with positive cone identified with {0}∪ {P ∈ ℤ [t]: P (λ) > 0, λ ∈ (0, γ]}, where γ = γ (Γ) =||Γ||−2 < 1/4. Hence for certain graphs there exists a unital homomorphism A(Γ1) → A(Γ2) if ||Γ1|| ≤ ||Γ2||. For certain finite T-shaped graphs
APA, Harvard, Vancouver, ISO, and other styles
8

EVANS, DAVID E., and JEREMY D. GOULD. "DIMENSION GROUPS, EMBEDDINGS AND PRESENTATIONS OF AF ALGEBRAS ASSOCIATED TO SOLVABLE LATTICE MODELS." Modern Physics Letters A 04, no. 20 (1989): 1883–90. http://dx.doi.org/10.1142/s0217732389002136.

Full text
Abstract:
If Γ is a graph, with distinguished vertex *, let A(Γ) denote the non-commutative path algebra on the space [Formula: see text] of semi-infinite paths in Γ beginning at *. Embeddings A(Γ1)→A(Γ2) of non-commutative AF algebras associated with graphs Γ1 and Γ2 are discussed from a dimension group point of view. For certain infinite T-shaped graphs, we have K0(A(Γ))≃ ℤ[t], with positive cone identified with {0}∪{P∈ℤ(t): P(λ)>0, λ∈(0,γ]}, where γ=γ(Γ)= ||Γ||−2<1/4. Hence for certain graphs there exists a unital homomorphism A(Γ1)→A(Γ2) if ||Γ1||=||Γ2||. For certain finite T-shaped graphs K0(
APA, Harvard, Vancouver, ISO, and other styles
9

Csikvári, Péter, and Zhicong Lin. "Homomorphisms of Trees into a Path." SIAM Journal on Discrete Mathematics 29, no. 3 (2015): 1406–22. http://dx.doi.org/10.1137/140993995.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kun, Gábor, and Claude Tardif. "Homomorphisms of random paths." European Journal of Combinatorics 31, no. 3 (2010): 688–93. http://dx.doi.org/10.1016/j.ejc.2009.09.003.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Path homomorphism"

1

Ferrão, Inês Margarida Neto. "Homomorfismos de grafos por caminhos e o problema da imersão de redes." Master's thesis, 2019. http://hdl.handle.net/10316/87951.

Full text
Abstract:
Dissertação de Mestrado em Matemática apresentada à Faculdade de Ciências e Tecnologia<br>In this work we begin by adressing the classic problem of graph homomorphism and then, a variation thereof, the path homomorphism problem. We give a formulation to this last problem as an integer linear program and present some numerical tests that we performed to test its behavior and the performance of IBM ILOG CPLEX Optimization Studio for solving it. We then approach the network embedding problem as a specialization of the path homomorphism problem and present further numerical tests. Finally, we appl
APA, Harvard, Vancouver, ISO, and other styles
2

Mailhot, Pierre-Alexandre. "Extension de l'homomorphisme de Calabi aux cobordismes lagrangiens." Thèse, 2019. http://hdl.handle.net/1866/23795.

Full text
Abstract:
Ce mémoire traite de la construction d’un nouvel invariant des cobordismes lagrangiens. Cette construction est inspirée des travaux récents de Solomon dans lesquels une extension de l’homomorphisme de Calabi aux chemins lagrangiens exacts est donnée. Cette extension fut entre autres motivée par le fait que le graphe d’une isotopie hamiltonienne est un chemin lagrangien exact. Nous utilisons la suspension lagrangienne, qui associe à chaque chemin lagrangien exact un cobordisme lagrangien, pour étendre la construction de Solomon aux cobordismes lagrangiens. Au premier chapitre nous donnons une
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Path homomorphism"

1

McDuff, Dusa, and Dietmar Salamon. The group of symplectomorphisms. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198794899.003.0011.

Full text
Abstract:
This chapter discusses the basic properties of the group of symplectomorphisms of a compact connected symplectic manifold and its subgroup of Hamiltonian symplectomorphisms. It begins by showing that the group of symplectomorphisms is locally path-connected and then moves on to the flux homomorphism. The main result here is a theorem of Banyaga that characterizes the Hamiltonian symplectomorphisms in terms of the flux homomorphism. In the noncompact case there is another interesting homomorphism, called the Calabi homomorphism, that takes values in the reals and may be defined on the universal
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Path homomorphism"

1

Beaudou, Laurent, Florent Foucaud, Florent Madelaine, Lhouari Nourine, and Gaétan Richard. "Complexity of Conjunctive Regular Path Query Homomorphisms." In Computing with Foresight and Industry. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-22996-2_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hubička, J., J. Nešetřil, P. Oviedo, and O. Serra. "On the Homomorphism Order of Oriented Paths and Trees." In Trends in Mathematics. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-83823-2_118.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kaosar, Golam, and Xun Yi. "Secure Two-Party Association Rule Mining Based on One-Pass FP-Tree." In Privacy Solutions and Security Frameworks in Information Protection. IGI Global, 2013. http://dx.doi.org/10.4018/978-1-4666-2050-6.ch006.

Full text
Abstract:
Frequent Path tree (FP-tree) is a popular method to compute association rules and is faster than Apriori-based solutions in some cases. Association rule mining using FP-tree method cannot ensure entire privacy since frequency of the itemsets are required to share among participants at the first stage. Moreover, FP-tree method requires two scans of database transactions which may not be the best solution if the database is very large or the database server does not allow multiple scans. In addition, one-pass FP-tree can accommodate continuous or periodically changing databases without restarting the process as opposed to a regular FP-tree based solution. In this paper, the authors propose a one-pass FP-tree method to perform association rule mining without compromising any data privacy among two parties. A fully homomorphic encryption system over integer numbers is applied to ensure secure computation among two data sites without disclosing any number belongs to themselves.
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography