Search results for "Category theory"

showing 10 items of 1172 documents

The Neumann Problem for the Total Variation Flow

2004

This chapter is devoted to prove existence and uniqueness of solutions for the minimizing total variation flow with Neumann boundary conditions, namely $$ \left\{ \begin{gathered} \frac{{\partial u}} {{\partial t}} = div\left( {\frac{{Du}} {{\left| {Du} \right|}}} \right) in Q = (0,\infty ) \times \Omega , \hfill \\ \frac{{\partial u}} {{\partial \eta }} = 0 on S = (0,\infty ) \times \partial \Omega , \hfill \\ u(0,x) = u_0 (x) in x \in \Omega , \hfill \\ \end{gathered} \right. $$ (2.1) where Ω is a bounded set in ℝ N with Lipschitz continuous boundary ∂ Ω and u0 ∈ L1(Ω). As we saw in the previous chapter, this partial differential equation appears when one uses the steepest descent method …

CombinatoricsPhysicsBounded setWeak solutionImage (category theory)Bounded functionMathematical analysisNeumann boundary conditionBoundary (topology)Context (language use)Uniqueness
researchProduct

Structure of Kac-Moody groups

2008

For a phys ic i s t , a Kac-Moody algebra is the current algebra of a quantum f i e l d theory model in I + I space-time dimensions with an in terna l symmetry group G [ I ] . A More p rec ise ly , l e t ~ be the Lie algebra of G . The Kac-Moody algebra g is a one-dimensional central extension of the loop algebra Map(S I , g ) . I f f l ' f2 C Map(S I ,~ ) , then the commutator is defined point -wise,

CombinatoricsPhysicsHigh Energy Physics::TheoryCommutatorLoop algebraLine bundleMathematics::Quantum AlgebraLoop groupLie algebraStructure (category theory)Current algebraSymmetry groupMathematics::Representation Theory
researchProduct

Evidence forB+→J/ψpΛ¯and Search forB0→J/ψpp¯

2003

We have performed a search for the decays ${B}^{+}\ensuremath{\rightarrow}J/\ensuremath{\psi}p\overline{\ensuremath{\Lambda}}$ and ${B}^{0}\ensuremath{\rightarrow}J/\ensuremath{\psi}p\overline{p}$ in a data set of $(88.9\ifmmode\pm\else\textpm\fi{}1.0)\ifmmode\times\else\texttimes\fi{}{10}^{6}$ $\ensuremath{\Upsilon}(4S)$ decays collected by the BABAR experiment at the PEP-II ${e}^{+}{e}^{\ensuremath{-}}$ storage ring at the Stanford Linear Accelerator Center. Four charged $B$ candidates have been observed with an expected background of $0.21\ifmmode\pm\else\textpm\fi{}0.14$ events. The corresponding branching fraction is $({12}_{\ensuremath{-}6}^{+9})\ifmmode\times\else\texttimes\fi{}{10}^…

CombinatoricsPhysicsParticle decay010308 nuclear & particles physicsBranching fraction0103 physical sciencesCenter (category theory)General Physics and Astronomy010306 general physics01 natural sciencesEngineering physicsPhysical Review Letters
researchProduct

Locally Convex Quasi C*-Algebras and Their Structure

2020

Throughout this chapter \({{\mathfrak A}}_{\scriptscriptstyle 0}[\| \cdot \|{ }_{\scriptscriptstyle 0}]\) denotes a unital C*-algebra and τ a locally convex topology on \({{\mathfrak A}}_{\scriptscriptstyle 0}\). Let \(\widetilde {{{\mathfrak A}}_{\scriptscriptstyle 0}}[\tau ]\) denote the completion of \({{\mathfrak A}}_{\scriptscriptstyle 0}\) with respect to the topology τ. Under certain conditions on τ, a subspace \({\mathfrak A}\) of \(\widetilde {{{\mathfrak A}}_{\scriptscriptstyle 0}}[\tau ]\), containing \({{\mathfrak A}}_{\scriptscriptstyle 0}\), will form (together with \({{\mathfrak A}}_{\scriptscriptstyle 0}\)) a locally convex quasi *-algebra \(({\mathfrak A}[\tau ],{{\mathfrak…

CombinatoricsPhysicsUnitalRegular polygonStructure (category theory)Algebra over a fieldMathematics::Representation Theory
researchProduct

Structured Frequency Algorithms

2015

B.A. Trakhtenbrot proved that in frequency computability (introduced by G. Rose) it is crucially important whether the frequency exceeds \(\frac{1}{2}\). If it does then only recursive sets are frequency-computable. If the frequency does not exceed \(\frac{1}{2}\) then a continuum of sets is frequency-computable. Similar results for finite automata were proved by E.B. Kinber and H. Austinat et al. We generalize the notion of frequency computability demanding a specific structure for the correct answers. We show that if this structure is described in terms of finite projective planes then even a frequency \(O(\frac{\sqrt{n}}{n})\) ensures recursivity of the computable set. We also show that …

CombinatoricsRecursive setComputationComputabilityStructure (category theory)Graph (abstract data type)Continuum (set theory)Rose (topology)Projective planeMathematics
researchProduct

The Structure Group and the Permutation Group of a Set-Theoretic Solution of the Quantum Yang–Baxter Equation

2021

We describe the left brace structure of the structure group and the permutation group associated to an involutive, non-degenerate set-theoretic solution of the quantum YangBaxter equation by using the Cayley graph of its permutation group with respect to its natural generating system. We use our descriptions of the additions in both braces to obtain new properties of the structure and the permutation groups and to recover some known properties of these groups in a more transparent way.

CombinatoricsSet (abstract data type)Cayley graphYang–Baxter equationGroup (mathematics)Mathematics::Quantum AlgebraGeneral MathematicsStructure (category theory)Permutation groupMatemàticaQuantumMathematicsMediterranean Journal of Mathematics
researchProduct

A reduction theorem for perfect locally finite minimal non-FC groups

1999

A group G is said to be a minimal non-FC group, if G contains an infinite conjugacy class, while every proper subgroup of G merely has finite conjugacy classes. The structure of imperfect minimal non-FC groups is quite well-understood. These groups are in particular locally finite. At the other end of the spectrum, a perfect locally finite minimal non-FC group must be a p-group. And it has been an open question for quite a while now, whether such groups exist or not.

CombinatoricsSubgroupConjugacy classReduction (recursion theory)Group (mathematics)General MathematicsSpectrum (functional analysis)Structure (category theory)FC-groupMathematicsGlasgow Mathematical Journal
researchProduct

A series of finite groups and related symmetric designs

2007

For any odd prime power q = pe we study a certain solvable group G of order q2 · ((q-1)/2)2 · 2 and construct from its internal structure a symmetric design D with parameters (2q2+1, q2, (q2-1)/2) on which G acts as an automorphism group. As a consequence we find that the full automorphism group of D contains a subgroup of order |G| · e2.

CombinatoricsSymmetric design; automorphism groupSeries (mathematics)Solvable groupSymmetric groupGeneral MathematicsStructure (category theory)Order (group theory)Alternating groupSymmetric designPrime powerMathematicsGlasnik matematički
researchProduct

Some Hadamard designs with parameters (71,35,17)

2002

Up to isomorphisms there are precisely eight symmetric designs with parameters (71, 35, 17) admitting a faithful action of a Frobenius group of order 21 in such a way that an element of order 3 fixes precisely 11 points. Five of these designs have 84 and three have 420 as the order of the full automorphism group G. If |G| = 420, then the structure of G is unique and we have G = (Frob21 × Z5):Z4. In this case Z(G) = 〈1〉, G′ has order 35, and G induces an automorphism group of order 6 of Z7. If |G| = 84, then Z(G) is of order 2, and in precisely one case a Sylow 2-subgroup is elementary abelian. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 144–149, 2002; DOI 10.1002/jcd.996

Combinatoricssymmetric design; Hadamard design; orbit structure; automorphism groupInner automorphismSylow theoremsStructure (category theory)Discrete Mathematics and CombinatoricsOuter automorphism groupOrder (group theory)Abelian groupElement (category theory)Frobenius groupMathematicsJournal of Combinatorial Designs
researchProduct

Morphological Structure of Verbal Forms

2012

Communicationbusiness.industryStructure (category theory)businessLinguisticsMathematicsThe Handbook of Hispanic Linguistics
researchProduct