|
Graph Algebra
In mathematics, especially in the fields of universal algebra and graph theory, a graph algebra is a way of giving a directed graph an algebraic structure. It was introduced by McNulty and Shallon, and has seen many uses in the field of universal algebra since then. Definition Let be a directed graph (data structure), graph, and an element not in . The graph algebra associated with has underlying set V \cup \, and is equipped with a multiplication defined by the rules * if x,y \in V and (x,y) \in E, * if x,y \in V \cup \ and (x,y)\notin E. Applications This notion has made it possible to use the methods of graph theory in universal algebra and several other directions of discrete mathematics and computer science. Graph algebras have been used, for example, in constructions concerning dualities, equational theory, equational theories, flatness (systems theory), flatness, groupoid (algebra), groupoid ring (mathematics), rings, topology, topologies, variety (universal alge ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting points of t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Finite-state Machine
A finite-state machine (FSM) or finite-state automaton (FSA, plural: ''automata''), finite automaton, or simply a state machine, is a mathematical model of computation. It is an abstract machine that can be in exactly one of a finite number of '' states'' at any given time. The FSM can change from one state to another in response to some inputs; the change from one state to another is called a ''transition''. An FSM is defined by a list of its states, its initial state, and the inputs that trigger each transition. Finite-state machines are of two types— deterministic finite-state machines and non-deterministic finite-state machines. A deterministic finite-state machine can be constructed equivalent to any non-deterministic one. The behavior of state machines can be observed in many devices in modern society that perform a predetermined sequence of actions depending on a sequence of events with which they are presented. Simple examples are vending machines, which dispense p ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
American Mathematical Society
The American Mathematical Society (AMS) is an association of professional mathematicians dedicated to the interests of mathematical research and scholarship, and serves the national and international community through its publications, meetings, advocacy and other programs. The society is one of the four parts of the Joint Policy Board for Mathematics and a member of the Conference Board of the Mathematical Sciences. History The AMS was founded in 1888 as the New York Mathematical Society, the brainchild of Thomas Fiske, who was impressed by the London Mathematical Society on a visit to England. John Howard Van Amringe was the first president and Fiske became secretary. The society soon decided to publish a journal, but ran into some resistance, due to concerns about competing with the American Journal of Mathematics. The result was the '' Bulletin of the American Mathematical Society'', with Fiske as editor-in-chief. The de facto journal, as intended, was influential i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Marcel Dekker
Marcel Dekker was a journal and encyclopedia publishing company with editorial boards found in New York City. Dekker encyclopedias are now published by CRC Press, part of the Taylor and Francis publishing group. History Initially a textbook publisher, the company added journal publishing in the 1970s, and encyclopedia publishing in the early 1980s. Serving mathematics, it published a series of ''Lecture Notes in Pure and Applied Mathematics''. The company was purchased by Taylor and Francis in 2003. At that time, it published 78 journals and 300 new books annually. The imprint closed in 2005. As of 2008, they have a total of 26 encyclopedias available. These encyclopedias deal with scientific issues such as |
Internet Archive
The Internet Archive is an American digital library with the stated mission of "universal access to all knowledge". It provides free public access to collections of digitized materials, including websites, software applications/games, music, movies/videos, moving images, and millions of books. In addition to its archiving function, the Archive is an activist organization, advocating a free and open Internet. , the Internet Archive holds over 35 million books and texts, 8.5 million movies, videos and TV shows, 894 thousand software programs, 14 million audio files, 4.4 million images, 2.4 million TV clips, 241 thousand concerts, and over 734 billion web pages in the Wayback Machine. The Internet Archive allows the public to upload and download digital material to its data cluster, but the bulk of its data is collected automatically by its web crawlers, which work to preserve as much of the public web as possible. Its web archiving, web archive, the Wayback Machine, contains hu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Springer-Verlag
Springer Science+Business Media, commonly known as Springer, is a German multinational publishing company of books, e-books and peer-reviewed journals in science, humanities, technical and medical (STM) publishing. Originally founded in 1842 in Berlin, it expanded internationally in the 1960s, and through mergers in the 1990s and a sale to venture capitalists it fused with Wolters Kluwer and eventually became part of Springer Nature in 2015. Springer has major offices in Berlin, Heidelberg, Dordrecht, and New York City. History Julius Springer founded Springer-Verlag in Berlin in 1842 and his son Ferdinand Springer grew it from a small firm of 4 employees into Germany's then second largest academic publisher with 65 staff in 1872.Chronology ". Springer Science+Business Media. In 1964, Springer expanded its business international ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Discrete Mathematics (journal)
''Discrete Mathematics'' is a biweekly peer-reviewed scientific journal in the broad area of discrete mathematics, combinatorics, graph theory, and their applications. It was established in 1971 and is published by North-Holland Publishing Company. It publishes both short notes, full length contributions, as well as survey articles. In addition, the journal publishes a number of special issues each year dedicated to a particular topic. Although originally it published articles in French and German, it now allows only English language articles. The editor-in-chief is Douglas West (University of Illinois, Urbana). History The journal was established in 1971. The very first article it published was written by Paul Erdős, who went on to publish a total of 84 papers in the journal. Abstracting and indexing The journal is abstracted and indexed in: According to the ''Journal Citation Reports'', the journal has a 2020 impact factor of 0.87. Notable publications * The 1972 pap ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Path Algebra
In graph theory, a quiver is a directed graph where loops and multiple arrows between two vertices are allowed, i.e. a multidigraph. They are commonly used in representation theory: a representation of a quiver assigns a vector space to each vertex of the quiver and a linear map to each arrow . In category theory, a quiver can be understood to be the underlying structure of a category, but without composition or a designation of identity morphisms. That is, there is a forgetful functor from to . Its left adjoint is a free functor which, from a quiver, makes the corresponding free category. Definition A quiver Γ consists of: * The set ''V'' of vertices of Γ * The set ''E'' of edges of Γ * Two functions: ''s'': ''E'' → ''V'' giving the ''start'' or ''source'' of the edge, and another function, ''t'': ''E'' → ''V'' giving the ''target'' of the edge. This definition is identical to that of a multidigraph. A morphism of quivers is defined ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Incidence Algebra
In order theory, a field of mathematics, an incidence algebra is an associative algebra, defined for every locally finite partially ordered set and commutative ring with unity. Subalgebras called reduced incidence algebras give a natural construction of various types of generating functions used in combinatorics and number theory. Definition A locally finite poset is one in which every closed interval : 'a, b''= is finite. The members of the incidence algebra are the functions ''f'' assigning to each nonempty interval 'a, b''a scalar ''f''(''a'', ''b''), which is taken from the '' ring of scalars'', a commutative ring with unity. On this underlying set one defines addition and scalar multiplication pointwise, and "multiplication" in the incidence algebra is a convolution defined by :(f*g)(a, b)=\sum_f(a, x)g(x, b). An incidence algebra is finite-dimensional if and only if the underlying poset is finite. Related concepts An incidence algebra is analogous to a group algebra; ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Group Algebra (other) .
{{disambig ...
In mathematics, the group algebra can mean either *A group ring of a group over some ring. *A group algebra of a locally compact group In functional analysis and related areas of mathematics, the group algebra is any of various constructions to assign to a locally compact group an operator algebra (or more generally a Banach algebra), such that representations of the algebra ar ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tree Automata
A tree automaton is a type of state machine. Tree automata deal with tree structures, rather than the strings of more conventional state machines. The following article deals with branching tree automata, which correspond to regular languages of trees. As with classical automata, finite tree automata (FTA) can be either a deterministic automaton or not. According to how the automaton processes the input tree, finite tree automata can be of two types: (a) bottom up, (b) top down. This is an important issue, as although non-deterministic (ND) top-down and ND bottom-up tree automata are equivalent in expressive power, deterministic top-down automata are strictly less powerful than their deterministic bottom-up counterparts, because tree properties specified by deterministic top-down tree automata can only depend on path properties. (Deterministic bottom-up tree automata are as powerful as ND tree automata.) Definitions A bottom-up finite tree automaton over ''F'' is defined as ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Finite State Automata
A finite-state machine (FSM) or finite-state automaton (FSA, plural: ''automata''), finite automaton, or simply a state machine, is a mathematical model of computation. It is an abstract machine that can be in exactly one of a finite number of '' states'' at any given time. The FSM can change from one state to another in response to some inputs; the change from one state to another is called a ''transition''. An FSM is defined by a list of its states, its initial state, and the inputs that trigger each transition. Finite-state machines are of two types— deterministic finite-state machines and non-deterministic finite-state machines. A deterministic finite-state machine can be constructed equivalent to any non-deterministic one. The behavior of state machines can be observed in many devices in modern society that perform a predetermined sequence of actions depending on a sequence of events with which they are presented. Simple examples are vending machines, which dispense p ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
