Search results for "C15"

showing 10 items of 66 documents

Internal inverse limits and retractions

2015

We establish equivalences between compacta that admit a sequence of retractions that converge uniformly to the identity map and compacta that are inverse limits on subcompacta with retractions for bonding maps. We give partial answers to questions of Charatonik and Prajs, and of Krasinkiewicz. Our results are related to and use results from another paper of the authors \cite{mp}.

Discrete mathematicsSequenceGeneral Mathematics54A20Inverse$r$-maps54F6554C15retractions54F15CalculusIdentity functionInternal inverse limitMathematics
researchProduct

Double adjunctions and free monads

2011

We characterize double adjunctions in terms of presheaves and universal squares, and then apply these characterizations to free monads and Eilenberg--Moore objects in double categories. We improve upon our earlier result in "Monads in Double Categories", JPAA 215:6, pages 1174-1197, 2011, to conclude: if a double category with cofolding admits the construction of free monads in its horizontal 2-category, then it also admits the construction of free monads as a double category. We also prove that a double category admits Eilenberg--Moore objects if and only if a certain parameterized presheaf is representable. Along the way, we develop parameterized presheaves on double categories and prove …

Double category adjunction monad18D05 (Primary) 18C15 18C20 (Secondary)Mathematics::Category TheoryFOS: MathematicsCategory Theory (math.CT)Mathematics - Category TheoryMathematics::Algebraic Topology
researchProduct

Cross-Sensor Adversarial Domain Adaptation of Landsat-8 and Proba-V images for Cloud Detection

2021

The number of Earth observation satellites carrying optical sensors with similar characteristics is constantly growing. Despite their similarities and the potential synergies among them, derived satellite products are often developed for each sensor independently. Differences in retrieved radiances lead to significant drops in accuracy, which hampers knowledge and information sharing across sensors. This is particularly harmful for machine learning algorithms, since gathering new ground truth data to train models for each sensor is costly and requires experienced manpower. In this work, we propose a domain adaptation transformation to reduce the statistical differences between images of two…

FOS: Computer and information sciencesAtmospheric ScienceComputer Science - Machine LearningGenerative adversarial networks010504 meteorology & atmospheric sciencesComputer scienceRemote sensing applicationdomain adaptationGeophysics. Cosmic physics0211 other engineering and technologiesCloud computing02 engineering and technologycomputer.software_genre01 natural sciencesImage (mathematics)Data modelingMachine Learning (cs.LG)convolutional neural networksFOS: Electrical engineering electronic engineering information engineeringLandsat-8Computers in Earth SciencesAdaptation (computer science)TC1501-1800021101 geological & geomatics engineering0105 earth and related environmental sciencesbusiness.industryQC801-809Image and Video Processing (eess.IV)Electrical Engineering and Systems Science - Image and Video ProcessingOcean engineeringTransformation (function)cloud detectionSatelliteData miningProba-VTransfer of learningbusinesscomputer
researchProduct

Quantum Toda Lattice: a Challenge for Representation Theory

2021

Quantum Toda lattice may solved by means of the Representation Theory of semisimple Lie groups, or alternatively by using the technique of the Quantum Inverse Scattering Method. A comparison of the two approaches, which is the purpose of the present review article, sheds a new light on Representation Theory and leads to a number of challenging questions.

FOS: MathematicsFOS: Physical sciences16T25 17B35 17B37 22E46 33B15 33C15Mathematical Physics (math-ph)[MATH] Mathematics [math]Representation Theory (math.RT)Mathematics - Representation TheoryMathematical PhysicsProceedings of Symposia in Pure Mathematics
researchProduct

Bounding the number of vertices in the degree graph of a finite group

2020

Abstract Let G be a finite group, and let cd ( G ) denote the set of degrees of the irreducible complex characters of G . The degree graph Δ ( G ) of G is defined as the simple undirected graph whose vertex set V ( G ) consists of the prime divisors of the numbers in cd ( G ) , two distinct vertices p and q being adjacent if and only if pq divides some number in cd ( G ) . In this note, we provide an upper bound on the size of V ( G ) in terms of the clique number ω ( G ) (i.e., the maximum size of a subset of V ( G ) inducing a complete subgraph) of Δ ( G ) . Namely, we show that | V ( G ) | ≤ max { 2 ω ( G ) + 1 , 3 ω ( G ) − 4 } . Examples are given in order to show that the bound is bes…

Finite groupAlgebra and Number Theory20C15010102 general mathematicsGroup Theory (math.GR)01 natural sciencesUpper and lower boundsGraphVertex (geometry)CombinatoricsBounding overwatch0103 physical sciencesFOS: MathematicsMaximum size010307 mathematical physics0101 mathematicsUndirected graphMathematics - Group TheoryClique numberMathematicsJournal of Pure and Applied Algebra
researchProduct

New Refinements of the McKay Conjecture for Arbitrary Finite Groups

2004

Let $G$ be an arbitrary finite group and fix a prime number $p$. The McKay conjecture asserts that $G$ and the normalizer in $G$ of a Sylow $p$-subgroup have equal numbers of irreducible characters with degrees not divisible by $p$. The Alperin-McKay conjecture is a version of this as applied to individual Brauer $p$-blocks of $G$. We offer evidence that perhaps much stronger forms of both of these conjectures are true.

Finite groupConjecture20C15Sylow theoremsPrime numberGroup Theory (math.GR)Centralizer and normalizerCollatz conjectureCombinatoricsMathematics::Group TheoryMathematics (miscellaneous)Character (mathematics)Symmetric groupFOS: MathematicsStatistics Probability and UncertaintyMathematics::Representation TheoryMathematics - Group TheoryMathematicsThe Annals of Mathematics
researchProduct

Conjugacy classes, characters and products of elements

2019

Recently, Baumslag and Wiegold proved that a finite group $G$ is nilpotent if and only if $o(xy)=o(x)o(y)$ for every $x,y\in G$ of coprime order. Motivated by this result, we study the groups with the property that $(xy)^G=x^Gy^G$ and those with the property that $\chi(xy)=\chi(x)\chi(y)$ for every complex irreducible character $\chi$ of $G$ and every nontrivial $x, y \in G$ of pairwise coprime order. We also consider several ways of weakening the hypothesis on $x$ and $y$. While the result of Baumslag and Wiegold is completely elementary, some of our arguments here depend on (parts of) the classification of finite simple groups.

Finite groupCoprime integersGeneral Mathematics010102 general mathematicsGroup Theory (math.GR)01 natural sciences010101 applied mathematicsCombinatoricsNilpotentCharacter (mathematics)Conjugacy classSolvable groupFOS: MathematicsOrder (group theory)Classification of finite simple groups0101 mathematicsMathematics - Group Theory20C15 20D15 20E45MathematicsMathematische Nachrichten
researchProduct

Strong chromatic index of products of graphs

2007

Graphs and Algorithms

General Computer ScienceCritical graphKronecker product[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]strong productinduced matchingTheoretical Computer ScienceCombinatoricssymbols.namesakeComputer Science::Discrete MathematicsCartesian productDiscrete Mathematics and CombinatoricsChromatic scaleMathematicsDiscrete mathematicsKronecker productMathematics::Combinatoricslcsh:Mathematics[ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM]Cartesian productlcsh:QA1-939Graph[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]Edge coloringMSC 05C15strong product.symbolsHypercubeStrong edge colouringMathematicsofComputing_DISCRETEMATHEMATICS
researchProduct

On operads, bimodules and analytic functors

2017

We develop further the theory of operads and analytic functors. In particular, we introduce a bicategory that has operads as 0-cells, operad bimodules as 1-cells and operad bimodule maps as 2-cells, and prove that this bicategory is cartesian closed. In order to obtain this result, we extend the theory of distributors and the formal theory of monads.

General Mathematics0102 computer and information sciences01 natural sciencesMathematics::Algebraic TopologyQuantitative Biology::Cell BehaviorMathematics::K-Theory and HomologyMathematics::Quantum AlgebraMathematics::Category Theory18D50 55P48 18D05 18C15FOS: MathematicsAlgebraic Topology (math.AT)Category Theory (math.CT)Mathematics - Algebraic Topology0101 mathematicsMathematicsFunctorOperad bimodule analytic functor bicategoryTheoryMathematics::Operator AlgebrasApplied Mathematics010102 general mathematicsOrder (ring theory)Mathematics - Category Theory16. Peace & justiceBicategoryAlgebraCartesian closed category010201 computation theory & mathematicsBimodule
researchProduct

COMPLEX STRUCTURES ON INDECOMPOSABLE 6-DIMENSIONAL NILPOTENT REAL LIE ALGEBRAS

2007

We compute all complex structures on indecomposable 6-dimensional real Lie algebras and their equivalence classes. We also give for each of them a global holomorphic chart on the connected simply connected Lie group associated to the real Lie algebra and write down the multiplication in that chart.

General MathematicsSimple Lie groupReal formMathematics - Rings and Algebras17B30Killing formAffine Lie algebraLie conformal algebraGraded Lie algebraAlgebra53C15Adjoint representation of a Lie algebraRepresentation of a Lie groupRings and Algebras (math.RA)FOS: Mathematics17B30;53C15MathematicsInternational Journal of Algebra and Computation
researchProduct