Main Page: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
mNo edit summary
mNo edit summary
Line 1: Line 1:
{{lowercase}}
{{Group theory sidebar |Basics}}
{{Infobox software
| name                  = rsync
| logo                  = [[File:Newrsynclogo.png|160px]]
| screenshot            = <!-- [[File: ]] -->
| caption                = rsync logo
| collapsible            =
| author                = [[Andrew Tridgell]], [[Paul Mackerras]]
| developer              = [[Wayne Davison]]
| released              = {{Start date|1996|06|19}}<ref name=rsyncrel>{{cite newsgroup | newsgroup = comp.os.linux.announce | date = 19 June 1996 | first = Andrew | last = Tridgell | url = http://groups.google.com/group/comp.os.linux.announce/msg/3bb93f6484065f20 | title = First release of rsync - rcp replacement | id = <cola-liw-835153950-21793-0@liw.clinet.fi>#1/1 | accessdate = 2007-07-19 }}</ref>
| discontinued          =
| latest preview version =
| latest preview date    = <!-- {{start date and age|YYYY|MM|DD}} -->
| frequently updated    = yes
| programming language  = [[C (programming language)|C]]
| operating system      =
| platform              = [[Unix-like]], [[Windows]]
| size                  =
| language              =
| status                = active
| genre                  = [[Data transfer]], [[Differential backup]]
| license                = [[GNU General Public License#Version 3|GNU GPLv3]]
| website                = {{URL|http://rsync.samba.org}}
}}
'''rsync''' is a [[software application]] and [[network protocol]] for [[Unix-like]] systems with ports to [[Windows]] that synchronizes [[computer file|file]]s and [[directory (file systems)|directories]] from one location to another while minimizing [[data]] transfer by using [[delta encoding]] when appropriate.  Quoting the official [http://rsync.samba.org website]: "rsync is a file transfer program for Unix systems. rsync uses the 'rsync algorithm' which provides a very fast method for bringing remote files into sync."<ref>[http://rsync.samba.org/features.html rsync features], Retrieved 29 Jul. 2012.</ref>  An important feature of rsync not found in most similar programs/protocols is that the [[mirror (computing)|mirror]]ing takes place with only one transmission in each direction. rsync can copy or display directory contents and copy files, optionally using [[data compression|compression]] and [[recursion]].


In [[Daemon (computer software)|daemon]] mode, rsync listens on the default [[Transmission Control Protocol|TCP]] [[TCP and UDP port|port]] of 873, serving files in the native rsync protocol or via a remote [[shell (computing)|shell]] such as [[Remote Shell|RSH]] or [[Secure Shell|SSH]].  In the latter case, the rsync client executable must be installed on the remote machine as well as on the local machine.
In [[mathematics]], the '''wreath product''' of [[group theory]] is a specialized product of two groups, based on a [[semidirect product]]. Wreath products are an important tool in the classification of [[permutation group]]s and also provide a way of constructing interesting examples of groups.


Released under the [[GNU General Public License#Version 3|GNU General Public License version 3]], rsync is [[free software]]. It is widely used.<ref>[http://books.google.com/books?id=Duz1wQEBkb8C&pg=PA280&dq=rsync+widely+used&cd=1#v=onepage&q=rsync%20widely%20used&f=false Lossless compression handbook]</ref><ref>[http://books.google.com/books?id=s8oZF1_ZJTQC&pg=PA316&dq=rsync+widely+used&cd=6#v=onepage&q=rsync%20widely%20used&f=false Web content caching and distribution: proceedings of the 8th International Workshop]</ref><ref>[http://hssl.cs.jhu.edu/ip-rsync/ip-rsync.pdf In-Place Rsync: File Synchronization for Mobile and Wireless Devices], David Rasch and Randal Burns, Department of Computer Science ,Johns Hopkins University</ref><ref>{{cite journal | id = {{citeseerx|10.1.1.95.5042}} | title = Towards an Efficient, Scalable Replication Mechanism for the I2-DSI Project | first1 = Bert J. | last1 = Dempsey | first2 = Debra | last2 = Weiss | date = April 30, 1999 | journal = Technical Report TR-1999-01 }}</ref>
Given two groups ''A'' and ''H'', there exist two variations of the wreath product: the '''unrestricted wreath product''' ''A''&nbsp;Wr&nbsp;''H'' (also written ''A''≀''H'') and the '''restricted wreath product''' ''A'' wr ''H''. Given a set Ω with an [[group action|''H''-action]] there exists a generalisation of the wreath product which is denoted by ''A''&nbsp;Wr<sub>Ω</sub>&nbsp;''H'' or ''A''&nbsp;wr<sub>Ω</sub>&nbsp;''H'' respectively.


== History ==
== Definition ==
[[Andrew Tridgell]] and [[Paul Mackerras]] wrote the original rsync.  Tridgell discusses the design, implementation and performance of rsync in chapters 3 through 5 of his [[Australian National University]] [[Doctor of Philosophy|Ph.D.]] thesis.<ref>Andrew Tridgell: [http://samba.org/~tridge/phd_thesis.pdf Efficient Algorithms for Sorting and Synchronization], February 1999. Retrieved 29 Sept. 2009.</ref>


rsync was first announced on 19 June 1996.<ref name=rsyncrel />  Rsync 3.0 was released on 1 March 2008.<ref>{{cite mailing list | url = http://lists.samba.org/archive/rsync-announce/2008/000057.html | date = 1 March 2008 | first = Wayne | last = Davison | title = Rsync 3.0.0 released | mailinglist = rsync-announce }}</ref>
Let ''A'' and ''H'' be groups and Ω a set with ''H'' [[group action|acting]] on it. Let ''K'' be the [[Direct product of groups|direct product]]


== Uses ==
: <math>K \equiv \prod_{\omega \,\in\, \Omega} A_\omega</math>
'''rsync''' was originally written as a replacement for [[rcp (Unix)|'''rcp''']] and [[Secure copy|'''scp''']]. As such, it has a similar syntax to its parent programs.<ref>See the [http://rsync.samba.org/ftp/rsync/README README file]</ref> Like its predecessors, it still requires a source and a destination to be specified, either of which may be remote. Because of the flexibility, speed and scriptability of rsync, it has become a standard Linux utility and is included in all popular Linux distributions. As a result, rsync has been ported to Windows (via commercial [[Cygwin]], freeware [[Grsync]] or [[Windows Services for UNIX|SFU]]<ref>http://www.suacommunity.com/tool_warehouse.aspx</ref>) and Mac OS.


Possible uses:
of copies of ''A''<sub>ω</sub> := ''A'' indexed by the set Ω. The elements of ''K'' can be seen as arbitrary sequences (''a''<sub>ω</sub>) of elements of ''A'' indexed by Ω with component wise multiplication. Then the action of ''H'' on Ω extends in a natural way to an action of ''H'' on the group ''K'' by
<source lang="bash">
rsync [OPTION] … SRC [SRC] … [USER@]HOST:DEST
rsync [OPTION] … [USER@]HOST:SRC [DEST]
</source>


One of the earliest applications of rsync was to implement mirroring or backup for multiple Unix clients to a central Unix server using rsync/ssh and standard Unix accounts.
: <math> h (a_\omega) \equiv (a_{h^{-1}\omega})</math>.


With a scheduling utility such as [[cron]], one can schedule automated encrypted rsync-based mirroring between multiple hosts and a central server.
Then the '''unrestricted wreath product''' ''A''&nbsp;Wr<sub>Ω</sub>&nbsp;''H'' of ''A'' by ''H'' is the [[semidirect product]] ''K''&nbsp;⋊&nbsp;''H''. The subgroup ''K'' of ''A''&nbsp;Wr<sub>Ω</sub>&nbsp;''H'' is called the '''base''' of the wreath product.


== Examples ==
The '''restricted wreath product''' ''A''&nbsp;wr<sub>Ω</sub>&nbsp;''H'' is constructed in the same way as the unrestricted wreath product except that one uses the [[Direct sum of groups|direct sum]]
 
: <math>K \equiv \bigoplus_{\omega \,\in\, \Omega} A_\omega</math>
 
as the base of the wreath product. In this case the elements of ''K'' are sequences (''a''<sub>ω</sub>) of elements in ''A'' indexed by Ω of which all but finitely many ''a''<sub>ω</sub> are the [[identity element]] of ''A''.
 
The group ''H'' [[Group action|acts]] in a natural way on itself by left multiplication. Thus we can choose Ω&nbsp;:=&nbsp;''H''. In this special (but very common) case the unrestricted and restricted wreath product may be denoted by ''A''&nbsp;Wr&nbsp;''H'' and ''A''&nbsp;wr&nbsp;''H'' respectively. We say in this case that the wreath product is '''regular'''.
 
== Notation and Conventions ==
 
The structure of the wreath product of ''A'' by ''H'' depends on the ''H''-set Ω and in case Ω is infinite it also depends on whether one uses the restricted or unrestricted wreath product. However, in literature the notation used may be deficient and one needs to pay attention on the circumstances.
 
* In literature ''A''≀<sub>Ω</sub>''H'' may stand for the unrestricted wreath product ''A''&nbsp;Wr<sub>Ω</sub>&nbsp;''H'' or the restricted wreath product ''A''&nbsp;wr<sub>Ω</sub>&nbsp;''H''.


A command line to mirror [[FreeBSD]] might look like:
* Similarly, ''A''≀''H'' may stand for the unrestricted regular wreath product ''A''&nbsp;Wr&nbsp;''H'' or the restricted regular wreath product ''A''&nbsp;wr&nbsp;''H''.


% rsync -avz --delete ftp4.de.FreeBSD.org::FreeBSD/ /pub/FreeBSD/<ref>[http://www.freebsd.org/doc/en/articles/hubs/mirror-howto.html How to Mirror FreeBSD (With rsync)]</ref>
* In literature the ''H''-set Ω may be omitted from the notation even if Ω≠H.


The [[Apache HTTP Server]] supports only rsync for updating mirrors.
* In the special case that ''H''&nbsp;=&nbsp;''S''<sub>''n''</sub> is the [[symmetric group]] of degree ''n'' it is common in the literature to assume that Ω={1,...,''n''} (with the natural action of ''S''<sub>''n''</sub>) and then omit Ω from the notation. That is, ''A''≀''S''<sub>n</sub> commonly denotes ''A''≀<sub>{1,...,''n''}</sub>''S''<sub>''n''</sub> instead of the regular wreath product ''A''≀<sub>''S''<sub>''n''</sub></sub>''S''<sub>''n''</sub>. In the first case the base group is the product of ''n'' copies of ''A'', in the latter it is the product of [[Factorial|''n''!]] copies of ''A''.


rsync -avz --delete --safe-links rsync.apache.org::apache-dist /path/to/mirror<ref>[http://www.apache.org/info/how-to-mirror.html How to become a mirror for the Apache Software Foundation]</ref>
== Properties ==


The preferred (and simplest) way to mirror the [[PuTTY]] website to the current directory is to use rsync.  
* Since the finite direct product is the same as the finite direct sum of groups, it follows that the unrestricted ''A''&nbsp;Wr<sub>Ω</sub>&nbsp;''H'' and the restricted wreath product ''A''&nbsp;wr<sub>Ω</sub>&nbsp;''H'' agree if the ''H''-set Ω is finite. In particular this is true when Ω = ''H'' is finite.


rsync -auH rsync://rsync.chiark.greenend.org.uk/ftp/users/sgtatham/putty-website-mirror/ .<ref>[http://www.chiark.greenend.org.uk/~sgtatham/putty/mirrors.html#guidelines PuTTY Web Site Mirrors: Mirroring guidelines]</ref>
* ''A''&nbsp;wr<sub>Ω</sub>&nbsp;''H'' is always a [[subgroup]] of ''A''&nbsp;Wr<sub>Ω</sub>&nbsp;''H''.


A way to mimic the capabilities of [[Time Machine (Mac OS)]].
* Universal Embedding Theorem: If ''G'' is an [[Group extension|extension]] of ''A'' by ''H'', then there exists a subgroup of the unrestricted wreath product ''A''≀''H'' which is isomorphic to ''G''.<ref>M. Krasner and L. Kaloujnine, "Produit complet des groupes de permutations et le problème d'extension de groupes III", Acta Sci. Math. Szeged 14, pp. 69-82 (1951)</ref>


#date=`date "+%Y-%m-%dT%H:%M:%S"`
* If ''A'', ''H'' and Ω are finite, then
date=`date "+%FT%T"`
rsync -aP --link-dest=$HOME/Backups/current /path/to/important_files $HOME/Backups/back-$date
rm -f $HOME/Backups/current
ln -s $HOME/Backups/back-$date $HOME/Backups/current<ref>[http://blog.interlinked.org/tutorials/rsync_time_machine.html Rsync setup to run like Time Machine]</ref>


== Algorithm ==
:: |''A''≀<sub>Ω</sub>''H''| = |''A''|<sup>|Ω|</sup>|''H''|.<ref>Joseph J. Rotman, An Introduction to the Theory of Groups, p. 172 (1995)</ref>
The rsync utility uses an [[algorithm]] invented by the Australian computer programmer [[Andrew Tridgell]] for efficiently transmitting a structure (such as a file) across a communications link when the receiving computer already has a similar, but not identical, version of the same structure.


The recipient splits its copy of the file into fixed-size non-overlapping chunks and computes two [[checksum]]s for each chunk: the [[MD5]] [[hash function|hash]], and a weaker '[[Rolling hash|rolling checksum]]'.  (Prior to version 30 of the protocol, released with rsync version 3.0.0, it used [[MD4]] hashes rather than MD5.<ref>[http://rsync.samba.org/ftp/rsync/src/rsync-3.0.0-NEWS NEWS for rsync 3.0.0] (1 Mar 2008)</ref>) It sends these checksums to the sender.
== Canonical Actions of Wreath Products ==


The sender computes the rolling checksum for every chunk of size <math>S</math> in its own version of the file, even overlapping chunks. This can be calculated efficiently because of a special property of the rolling checksum: if the rolling checksum of [[byte]]s <math>n</math> through <math>n+S-1</math> is <math>R</math>, the rolling checksum of bytes <math>n+1</math> through <math>n+S</math> can be computed from <math>R</math>, byte <math>n</math>, and byte <math>n+S</math> without having to examine the intervening bytes. Thus, if one had already calculated the rolling checksum of bytes 1–25, one could calculate the rolling checksum of bytes 2–26 solely from the previous checksum (R), byte 1 (n), and byte 26 (n+S).
If the group ''A'' acts on a set Λ then there are two canonical ways to construct sets from Ω and Λ on which ''A''&nbsp;Wr<sub>Ω</sub>&nbsp;''H'' (and therefore also ''A''&nbsp;wr<sub>Ω</sub>&nbsp;''H'') can act.


The [[rolling hash|rolling checksum]] used in rsync is based on Mark Adler's [[adler-32]] checksum, which is used in [[zlib]], and is itself based on [[Fletcher's checksum]].
* The '''imprimitive''' wreath product action on Λ×Ω.


The sender then compares its rolling checksums with the set sent by the recipient to determine if any matches exist.  If they do, it verifies the match by computing the hash for the matching [[Block (programming)|block]] and by comparing it with the hash for that block sent by the recipient.
: If ((''a''<sub>ω</sub>),''h'')∈''A''&nbsp;Wr<sub>Ω</sub>&nbsp;''H'' and (λ,ω')∈Λ×Ω, then


The sender then sends the recipient those parts of its file that did not match the recipient's blocks, along with information on where to merge these blocks into the recipient's version. This makes the copies identical. However, there is a small probability that differences between chunks in the sender and recipient are not detected, and thus remains uncorrected. This requires a simultaneous hash collision in MD5 and the rolling checksum. It is possible to generate MD5 collisions, and the rolling checksum is not cryptographically strong, but the chance for this to occur by accident is nevertheless extremely remote. With 128 bits from MD5 plus 32 bits from the rolling checksum, and assuming maximum [[entropy (information theory)|entropy]] in these bits, the probability of a hash collision with this combined checksum is 2<sup>−(128+32)</sup> = 2<sup>−160</sup>. The actual probability is a few times higher, since good checksums approach maximum output entropy but very rarely achieve it.
:: <math>((a_{\omega}), h) \cdot (\lambda,\omega') := (a_{h(\omega')}\lambda, h\omega')</math>.


If the sender's and recipient's versions of the file have many sections in common, the utility needs to transfer relatively little data to synchronize the files. Note that if usual [[data compression]] algorithms are used, files that are similar when uncompressed may be very different when compressed, and thus the entire file will need to be transferred – local changes in uncompressed files yield global changes in compressed files. This is particularly an issue with mirroring of [[archive file]]s, such as [[disk image]]s and compressed [[tar (file format)|tarballs]], where often individual files change. Some compression programs, such as [[gzip]] and [[bzip2]], provide a special "rsyncable" mode which allows these files to be efficiently rsynced, by ensuring that local changes in the uncompressed file yields only local changes in the compressed file.
* The '''primitive''' wreath product action on Λ<sup>Ω</sup>.


While the rsync algorithm forms the heart of the rsync application that essentially optimizes transfers between two computers over TCP/IP, the rsync application supports other key features that aid significantly in data transfers or backup. They include compression and decompression of data block by block using [[zlib]] at sending and receiving ends, and support for protocols such as [[Secure Shell|ssh]] that enables encrypted transmission of compressed and efficient differential data using rsync algorithm. Instead of ssh, [[stunnel]] can also be used to create an encrypted tunnel to secure the data transmitted.
: An element in Λ<sup>Ω</sup> is a sequence (λ<sub>ω</sub>) indexed by the ''H''-set Ω. Given an element ((''a''<sub>ω</sub>), ''h'') ∈ ''A''&nbsp;Wr<sub>Ω</sub>&nbsp;''H'' its operation on (λ<sub>ω</sub>)∈Λ<sup>Ω</sup> is given by


Finally, rsync is capable of limiting the bandwidth consumed during a transfer, a useful feature that few other standard file transfer programs offer.
:: <math>((a_\omega), h) \cdot (\lambda_\omega) :=  (a_{h^{-1}\omega}\lambda_{h^{-1}\omega})</math>.


== Variations ==
== Examples ==
A utility called '''{{visible anchor|rdiff}}''' uses the rsync algorithm to generate [[Delta encoding|delta file]]s with the difference from file A to file B (like the utility [[diff]], but in a different delta format). The delta file can then be applied to file A, turning it into file B (similar to the [[patch (Unix)|patch]] utility).


Unlike diff, the process of creating a delta file has two steps: first a signature file is created from file A, and then this (relatively small) signature and file B are used to create the delta file. Also unlike diff, rdiff works well with [[binary file]]s.
* The [[Lamplighter group]] is the restricted wreath product ℤ<sub>2</sub>≀ℤ.


Using rdiff, a utility called ''rdiff-backup'' has been created, capable of maintaining a [[backup]] mirror of a file or directory either locally or remotely over the network, on another server. rdiff-backup stores incremental rdiff deltas with the backup, with which it is possible to recreate any backup point.<ref>{{official website
* ℤ<sub>m</sub>≀''S''<sub>''n''</sub> ([[Generalized symmetric group]]).
| 2 = rdiff-backup
| 1 = www.nongnu.org/rdiff-backup/
}}</ref>


[[Duplicity (software)|Duplicity]] is a variation on rdiff-backup that allows for backups without cooperation from the storage server, as with simple storage services like [[Amazon S3]]. It works by generating the hashes for each block in advance, encrypting them, and storing them on the server, then retrieving them when doing an incremental backup. The rest of the data is also stored encrypted for security purposes.
: The base of this wreath product is the ''n''-fold direct product


[[rsyncrypto]] is a utility to encrypt files in an rsync-friendly fashion. The rsyncrypto algorithm ensures that two almost identical files, when encrypted with rsyncrypto and the same key, will produce almost identical encrypted files. This allows for the low-overhead data transfer achieved by rsync while providing encryption for secure transfer and storage of sensitive data in a remote location.<ref>{{official website
:: ℤ<sub>''m''</sub><sup>''n''</sup> = ℤ<sub>''m''</sub> × ... × ℤ<sub>''m''</sub>
| 2 = rsyncrypto
| 1 = rsyncrypto.lingnu.com/
}}</ref>


An alternative to manually scripting rsync is the Free Software (FLOSS) GUI program [[BackupPC]], which performs automatic scheduled backups to rsync servers.
: of copies of ℤ<sub>''m''</sub> where the action φ&nbsp;:&nbsp;''S''<sub>''n''</sub> → Aut(ℤ<sub>''m''</sub><sup>''n''</sup>) of the [[symmetric group]] ''S''<sub>''n''</sub> of degree ''n'' is given by


As of Mac OS X 10.5 and later, there is a special -E or --extended-attributes switch which allows retaining much of the [[Hierarchical File System|HFS]] file metadata when syncing between two machines supporting this feature. This is achieved by transmitting the proprietary [[Resource Fork]] along with the Data Fork.<ref>http://developer.apple.com/library/mac/#documentation/Darwin/Reference/ManPages/man1/rsync.1.html</ref>
:: φ(σ)(α<sub>1</sub>,..., α<sub>''n''</sub>) := (α<sub>σ(1)</sub>,..., α<sub>σ(''n'')</sub>).<ref>J. W. Davies and A. O. Morris, "The Schur Multiplier of the Generalized Symmetric Group", J. London Math. Soc (2), 8, (1974), pp. 615-620</ref>


== Practical applications ==
* ''S''<sub>2</sub>≀''S''<sub>''n''</sub> ([[Hyperoctahedral group]]).
'''rsync''' can be used as a method to intelligently copy or back files up from one location to another.  For example, within a music library, all music files may be located within an artist folder, with an album subdirectory.  If you have an external hard drive that serves as a backup of your music then manually updating the music, even when copies merge directories, can be an error prone and time consuming task best left to automation.  However, rsync can be used to scan all of the files in your music library, as well as the subdirectories, and to add only the ones that are not present on the external hard drive.


== Solutions using Rsync ==
: The action of ''S''<sub>''n''</sub> on {1,...,''n''} is as above. Since the symmetric group ''S''<sub>2</sub> of degree 2 is [[Group isomorphism|isomorphic]] to ℤ<sub>2</sub> the hyperoctahedral group is a special case of a generalized symmetric group.<ref>P. Graczyk, G. Letac and H. Massam, "The Hyperoctahedral Group, Symmetric Group Representations and the Moments of the Real Wishart Distribution",  J. Theoret. Probab.  18  (2005),  no. 1, 1-42.</ref>


{|class="wikitable sortable" border="1"
* Let ''p'' be a [[Prime number|prime]] and let ''n''≥1. Let ''P'' be a [[Sylow theorems|Sylow ''p''-subgroup]] of the symmetric group ''S''<sub>''p''<sup>''n''</sup></sub> of degree ''p''<sup>''n''</sup>. Then ''P'' is [[Group isomorphism|isomorphic]] to the iterated regular wreath product ''W''<sub>''n''</sub> = ℤ<sub>''p''</sub> ≀ ℤ<sub>''p''</sub>≀...≀ℤ<sub>''p''</sub> of ''n'' copies of ℤ<sub>''p''</sub>. Here ''W''<sub>1</sub> := ℤ<sub>''p''</sub> and ''W''<sub>''k''</sub> := ''W''<sub>''k''-1</sub>≀ℤ<sub>''p''</sub> for all ''k''≥2.<ref>Joseph J. Rotman, An Introduction to the Theory of Groups, p. 176 (1995)</ref><ref>L. Kaloujnine, "La structure des p-groupes de Sylow des groupes symétriques finis", Annales Scientifiques de l'École Normale Supérieure. Troisième Série 65, pp. 239–276 (1948)</ref>
|-
! Name !! Linux || Mac OS || Windows || Comments
|-
| [[BackupAssist]] || {{No}}|| {{No}}|| {{Yes}} || Direct mirror or with history, VSS
|-
| [http://backintime.le-web.org/ Back In Time] || {{Yes}}||{{No}}||{{No}} ||
|-
| [[Cwrsync]] || {{No}}|| {{No}}|| {{Yes}} || Rsync for Windows (based on [[Cygwin]])
|-
| [[CarbonCopyCloner]] || {{No}}|| {{Yes}}|| {{No}} || Local whole disk backup
|-
| [[DSynchronize]] || {{No}}|| {{No}}|| {{Yes}} ||
|-
| [[LuckyBackup]] || {{Yes}}|| {{Yes}}|| {{Yes}} ||
|-
| gadmin-rsync || {{Yes}}||{{No}} || {{No}}|| Part of [[Gadmintools]]
|-
| [[Grsync]] || {{Yes}}|| {{Yes}}|| {{Yes}}||
|-
| [[QtdSync]] || {{Yes}}|| {{No}}|| {{Yes}}||
|-
| [[PureSync]] || {{No}}|| {{No}}|| {{Yes}}||
|-
| [[DeltaCopy]] || {{No}}|| {{No}}|| {{Yes}}|| Open Source, Free - [http://www.aboutmyip.com/AboutMyXApp/DeltaCopy.jsp WebSite] - [http://www.aboutmyx.com/files/DeltaCopy.zip Download]
|-
| [[Yintersync]] || {{No}}|| {{No}}|| {{Yes}}|| VSS Shadow Copies, Email Reports, Scheduler, NTFS Permissions, Centralised.
|-
| [[Syncrify]] || {{Yes}}|| {{No}}|| {{Yes}}||
|-
| [[Backuplist+]] || {{No}}|| {{Yes}}|| {{No}}||
|-
| [[RipCord Backup]] || {{No}}|| {{Yes}}|| {{No}}||
|-
| [[RsyncX]] || {{No}}|| {{Yes}}|| {{No}}||
|-
| [[arRsync]] || {{No}}|| {{Yes}}|| {{No}}||
|-
| [[Duplicati (software)|Duplicati]] || {{Yes}}|| {{Yes}}|| {{Yes}}|| VSS, LVM snapshots, Scheduler
|-
| [[FolderWatch]] || {{No}}|| {{Yes}}|| {{No}}|| Supports real-time and on-demand syncing
|-
| [[rdiff-backup]] || {{Yes}}|| {{Yes}}|| {{Yes}}|| supports history
|-
| [[Get Backup]] || {{No}}|| {{Yes}}|| {{No}}|| Partial sync, comparison between sync, scheduler, disk cloning
|-
| [[Unison (file synchronizer)|Unison]] || {{Yes}} || {{Yes}} || {{Yes}} || File synchronizer using Rsync algorithm
|-
|}


== See also ==
* The [[Rubik's Cube group]] is a subgroup of small index in the product of wreath products, (ℤ<sub>3</sub>≀''S''<sub>8</sub>)&nbsp;× (ℤ<sub>2</sub>≀''S''<sub>12</sub>), the factors corresponding to the symmetries of the 8 corners and 12 edges.
{{Portal|Free software}}


* [[Remote Differential Compression]]
== References ==


==References==
{{Reflist}}
{{Reflist}}


==External links==
== External links ==
* {{Official website|http://rsync.samba.org}}
* [http://planetmath.org/encyclopedia/WreathProduct.html PlanetMath page]
* [http://rsync.samba.org/tech_report/ rsync algorithm]
* [http://www.encyclopediaofmath.org/index.php/Wreath_product Springer Online Reference Works]
* [http://rsync.samba.org/examples.html Official rsync examples]
* [http://www.abstractmath.org/Papers/SAWPCWC.pdf Some Applications of the Wreath Product Construction]


[[Category:1996 software]]
[[Category:Data synchronization]]
[[Category:Free backup software]]
[[Category:Free network-related software]]
[[Category:Networking algorithms]]
[[Category:Network file transfer protocols]]
[[Category:Unix network-related software]]
[[Category:Free file transfer software]]


[[ca:Rsync]]
[[Category:Group theory]]
[[cs:Rsync]]
[[Category:Permutation groups]]
[[da:Rsync]]
[[Category:Binary operations]]
[[de:Rsync]]
[[es:Rsync]]
[[fr:Rsync]]
[[it:Rsync]]
[[nl:Rsync]]
[[ja:Rsync]]
[[pl:Rsync]]
[[pt:Rsync]]
[[ru:Rsync]]
[[sv:Rsync]]
[[tr:Rsync]]
[[zh:Rsync]]

Revision as of 05:02, 10 August 2014

Template:Group theory sidebar

In mathematics, the wreath product of group theory is a specialized product of two groups, based on a semidirect product. Wreath products are an important tool in the classification of permutation groups and also provide a way of constructing interesting examples of groups.

Given two groups A and H, there exist two variations of the wreath product: the unrestricted wreath product A Wr H (also written AH) and the restricted wreath product A wr H. Given a set Ω with an H-action there exists a generalisation of the wreath product which is denoted by A WrΩ H or A wrΩ H respectively.

Definition

Let A and H be groups and Ω a set with H acting on it. Let K be the direct product

KωΩAω

of copies of Aω := A indexed by the set Ω. The elements of K can be seen as arbitrary sequences (aω) of elements of A indexed by Ω with component wise multiplication. Then the action of H on Ω extends in a natural way to an action of H on the group K by

h(aω)(ah1ω).

Then the unrestricted wreath product A WrΩ H of A by H is the semidirect product K ⋊ H. The subgroup K of A WrΩ H is called the base of the wreath product.

The restricted wreath product A wrΩ H is constructed in the same way as the unrestricted wreath product except that one uses the direct sum

KωΩAω

as the base of the wreath product. In this case the elements of K are sequences (aω) of elements in A indexed by Ω of which all but finitely many aω are the identity element of A.

The group H acts in a natural way on itself by left multiplication. Thus we can choose Ω := H. In this special (but very common) case the unrestricted and restricted wreath product may be denoted by A Wr H and A wr H respectively. We say in this case that the wreath product is regular.

Notation and Conventions

The structure of the wreath product of A by H depends on the H-set Ω and in case Ω is infinite it also depends on whether one uses the restricted or unrestricted wreath product. However, in literature the notation used may be deficient and one needs to pay attention on the circumstances.

  • In literature AΩH may stand for the unrestricted wreath product A WrΩ H or the restricted wreath product A wrΩ H.
  • Similarly, AH may stand for the unrestricted regular wreath product A Wr H or the restricted regular wreath product A wr H.
  • In literature the H-set Ω may be omitted from the notation even if Ω≠H.
  • In the special case that H = Sn is the symmetric group of degree n it is common in the literature to assume that Ω={1,...,n} (with the natural action of Sn) and then omit Ω from the notation. That is, ASn commonly denotes A{1,...,n}Sn instead of the regular wreath product ASnSn. In the first case the base group is the product of n copies of A, in the latter it is the product of n! copies of A.

Properties

  • Since the finite direct product is the same as the finite direct sum of groups, it follows that the unrestricted A WrΩ H and the restricted wreath product A wrΩ H agree if the H-set Ω is finite. In particular this is true when Ω = H is finite.
  • A wrΩ H is always a subgroup of A WrΩ H.
  • Universal Embedding Theorem: If G is an extension of A by H, then there exists a subgroup of the unrestricted wreath product AH which is isomorphic to G.[1]
  • If A, H and Ω are finite, then
|AΩH| = |A||Ω||H|.[2]

Canonical Actions of Wreath Products

If the group A acts on a set Λ then there are two canonical ways to construct sets from Ω and Λ on which A WrΩ H (and therefore also A wrΩ H) can act.

  • The imprimitive wreath product action on Λ×Ω.
If ((aω),h)∈A WrΩ H and (λ,ω')∈Λ×Ω, then
((aω),h)(λ,ω):=(ah(ω)λ,hω).
  • The primitive wreath product action on ΛΩ.
An element in ΛΩ is a sequence (λω) indexed by the H-set Ω. Given an element ((aω), h) ∈ A WrΩ H its operation on (λω)∈ΛΩ is given by
((aω),h)(λω):=(ah1ωλh1ω).

Examples

The base of this wreath product is the n-fold direct product
mn = ℤm × ... × ℤm
of copies of ℤm where the action φ : Sn → Aut(ℤmn) of the symmetric group Sn of degree n is given by
φ(σ)(α1,..., αn) := (ασ(1),..., ασ(n)).[3]
The action of Sn on {1,...,n} is as above. Since the symmetric group S2 of degree 2 is isomorphic to ℤ2 the hyperoctahedral group is a special case of a generalized symmetric group.[4]
  • Let p be a prime and let n≥1. Let P be a Sylow p-subgroup of the symmetric group Spn of degree pn. Then P is isomorphic to the iterated regular wreath product Wn = ℤp ≀ ℤp≀...≀ℤp of n copies of ℤp. Here W1 := ℤp and Wk := Wk-1≀ℤp for all k≥2.[5][6]
  • The Rubik's Cube group is a subgroup of small index in the product of wreath products, (ℤ3S8) × (ℤ2S12), the factors corresponding to the symmetries of the 8 corners and 12 edges.

References

43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.

External links

  1. M. Krasner and L. Kaloujnine, "Produit complet des groupes de permutations et le problème d'extension de groupes III", Acta Sci. Math. Szeged 14, pp. 69-82 (1951)
  2. Joseph J. Rotman, An Introduction to the Theory of Groups, p. 172 (1995)
  3. J. W. Davies and A. O. Morris, "The Schur Multiplier of the Generalized Symmetric Group", J. London Math. Soc (2), 8, (1974), pp. 615-620
  4. P. Graczyk, G. Letac and H. Massam, "The Hyperoctahedral Group, Symmetric Group Representations and the Moments of the Real Wishart Distribution", J. Theoret. Probab. 18 (2005), no. 1, 1-42.
  5. Joseph J. Rotman, An Introduction to the Theory of Groups, p. 176 (1995)
  6. L. Kaloujnine, "La structure des p-groupes de Sylow des groupes symétriques finis", Annales Scientifiques de l'École Normale Supérieure. Troisième Série 65, pp. 239–276 (1948)