Secondary range symmetric matrices

Secondary range symmetric matrices | F1000Research "use strict";function _typeof(t){return(_typeof="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t})(t)}!function(){var t=function(){var t,e,o=[],n=window,r=n;for(;r;){try{if(r.frames.__tcfapiLocator){t=r;break}}catch(t){}if(r===n.top)break;r=r.parent}t||(!function t(){var e=n.document,o=!!n.frames.__tcfapiLocator;if(!o)if(e.body){var r=e.createElement("iframe");r.style.cssText="display:none",r.name="__tcfapiLocator",e.body.appendChild(r)}else setTimeout(t,5);return!o}(),n.__tcfapi=function(){for(var t=arguments.length,n=new Array(t),r=0;r 3&&2===parseInt(n[1],10)&&"boolean"==typeof n[3]&&(e=n[3],"function"==typeof n[2]&&n[2]("set",!0)):"ping"===n[0]?"function"==typeof n[2]&&n[2]({gdprApplies:e,cmpLoaded:!1,cmpStatus:"stub"}):o.push(n)},n.addEventListener("message",(function(t){var e="string"==typeof t.data,o={};if(e)try{o=JSON.parse(t.data)}catch(t){}else o=t.data;var n="object"===_typeof(o)&&null!==o?o.__tcfapiCall:null;n&&window.__tcfapi(n.command,n.version,(function(o,r){var a={__tcfapiReturn:{returnValue:o,success:r,callId:n.callId}};t&&t.source&&t.source.postMessage&&t.source.postMessage(e?JSON.stringify(a):a,"*")}),n.parameter)}),!1))};"undefined"!=typeof module?module.exports=t:t()}(); dataLayer = dataLayer || []; // Standard GTM initialization - Google Consent Mode handles consent automatically (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start': new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0], j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src= 'https://www.googletagmanager.com/gtm.js?id='+i+dl+ '>m_auth=hzk0Vc3qFsQYhCrIoHz68A>m_preview=env-1>m_cookies_win=x';f.parentNode.insertBefore(j,f); })(window,document,'script','dataLayer','GTM-MWFK8L5J'); ;window.NREUM||(NREUM={});NREUM.init={distributed_tracing:{enabled:true},privacy:{cookies_enabled:true},ajax:{deny_list:["bam.nr-data.net"]}}; ;NREUM.loader_config={accountID:"438030",trustKey:"438030",agentID:"772317073",licenseKey:"97f8f67f26",applicationID:"772317073"} ;NREUM.info={beacon:"bam.nr-data.net",errorBeacon:"bam.nr-data.net",licenseKey:"97f8f67f26",applicationID:"772317073",sa:1} ;/*! For license information please see nr-loader-spa-1.236.0.min.js.LICENSE.txt */ (()=>{"use strict";var e,t,r={5763:(e,t,r)=>{r.d(t,{P_:()=>l,Mt:()=>g,C5:()=>s,DL:()=>v,OP:()=>T,lF:()=>D,Yu:()=>y,Dg:()=>h,CX:()=>c,GE:()=>b,sU:()=>_});var n=r(8632),i=r(9567);const o={beacon:n.ce.beacon,errorBeacon:n.ce.errorBeacon,licenseKey:void 0,applicationID:void 0,sa:void 0,queueTime:void 0,applicationTime:void 0,ttGuid:void 0,user:void 0,account:void 0,product:void 0,extra:void 0,jsAttributes:{},userAttributes:void 0,atts:void 0,transactionName:void 0,tNamePlain:void 0},a={};function s(e){if(!e)throw new Error("All info objects require an agent identifier!");if(!a[e])throw new Error("Info for ".concat(e," was never set"));return a[e]}function c(e,t){if(!e)throw new Error("All info objects require an agent identifier!");a[e]=(0,i.D)(t,o),(0,n.Qy)(e,a[e],"info")}var u=r(7056);const d=()=>{const e={blockSelector:"[data-nr-block]",maskInputOptions:{password:!0}};return{allow_bfcache:!0,privacy:{cookies_enabled:!0},ajax:{deny_list:void 0,enabled:!0,harvestTimeSeconds:10},distributed_tracing:{enabled:void 0,exclude_newrelic_header:void 0,cors_use_newrelic_header:void 0,cors_use_tracecontext_headers:void 0,allowed_origins:void 0},session:{domain:void 0,expiresMs:u.oD,inactiveMs:u.Hb},ssl:void 0,obfuscate:void 0,jserrors:{enabled:!0,harvestTimeSeconds:10},metrics:{enabled:!0},page_action:{enabled:!0,harvestTimeSeconds:30},page_view_event:{enabled:!0},page_view_timing:{enabled:!0,harvestTimeSeconds:30,long_task:!1},session_trace:{enabled:!0,harvestTimeSeconds:10},harvest:{tooManyRequestsDelay:60},session_replay:{enabled:!1,harvestTimeSeconds:60,sampleRate:.1,errorSampleRate:.1,maskTextSelector:"*",maskAllInputs:!0,get blockClass(){return"nr-block"},get ignoreClass(){return"nr-ignore"},get maskTextClass(){return"nr-mask"},get blockSelector(){return e.blockSelector},set blockSelector(t){e.blockSelector+=",".concat(t)},get maskInputOptions(){return e.maskInputOptions},set maskInputOptions(t){e.maskInputOptions={...t,password:!0}}},spa:{enabled:!0,harvestTimeSeconds:10}}},f={};function l(e){if(!e)throw new Error("All configuration objects require an agent identifier!");if(!f[e])throw new Error("Configuration for ".concat(e," was never set"));return f[e]}function h(e,t){if(!e)throw new Error("All configuration objects require an agent identifier!");f[e]=(0,i.D)(t,d()),(0,n.Qy)(e,f[e],"config")}function g(e,t){if(!e)throw new Error("All configuration objects require an agent identifier!");var r=l(e);if(r){for(var n=t.split("."),i=0;i {r.d(t,{D:()=>i});var n=r(50);function i(e,t){try{if(!e||"object"!=typeof e)return(0,n.Z)("Setting a Configurable requires an object as input");if(!t||"object"!=typeof t)return(0,n.Z)("Setting a Configurable requires a model to set its initial properties");const r=Object.create(Object.getPrototypeOf(t),Object.getOwnPropertyDescriptors(t)),o=0===Object.keys(r).length?e:r;for(let a in o)if(void 0!==e[a])try{"object"==typeof e[a]&&"object"==typeof t[a]?r[a]=i(e[a],t[a]):r[a]=e[a]}catch(e){(0,n.Z)("An error occurred while setting a property of a Configurable",e)}return r}catch(e){(0,n.Z)("An error occured while setting a Configurable",e)}}},6818:(e,t,r)=>{r.d(t,{Re:()=>i,gF:()=>o,q4:()=>n});const n="1.236.0",i="PROD",o="CDN"},385:(e,t,r)=>{r.d(t,{FN:()=>a,IF:()=>u,Nk:()=>f,Tt:()=>s,_A:()=>o,il:()=>n,pL:()=>c,v6:()=>i,w1:()=>d});const n="undefined"!=typeof window&&!!window.document,i="undefined"!=typeof WorkerGlobalScope&&("undefined"!=typeof self&&self instanceof WorkerGlobalScope&&self.navigator instanceof WorkerNavigator||"undefined"!=typeof globalThis&&globalThis instanceof WorkerGlobalScope&&globalThis.navigator instanceof WorkerNavigator),o=n?window:"undefined"!=typeof WorkerGlobalScope&&("undefined"!=typeof self&&self instanceof WorkerGlobalScope&&self||"undefined"!=typeof globalThis&&globalThis instanceof WorkerGlobalScope&&globalThis),a=""+o?.location,s=/iPad|iPhone|iPod/.test(navigator.userAgent),c=s&&"undefined"==typeof SharedWorker,u=(()=>{const e=navigator.userAgent.match(/Firefox[/\s](\d+\.\d+)/);return Array.isArray(e)&&e.length>=2?+e[1]:0})(),d=Boolean(n&&window.document.documentMode),f=!!navigator.sendBeacon},1117:(e,t,r)=>{r.d(t,{w:()=>o});var n=r(50);const i={agentIdentifier:"",ee:void 0};class o{constructor(e){try{if("object"!=typeof e)return(0,n.Z)("shared context requires an object as input");this.sharedContext={},Object.assign(this.sharedContext,i),Object.entries(e).forEach((e=>{let[t,r]=e;Object.keys(i).includes(t)&&(this.sharedContext[t]=r)}))}catch(e){(0,n.Z)("An error occured while setting SharedContext",e)}}}},8e3:(e,t,r)=>{r.d(t,{L:()=>d,R:()=>c});var n=r(2177),i=r(1284),o=r(4322),a=r(3325);const s={};function c(e,t){const r={staged:!1,priority:a.p[t]||0};u(e),s[e].get(t)||s[e].set(t,r)}function u(e){e&&(s[e]||(s[e]=new Map))}function d(){let e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:"",t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:"feature";if(u(e),!e||!s[e].get(t))return a(t);s[e].get(t).staged=!0;const r=[...s[e]];function a(t){const r=e?n.ee.get(e):n.ee,a=o.X.handlers;if(r.backlog&&a){var s=r.backlog[t],c=a[t];if(c){for(var u=0;s&&u {let[t,r]=e;return r.staged}))&&(r.sort(((e,t)=>e[1].priority-t[1].priority)),r.forEach((e=>{let[t]=e;a(t)})))}function f(e,t){var r=e[1];(0,i.D)(t[r],(function(t,r){var n=e[0];if(r[0]===n){var i=r[1],o=e[3],a=e[2];i.apply(o,a)}}))}},2177:(e,t,r)=>{r.d(t,{c:()=>f,ee:()=>u});var n=r(8632),i=r(2210),o=r(1284),a=r(5763),s="nr@context";let c=(0,n.fP)();var u;function d(){}function f(e){return(0,i.X)(e,s,l)}function l(){return new d}function h(){u.aborted=!0,u.backlog={}}c.ee?u=c.ee:(u=function e(t,r){var n={},c={},f={},g=!1;try{g=16===r.length&&(0,a.OP)(r).isolatedBacklog}catch(e){}var p={on:b,addEventListener:b,removeEventListener:y,emit:v,get:x,listeners:w,context:m,buffer:A,abort:h,aborted:!1,isBuffering:E,debugId:r,backlog:g?{}:t&&"object"==typeof t.backlog?t.backlog:{}};return p;function m(e){return e&&e instanceof d?e:e?(0,i.X)(e,s,l):l()}function v(e,r,n,i,o){if(!1!==o&&(o=!0),!u.aborted||i){t&&o&&t.emit(e,r,n);for(var a=m(n),s=w(e),d=s.length,f=0;fn,p:()=>i});var n=r(2177).ee.get("handle");function i(e,t,r,i,o){o?(o.buffer([e],i),o.emit(e,t,r)):(n.buffer([e],i),n.emit(e,t,r))}},4322:(e,t,r)=>{r.d(t,{X:()=>o});var n=r(5546);o.on=a;var i=o.handlers={};function o(e,t,r,o){a(o||n.E,i,e,t,r)}function a(e,t,r,i,o){o||(o="feature"),e||(e=n.E);var a=t[o]=t[o]||{};(a[r]=a[r]||[]).push([e,i])}},3239:(e,t,r)=>{r.d(t,{bP:()=>s,iz:()=>c,m$:()=>a});var n=r(385);let i=!1,o=!1;try{const e={get passive(){return i=!0,!1},get signal(){return o=!0,!1}};n._A.addEventListener("test",null,e),n._A.removeEventListener("test",null,e)}catch(e){}function a(e,t){return i||o?{capture:!!e,passive:i,signal:t}:!!e}function s(e,t){let r=arguments.length>2&&void 0!==arguments[2]&&arguments[2],n=arguments.length>3?arguments[3]:void 0;window.addEventListener(e,t,a(r,n))}function c(e,t){let r=arguments.length>2&&void 0!==arguments[2]&&arguments[2],n=arguments.length>3?arguments[3]:void 0;document.addEventListener(e,t,a(r,n))}},4402:(e,t,r)=>{r.d(t,{Ht:()=>u,M:()=>c,Rl:()=>a,ky:()=>s});var n=r(385);const i="xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx";function o(e,t){return e?15&e[t]:16*Math.random()|0}function a(){const e=n._A?.crypto||n._A?.msCrypto;let t,r=0;return e&&e.getRandomValues&&(t=e.getRandomValues(new Uint8Array(31))),i.split("").map((e=>"x"===e?o(t,++r).toString(16):"y"===e?(3&o()|8).toString(16):e)).join("")}function s(e){const t=n._A?.crypto||n._A?.msCrypto;let r,i=0;t&&t.getRandomValues&&(r=t.getRandomValues(new Uint8Array(31)));const a=[];for(var s=0;s {r.d(t,{Bq:()=>n,Hb:()=>o,oD:()=>i});const n="NRBA",i=144e5,o=18e5},7894:(e,t,r)=>{function n(){return Math.round(performance.now())}r.d(t,{z:()=>n})},7243:(e,t,r)=>{r.d(t,{e:()=>o});var n=r(385),i={};function o(e){if(e in i)return i[e];if(0===(e||"").indexOf("data:"))return{protocol:"data"};let t;var r=n._A?.location,o={};if(n.il)t=document.createElement("a"),t.href=e;else try{t=new URL(e,r.href)}catch(e){return o}o.port=t.port;var a=t.href.split("://");!o.port&&a[1]&&(o.port=a[1].split("/")[0].split("@").pop().split(":")[1]),o.port&&"0"!==o.port||(o.port="https"===a[0]?"443":"80"),o.hostname=t.hostname||r.hostname,o.pathname=t.pathname,o.protocol=a[0],"/"!==o.pathname.charAt(0)&&(o.pathname="/"+o.pathname);var s=!t.protocol||":"===t.protocol||t.protocol===r.protocol,c=t.hostname===r.hostname&&t.port===r.port;return o.sameOrigin=s&&(!t.hostname||c),"/"===o.pathname&&(i[e]=o),o}},50:(e,t,r)=>{function n(e,t){"function"==typeof console.warn&&(console.warn("New Relic: ".concat(e)),t&&console.warn(t))}r.d(t,{Z:()=>n})},2587:(e,t,r)=>{r.d(t,{N:()=>c,T:()=>u});var n=r(2177),i=r(5546),o=r(8e3),a=r(3325);const s={stn:[a.D.sessionTrace],err:[a.D.jserrors,a.D.metrics],ins:[a.D.pageAction],spa:[a.D.spa],sr:[a.D.sessionReplay,a.D.sessionTrace]};function c(e,t){const r=n.ee.get(t);e&&"object"==typeof e&&(Object.entries(e).forEach((e=>{let[t,n]=e;void 0===u[t]&&(s[t]?s[t].forEach((e=>{n?(0,i.p)("feat-"+t,[],void 0,e,r):(0,i.p)("block-"+t,[],void 0,e,r),(0,i.p)("rumresp-"+t,[Boolean(n)],void 0,e,r)})):n&&(0,i.p)("feat-"+t,[],void 0,void 0,r),u[t]=Boolean(n))})),Object.keys(s).forEach((e=>{void 0===u[e]&&(s[e]?.forEach((t=>(0,i.p)("rumresp-"+e,[!1],void 0,t,r))),u[e]=!1)})),(0,o.L)(t,a.D.pageViewEvent))}const u={}},2210:(e,t,r)=>{r.d(t,{X:()=>i});var n=Object.prototype.hasOwnProperty;function i(e,t,r){if(n.call(e,t))return e[t];var i=r();if(Object.defineProperty&&Object.keys)try{return Object.defineProperty(e,t,{value:i,writable:!0,enumerable:!1}),i}catch(e){}return e[t]=i,i}},1284:(e,t,r)=>{r.d(t,{D:()=>n});const n=(e,t)=>Object.entries(e||{}).map((e=>{let[r,n]=e;return t(r,n)}))},4351:(e,t,r)=>{r.d(t,{P:()=>o});var n=r(2177);const i=()=>{const e=new WeakSet;return(t,r)=>{if("object"==typeof r&&null!==r){if(e.has(r))return;e.add(r)}return r}};function o(e){try{return JSON.stringify(e,i())}catch(e){try{n.ee.emit("internal-error",[e])}catch(e){}}}},3960:(e,t,r)=>{r.d(t,{K:()=>a,b:()=>o});var n=r(3239);function i(){return"undefined"==typeof document||"complete"===document.readyState}function o(e,t){if(i())return e();(0,n.bP)("load",e,t)}function a(e){if(i())return e();(0,n.iz)("DOMContentLoaded",e)}},8632:(e,t,r)=>{r.d(t,{EZ:()=>u,Qy:()=>c,ce:()=>o,fP:()=>a,gG:()=>d,mF:()=>s});var n=r(7894),i=r(385);const o={beacon:"bam.nr-data.net",errorBeacon:"bam.nr-data.net"};function a(){return i._A.NREUM||(i._A.NREUM={}),void 0===i._A.newrelic&&(i._A.newrelic=i._A.NREUM),i._A.NREUM}function s(){let e=a();return e.o||(e.o={ST:i._A.setTimeout,SI:i._A.setImmediate,CT:i._A.clearTimeout,XHR:i._A.XMLHttpRequest,REQ:i._A.Request,EV:i._A.Event,PR:i._A.Promise,MO:i._A.MutationObserver,FETCH:i._A.fetch}),e}function c(e,t,r){let i=a();const o=i.initializedAgents||{},s=o[e]||{};return Object.keys(s).length||(s.initializedAt={ms:(0,n.z)(),date:new Date}),i.initializedAgents={...o,[e]:{...s,[r]:t}},i}function u(e,t){a()[e]=t}function d(){return function(){let e=a();const t=e.info||{};e.info={beacon:o.beacon,errorBeacon:o.errorBeacon,...t}}(),function(){let e=a();const t=e.init||{};e.init={...t}}(),s(),function(){let e=a();const t=e.loader_config||{};e.loader_config={...t}}(),a()}},7956:(e,t,r)=>{r.d(t,{N:()=>i});var n=r(3239);function i(e){let t=arguments.length>1&&void 0!==arguments[1]&&arguments[1],r=arguments.length>2?arguments[2]:void 0,i=arguments.length>3?arguments[3]:void 0;return void(0,n.iz)("visibilitychange",(function(){if(t)return void("hidden"==document.visibilityState&&e());e(document.visibilityState)}),r,i)}},1214:(e,t,r)=>{r.d(t,{em:()=>v,u5:()=>N,QU:()=>S,_L:()=>I,Gm:()=>L,Lg:()=>M,gy:()=>U,BV:()=>Q,Kf:()=>ee});var n=r(2177);const i="nr@original";var o=Object.prototype.hasOwnProperty,a=!1;function s(e,t){return e||(e=n.ee),r.inPlace=function(e,t,n,i,o){n||(n="");var a,s,c,u="-"===n.charAt(0);for(c=0;c 2?n-2:0),o=2;o {r(A[T],e,w),r(E[T],e,w)})),r(l._A,"fetch",y),t.on(y+"end",(function(e,r){var n=this;if(r){var i=r.headers.get("content-length");null!==i&&(n.rxSize=i),t.emit(y+"done",[null,r],n)}else t.emit(y+"done",[e],n)})),t}const O={},j=["pushState","replaceState"];function S(e){const t=function(e){return(e||n.ee).get("history")}(e);return!l.il||O[t.debugId]++||(O[t.debugId]=1,s(t).inPlace(window.history,j,"-")),t}var P=r(3239);const C={},R=["appendChild","insertBefore","replaceChild"];function I(e){const t=function(e){return(e||n.ee).get("jsonp")}(e);if(!l.il||C[t.debugId])return t;C[t.debugId]=!0;var r=s(t),i=/[?&](?:callback|cb)=([^&#]+)/,o=/(.*)\.([^.]+)/,a=/^(\w+)(\.|$)(.*)$/;function c(e,t){var r=e.match(a),n=r[1],i=r[3];return i?c(i,t[n]):t[n]}return r.inPlace(Node.prototype,R,"dom-"),t.on("dom-start",(function(e){!function(e){if(!e||"string"!=typeof e.nodeName||"script"!==e.nodeName.toLowerCase())return;if("function"!=typeof e.addEventListener)return;var n=(a=e.src,s=a.match(i),s?s[1]:null);var a,s;if(!n)return;var u=function(e){var t=e.match(o);if(t&&t.length>=3)return{key:t[2],parent:c(t[1],window)};return{key:e,parent:window}}(n);if("function"!=typeof u.parent[u.key])return;var d={};function f(){t.emit("jsonp-end",[],d),e.removeEventListener("load",f,(0,P.m$)(!1)),e.removeEventListener("error",l,(0,P.m$)(!1))}function l(){t.emit("jsonp-error",[],d),t.emit("jsonp-end",[],d),e.removeEventListener("load",f,(0,P.m$)(!1)),e.removeEventListener("error",l,(0,P.m$)(!1))}r.inPlace(u.parent,[u.key],"cb-",d),e.addEventListener("load",f,(0,P.m$)(!1)),e.addEventListener("error",l,(0,P.m$)(!1)),t.emit("new-jsonp",[e.src],d)}(e[0])})),t}var k=r(5763);const H={};function L(e){const t=function(e){return(e||n.ee).get("mutation")}(e);if(!l.il||H[t.debugId])return t;H[t.debugId]=!0;var r=s(t),i=k.Yu.MO;return i&&(window.MutationObserver=function(e){return this instanceof i?new i(r(e,"fn-")):i.apply(this,arguments)},MutationObserver.prototype=i.prototype),t}const z={};function M(e){const t=function(e){return(e||n.ee).get("promise")}(e);if(z[t.debugId])return t;z[t.debugId]=!0;var r=n.c,o=s(t),a=k.Yu.PR;return a&&function(){function e(r){var n=t.context(),i=o(r,"executor-",n,null,!1);const s=Reflect.construct(a,[i],e);return t.context(s).getCtx=function(){return n},s}l._A.Promise=e,Object.defineProperty(e,"name",{value:"Promise"}),e.toString=function(){return a.toString()},Object.setPrototypeOf(e,a),["all","race"].forEach((function(r){const n=a[r];e[r]=function(e){let i=!1;[...e||[]].forEach((e=>{this.resolve(e).then(a("all"===r),a(!1))}));const o=n.apply(this,arguments);return o;function a(e){return function(){t.emit("propagate",[null,!i],o,!1,!1),i=i||!e}}}})),["resolve","reject"].forEach((function(r){const n=a[r];e[r]=function(e){const r=n.apply(this,arguments);return e!==r&&t.emit("propagate",[e,!0],r,!1,!1),r}})),e.prototype=a.prototype;const n=a.prototype.then;a.prototype.then=function(){var e=this,i=r(e);i.promise=e;for(var a=arguments.length,s=new Array(a),c=0;c e())),t};function m(e,t){i.inPlace(t,["onreadystatechange"],"fn-",E)}function b(){var e=this,t=r.context(e);e.readyState>3&&!t.resolved&&(t.resolved=!0,r.emit("xhr-resolved",[],e)),i.inPlace(e,f,"fn-",E)}if(function(e,t){for(var r in e)t[r]=e[r]}(o,p),p.prototype=o.prototype,i.inPlace(p.prototype,J,"-xhr-",E),r.on("send-xhr-start",(function(e,t){m(e,t),function(e){h.push(e),a&&(y?y.then(A):u?u(A):(w=-w,x.data=w))}(t)})),r.on("open-xhr-start",m),a){var y=c&&c.resolve();if(!u&&!c){var w=1,x=document.createTextNode(w);new a(A).observe(x,{characterData:!0})}}else t.on("fn-end",(function(e){e[0]&&e[0].type===d||A()}));function A(){for(var e=0;e {r.d(t,{t:()=>n});const n=r(3325).D.ajax},6660:(e,t,r)=>{r.d(t,{A:()=>i,t:()=>n});const n=r(3325).D.jserrors,i="nr@seenError"},3081:(e,t,r)=>{r.d(t,{gF:()=>o,mY:()=>i,t9:()=>n,vz:()=>s,xS:()=>a});const n=r(3325).D.metrics,i="sm",o="cm",a="storeSupportabilityMetrics",s="storeEventMetrics"},4649:(e,t,r)=>{r.d(t,{t:()=>n});const n=r(3325).D.pageAction},7633:(e,t,r)=>{r.d(t,{Dz:()=>i,OJ:()=>a,qw:()=>o,t9:()=>n});const n=r(3325).D.pageViewEvent,i="firstbyte",o="domcontent",a="windowload"},9251:(e,t,r)=>{r.d(t,{t:()=>n});const n=r(3325).D.pageViewTiming},3614:(e,t,r)=>{r.d(t,{BST_RESOURCE:()=>i,END:()=>s,FEATURE_NAME:()=>n,FN_END:()=>u,FN_START:()=>c,PUSH_STATE:()=>d,RESOURCE:()=>o,START:()=>a});const n=r(3325).D.sessionTrace,i="bstResource",o="resource",a="-start",s="-end",c="fn"+a,u="fn"+s,d="pushState"},7836:(e,t,r)=>{r.d(t,{BODY:()=>A,CB_END:()=>E,CB_START:()=>u,END:()=>x,FEATURE_NAME:()=>i,FETCH:()=>_,FETCH_BODY:()=>v,FETCH_DONE:()=>m,FETCH_START:()=>p,FN_END:()=>c,FN_START:()=>s,INTERACTION:()=>l,INTERACTION_API:()=>d,INTERACTION_EVENTS:()=>o,JSONP_END:()=>b,JSONP_NODE:()=>g,JS_TIME:()=>T,MAX_TIMER_BUDGET:()=>a,REMAINING:()=>f,SPA_NODE:()=>h,START:()=>w,originalSetTimeout:()=>y});var n=r(5763);const i=r(3325).D.spa,o=["click","submit","keypress","keydown","keyup","change"],a=999,s="fn-start",c="fn-end",u="cb-start",d="api-ixn-",f="remaining",l="interaction",h="spaNode",g="jsonpNode",p="fetch-start",m="fetch-done",v="fetch-body-",b="jsonp-end",y=n.Yu.ST,w="-start",x="-end",A="-body",E="cb"+x,T="jsTime",_="fetch"},5938:(e,t,r)=>{r.d(t,{W:()=>o});var n=r(5763),i=r(2177);class o{constructor(e,t,r){this.agentIdentifier=e,this.aggregator=t,this.ee=i.ee.get(e,(0,n.OP)(this.agentIdentifier).isolatedBacklog),this.featureName=r,this.blocked=!1}}},9144:(e,t,r)=>{r.d(t,{j:()=>m});var n=r(3325),i=r(5763),o=r(5546),a=r(2177),s=r(7894),c=r(8e3),u=r(3960),d=r(385),f=r(50),l=r(3081),h=r(8632);function g(){const e=(0,h.gG)();["setErrorHandler","finished","addToTrace","inlineHit","addRelease","addPageAction","setCurrentRouteName","setPageViewName","setCustomAttribute","interaction","noticeError","setUserId"].forEach((t=>{e[t]=function(){for(var r=arguments.length,n=new Array(r),i=0;i 1?r-1:0),i=1;i {e.exposed&&e.api[t]&&o.push(e.api[t](...n))})),o.length>1?o:o[0]}(t,...n)}}))}var p=r(2587);function m(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{},m=arguments.length>2?arguments[2]:void 0,v=arguments.length>3?arguments[3]:void 0,{init:b,info:y,loader_config:w,runtime:x={loaderType:m},exposed:A=!0}=t;const E=(0,h.gG)();y||(b=E.init,y=E.info,w=E.loader_config),(0,i.Dg)(e,b||{}),(0,i.GE)(e,w||{}),(0,i.sU)(e,x),y.jsAttributes??={},d.v6&&(y.jsAttributes.isWorker=!0),(0,i.CX)(e,y),g();const T=function(e,t){t||(0,c.R)(e,"api");const h={};var g=a.ee.get(e),p=g.get("tracer"),m="api-",v=m+"ixn-";function b(t,r,n,o){const a=(0,i.C5)(e);return null===r?delete a.jsAttributes[t]:(0,i.CX)(e,{...a,jsAttributes:{...a.jsAttributes,[t]:r}}),x(m,n,!0,o||null===r?"session":void 0)(t,r)}function y(){}["setErrorHandler","finished","addToTrace","inlineHit","addRelease"].forEach((e=>h[e]=x(m,e,!0,"api"))),h.addPageAction=x(m,"addPageAction",!0,n.D.pageAction),h.setCurrentRouteName=x(m,"routeName",!0,n.D.spa),h.setPageViewName=function(t,r){if("string"==typeof t)return"/"!==t.charAt(0)&&(t="/"+t),(0,i.OP)(e).customTransaction=(r||"http://custom.transaction")+t,x(m,"setPageViewName",!0)()},h.setCustomAttribute=function(e,t){let r=arguments.length>2&&void 0!==arguments[2]&&arguments[2];if("string"==typeof e){if(["string","number"].includes(typeof t)||null===t)return b(e,t,"setCustomAttribute",r);(0,f.Z)("Failed to execute setCustomAttribute.\nNon-null value must be a string or number type, but a type of was provided."))}else(0,f.Z)("Failed to execute setCustomAttribute.\nName must be a string type, but a type of was provided."))},h.setUserId=function(e){if("string"==typeof e||null===e)return b("enduser.id",e,"setUserId",!0);(0,f.Z)("Failed to execute setUserId.\nNon-null value must be a string type, but a type of was provided."))},h.interaction=function(){return(new y).get()};var w=y.prototype={createTracer:function(e,t){var r={},i=this,a="function"==typeof t;return(0,o.p)(v+"tracer",[(0,s.z)(),e,r],i,n.D.spa,g),function(){if(p.emit((a?"":"no-")+"fn-start",[(0,s.z)(),i,a],r),a)try{return t.apply(this,arguments)}catch(e){throw p.emit("fn-err",[arguments,this,"string"==typeof e?new Error(e):e],r),e}finally{p.emit("fn-end",[(0,s.z)()],r)}}}};function x(e,t,r,i){return function(){return(0,o.p)(l.xS,["API/"+t+"/called"],void 0,n.D.metrics,g),i&&(0,o.p)(e+t,[(0,s.z)(),...arguments],r?null:this,i,g),r?void 0:this}}function A(){r.e(439).then(r.bind(r,7438)).then((t=>{let{setAPI:r}=t;r(e),(0,c.L)(e,"api")})).catch((()=>(0,f.Z)("Downloading runtime APIs failed...")))}return["actionText","setName","setAttribute","save","ignore","onEnd","getContext","end","get"].forEach((e=>{w[e]=x(v,e,void 0,n.D.spa)})),h.noticeError=function(e,t){"string"==typeof e&&(e=new Error(e)),(0,o.p)(l.xS,["API/noticeError/called"],void 0,n.D.metrics,g),(0,o.p)("err",[e,(0,s.z)(),!1,t],void 0,n.D.jserrors,g)},d.il?(0,u.b)((()=>A()),!0):A(),h}(e,v);return(0,h.Qy)(e,T,"api"),(0,h.Qy)(e,A,"exposed"),(0,h.EZ)("activatedFeatures",p.T),T}},3325:(e,t,r)=>{r.d(t,{D:()=>n,p:()=>i});const n={ajax:"ajax",jserrors:"jserrors",metrics:"metrics",pageAction:"page_action",pageViewEvent:"page_view_event",pageViewTiming:"page_view_timing",sessionReplay:"session_replay",sessionTrace:"session_trace",spa:"spa"},i={[n.pageViewEvent]:1,[n.pageViewTiming]:2,[n.metrics]:3,[n.jserrors]:4,[n.ajax]:5,[n.sessionTrace]:6,[n.pageAction]:7,[n.spa]:8,[n.sessionReplay]:9}}},n={};function i(e){var t=n[e];if(void 0!==t)return t.exports;var o=n[e]={exports:{}};return r[e](o,o.exports,i),o.exports}i.m=r,i.d=(e,t)=>{for(var r in t)i.o(t,r)&&!i.o(e,r)&&Object.defineProperty(e,r,{enumerable:!0,get:t[r]})},i.f={},i.e=e=>Promise.all(Object.keys(i.f).reduce(((t,r)=>(i.f[r](e,t),t)),[])),i.u=e=>(({78:"page_action-aggregate",147:"metrics-aggregate",242:"session-manager",317:"jserrors-aggregate",348:"page_view_timing-aggregate",412:"lazy-feature-loader",439:"async-api",538:"recorder",590:"session_replay-aggregate",675:"compressor",733:"session_trace-aggregate",786:"page_view_event-aggregate",873:"spa-aggregate",898:"ajax-aggregate"}[e]||e)+"."+{78:"ac76d497",147:"3dc53903",148:"1a20d5fe",242:"2a64278a",317:"49e41428",348:"bd6de33a",412:"2f55ce66",439:"30bd804e",538:"1b18459f",590:"cf0efb30",675:"ae9f91a8",733:"83105561",786:"06482edd",860:"03a8b7a5",873:"e6b09d52",898:"998ef92b"}[e]+"-1.236.0.min.js"),i.o=(e,t)=>Object.prototype.hasOwnProperty.call(e,t),e={},t="NRBA:",i.l=(r,n,o,a)=>{if(e[r])e[r].push(n);else{var s,c;if(void 0!==o)for(var u=document.getElementsByTagName("script"),d=0;d {s.onerror=s.onload=null,clearTimeout(h);var i=e[r];if(delete e[r],s.parentNode&&s.parentNode.removeChild(s),i&&i.forEach((e=>e(n))),t)return t(n)},h=setTimeout(l.bind(null,void 0,{type:"timeout",target:s}),12e4);s.onerror=l.bind(null,s.onerror),s.onload=l.bind(null,s.onload),c&&document.head.appendChild(s)}},i.r=e=>{"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(e,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(e,"__esModule",{value:!0})},i.j=364,i.p="https://js-agent.newrelic.com/",(()=>{var e={364:0,953:0};i.f.j=(t,r)=>{var n=i.o(e,t)?e[t]:void 0;if(0!==n)if(n)r.push(n[2]);else{var o=new Promise(((r,i)=>n=e[t]=[r,i]));r.push(n[2]=o);var a=i.p+i.u(t),s=new Error;i.l(a,(r=>{if(i.o(e,t)&&(0!==(n=e[t])&&(e[t]=void 0),n)){var o=r&&("load"===r.type?"missing":r.type),a=r&&r.target&&r.target.src;s.message="Loading chunk "+t+" failed.\n("+o+": "+a+")",s.name="ChunkLoadError",s.type=o,s.request=a,n[1](s)}}),"chunk-"+t,t)}};var t=(t,r)=>{var n,o,[a,s,c]=r,u=0;if(a.some((t=>0!==e[t]))){for(n in s)i.o(s,n)&&(i.m[n]=s[n]);if(c)c(i)}for(t&&t(r);u {i.r(o);var e=i(3325),t=i(5763);const r=Object.values(e.D);function n(e){const n={};return r.forEach((r=>{n[r]=function(e,r){return!1!==(0,t.Mt)(r,"".concat(e,".enabled"))}(r,e)})),n}var a=i(9144);var s=i(5546),c=i(385),u=i(8e3),d=i(5938),f=i(3960),l=i(50);class h extends d.W{constructor(e,t,r){let n=!(arguments.length>3&&void 0!==arguments[3])||arguments[3];super(e,t,r),this.auto=n,this.abortHandler,this.featAggregate,this.onAggregateImported,n&&(0,u.R)(e,r)}importAggregator(){let e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:{};if(this.featAggregate||!this.auto)return;const r=c.il&&!0===(0,t.Mt)(this.agentIdentifier,"privacy.cookies_enabled");let n;this.onAggregateImported=new Promise((e=>{n=e}));const o=async()=>{let t;try{if(r){const{setupAgentSession:e}=await Promise.all([i.e(860),i.e(242)]).then(i.bind(i,3228));t=e(this.agentIdentifier)}}catch(e){(0,l.Z)("A problem occurred when starting up session manager. This page will not start or extend any session.",e)}try{if(!this.shouldImportAgg(this.featureName,t))return void(0,u.L)(this.agentIdentifier,this.featureName);const{lazyFeatureLoader:r}=await i.e(412).then(i.bind(i,8582)),{Aggregate:o}=await r(this.featureName,"aggregate");this.featAggregate=new o(this.agentIdentifier,this.aggregator,e),n(!0)}catch(e){(0,l.Z)("Downloading and initializing ".concat(this.featureName," failed..."),e),this.abortHandler?.(),n(!1)}};c.il?(0,f.b)((()=>o()),!0):o()}shouldImportAgg(r,n){return r!==e.D.sessionReplay||!1!==(0,t.Mt)(this.agentIdentifier,"session_trace.enabled")&&(!!n?.isNew||!!n?.state.sessionReplay)}}var g=i(7633),p=i(7894);class m extends h{static featureName=g.t9;constructor(r,n){let i=!(arguments.length>2&&void 0!==arguments[2])||arguments[2];if(super(r,n,g.t9,i),("undefined"==typeof PerformanceNavigationTiming||c.Tt)&&"undefined"!=typeof PerformanceTiming){const n=(0,t.OP)(r);n[g.Dz]=Math.max(Date.now()-n.offset,0),(0,f.K)((()=>n[g.qw]=Math.max((0,p.z)()-n[g.Dz],0))),(0,f.b)((()=>{const t=(0,p.z)();n[g.OJ]=Math.max(t-n[g.Dz],0),(0,s.p)("timing",["load",t],void 0,e.D.pageViewTiming,this.ee)}))}this.importAggregator()}}var v=i(1117),b=i(1284);class y extends v.w{constructor(e){super(e),this.aggregatedData={}}store(e,t,r,n,i){var o=this.getBucket(e,t,r,i);return o.metrics=function(e,t){t||(t={count:0});return t.count+=1,(0,b.D)(e,(function(e,r){t[e]=w(r,t[e])})),t}(n,o.metrics),o}merge(e,t,r,n,i){var o=this.getBucket(e,t,n,i);if(o.metrics){var a=o.metrics;a.count+=r.count,(0,b.D)(r,(function(e,t){if("count"!==e){var n=a[e],i=r[e];i&&!i.c?a[e]=w(i.t,n):a[e]=function(e,t){if(!t)return e;t.c||(t=x(t.t));return t.min=Math.min(e.min,t.min),t.max=Math.max(e.max,t.max),t.t+=e.t,t.sos+=e.sos,t.c+=e.c,t}(i,a[e])}}))}else o.metrics=r}storeMetric(e,t,r,n){var i=this.getBucket(e,t,r);return i.stats=w(n,i.stats),i}getBucket(e,t,r,n){this.aggregatedData[e]||(this.aggregatedData[e]={});var i=this.aggregatedData[e][t];return i||(i=this.aggregatedData[e][t]={params:r||{}},n&&(i.custom=n)),i}get(e,t){return t?this.aggregatedData[e]&&this.aggregatedData[e][t]:this.aggregatedData[e]}take(e){for(var t={},r="",n=!1,i=0;i t.max&&(t.max=e),e 2&&void 0!==arguments[2])||arguments[2];super(e,r,j.t,n),c.il&&((0,t.OP)(e).initHidden=Boolean("hidden"===document.visibilityState),(0,N.N)((()=>(0,s.p)("docHidden",[(0,p.z)()],void 0,j.t,this.ee)),!0),(0,O.bP)("pagehide",(()=>(0,s.p)("winPagehide",[(0,p.z)()],void 0,j.t,this.ee))),this.importAggregator())}}var P=i(3081);class C extends h{static featureName=P.t9;constructor(e,t){let r=!(arguments.length>2&&void 0!==arguments[2])||arguments[2];super(e,t,P.t9,r),this.importAggregator()}}var R,I=i(2210),k=i(1214),H=i(2177),L={};try{R=localStorage.getItem("__nr_flags").split(","),console&&"function"==typeof console.log&&(L.console=!0,-1!==R.indexOf("dev")&&(L.dev=!0),-1!==R.indexOf("nr_dev")&&(L.nrDev=!0))}catch(e){}function z(e){try{L.console&&z(e)}catch(e){}}L.nrDev&&H.ee.on("internal-error",(function(e){z(e.stack)})),L.dev&&H.ee.on("fn-err",(function(e,t,r){z(r.stack)})),L.dev&&(z("NR AGENT IN DEVELOPMENT MODE"),z("flags: "+(0,b.D)(L,(function(e,t){return e})).join(", ")));var M=i(6660);class B extends h{static featureName=M.t;constructor(r,n){let i=!(arguments.length>2&&void 0!==arguments[2])||arguments[2];super(r,n,M.t,i),this.skipNext=0;try{this.removeOnAbort=new AbortController}catch(e){}const o=this;o.ee.on("fn-start",(function(e,t,r){o.abortHandler&&(o.skipNext+=1)})),o.ee.on("fn-err",(function(t,r,n){o.abortHandler&&!n[M.A]&&((0,I.X)(n,M.A,(function(){return!0})),this.thrown=!0,(0,s.p)("err",[n,(0,p.z)()],void 0,e.D.jserrors,o.ee))})),o.ee.on("fn-end",(function(){o.abortHandler&&!this.thrown&&o.skipNext>0&&(o.skipNext-=1)})),o.ee.on("internal-error",(function(t){(0,s.p)("ierr",[t,(0,p.z)(),!0],void 0,e.D.jserrors,o.ee)})),this.origOnerror=c._A.onerror,c._A.onerror=this.onerrorHandler.bind(this),c._A.addEventListener("unhandledrejection",(t=>{const r=function(e){let t="Unhandled Promise Rejection: ";if(e instanceof Error)try{return e.message=t+e.message,e}catch(t){return e}if(void 0===e)return new Error(t);try{return new Error(t+(0,D.P)(e))}catch(e){return new Error(t)}}(t.reason);(0,s.p)("err",[r,(0,p.z)(),!1,{unhandledPromiseRejection:1}],void 0,e.D.jserrors,this.ee)}),(0,O.m$)(!1,this.removeOnAbort?.signal)),(0,k.gy)(this.ee),(0,k.BV)(this.ee),(0,k.em)(this.ee),(0,t.OP)(r).xhrWrappable&&(0,k.Kf)(this.ee),this.abortHandler=this.#e,this.importAggregator()}#e(){this.removeOnAbort?.abort(),this.abortHandler=void 0}onerrorHandler(t,r,n,i,o){"function"==typeof this.origOnerror&&this.origOnerror(...arguments);try{this.skipNext?this.skipNext-=1:(0,s.p)("err",[o||new F(t,r,n),(0,p.z)()],void 0,e.D.jserrors,this.ee)}catch(t){try{(0,s.p)("ierr",[t,(0,p.z)(),!0],void 0,e.D.jserrors,this.ee)}catch(e){}}return!1}}function F(e,t,r){this.message=e||"Uncaught error with no additional information",this.sourceURL=t,this.line=r}let U=1;const q="nr@id";function G(e){const t=typeof e;return!e||"object"!==t&&"function"!==t?-1:e===c._A?0:(0,I.X)(e,q,(function(){return U++}))}function V(e){if("string"==typeof e&&e.length)return e.length;if("object"==typeof e){if("undefined"!=typeof ArrayBuffer&&e instanceof ArrayBuffer&&e.byteLength)return e.byteLength;if("undefined"!=typeof Blob&&e instanceof Blob&&e.size)return e.size;if(!("undefined"!=typeof FormData&&e instanceof FormData))try{return(0,D.P)(e).length}catch(e){return}}}var X=i(7243);class W{constructor(e){this.agentIdentifier=e,this.generateTracePayload=this.generateTracePayload.bind(this),this.shouldGenerateTrace=this.shouldGenerateTrace.bind(this)}generateTracePayload(e){if(!this.shouldGenerateTrace(e))return null;var r=(0,t.DL)(this.agentIdentifier);if(!r)return null;var n=(r.accountID||"").toString()||null,i=(r.agentID||"").toString()||null,o=(r.trustKey||"").toString()||null;if(!n||!i)return null;var a=(0,_.M)(),s=(0,_.Ht)(),c=Date.now(),u={spanId:a,traceId:s,timestamp:c};return(e.sameOrigin||this.isAllowedOrigin(e)&&this.useTraceContextHeadersForCors())&&(u.traceContextParentHeader=this.generateTraceContextParentHeader(a,s),u.traceContextStateHeader=this.generateTraceContextStateHeader(a,c,n,i,o)),(e.sameOrigin&&!this.excludeNewrelicHeader()||!e.sameOrigin&&this.isAllowedOrigin(e)&&this.useNewrelicHeaderForCors())&&(u.newrelicHeader=this.generateTraceHeader(a,s,c,n,i,o)),u}generateTraceContextParentHeader(e,t){return"00-"+t+"-"+e+"-01"}generateTraceContextStateHeader(e,t,r,n,i){return i+"@nr=0-1-"+r+"-"+n+"-"+e+"----"+t}generateTraceHeader(e,t,r,n,i,o){if(!("function"==typeof c._A?.btoa))return null;var a={v:[0,1],d:{ty:"Browser",ac:n,ap:i,id:e,tr:t,ti:r}};return o&&n!==o&&(a.d.tk=o),btoa((0,D.P)(a))}shouldGenerateTrace(e){return this.isDtEnabled()&&this.isAllowedOrigin(e)}isAllowedOrigin(e){var r=!1,n={};if((0,t.Mt)(this.agentIdentifier,"distributed_tracing")&&(n=(0,t.P_)(this.agentIdentifier).distributed_tracing),e.sameOrigin)r=!0;else if(n.allowed_origins instanceof Array)for(var i=0;i 2&&void 0!==arguments[2])||arguments[2];super(r,n,Z.t,i),(0,t.OP)(r).xhrWrappable&&(this.dt=new W(r),this.handler=(e,t,r,n)=>(0,s.p)(e,t,r,n,this.ee),(0,k.u5)(this.ee),(0,k.Kf)(this.ee),function(r,n,i,o){function a(e){var t=this;t.totalCbs=0,t.called=0,t.cbTime=0,t.end=E,t.ended=!1,t.xhrGuids={},t.lastSize=null,t.loadCaptureCalled=!1,t.params=this.params||{},t.metrics=this.metrics||{},e.addEventListener("load",(function(r){_(t,e)}),(0,O.m$)(!1)),c.IF||e.addEventListener("progress",(function(e){t.lastSize=e.loaded}),(0,O.m$)(!1))}function s(e){this.params={method:e[0]},T(this,e[1]),this.metrics={}}function u(e,n){var i=(0,t.DL)(r);i.xpid&&this.sameOrigin&&n.setRequestHeader("X-NewRelic-ID",i.xpid);var a=o.generateTracePayload(this.parsedOrigin);if(a){var s=!1;a.newrelicHeader&&(n.setRequestHeader("newrelic",a.newrelicHeader),s=!0),a.traceContextParentHeader&&(n.setRequestHeader("traceparent",a.traceContextParentHeader),a.traceContextStateHeader&&n.setRequestHeader("tracestate",a.traceContextStateHeader),s=!0),s&&(this.dt=a)}}function d(e,t){var r=this.metrics,i=e[0],o=this;if(r&&i){var a=V(i);a&&(r.txSize=a)}this.startTime=(0,p.z)(),this.listener=function(e){try{"abort"!==e.type||o.loadCaptureCalled||(o.params.aborted=!0),("load"!==e.type||o.called===o.totalCbs&&(o.onloadCalled||"function"!=typeof t.onload)&&"function"==typeof o.end)&&o.end(t)}catch(e){try{n.emit("internal-error",[e])}catch(e){}}};for(var s=0;s 1?e[1]=i:e.push(i)}else e[0]&&e[0].headers&&s(e[0].headers,n)&&(this.dt=n);function s(e,t){var r=!1;return t.newrelicHeader&&(e.set("newrelic",t.newrelicHeader),r=!0),t.traceContextParentHeader&&(e.set("traceparent",t.traceContextParentHeader),t.traceContextStateHeader&&e.set("tracestate",t.traceContextStateHeader),r=!0),r}}function x(e,t){this.params={},this.metrics={},this.startTime=(0,p.z)(),this.dt=t,e.length>=1&&(this.target=e[0]),e.length>=2&&(this.opts=e[1]);var r,n=this.opts||{},i=this.target;"string"==typeof i?r=i:"object"==typeof i&&i instanceof Y?r=i.url:c._A?.URL&&"object"==typeof i&&i instanceof URL&&(r=i.href),T(this,r);var o=(""+(i&&i instanceof Y&&i.method||n.method||"GET")).toUpperCase();this.params.method=o,this.txSize=V(n.body)||0}function A(t,r){var n;this.endTime=(0,p.z)(),this.params||(this.params={}),this.params.status=r?r.status:0,"string"==typeof this.rxSize&&this.rxSize.length>0&&(n=+this.rxSize);var o={txSize:this.txSize,rxSize:n,duration:(0,p.z)()-this.startTime};i("xhr",[this.params,o,this.startTime,this.endTime,"fetch"],this,e.D.ajax)}function E(t){var r=this.params,n=this.metrics;if(!this.ended){this.ended=!0;for(var o=0;o 2&&void 0!==arguments[2])||arguments[2];super(e,t,we.t,r),this.importAggregator()}}new class{constructor(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:(0,_.ky)(16);c._A?(this.agentIdentifier=t,this.sharedAggregator=new y({agentIdentifier:this.agentIdentifier}),this.features={},this.desiredFeatures=new Set(e.features||[]),this.desiredFeatures.add(m),Object.assign(this,(0,a.j)(this.agentIdentifier,e,e.loaderType||"agent")),this.start()):(0,l.Z)("Failed to initial the agent. Could not determine the runtime environment.")}get config(){return{info:(0,t.C5)(this.agentIdentifier),init:(0,t.P_)(this.agentIdentifier),loader_config:(0,t.DL)(this.agentIdentifier),runtime:(0,t.OP)(this.agentIdentifier)}}start(){const t="features";try{const r=n(this.agentIdentifier),i=[...this.desiredFeatures];i.sort(((t,r)=>e.p[t.featureName]-e.p[r.featureName])),i.forEach((t=>{if(r[t.featureName]||t.featureName===e.D.pageViewEvent){const n=function(t){switch(t){case e.D.ajax:return[e.D.jserrors];case e.D.sessionTrace:return[e.D.ajax,e.D.pageViewEvent];case e.D.sessionReplay:return[e.D.sessionTrace];case e.D.pageViewTiming:return[e.D.pageViewEvent];default:return[]}}(t.featureName);n.every((e=>r[e]))||(0,l.Z)("".concat(t.featureName," is enabled but one or more dependent features has been disabled (").concat((0,D.P)(n),"). This may cause unintended consequences or missing data...")),this.features[t.featureName]=new t(this.agentIdentifier,this.sharedAggregator)}})),(0,T.Qy)(this.agentIdentifier,this.features,t)}catch(e){(0,l.Z)("Failed to initialize all enabled instrument classes (agent aborted) -",e);for(const e in this.features)this.features[e].abortHandler?.();const r=(0,T.fP)();return delete r.initializedAgents[this.agentIdentifier]?.api,delete r.initializedAgents[this.agentIdentifier]?.[t],delete this.sharedAggregator,r.ee?.abort(),delete r.ee?.get(this.agentIdentifier),!1}}}({features:[J,m,S,class extends h{static featureName=oe;constructor(t,r){if(super(t,r,oe,!(arguments.length>2&&void 0!==arguments[2])||arguments[2]),!c.il)return;const n=this.ee;let i;(0,k.QU)(n),this.eventsEE=(0,k.em)(n),this.eventsEE.on(se,(function(e,t){this.bstStart=(0,p.z)()})),this.eventsEE.on(ae,(function(t,r){(0,s.p)("bst",[t[0],r,this.bstStart,(0,p.z)()],void 0,e.D.sessionTrace,n)})),n.on(ce+ne,(function(e){this.time=(0,p.z)(),this.startPath=location.pathname+location.hash})),n.on(ce+ie,(function(t){(0,s.p)("bstHist",[location.pathname+location.hash,this.startPath,this.time],void 0,e.D.sessionTrace,n)}));try{i=new PerformanceObserver((t=>{const r=t.getEntries();(0,s.p)(te,[r],void 0,e.D.sessionTrace,n)})),i.observe({type:re,buffered:!0})}catch(e){}this.importAggregator({resourceObserver:i})}},C,xe,B,class extends h{static featureName=de;constructor(e,r){if(super(e,r,de,!(arguments.length>2&&void 0!==arguments[2])||arguments[2]),!c.il)return;if(!(0,t.OP)(e).xhrWrappable)return;try{this.removeOnAbort=new AbortController}catch(e){}let n,i=0;const o=this.ee.get("tracer"),a=(0,k._L)(this.ee),s=(0,k.Lg)(this.ee),u=(0,k.BV)(this.ee),d=(0,k.Kf)(this.ee),f=this.ee.get("events"),l=(0,k.u5)(this.ee),h=(0,k.QU)(this.ee),g=(0,k.Gm)(this.ee);function m(e,t){h.emit("newURL",[""+window.location,t])}function v(){i++,n=window.location.hash,this[ve]=(0,p.z)()}function b(){i--,window.location.hash!==n&&m(0,!0);var e=(0,p.z)();this[pe]=~~this[pe]+e-this[ve],this[ye]=e}function y(e,t){e.on(t,(function(){this[t]=(0,p.z)()}))}this.ee.on(ve,v),s.on(be,v),a.on(be,v),this.ee.on(ye,b),s.on(ge,b),a.on(ge,b),this.ee.buffer([ve,ye,"xhr-resolved"],this.featureName),f.buffer([ve],this.featureName),u.buffer(["setTimeout"+le,"clearTimeout"+fe,ve],this.featureName),d.buffer([ve,"new-xhr","send-xhr"+fe],this.featureName),l.buffer([me+fe,me+"-done",me+he+fe,me+he+le],this.featureName),h.buffer(["newURL"],this.featureName),g.buffer([ve],this.featureName),s.buffer(["propagate",be,ge,"executor-err","resolve"+fe],this.featureName),o.buffer([ve,"no-"+ve],this.featureName),a.buffer(["new-jsonp","cb-start","jsonp-error","jsonp-end"],this.featureName),y(l,me+fe),y(l,me+"-done"),y(a,"new-jsonp"),y(a,"jsonp-end"),y(a,"cb-start"),h.on("pushState-end",m),h.on("replaceState-end",m),window.addEventListener("hashchange",m,(0,O.m$)(!0,this.removeOnAbort?.signal)),window.addEventListener("load",m,(0,O.m$)(!0,this.removeOnAbort?.signal)),window.addEventListener("popstate",(function(){m(0,i>1)}),(0,O.m$)(!0,this.removeOnAbort?.signal)),this.abortHandler=this.#e,this.importAggregator()}#e(){this.removeOnAbort?.abort(),this.abortHandler=void 0}}],loaderType:"spa"})})(),window.NRBA=o})(); window.jQuery || document.write(' ') CKEDITOR_BASEPATH='https://f1000research.com/js/vendor/ckeditor/' window.reactTheme = 'research'; window.MathJax = { CommonHTML: { linebreaks: { automatic: true } }, 'HTML-CSS': { linebreaks: { automatic: true } }, SVG: { linebreaks: { automatic: true } }, AuthorInit: function() { MathJax.Hub.Register.MessageHook('End Process', function () { let timeout = false; // holder for timeout id const delay = 250; // delay after event is "complete" to run callback const reflowMath = function() { const dispFormulas = document.querySelectorAll('.disp-formula.panel'); if (!dispFormulas) { return; } for (const dispFormula of dispFormulas) { const child = dispFormula.querySelector('.MathJax_Preview').nextSibling.firstChild; const isMultiline = MathJax.Hub.getAllJax(dispFormula)[0].root.isMultiline; if (dispFormula.offsetWidth < child.offsetWidth || isMultiline) { MathJax.Hub.Queue(['Rerender', MathJax.Hub, dispFormula]); } } }; window.addEventListener('resize', function() { clearTimeout(timeout); // clear the timeout timeout = setTimeout(reflowMath, delay); // start timing for event "completion" }); }); }, }; if (window.location.hash == '#_=_'){ window.location = window.location.href.split('#')[0] } !function(f,b,e,v,n,t,s){if(f.fbq)return;n=f.fbq=function() {n.callMethod? n.callMethod.apply(n,arguments):n.queue.push(arguments)} ;if(!f._fbq)f._fbq=n; n.push=n;n.loaded=!0;n.version='2.0';n.queue=[];t=b.createElement(e);t.async=!0; t.src=v;s=b.getElementsByTagName(e)[0];s.parentNode.insertBefore(t,s)}(window, document,'script','https://connect.facebook.net/en_US/fbevents.js'); fbq('init', '1641728616063202'); fbq('track', "PixelInitialized", {}); (function(h,o,t,j,a,r){ h.hj=h.hj||function(){(h.hj.q=h.hj.q||[]).push(arguments)}; h._hjSettings={hjid:2318163,hjsv:6}; a=o.getElementsByTagName('head')[0]; r=o.createElement('script');r.async=1; r.src=t+h._hjSettings.hjid+j+h._hjSettings.hjsv; a.appendChild(r); })(window,document,'https://static.hotjar.com/c/hotjar-','.js?sv='); search file_upload Submit your research search menu close search Browse Gateways & Collections How to Publish Submit your Research My Submissions Article Guidelines Article Guidelines (New Versions) Open Data, Software and Code Guidelines Open Data and Accessible Source Materials Guidelines (HSS) Open Data, Software and Code Guidelines (PSE) Prepublication Checks Production Process Posters and Slides Guidelines Document Guidelines Article Processing Charges Peer Review Finding Article Reviewers About How it Works For Reviewers Our Advisors Policies Glossary FAQs For Developers Newsroom Contact My Research Submissions Content and Tracking Alerts My Details Sign In file_upload Submit your research { "@context": "https://schema.org", "@type": "ScholarlyArticle", "mainEntityOfPage": { "@type": "WebPage", "@id": "https://f1000research.com/articles/13-112" }, "headline": "Secondary range symmetric matrices", "datePublished": "2024-02-19T09:47:49", "dateModified": "2024-09-11T13:22:03", "author": [ { "@type": "Person", "name": "Divya Shenoy" } ], "publisher": { "@type": "Organization", "name": "F1000Research", "logo": { "@type": "ImageObject", "url": "https://f1000research.com/img/AMP/F1000Research_image.png", "height": 480, "width": 60 } }, "image": { "@type": "ImageObject", "url": "https://f1000research.com/img/AMP/F1000Research_image.png", "height": 1200, "width": 150 }, "description": "The concept of secondary range symmetric matrices is introduced here. Some characterizations as well as the equivalent conditions for a range symmetric matrix to be secondary range symmetric matrix is given. The idea of range symmetric matrices, range symmetric matrices over Minkowski space and secondary range symmetric matrices are different, and is depicted with the help of suitable examples. Finally, a necessary and sufficient condition for a secondary range symmetric matrix to have a secondary generalized inverse has been obtained." } { "@context": "http://schema.org", "@type": "BreadcrumbList", "itemListElement": [ { "@type": "ListItem", "position": "1", "item": { "@id": "https://f1000research.com/", "name": "Home" } }, { "@type": "ListItem", "position": "2", "item": { "@id": "https://f1000research.com/browse/articles", "name": "Browse" } }, { "@type": "ListItem", "position": "3", "item": { "@id": "https://f1000research.com/articles/13-112/v2", "name": "Secondary range symmetric matrices" } } ] } Home Browse Secondary range symmetric matrices ALL Metrics - Views Downloads Get PDF Get XML Cite How to cite this article Shenoy D. Secondary range symmetric matrices [version 2; peer review: 3 approved] . F1000Research 2024, 13 :112 ( https://doi.org/10.12688/f1000research.144171.2 ) NOTE: If applicable, it is important to ensure the information in square brackets after the title is included in all citations of this article. Close Copy Citation Details Export Export Citation Sciwheel EndNote Ref. Manager Bibtex ProCite Sente EXPORT Select a format first Track Share ▬ ✚ Research Article Revised Secondary range symmetric matrices [version 2; peer review: 3 approved] Divya Shenoy https://orcid.org/0000-0001-7307-6688 Divya Shenoy https://orcid.org/0000-0001-7307-6688 PUBLISHED 11 Sep 2024 Author details Author details Department of Mathematics, Manipal Institute of Technology, Manipal, Manipal Academy of Higher Education, Udupi, Karnataka, 576104, India Divya Shenoy Roles: Conceptualization, Data Curation, Formal Analysis, Validation, Writing – Original Draft Preparation OPEN PEER REVIEW DETAILS REVIEWER STATUS This article is included in the Manipal Academy of Higher Education gateway. Abstract The concept of secondary range symmetric matrices is introduced here. Some characterizations as well as the equivalent conditions for a range symmetric matrix to be secondary range symmetric matrix is given. The idea of range symmetric matrices, range symmetric matrices over Minkowski space and secondary range symmetric matrices are different, and is depicted with the help of suitable examples. Finally, a necessary and sufficient condition for a secondary range symmetric matrix to have a secondary generalized inverse has been obtained. READ ALL READ LESS Keywords Generalized inverses, Secondary generalized inverses, Secondary transpose, EP matrices Corresponding Author(s) Divya Shenoy ( [email protected] ) Close Corresponding author: Divya Shenoy Competing interests: No competing interests were disclosed. Grant information: The author(s) declared that no grants were involved in supporting this work. Copyright: © 2024 Shenoy D. This is an open access article distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. How to cite: Shenoy D. Secondary range symmetric matrices [version 2; peer review: 3 approved] . F1000Research 2024, 13 :112 ( https://doi.org/10.12688/f1000research.144171.2 ) First published: 19 Feb 2024, 13 :112 ( https://doi.org/10.12688/f1000research.144171.1 ) Latest published: 11 Sep 2024, 13 :112 ( https://doi.org/10.12688/f1000research.144171.2 ) Revised Amendments from Version 1 Version 2 of the article incorporates the valuable suggestions from the reviewers. Changes include language correction, a preliminary section highlighting basic definitions, examples elaborating the definitions, etc. Additionally, a few references have been added, updating the bibliography. Version 2 of the article incorporates the valuable suggestions from the reviewers. Changes include language correction, a preliminary section highlighting basic definitions, examples elaborating the definitions, etc. Additionally, a few references have been added, updating the bibliography. See the author's detailed response to the review by P Sam Johnson See the author's detailed response to the review by Mehsin Jabel Atteya See the author's detailed response to the review by Pankaj Kumar Manjhi READ REVIEWER RESPONSES Introduction The theory of symmetric matrices as well as range symmetric matrices are well known in literature. A matrix is said to be EP (or range symmetric), whenever the range space of the matrix is equal to the range space of its conjugate transpose. In other words, matrix is EP whenever its null space is same as that of the null space of its conjugate transpose. Ballantine 1 has studied about the product of two EP matrices of specific rank to be again an EP matrix. In 2 new characterizations of EP matrices are given. Also, weighted EP matrix is defined and characterized. Meenakshi 3 extended the concept of range symmetric matrices over Minkowski space. In 2014, the same author defined range symmetric matrices in indefinite inner product space. 4 In Ref. 5 , the concept of EP matrices to bounded operator with closed range is defined on a Hilbert space. For more characterizations of EP and hypo EP operators one can refer. 6 , 7 For an n × n matrix A , the secondary transpose is related to transpose of the matrix by the relation A S = VA T V . Here, the matrix V has non zero unitary entries only on the secondary diagonal. For a matrix A with complex entries, the secondary transpose will be renamed as secondary conjugate transpose A θ and is given by A θ = VA ∗ V . The concept of secondary conjugate transpose is gaining importance in recent years. Shenoy 8 has defined Outer Theta inverse by combining the outer inverse and secondary transpose of a matrix A . Drazin-Theta matix A D , θ 9 is a new class of generalized inverse introduced for a square matrix of index m. One can refer 10 for the extension of these inverses over rectangular matrices. R. Vijayakumar 11 introduced the concept of secondary generalized inverse with the help of secondary transpose of a matrix. This concept is similar to Moore Penrose inverse. But unlike Moore penrose inverse, existence of s-g inverse is not assured in general. In Ref. 12 , a necessary and sufficient conditions of existence of s-g invese is given. In the same article, a few characterizations and a determinantal formula for s-g inverse also has been discussed. In 2009, Krishnamoorthy and Vijayakumar 13 has defined the concept of S - normal matrices with the help of secondary transopse for a class of complex square matrices. Jayashree 14 has defined secondary k - range symmetric fuzzy matrices. Its relation with S - range symmetric fuzzy matrices, k - range fuzzy symmetric matrices and EP matrices are defined. In this article, we define secondary range symmetric matrices. Several equivalent conditions for a matrix to be secondary range symmetric, is obtained here. Also, the existence of secondary generalized inverse of a secondary range symmetric matrix is discussed. Below are some useful deifnitions and results related to secondary conjugate transpose. Preliminaries The set of all n × n matrices with complex entries are denoted by C n × n ( R n × n for matrices with real entries. Also, N A represents the null space of the matrix A . The column space and rank of A are denoted by C A , ρ A respectively. Definition 1 (Ref. 15 ) Let A ∈ ℝ n × n . Then the secondary transpose (or secondary conjugate transpose A θ in the case of complex matrices) of A denoted by A S and is defined as A S = b ij , where b ij = a n − j + 1 , n − i + 1 , i , j = 1 , 2 , … n . Definition 2 (Ref. 16 ) Let A ∈ ℂ n × n . Then the conjugate secondary transpose of A denoted by A θ and is defined as A θ = A ¯ s = c ij where c ij = a ¯ n − j + 1 , n − i + 1 . The secondary transpose of a matrix is defined by reflecting the entries through sendary diagonal. Definition 3 (Ref. 16 ) A matrix is said to be secondary normal (S - normal) if AA S = A S A . Definition 4 (Ref. 12 ) A † S is said to be secondary generalized inverse of A if AA † S A = A A † S AA † S = A † S and AA † S and A † S A are S − symmetric . Note that the matrix A is said to be secondary symmetric or S − symmetric if and only if A S = A . Theorem 0.1 (Ref. 12 ) Given an m × n matrix A . The following statements are equivalent. (1) A has S - cancellation property (i.e., A s AX = 0 AX = 0 and YAA s = 0 YA = 0 ). (2) ρ A s A = ρ AA s = ρ A (3) A † S exists. Definition 5 (Ref. 17 ) A matrix A ∈ ℂ n × n is said to be EP (or range symmetric) if N A = N A ∗ . Meenakshi 3 has defined EP in Minkowski space and has given equivalent conditions for a matrix to be range symmetric. Let the components of a complex vector C n from 0 to n -1, be u = u 0 u 1 u 2 … u n − 1 . Let us denote the Minkowski metric tensor by G and it is defined as G = u 0 − u 1 − u 2 … − u n − 1 . Now, the Minkowski metric matrix is G = 1 0 0 − I n − 1 . The Minkowski inner product on C n is defined by u v = where is the Hilbert inner product. A space with Minkowski inner product is defined as Minkowski space. The idea of Minkowski space arised when Xing 18 tried to study the optical devices described by the Mueller matrix which may not have a singluar value decomposition. The problem was solved by Renardy 19 by defining Minkowski space and obtained the singular value decomposition of Mueller matrix over the Minkowski space. Definition 6 (Ref. 3 ) A matrix A ∈ ℂ n × n is said to be range symmetric in Minkowski space if and only if N A = N A + . Here A + represents the Minkowski adjoint given by A + = GA ∗ G where G is the Minkowski metric tensor. Results In this section, we define secondary range symmetric matrices which is analogous to that of range symmetric matrices. Some equivalent conditions for a matrix to be range symmetric is also given here. Definition 7 X is secondary right (left) normalized g inverse of A where A ∈ R (n×n) if AXA = A , XAX = X and AX is S - symmetric. ( XA is S - symmetric). Example 1: Let A = 1 1 2 1 1 2 . Note that the matrix X = − 1 1 0 7 / 5 − 4 / 5 1 / 5 is both secondary right normalized g-inverse and secondary left normalized inverse of A . The conditions AXA = A , XAX = X can be easily verified. Also AX = 2 / 5 1 / 5 1 / 5 − 3 / 5 6 / 5 1 / 5 9 / 5 − 3 / 5 2 / 5 = AX S . Therefore X is secondary right normalized g-inverse of A . Here XA = 1 0 0 1 = XA S . Here X is also a left normalized g-inverse. Definition 8 Consider A ∈ ℝ m × n . The S - transpose of A is defined as A s = b ij where b ij = a m − j + 1 , n − i + 1 , 1 ≤ i ≤ n , 1 ≤ j ≤ m . Example 2: Consider a matrix A = 1 2 3 4 5 6 . The S – transpose of A is given by A S = 6 3 5 2 4 1 . Definition 9 A matrix A ∈ ℝ n × n secondary range symmetric if and only if N A = N A S Example 3: Let A = 1 0 0 1 . Here N A ≠ N A ∗ . But N A = N A S . Therefore the matrix is not range symmetric, but it is secondary range symmetric. Theorem 0.2 Let A ∈ ℝ n × n . Then the following conditions are equivalent. (1) A is secondary range symmetric (2) VA is EP (3) AV is EP (V is a permutation matrix with ‘1’ in the secondary diagonal) (4) N A ∗ = N AV (5) C A = C A S (6) A S = BA = AC where B and C are some nonsingular matrices (7) C A ∗ = C VA (8) C A ∗ ⊕ N A = ℂ n (9) C A ⊕ N A ∗ = ℂ n Proof 1 A is secondary range symmetric ⇔ N A = N A S ⇔ N VA = N A S V ( since V 2 = I ) ⇔ VA is EP ⇔ V VA V S is EP ⇔ AV is EP . Hence 1 ⇔ 2 ⇔ 3 holds true. 1 ⇔ 4 A is secondary range symmetric ⇔ N A = N A S ⇔ N A = N VA ∗ V (by definition of secondary transpose) ⇔ N A = N A ∗ V ⇔ A ∗ V = A ∗ VA 1 A ⇔ A ∗ = A ∗ VA 1 AV ⇔ A ∗ = A ∗ AV 1 AV ⇔ N A ∗ = N AV This proves the equivalence of 1 and 4 . 3 ⇔ 5 AV is range symmetric ⇔ C AV = C AV ∗ ⇔ C A = C VA ∗ ( Since V * = V ) ⇔ C A = C VA ∗ V ⇔ C A = C A S Hence 3 and 5 are equivalent. 2 ⇔ 6 VA is range symmetric ⇔ VA ∗ = VAP for some nonsingular n × n matrix P ⇔ A ∗ V = VAP ⇔ VA ∗ V = AP ⇔ A S = AP ⇔ A = AP S = P S A S (By property of secondary transpose) ⇔ A S = P S − 1 A ⇔ A S = KA where K = P S − 1 . ( Using ( A † S ) † S = A ) Hence 2 ⇔ 6 . 5 ⇔ 7 C A = C A S ⇔ C A = C VA S V ⇔ C A = C VA S ⇔ VA ∗ = AA 1 VA ∗ ( By [ 14 ] ) ⇔ A ∗ = VAA 1 VA ∗ ⇔ A ∗ = VA VA 1 A ∗ ⇔ C A ∗ = C VA Thus equivalence of 5 and 7 are proved. 2 ⇔ 8 . VA is range symmetric ⇔ ℂ n = C VA ⊕ N GA = C VA ∗ ⊕ N A = C A ∗ V ⊕ N A = C A ∗ ⊕ N A Thus equivalence of 2 and 8 are proved. 3 ⇔ 9 AV is range symmetric ⇔ ℂ n = C AV ⊕ N AV = ℂ n = C AV ⊕ N AV ∗ = C A ⊕ N A ∗ Thus the equivalence of 3 and 9 is proved. From the following example, it is clear that EP matrices in Minkowski space defined by Meenakshi 3 and secondary range symmetric matrices are two different concepts. Consider a matrix A = − 1 1 1 − 1 where A S = − 1 1 1 − 1 . Note that, here the secondary transpose A S of the matrix A coincides with A . Clearly A is secondary range symmetric (i.e., N A = N A S . Here, A is secondary normal as well as ρ A = ρ AA S . However, the matrix is not range symmetric in Minkowski’s space since A + = GA ∗ G = − 1 − 1 − 1 − 1 . It is clear that N A ≠ N A + . In this example, the matrix A is secondary range symmetric, but not range symmetric in Minkowski space. In the following example, B is range symmetric in Minkowski space. But it is not secondary range symmetric. Let B = 1 − 1 1 − 1 and B S = − 1 − 1 1 1 . Clearly B is not secondary range symmetric. Observe that B is range symmetric in Minkowski space. Since, B + = GB ∗ G = 1 − 1 1 − 1 so that N B = N B + . These examples shows that secondary range symmetric matrices and range symmetric matrices in Minkowski inverse are two different matrices even though the proof techniques adopted here are similar. Note that A S = VA ∗ V = VGA + GV . A necessary condition for a matrix to be a S - EP (secondary range symmetric) is proved here. Theorem 0.3 Let A ∈ ℝ n × n . If A is secondary normal and ρ A = ρ AA S , then A is secondary range symmetric. Proof 2 Since A is secondary normal, AA S = A S A . Hence ρ A = ρ AA S = ρ A S A = ρ A S which implies N A = N AA S = N A S A = N A S . Thus A is secondary range symmetric. A relation connecting range symmetric and secondary range symmetric matrices is given below: Theorem 0.4 Let A ∈ ℝ n × n . Then any two of the following conditions imply the third one. (1) A is EP. (2) A is secondary EP. (3) C A = C VA . Proof 3 1 , 2 ⇒ 3 Since A is EP, C A = C A ∗ . By condition (7) of Theorem 0.2 , C A ∗ = C VA as A is secondary range symmetric. Hence A is secondary EP ⇔ C A = C VA . (1), (3) ⇒ (2) Since A is EP, C A = C A ∗ . Also, from (3) we have C A = C VA , which gives C A ∗ = C VA . Hence, by Theorem 0.2 , A is secondary range symmetric. 2 , 3 ⇒ 1 Since A is S - EP, by condition (2) of Theorem 0.2 , VA is range symmetric. Hence C VA = C VA ∗ = C A ∗ V = C A ∗ . Also, By (3), C A = C VA from which it follows that C A = C A ∗ . Hence A is range symmetric. Thus (1) holds. For any square complex matrix A , there exists unique S - symmetric matrices such that A = M + iN where M = 1 2 A + A S and N = 1 2 i A − A S . In the following theorem, an equivalent condition for a matrix A to be secondary range symmetric is obtained interms of M , the S -symmetric part of A . Theorem 0.5 For A ∈ ℝ n × n , A is secondary range symmetric if and only if N A ⊆ N M where M is the S - symmetric part of A . Proof 4 If A is secondary range symmetric, then N A = N A S . For x ∈ N A , Ax = 0 and A S x = 0 . Hence Mx = 0 . Thus, N A ⊆ N M , then Ax = 0 ⇒ Mx = 0 and hence Nx = 0 . Therefore N A ⊆ N N . Thus N A ⊆ N M ∩ N N . Since, both M and N are S -symmetric, they are secondary range symmetric. N M = N M S = N VM ∗ V = N M ∗ V and N N = N N S = N VN ∗ V = N N ∗ V Now , N A ⊆ N M ∩ N N = N M ∗ V ∩ N N ∗ V ⊆ N M ∗ + iN ∗ V = N A ∗ V and ρ A = ρ A ∗ = ρ A ∗ V . Therefore , N A = N A ∗ V = N VA ∗ V = N A S . Thus A is secondary range symmetric. We shall discuss the existence of secondary generalized inverse inverse of a secondary range symmetric matrix. First, we shall prove certain lemmas, to simplify the proof of the main result. Lemma 1 For an m × n matrix A , if A † S exists, then C A † S = C A S . Proof 5 If A † S exists, then A † S A = A † S A S = A S AA † S S A † S S and A † S = A † S AA † S = A S A † S S A † S ⇒ C A † S ⊆ C A S . Further , ρ A † S = ρ A = ρ A S . Thus , C A † S = C A S . Lemma 2 For an m × n matrix A , if A † S exists, then C AA † S is the projection on C A † S and A † S A is the projection on C A † S . Proof 6 x ∈ C A if and only if x = Ay = AA † S Ay = AA † S x . By definition 2 , AA † S being S - symmetric, idempotent is the projection on C A . Similarly, x ∈ C A † S if and only if x = A † S AA † S y = A † S Ax and A † S A is S - symmetric and idempotent. Hence A † S A is the projection on C A † S . Theorem 0.6 For an n × n matrix A , the following are equivalent: (1) A is secondary range symmetric and ρ A = ρ A 2 . (2) A † S exists and A † S is secondary range symmetric. (3) There exists a symmetric idempotent matrix E such that AE = EA and C A = C E . Proof 7 1 ⇒ 2 . Since ρ A = ρ A 2 and A is secondary symmetric, by using Theorem 0.2 we have, ρ A S A = ρ BA 2 = ρ A 2 = ρ A and ρ AA S = ρ A 2 C = ρ A 2 = ρ A . Thus ρ A = ρ AA S = ρ A S A . Hence by Thoerem 0.1 , it follows that A † S exists, By Lemma 1 and Theorem 0.2 , C A † S = C A S = C A = C A S S = C A † S S . Hence A † S is range symmetric. Thus (2) holds. 2 ⇒ 3 . Since A † S exists, by Lemma 1 , C A † S = C A S , by equivalence of condition (1) and (5) of Theorem 0.2 , A † S is secondary range symmetric which implies that C A † S = C A † S S . Hence C A S = C A † S S . By Lemma 2 , it follows that A S A S † S = A † S S A S , hence A † S A S = AA † S S . By definition 2 , A † S A = AA † S = E , is S - symmetric, idempotent and AE = EA = A ; hence C A ⊆ C E and ρ E = ρ AA † S = ρ A , which implies C A = C E . Thus 3 holds. 3 ⇒ 1 . Since , E is S - symmetric and idempotent , E S = E = E 2 , by lemma 1.1, E † S exists and E † S = E implies E is the projection on C A . For all reflexive g-inverses A r of A , AA r = EE † S = E . Since E is S - symmetric and idempotent , AA r is S - symmetric. Hence by definition 7 , A n exists and AA n = EE † S = E which implies EA = A . By hypothesis AE = EA = A . Therefore AA n = A n A = E . Thus both AA n and A n A are S - symmetric . By definition 2 , A † S exists and E = AA † S = A † S A . By taking secondary transpose on AE = EA = A , we get EA S = A S E = A S . C A S ⊆ C E = C A and ρ A S = ρ A . Therefore C A = C A S . By theorem 0.2 , A is secondary ramge symmetric. ρ AA S ≥ ρ AA S A † S S = ρ A A † S S , ρ AE = ρ A ≥ ρ AA S . Thus ρ A = ρ AA S = ρ A 2 C = ρ A 2 . Thus (1) holds. Hence the theorem. Corollary 1 Let A be n × n secondary range symmetric matrix. Then exists A † S if and only if ρ A = ρ A 2 . Proof 8 Since A is secondary range symmetric and ρ A = ρ A 2 , the existence of A † S follows from equivalence of (1) and (2) of Thereom 0.6 . Conversly, if A is secondary range symmetric, and A † S exists, then by equivalence of (2) and (3) of Theorem 0.1 ρ A = ρ AA S = ρ A S A and by Theorem 0.2 , A S = AC . Hence ρ A = ρ AAC = ρ A 2 . Conclusion In this article we defined and characterized the concept of secondary range symmetric matrices. The Moore Penrose inverse exists for any matrix. But, in the case of secondary generalized inverse this is not true. Here, we obtained a necessary condition for a secondary range symmetric matrix to have an s-g inverse. In fact this condition holds true for the existence of secondary generalized inverse for any matrix. As an extension of this work, the sum of range symmetric matrices are discussed in Ref. 20 . One can think of defining weighted secondary EP matrices and its characterizations. Also, extending secondary range symmetric matrix to indefinite inner product spaces will open up a new area of research. Data availability No data are associated with this article. References 1. Ballantine CS: Products of EP matrices. Linear Algebra Appl. 1975; 12 (3): 257–267. Publisher Full Text 2. Tian Y, Wang H: Characterizations of EP matrices and Weighted EP matrices. Linear Algebra Appl. 2011; 434 (5): 1295–1318. Publisher Full Text 3. Meenakshi AR: Range Symmetric Matrices in Minkowski Space. Bull. Malaysian Math. Sci. Soc. 2000; 23 : 45–52. 4. Meenakshi AR: Range Symmetric Matrices in Indefinite Inner Product Space. Int. J. Fuzzy Math. Arch. 2014; 5 (2): 49–56. 5. Campbell SL, Meyer CD: EP operators and generalized inverses. Can. Math. Bull. 1975; 18 (3):327–333. Publisher Full Text 6. Johnson P, Vinoth PA: Product and factorization of hypo-EP operators. Spec. Matrices. 2018; 6 (1):376–382. Publisher Full Text 7. Johnson P: Closed EP and hypo-EP operators on Hilbert spaces. J. Anal. 2022; 30 (4):1377–1390. Publisher Full Text 8. Shenoy DP: Outer-Theta and Theta-Outer matrices. IAENG Int. J. Appl. Math. 2022; 52 (4): 1020–1024. 9. Shenoy DP: Drazin-Theta and Theta-Drazin matrices. Numer. Algebra, Control. Optim. 2024; 14 (2): 273–283. Publisher Full Text 10. Shenoy DP: Drazin theta inverse for rectangular matrices. IAENG Int. J. Comput. Sci. 2023; 50 (4): IJCS_50_4_41. 11. Vijayakumar R: s-g inverse of s-normal matrices. Int. J. Math. Trends Technol. 2016; 39 (4): 240–244. Publisher Full Text 12. Savitha V, Shenoy DP, Umashankar K, et al. : Secondary transpose of a matrix and generalized inverses. J. Algebra Its Appl. 2024; 23 (3): 2450052. Publisher Full Text 13. Krishnamoorthy S, Vijayakumar R: Some equivalent conditions on s-normal matrices. Int. J. Contemp. Math. Sci. 2009; 4 (29): 1449–1454. 14. Shree DJ: Secondary k-range symmetric fuzzy matrices. J. Discret. Math. Sci. Cryptogr. 2018; 21 (1): 1–11. Publisher Full Text 15. Lee A: Secondary symmetric, Skew symmetric and orthogonal matrices. Period. Math. Hung. 1976; 7 (1): 63–70. Publisher Full Text 16. Krishnamoorthy S, Vijayakumar R: Some characteristics on s-normal matrices. Int. J. Comput. Appl. Math. 2009; 4 (1): 49–53. 17. Ben-Israel A, Greville TNE: Generalized Inverses and Applications. Wiley; 1974. 18. Xing Z: On the deterministic and nondeterministic Mueller matrix. J. Mod. Opt. 1992; 39 :461–484. Publisher Full Text 19. Renardy M: Singular value decomposition in Minkowski Space. Linear Algebra Appl. 1996; 236 :53–58. Publisher Full Text 20. Purushothama DS: Sum of secondary range symmetric matrices. Glob. Stoch. Anal. 2024; 11 (3). Comments on this article Comments (0) Version 2 VERSION 2 PUBLISHED 19 Feb 2024 ADD YOUR COMMENT Comment Author details Author details Department of Mathematics, Manipal Institute of Technology, Manipal, Manipal Academy of Higher Education, Udupi, Karnataka, 576104, India Divya Shenoy Roles: Conceptualization, Data Curation, Formal Analysis, Validation, Writing – Original Draft Preparation Competing interests No competing interests were disclosed. Grant information The author(s) declared that no grants were involved in supporting this work. Article Versions (2) version 2 Revised Published: 11 Sep 2024, 13:112 https://doi.org/10.12688/f1000research.144171.2 version 1 Published: 19 Feb 2024, 13:112 https://doi.org/10.12688/f1000research.144171.1 Copyright © 2024 Shenoy D. This is an open access article distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Download Export To Sciwheel Bibtex EndNote ProCite Ref. Manager (RIS) Sente metrics Views Downloads F1000Research - - PubMed Central info_outline Data from PMC are received and updated monthly. - - Citations open_in_new 0 open_in_new 0 open_in_new SEE MORE DETAILS CITE how to cite this article Shenoy D. Secondary range symmetric matrices [version 2; peer review: 3 approved] . F1000Research 2024, 13 :112 ( https://doi.org/10.12688/f1000research.144171.2 ) NOTE: If applicable, it is important to ensure the information in square brackets after the title is included in all citations of this article. COPY CITATION DETAILS track receive updates on this article Track an article to receive email alerts on any updates to this article. TRACK THIS ARTICLE Share Open Peer Review Current Reviewer Status: ? Key to Reviewer Statuses VIEW HIDE Approved The paper is scientifically sound in its current form and only minor, if any, improvements are suggested Approved with reservations A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit. Not approved Fundamental flaws in the paper seriously undermine the findings and conclusions Version 2 VERSION 2 PUBLISHED 11 Sep 2024 Revised Views 0 Cite How to cite this report: Manjhi PK. Reviewer Report For: Secondary range symmetric matrices [version 2; peer review: 3 approved] . F1000Research 2024, 13 :112 ( https://doi.org/10.5256/f1000research.168149.r322688 ) The direct URL for this report is: https://f1000research.com/articles/13-112/v2#referee-response-322688 NOTE: it is important to ensure the information in square brackets after the title is included in this citation. Close Copy Citation Details Reviewer Report 11 Oct 2024 Pankaj Kumar Manjhi , Department of Mathematics,, Vinoba Bhave University,, Hazaribag,, Jharkhand,, India Approved VIEWS 0 https://doi.org/10.5256/f1000research.168149.r322688 The author has successfully addressed all the provided suggestions, resulting in a significantly improved manuscript. The revised version is now clearer, more comprehensible, and effectively presents the research. It is suitable for proceeding to the next stage of the publication ... Continue reading READ ALL The author has successfully addressed all the provided suggestions, resulting in a significantly improved manuscript. The revised version is now clearer, more comprehensible, and effectively presents the research. It is suitable for proceeding to the next stage of the publication process. Competing Interests: No competing interests were disclosed. I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard. Close READ LESS CITE CITE HOW TO CITE THIS REPORT Manjhi PK. Reviewer Report For: Secondary range symmetric matrices [version 2; peer review: 3 approved] . F1000Research 2024, 13 :112 ( https://doi.org/10.5256/f1000research.168149.r322688 ) The direct URL for this report is: https://f1000research.com/articles/13-112/v2#referee-response-322688 NOTE: it is important to ensure the information in square brackets after the title is included in all citations of this article. COPY CITATION DETAILS Report a concern Respond or Comment COMMENT ON THIS REPORT Version 1 VERSION 1 PUBLISHED 19 Feb 2024 Views 0 Cite How to cite this report: Atteya MJ. Reviewer Report For: Secondary range symmetric matrices [version 2; peer review: 3 approved] . F1000Research 2024, 13 :112 ( https://doi.org/10.5256/f1000research.157925.r261048 ) The direct URL for this report is: https://f1000research.com/articles/13-112/v1#referee-response-261048 NOTE: it is important to ensure the information in square brackets after the title is included in this citation. Close Copy Citation Details Reviewer Report 08 Jun 2024 Mehsin Jabel Atteya , Department of Mathematics, Al- Mustansiriyah University, Falastin St, Baghdad, Iraq Approved VIEWS 0 https://doi.org/10.5256/f1000research.157925.r261048 Dear Sir., My Report: 1. The Definitions 7, 8 and 9 need to provide examples. 2. In the proof of Theorem 0.4, where the prove of the case (1) and (3) implies to (2). 3. in ... Continue reading READ ALL Dear Sir., My Report: 1. The Definitions 7, 8 and 9 need to provide examples. 2. In the proof of Theorem 0.4, where the prove of the case (1) and (3) implies to (2). 3. in the proof of Corollary 1, the author used Theorem 0.1 while Theorem 0.1 concerning an m×n matrix A. 4. Again in Corollary 0.1, the author depended on Theorems (0.1 and 0.6) without mention the branches. Similarly for the prove of Theorems(0.3 and 0.6) where the author used Theorems (0.2 and 0.1). 5. The branches of Theorem (0.2) wrote by Roman numbers system while in the proof used Arabic numbers system. Is the work clearly and accurately presented and does it cite the current literature? Yes Is the study design appropriate and is the work technically sound? Yes Are sufficient details of methods and analysis provided to allow replication by others? Yes If applicable, is the statistical analysis and its interpretation appropriate? Not applicable Are all the source data underlying the results available to ensure full reproducibility? Yes Are the conclusions drawn adequately supported by the results? Yes Competing Interests: No competing interests were disclosed. Reviewer Expertise: The paper tried to supply new results with avoid any mistake. I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard. Close READ LESS CITE CITE HOW TO CITE THIS REPORT Atteya MJ. Reviewer Report For: Secondary range symmetric matrices [version 2; peer review: 3 approved] . F1000Research 2024, 13 :112 ( https://doi.org/10.5256/f1000research.157925.r261048 ) The direct URL for this report is: https://f1000research.com/articles/13-112/v1#referee-response-261048 NOTE: it is important to ensure the information in square brackets after the title is included in all citations of this article. COPY CITATION DETAILS Report a concern Author Response 11 Sep 2024 Divya Shenoy , Department of Mathematics, Manipal Institute of Technology, Manipal, Manipal Academy of Higher Education, Udupi, 576104, India 11 Sep 2024 Author Response Comments and Responses: Comment 1: The Definitions 7, 8 and 9 need to provide examples. Response: Definitions 7,8 and 9 are illustrated with examples- 1, 2 and 3 respectively. ... Continue reading Comments and Responses: Comment 1: The Definitions 7, 8 and 9 need to provide examples. Response: Definitions 7,8 and 9 are illustrated with examples- 1, 2 and 3 respectively. Comment 2: In the proof of Theorem 0.4, where the prove of the case (1) and (3) implies to (2). Response: The omission error has been corrected in the revised article. A proof for (1) and (3) implies (2) is added in the new version. Comment 3: In the proof of Corollary 1, the author used Theorem 0.1 while Theorem 0.1 concerning an m×n matrix A. Response: Theorem 0.1 holds for a matrix of any order [m×n as well as n×n ]. For generalization, the authors [in reference: V. Savitha, D. P. Shenoy, K. Umashankar and R. B. Bapat, Secondary transpose of a matrix and generalized inverses, Journal of Algebra and its applications, 23(3), 2450052, 2024, doi:10.1142/S021949882450052X.] have considered rectangular matrices. Similar to Moore-Penrose inverse , in this context, the conditions for rectangular matrices holds true for square matrices also. Comment 4: Again in Corollary 0.1, the author depended on Theorems (0.1 and 0.6) without mention the branches. Similarly for the prove of Theorems(0.3 and 0.6) where the author used Theorems (0.2 and 0.1). Response: The appropriate branches are mentioned in the revised version. Comment 5: The branches of Theorem (0.2) wrote by Roman numbers system while in the proof used Arabic numbers system. Response: The typological errors have been corrected. Comments and Responses: Comment 1: The Definitions 7, 8 and 9 need to provide examples. Response: Definitions 7,8 and 9 are illustrated with examples- 1, 2 and 3 respectively. Comment 2: In the proof of Theorem 0.4, where the prove of the case (1) and (3) implies to (2). Response: The omission error has been corrected in the revised article. A proof for (1) and (3) implies (2) is added in the new version. Comment 3: In the proof of Corollary 1, the author used Theorem 0.1 while Theorem 0.1 concerning an m×n matrix A. Response: Theorem 0.1 holds for a matrix of any order [m×n as well as n×n ]. For generalization, the authors [in reference: V. Savitha, D. P. Shenoy, K. Umashankar and R. B. Bapat, Secondary transpose of a matrix and generalized inverses, Journal of Algebra and its applications, 23(3), 2450052, 2024, doi:10.1142/S021949882450052X.] have considered rectangular matrices. Similar to Moore-Penrose inverse , in this context, the conditions for rectangular matrices holds true for square matrices also. Comment 4: Again in Corollary 0.1, the author depended on Theorems (0.1 and 0.6) without mention the branches. Similarly for the prove of Theorems(0.3 and 0.6) where the author used Theorems (0.2 and 0.1). Response: The appropriate branches are mentioned in the revised version. Comment 5: The branches of Theorem (0.2) wrote by Roman numbers system while in the proof used Arabic numbers system. Response: The typological errors have been corrected. Competing Interests: There are no competing interests to declare Close Report a concern Respond or Comment COMMENTS ON THIS REPORT Author Response 11 Sep 2024 Divya Shenoy , Department of Mathematics, Manipal Institute of Technology, Manipal, Manipal Academy of Higher Education, Udupi, 576104, India 11 Sep 2024 Author Response Comments and Responses: Comment 1: The Definitions 7, 8 and 9 need to provide examples. Response: Definitions 7,8 and 9 are illustrated with examples- 1, 2 and 3 respectively. ... Continue reading Comments and Responses: Comment 1: The Definitions 7, 8 and 9 need to provide examples. Response: Definitions 7,8 and 9 are illustrated with examples- 1, 2 and 3 respectively. Comment 2: In the proof of Theorem 0.4, where the prove of the case (1) and (3) implies to (2). Response: The omission error has been corrected in the revised article. A proof for (1) and (3) implies (2) is added in the new version. Comment 3: In the proof of Corollary 1, the author used Theorem 0.1 while Theorem 0.1 concerning an m×n matrix A. Response: Theorem 0.1 holds for a matrix of any order [m×n as well as n×n ]. For generalization, the authors [in reference: V. Savitha, D. P. Shenoy, K. Umashankar and R. B. Bapat, Secondary transpose of a matrix and generalized inverses, Journal of Algebra and its applications, 23(3), 2450052, 2024, doi:10.1142/S021949882450052X.] have considered rectangular matrices. Similar to Moore-Penrose inverse , in this context, the conditions for rectangular matrices holds true for square matrices also. Comment 4: Again in Corollary 0.1, the author depended on Theorems (0.1 and 0.6) without mention the branches. Similarly for the prove of Theorems(0.3 and 0.6) where the author used Theorems (0.2 and 0.1). Response: The appropriate branches are mentioned in the revised version. Comment 5: The branches of Theorem (0.2) wrote by Roman numbers system while in the proof used Arabic numbers system. Response: The typological errors have been corrected. Comments and Responses: Comment 1: The Definitions 7, 8 and 9 need to provide examples. Response: Definitions 7,8 and 9 are illustrated with examples- 1, 2 and 3 respectively. Comment 2: In the proof of Theorem 0.4, where the prove of the case (1) and (3) implies to (2). Response: The omission error has been corrected in the revised article. A proof for (1) and (3) implies (2) is added in the new version. Comment 3: In the proof of Corollary 1, the author used Theorem 0.1 while Theorem 0.1 concerning an m×n matrix A. Response: Theorem 0.1 holds for a matrix of any order [m×n as well as n×n ]. For generalization, the authors [in reference: V. Savitha, D. P. Shenoy, K. Umashankar and R. B. Bapat, Secondary transpose of a matrix and generalized inverses, Journal of Algebra and its applications, 23(3), 2450052, 2024, doi:10.1142/S021949882450052X.] have considered rectangular matrices. Similar to Moore-Penrose inverse , in this context, the conditions for rectangular matrices holds true for square matrices also. Comment 4: Again in Corollary 0.1, the author depended on Theorems (0.1 and 0.6) without mention the branches. Similarly for the prove of Theorems(0.3 and 0.6) where the author used Theorems (0.2 and 0.1). Response: The appropriate branches are mentioned in the revised version. Comment 5: The branches of Theorem (0.2) wrote by Roman numbers system while in the proof used Arabic numbers system. Response: The typological errors have been corrected. Competing Interests: There are no competing interests to declare Close Report a concern COMMENT ON THIS REPORT Views 0 Cite How to cite this report: Manjhi PK. Reviewer Report For: Secondary range symmetric matrices [version 2; peer review: 3 approved] . F1000Research 2024, 13 :112 ( https://doi.org/10.5256/f1000research.157925.r274406 ) The direct URL for this report is: https://f1000research.com/articles/13-112/v1#referee-response-274406 NOTE: it is important to ensure the information in square brackets after the title is included in this citation. Close Copy Citation Details Reviewer Report 08 Jun 2024 Pankaj Kumar Manjhi , Department of Mathematics,, Vinoba Bhave University,, Hazaribag,, Jharkhand,, India Approved with Reservations VIEWS 0 https://doi.org/10.5256/f1000research.157925.r274406 I am very delighted to see the scholarly interest in the study of range symmetric matrices. Here are my suggestions for improving the article: Some definitions (such as definition 1) are not clearly written and ... Continue reading READ ALL I am very delighted to see the scholarly interest in the study of range symmetric matrices. Here are my suggestions for improving the article: Some definitions (such as definition 1) are not clearly written and need to be clarified for better understanding. The article requires a sufficient number of illustrations to explain the theory and definitions, which are currently missing. A new preliminary section should be included, containing all the necessary basic concepts to provide a strong foundation for the reader. Definition 7 does not adequately explain the entries of matrix A and needs to be revised for clarity. Definitions 7 and 8 should be illustrated through examples to enhance comprehension. The proofs, especially the proof of Theorem 1, are not written in an easily understandable manner and should be simplified for better readability. A conclusion and discussion section must be included and well explained to summarize the findings and implications of the study. The definition of Minkowski’s space should be included, accompanied by examples to illustrate its application. The examples given at the beginning of page 5 are not properly explained and need to be elaborated for clarity. By addressing these points, the article can be significantly improved and provide a clearer, more comprehensive understanding of range symmetric matrices. Is the work clearly and accurately presented and does it cite the current literature? Yes Is the study design appropriate and is the work technically sound? Partly Are sufficient details of methods and analysis provided to allow replication by others? Partly If applicable, is the statistical analysis and its interpretation appropriate? Yes Are all the source data underlying the results available to ensure full reproducibility? Partly Are the conclusions drawn adequately supported by the results? Partly Competing Interests: No competing interests were disclosed. Reviewer Expertise: Combinatorial matrices, Discrete Mathematics, computer science I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard, however I have significant reservations, as outlined above. Close READ LESS CITE CITE HOW TO CITE THIS REPORT Manjhi PK. Reviewer Report For: Secondary range symmetric matrices [version 2; peer review: 3 approved] . F1000Research 2024, 13 :112 ( https://doi.org/10.5256/f1000research.157925.r274406 ) The direct URL for this report is: https://f1000research.com/articles/13-112/v1#referee-response-274406 NOTE: it is important to ensure the information in square brackets after the title is included in all citations of this article. COPY CITATION DETAILS Report a concern Author Response 11 Sep 2024 Divya Shenoy , Department of Mathematics, Manipal Institute of Technology, Manipal, Manipal Academy of Higher Education, Udupi, 576104, India 11 Sep 2024 Author Response Comments and Responses: Comment 1: Some definitions (such as definition 1) are not clearly written and need to be clarified for better understanding. Response: Definition 1 (of the secondary ... Continue reading Comments and Responses: Comment 1: Some definitions (such as definition 1) are not clearly written and need to be clarified for better understanding. Response: Definition 1 (of the secondary transpose of a rectangular matrix) has been quoted from: A. Lee, Secondary symmetric, Skew symmetric and orthogonal matrices, Period. Math. Hungar 7(1), pp. 63-70, 1976. In the revised article, it is elaborated and an example [example-2, results ] has been added for better understanding of the concept. Comment 2: The article requires a sufficient number of illustrations to explain the theory and definitions, which are currently missing. Response: As per the suggestion, the article is modified providing sufficient examples. On page 3, the definitions are explained with examples [example 1, 2 and 3]. Also, a clearer explanation is given for the example given after the proof of theorem 0.1. Comment 3: A new preliminary section should be included, containing all the necessary basic concepts to provide a strong foundation for the reader. Response: A preliminary section [ section 2 ] is included with all necessary basic concepts. Comment 4: Definition 7 does not adequately explain the entries of matrix A and needs to be revised for clarity. Response: The definition (7) has been revised. The entries of the matrix are from a real field. The explanation has been provided in the text. Comment 5: Definitions 7 and 8 should be illustrated through examples to enhance comprehension. Response: As per the suggestion, definitions 7 and 8 are explained with examples. Comment 6: The proofs, especially the proof of Theorem 1, are not written in an easily understandable manner and should be simplified for better readability. Response: Explanation for the steps for the proof of Theorem -1, has been provided within parenthesis. Comment 7: A conclusion and discussion section must be included and well explained to summarize the findings and implications of the study. Response: The conclusion section has been modified to include discussion, and scope for future work. Comment 8: The definition of Minkowski’s space should be included, accompanied by examples to illustrate its application Response: As per the suggestion, the definition of Minkowski space, with application and reference is included in the preliminary section . Comment 9: The examples given at the beginning of page 5 are not properly explained and need to be elaborated for clarity. Response: The example is elaborated for better understanding. Comments and Responses: Comment 1: Some definitions (such as definition 1) are not clearly written and need to be clarified for better understanding. Response: Definition 1 (of the secondary transpose of a rectangular matrix) has been quoted from: A. Lee, Secondary symmetric, Skew symmetric and orthogonal matrices, Period. Math. Hungar 7(1), pp. 63-70, 1976. In the revised article, it is elaborated and an example [example-2, results ] has been added for better understanding of the concept. Comment 2: The article requires a sufficient number of illustrations to explain the theory and definitions, which are currently missing. Response: As per the suggestion, the article is modified providing sufficient examples. On page 3, the definitions are explained with examples [example 1, 2 and 3]. Also, a clearer explanation is given for the example given after the proof of theorem 0.1. Comment 3: A new preliminary section should be included, containing all the necessary basic concepts to provide a strong foundation for the reader. Response: A preliminary section [ section 2 ] is included with all necessary basic concepts. Comment 4: Definition 7 does not adequately explain the entries of matrix A and needs to be revised for clarity. Response: The definition (7) has been revised. The entries of the matrix are from a real field. The explanation has been provided in the text. Comment 5: Definitions 7 and 8 should be illustrated through examples to enhance comprehension. Response: As per the suggestion, definitions 7 and 8 are explained with examples. Comment 6: The proofs, especially the proof of Theorem 1, are not written in an easily understandable manner and should be simplified for better readability. Response: Explanation for the steps for the proof of Theorem -1, has been provided within parenthesis. Comment 7: A conclusion and discussion section must be included and well explained to summarize the findings and implications of the study. Response: The conclusion section has been modified to include discussion, and scope for future work. Comment 8: The definition of Minkowski’s space should be included, accompanied by examples to illustrate its application Response: As per the suggestion, the definition of Minkowski space, with application and reference is included in the preliminary section . Comment 9: The examples given at the beginning of page 5 are not properly explained and need to be elaborated for clarity. Response: The example is elaborated for better understanding. Competing Interests: There are no competing interests to declare Close Report a concern Respond or Comment COMMENTS ON THIS REPORT Author Response 11 Sep 2024 Divya Shenoy , Department of Mathematics, Manipal Institute of Technology, Manipal, Manipal Academy of Higher Education, Udupi, 576104, India 11 Sep 2024 Author Response Comments and Responses: Comment 1: Some definitions (such as definition 1) are not clearly written and need to be clarified for better understanding. Response: Definition 1 (of the secondary ... Continue reading Comments and Responses: Comment 1: Some definitions (such as definition 1) are not clearly written and need to be clarified for better understanding. Response: Definition 1 (of the secondary transpose of a rectangular matrix) has been quoted from: A. Lee, Secondary symmetric, Skew symmetric and orthogonal matrices, Period. Math. Hungar 7(1), pp. 63-70, 1976. In the revised article, it is elaborated and an example [example-2, results ] has been added for better understanding of the concept. Comment 2: The article requires a sufficient number of illustrations to explain the theory and definitions, which are currently missing. Response: As per the suggestion, the article is modified providing sufficient examples. On page 3, the definitions are explained with examples [example 1, 2 and 3]. Also, a clearer explanation is given for the example given after the proof of theorem 0.1. Comment 3: A new preliminary section should be included, containing all the necessary basic concepts to provide a strong foundation for the reader. Response: A preliminary section [ section 2 ] is included with all necessary basic concepts. Comment 4: Definition 7 does not adequately explain the entries of matrix A and needs to be revised for clarity. Response: The definition (7) has been revised. The entries of the matrix are from a real field. The explanation has been provided in the text. Comment 5: Definitions 7 and 8 should be illustrated through examples to enhance comprehension. Response: As per the suggestion, definitions 7 and 8 are explained with examples. Comment 6: The proofs, especially the proof of Theorem 1, are not written in an easily understandable manner and should be simplified for better readability. Response: Explanation for the steps for the proof of Theorem -1, has been provided within parenthesis. Comment 7: A conclusion and discussion section must be included and well explained to summarize the findings and implications of the study. Response: The conclusion section has been modified to include discussion, and scope for future work. Comment 8: The definition of Minkowski’s space should be included, accompanied by examples to illustrate its application Response: As per the suggestion, the definition of Minkowski space, with application and reference is included in the preliminary section . Comment 9: The examples given at the beginning of page 5 are not properly explained and need to be elaborated for clarity. Response: The example is elaborated for better understanding. Comments and Responses: Comment 1: Some definitions (such as definition 1) are not clearly written and need to be clarified for better understanding. Response: Definition 1 (of the secondary transpose of a rectangular matrix) has been quoted from: A. Lee, Secondary symmetric, Skew symmetric and orthogonal matrices, Period. Math. Hungar 7(1), pp. 63-70, 1976. In the revised article, it is elaborated and an example [example-2, results ] has been added for better understanding of the concept. Comment 2: The article requires a sufficient number of illustrations to explain the theory and definitions, which are currently missing. Response: As per the suggestion, the article is modified providing sufficient examples. On page 3, the definitions are explained with examples [example 1, 2 and 3]. Also, a clearer explanation is given for the example given after the proof of theorem 0.1. Comment 3: A new preliminary section should be included, containing all the necessary basic concepts to provide a strong foundation for the reader. Response: A preliminary section [ section 2 ] is included with all necessary basic concepts. Comment 4: Definition 7 does not adequately explain the entries of matrix A and needs to be revised for clarity. Response: The definition (7) has been revised. The entries of the matrix are from a real field. The explanation has been provided in the text. Comment 5: Definitions 7 and 8 should be illustrated through examples to enhance comprehension. Response: As per the suggestion, definitions 7 and 8 are explained with examples. Comment 6: The proofs, especially the proof of Theorem 1, are not written in an easily understandable manner and should be simplified for better readability. Response: Explanation for the steps for the proof of Theorem -1, has been provided within parenthesis. Comment 7: A conclusion and discussion section must be included and well explained to summarize the findings and implications of the study. Response: The conclusion section has been modified to include discussion, and scope for future work. Comment 8: The definition of Minkowski’s space should be included, accompanied by examples to illustrate its application Response: As per the suggestion, the definition of Minkowski space, with application and reference is included in the preliminary section . Comment 9: The examples given at the beginning of page 5 are not properly explained and need to be elaborated for clarity. Response: The example is elaborated for better understanding. Competing Interests: There are no competing interests to declare Close Report a concern COMMENT ON THIS REPORT Views 0 Cite How to cite this report: Johnson PS. Reviewer Report For: Secondary range symmetric matrices [version 2; peer review: 3 approved] . F1000Research 2024, 13 :112 ( https://doi.org/10.5256/f1000research.157925.r252908 ) The direct URL for this report is: https://f1000research.com/articles/13-112/v1#referee-response-252908 NOTE: it is important to ensure the information in square brackets after the title is included in this citation. Close Copy Citation Details Reviewer Report 28 Mar 2024 P Sam Johnson , National Institute of Technology Karnataka, Surathkal, Surathkal, Karnataka,, India Approved VIEWS 0 https://doi.org/10.5256/f1000research.157925.r252908 The paper is well written. It discusses secondary range symmetric matrices. It should incorporate the following suggestions / corrections : Minor points : (i) First line of abstract should be "is" introduced. (ii) No uniformity of symbol ... Continue reading READ ALL The paper is well written. It discusses secondary range symmetric matrices. It should incorporate the following suggestions / corrections : Minor points : (i) First line of abstract should be "is" introduced. (ii) No uniformity of symbol "s" in many places : s-symmetric, s-transpose ; capital letter or a small letter (iii) Corollary 1 in page 6 should be rephrased as : Let A be an nxn secondary range symmetric matrix. Major point: (iv) The following recent references may be added. Is the work clearly and accurately presented and does it cite the current literature? No Is the study design appropriate and is the work technically sound? Yes Are sufficient details of methods and analysis provided to allow replication by others? Yes If applicable, is the statistical analysis and its interpretation appropriate? Not applicable Are all the source data underlying the results available to ensure full reproducibility? Yes Are the conclusions drawn adequately supported by the results? Yes References 1. Johnson P, Vinoth A: Product and factorization of hypo-EP operators. Special Matrices . 2018; 6 (1): 376-382 Publisher Full Text 2. Johnson P: Closed EP and hypo-EP operators on Hilbert spaces. The Journal of Analysis . 2022; 30 (4): 1377-1390 Publisher Full Text Competing Interests: No competing interests were disclosed. Reviewer Expertise: Functional Analysis I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard. Close READ LESS CITE CITE HOW TO CITE THIS REPORT Johnson PS. Reviewer Report For: Secondary range symmetric matrices [version 2; peer review: 3 approved] . F1000Research 2024, 13 :112 ( https://doi.org/10.5256/f1000research.157925.r252908 ) The direct URL for this report is: https://f1000research.com/articles/13-112/v1#referee-response-252908 NOTE: it is important to ensure the information in square brackets after the title is included in all citations of this article. COPY CITATION DETAILS Report a concern Author Response 04 Apr 2024 Divya Shenoy , Department of Mathematics, Manipal Institute of Technology, Manipal, Manipal Academy of Higher Education, Udupi, 576104, India 04 Apr 2024 Author Response I thank reviewer 1 for the critical comments. The suggested corrections (typo errors) and the inclusion of latest references in the manuscript and their corresponding information in the body ... Continue reading I thank reviewer 1 for the critical comments. The suggested corrections (typo errors) and the inclusion of latest references in the manuscript and their corresponding information in the body of the manuscript will be incorporated in version 1, which will be uploaded after receiving comments from the second reviewer. I thank reviewer 1 for the critical comments. The suggested corrections (typo errors) and the inclusion of latest references in the manuscript and their corresponding information in the body of the manuscript will be incorporated in version 1, which will be uploaded after receiving comments from the second reviewer. Competing Interests: No competing interests. Close Report a concern Author Response 11 Sep 2024 Divya Shenoy , Department of Mathematics, Manipal Institute of Technology, Manipal, Manipal Academy of Higher Education, Udupi, 576104, India 11 Sep 2024 Author Response Comments and Responses A. Response to Minor points : Comment (i): First line of abstract should be "is" introduced. Response : The correction has been incorporated. Comment (ii): No ... Continue reading Comments and Responses A. Response to Minor points : Comment (i): First line of abstract should be "is" introduced. Response : The correction has been incorporated. Comment (ii): No uniformity of symbol "s" in many places: s-symmetric, s-transpose; capital letter or a small letter. Response: Uniformity has been maintained in the new version. Capital letter is used for all instances, S – symmetric, S – transpose etc. Comment (iii): Corollary 1 in page 6 should be rephrased as: Let A be an nxn secondary range symmetric matrix. Response: The suggested correction has been incorporated. Major point: Comment (iv): Regarding the addition of recent references on a) product and factorization of hypo-EP operators and b) Closed EP and hypo-EP operators on Hilbert spaces. Response: The latest references have been added. The relevant text is added in the article, with appropriate citation. Comments and Responses A. Response to Minor points : Comment (i): First line of abstract should be "is" introduced. Response : The correction has been incorporated. Comment (ii): No uniformity of symbol "s" in many places: s-symmetric, s-transpose; capital letter or a small letter. Response: Uniformity has been maintained in the new version. Capital letter is used for all instances, S – symmetric, S – transpose etc. Comment (iii): Corollary 1 in page 6 should be rephrased as: Let A be an nxn secondary range symmetric matrix. Response: The suggested correction has been incorporated. Major point: Comment (iv): Regarding the addition of recent references on a) product and factorization of hypo-EP operators and b) Closed EP and hypo-EP operators on Hilbert spaces. Response: The latest references have been added. The relevant text is added in the article, with appropriate citation. Competing Interests: There are no competing interest to declare. Close Report a concern Respond or Comment COMMENTS ON THIS REPORT Author Response 04 Apr 2024 Divya Shenoy , Department of Mathematics, Manipal Institute of Technology, Manipal, Manipal Academy of Higher Education, Udupi, 576104, India 04 Apr 2024 Author Response I thank reviewer 1 for the critical comments. The suggested corrections (typo errors) and the inclusion of latest references in the manuscript and their corresponding information in the body ... Continue reading I thank reviewer 1 for the critical comments. The suggested corrections (typo errors) and the inclusion of latest references in the manuscript and their corresponding information in the body of the manuscript will be incorporated in version 1, which will be uploaded after receiving comments from the second reviewer. I thank reviewer 1 for the critical comments. The suggested corrections (typo errors) and the inclusion of latest references in the manuscript and their corresponding information in the body of the manuscript will be incorporated in version 1, which will be uploaded after receiving comments from the second reviewer. Competing Interests: No competing interests. Close Report a concern Author Response 11 Sep 2024 Divya Shenoy , Department of Mathematics, Manipal Institute of Technology, Manipal, Manipal Academy of Higher Education, Udupi, 576104, India 11 Sep 2024 Author Response Comments and Responses A. Response to Minor points : Comment (i): First line of abstract should be "is" introduced. Response : The correction has been incorporated. Comment (ii): No ... Continue reading Comments and Responses A. Response to Minor points : Comment (i): First line of abstract should be "is" introduced. Response : The correction has been incorporated. Comment (ii): No uniformity of symbol "s" in many places: s-symmetric, s-transpose; capital letter or a small letter. Response: Uniformity has been maintained in the new version. Capital letter is used for all instances, S – symmetric, S – transpose etc. Comment (iii): Corollary 1 in page 6 should be rephrased as: Let A be an nxn secondary range symmetric matrix. Response: The suggested correction has been incorporated. Major point: Comment (iv): Regarding the addition of recent references on a) product and factorization of hypo-EP operators and b) Closed EP and hypo-EP operators on Hilbert spaces. Response: The latest references have been added. The relevant text is added in the article, with appropriate citation. Comments and Responses A. Response to Minor points : Comment (i): First line of abstract should be "is" introduced. Response : The correction has been incorporated. Comment (ii): No uniformity of symbol "s" in many places: s-symmetric, s-transpose; capital letter or a small letter. Response: Uniformity has been maintained in the new version. Capital letter is used for all instances, S – symmetric, S – transpose etc. Comment (iii): Corollary 1 in page 6 should be rephrased as: Let A be an nxn secondary range symmetric matrix. Response: The suggested correction has been incorporated. Major point: Comment (iv): Regarding the addition of recent references on a) product and factorization of hypo-EP operators and b) Closed EP and hypo-EP operators on Hilbert spaces. Response: The latest references have been added. The relevant text is added in the article, with appropriate citation. Competing Interests: There are no competing interest to declare. Close Report a concern COMMENT ON THIS REPORT Comments on this article Comments (0) Version 2 VERSION 2 PUBLISHED 19 Feb 2024 ADD YOUR COMMENT Comment keyboard_arrow_left keyboard_arrow_right Open Peer Review Reviewer Status info_outline Alongside their report, reviewers assign a status to the article: Approved The paper is scientifically sound in its current form and only minor, if any, improvements are suggested Approved with reservations A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit. Not approved Fundamental flaws in the paper seriously undermine the findings and conclusions Reviewer Reports Invited Reviewers 1 2 3 Version 2 (revision) 11 Sep 24 read Version 1 19 Feb 24 read read read P Sam Johnson , National Institute of Technology Karnataka, Surathkal, Surathkal, India Pankaj Kumar Manjhi , Vinoba Bhave University,, Hazaribag,, India Mehsin Jabel Atteya , Al- Mustansiriyah University, Falastin St, Iraq Comments on this article All Comments (0) Add a comment Sign up for content alerts Sign Up You are now signed up to receive this alert Browse by related subjects keyboard_arrow_left Back to all reports Reviewer Report 0 Views copyright © 2024 Manjhi P. This is an open access peer review report distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 11 Oct 2024 | for Version 2 Pankaj Kumar Manjhi , Department of Mathematics,, Vinoba Bhave University,, Hazaribag,, Jharkhand,, India 0 Views copyright © 2024 Manjhi P. This is an open access peer review report distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. format_quote Cite this report speaker_notes Responses (0) Approved info_outline Alongside their report, reviewers assign a status to the article: Approved The paper is scientifically sound in its current form and only minor, if any, improvements are suggested Approved with reservations A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit. Not approved Fundamental flaws in the paper seriously undermine the findings and conclusions The author has successfully addressed all the provided suggestions, resulting in a significantly improved manuscript. The revised version is now clearer, more comprehensible, and effectively presents the research. It is suitable for proceeding to the next stage of the publication process. Competing Interests No competing interests were disclosed. I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard. reply Respond to this report Responses (0) Manjhi PK. Peer Review Report For: Secondary range symmetric matrices [version 2; peer review: 3 approved] . F1000Research 2024, 13 :112 ( https://doi.org/10.5256/f1000research.168149.r322688) NOTE: it is important to ensure the information in square brackets after the title is included in this citation. The direct URL for this report is: https://f1000research.com/articles/13-112/v2#referee-response-322688 keyboard_arrow_left Back to all reports Reviewer Report 0 Views copyright © 2024 Atteya M. This is an open access peer review report distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 08 Jun 2024 | for Version 1 Mehsin Jabel Atteya , Department of Mathematics, Al- Mustansiriyah University, Falastin St, Baghdad, Iraq 0 Views copyright © 2024 Atteya M. This is an open access peer review report distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. format_quote Cite this report speaker_notes Responses (1) Approved info_outline Alongside their report, reviewers assign a status to the article: Approved The paper is scientifically sound in its current form and only minor, if any, improvements are suggested Approved with reservations A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit. Not approved Fundamental flaws in the paper seriously undermine the findings and conclusions Dear Sir., My Report: 1. The Definitions 7, 8 and 9 need to provide examples. 2. In the proof of Theorem 0.4, where the prove of the case (1) and (3) implies to (2). 3. in the proof of Corollary 1, the author used Theorem 0.1 while Theorem 0.1 concerning an m×n matrix A. 4. Again in Corollary 0.1, the author depended on Theorems (0.1 and 0.6) without mention the branches. Similarly for the prove of Theorems(0.3 and 0.6) where the author used Theorems (0.2 and 0.1). 5. The branches of Theorem (0.2) wrote by Roman numbers system while in the proof used Arabic numbers system. Is the work clearly and accurately presented and does it cite the current literature? Yes Is the study design appropriate and is the work technically sound? Yes Are sufficient details of methods and analysis provided to allow replication by others? Yes If applicable, is the statistical analysis and its interpretation appropriate? Not applicable Are all the source data underlying the results available to ensure full reproducibility? Yes Are the conclusions drawn adequately supported by the results? Yes Competing Interests No competing interests were disclosed. Reviewer Expertise The paper tried to supply new results with avoid any mistake. I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard. reply Respond to this report Responses (1) Author Response 11 Sep 2024 Divya Shenoy, Department of Mathematics, Manipal Institute of Technology, Manipal, Manipal Academy of Higher Education, Udupi, 576104, India Comments and Responses: Comment 1: The Definitions 7, 8 and 9 need to provide examples. Response: Definitions 7,8 and 9 are illustrated with examples- 1, 2 and 3 respectively. Comment 2: In the proof of Theorem 0.4, where the prove of the case (1) and (3) implies to (2). Response: The omission error has been corrected in the revised article. A proof for (1) and (3) implies (2) is added in the new version. Comment 3: In the proof of Corollary 1, the author used Theorem 0.1 while Theorem 0.1 concerning an m×n matrix A. Response: Theorem 0.1 holds for a matrix of any order [m×n as well as n×n ]. For generalization, the authors [in reference: V. Savitha, D. P. Shenoy, K. Umashankar and R. B. Bapat, Secondary transpose of a matrix and generalized inverses, Journal of Algebra and its applications, 23(3), 2450052, 2024, doi:10.1142/S021949882450052X.] have considered rectangular matrices. Similar to Moore-Penrose inverse , in this context, the conditions for rectangular matrices holds true for square matrices also. Comment 4: Again in Corollary 0.1, the author depended on Theorems (0.1 and 0.6) without mention the branches. Similarly for the prove of Theorems(0.3 and 0.6) where the author used Theorems (0.2 and 0.1). Response: The appropriate branches are mentioned in the revised version. Comment 5: The branches of Theorem (0.2) wrote by Roman numbers system while in the proof used Arabic numbers system. Response: The typological errors have been corrected. View more View less Competing Interests There are no competing interests to declare reply Respond Report a concern Atteya MJ. Peer Review Report For: Secondary range symmetric matrices [version 2; peer review: 3 approved] . F1000Research 2024, 13 :112 ( https://doi.org/10.5256/f1000research.157925.r261048) NOTE: it is important to ensure the information in square brackets after the title is included in this citation. The direct URL for this report is: https://f1000research.com/articles/13-112/v1#referee-response-261048 keyboard_arrow_left Back to all reports Reviewer Report 0 Views copyright © 2024 Manjhi P. This is an open access peer review report distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 08 Jun 2024 | for Version 1 Pankaj Kumar Manjhi , Department of Mathematics,, Vinoba Bhave University,, Hazaribag,, Jharkhand,, India 0 Views copyright © 2024 Manjhi P. This is an open access peer review report distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. format_quote Cite this report speaker_notes Responses (1) Approved With Reservations info_outline Alongside their report, reviewers assign a status to the article: Approved The paper is scientifically sound in its current form and only minor, if any, improvements are suggested Approved with reservations A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit. Not approved Fundamental flaws in the paper seriously undermine the findings and conclusions I am very delighted to see the scholarly interest in the study of range symmetric matrices. Here are my suggestions for improving the article: Some definitions (such as definition 1) are not clearly written and need to be clarified for better understanding. The article requires a sufficient number of illustrations to explain the theory and definitions, which are currently missing. A new preliminary section should be included, containing all the necessary basic concepts to provide a strong foundation for the reader. Definition 7 does not adequately explain the entries of matrix A and needs to be revised for clarity. Definitions 7 and 8 should be illustrated through examples to enhance comprehension. The proofs, especially the proof of Theorem 1, are not written in an easily understandable manner and should be simplified for better readability. A conclusion and discussion section must be included and well explained to summarize the findings and implications of the study. The definition of Minkowski’s space should be included, accompanied by examples to illustrate its application. The examples given at the beginning of page 5 are not properly explained and need to be elaborated for clarity. By addressing these points, the article can be significantly improved and provide a clearer, more comprehensive understanding of range symmetric matrices. Is the work clearly and accurately presented and does it cite the current literature? Yes Is the study design appropriate and is the work technically sound? Partly Are sufficient details of methods and analysis provided to allow replication by others? Partly If applicable, is the statistical analysis and its interpretation appropriate? Yes Are all the source data underlying the results available to ensure full reproducibility? Partly Are the conclusions drawn adequately supported by the results? Partly Competing Interests No competing interests were disclosed. Reviewer Expertise Combinatorial matrices, Discrete Mathematics, computer science I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard, however I have significant reservations, as outlined above. reply Respond to this report Responses (1) Author Response 11 Sep 2024 Divya Shenoy, Department of Mathematics, Manipal Institute of Technology, Manipal, Manipal Academy of Higher Education, Udupi, 576104, India Comments and Responses: Comment 1: Some definitions (such as definition 1) are not clearly written and need to be clarified for better understanding. Response: Definition 1 (of the secondary transpose of a rectangular matrix) has been quoted from: A. Lee, Secondary symmetric, Skew symmetric and orthogonal matrices, Period. Math. Hungar 7(1), pp. 63-70, 1976. In the revised article, it is elaborated and an example [example-2, results ] has been added for better understanding of the concept. Comment 2: The article requires a sufficient number of illustrations to explain the theory and definitions, which are currently missing. Response: As per the suggestion, the article is modified providing sufficient examples. On page 3, the definitions are explained with examples [example 1, 2 and 3]. Also, a clearer explanation is given for the example given after the proof of theorem 0.1. Comment 3: A new preliminary section should be included, containing all the necessary basic concepts to provide a strong foundation for the reader. Response: A preliminary section [ section 2 ] is included with all necessary basic concepts. Comment 4: Definition 7 does not adequately explain the entries of matrix A and needs to be revised for clarity. Response: The definition (7) has been revised. The entries of the matrix are from a real field. The explanation has been provided in the text. Comment 5: Definitions 7 and 8 should be illustrated through examples to enhance comprehension. Response: As per the suggestion, definitions 7 and 8 are explained with examples. Comment 6: The proofs, especially the proof of Theorem 1, are not written in an easily understandable manner and should be simplified for better readability. Response: Explanation for the steps for the proof of Theorem -1, has been provided within parenthesis. Comment 7: A conclusion and discussion section must be included and well explained to summarize the findings and implications of the study. Response: The conclusion section has been modified to include discussion, and scope for future work. Comment 8: The definition of Minkowski’s space should be included, accompanied by examples to illustrate its application Response: As per the suggestion, the definition of Minkowski space, with application and reference is included in the preliminary section . Comment 9: The examples given at the beginning of page 5 are not properly explained and need to be elaborated for clarity. Response: The example is elaborated for better understanding. View more View less Competing Interests There are no competing interests to declare reply Respond Report a concern Manjhi PK. Peer Review Report For: Secondary range symmetric matrices [version 2; peer review: 3 approved] . F1000Research 2024, 13 :112 ( https://doi.org/10.5256/f1000research.157925.r274406) NOTE: it is important to ensure the information in square brackets after the title is included in this citation. The direct URL for this report is: https://f1000research.com/articles/13-112/v1#referee-response-274406 keyboard_arrow_left Back to all reports Reviewer Report 0 Views copyright © 2024 Johnson P. This is an open access peer review report distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 28 Mar 2024 | for Version 1 P Sam Johnson , National Institute of Technology Karnataka, Surathkal, Surathkal, Karnataka,, India 0 Views copyright © 2024 Johnson P. This is an open access peer review report distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. format_quote Cite this report speaker_notes Responses (2) Approved info_outline Alongside their report, reviewers assign a status to the article: Approved The paper is scientifically sound in its current form and only minor, if any, improvements are suggested Approved with reservations A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit. Not approved Fundamental flaws in the paper seriously undermine the findings and conclusions The paper is well written. It discusses secondary range symmetric matrices. It should incorporate the following suggestions / corrections : Minor points : (i) First line of abstract should be "is" introduced. (ii) No uniformity of symbol "s" in many places : s-symmetric, s-transpose ; capital letter or a small letter (iii) Corollary 1 in page 6 should be rephrased as : Let A be an nxn secondary range symmetric matrix. Major point: (iv) The following recent references may be added. Is the work clearly and accurately presented and does it cite the current literature? No Is the study design appropriate and is the work technically sound? Yes Are sufficient details of methods and analysis provided to allow replication by others? Yes If applicable, is the statistical analysis and its interpretation appropriate? Not applicable Are all the source data underlying the results available to ensure full reproducibility? Yes Are the conclusions drawn adequately supported by the results? Yes References 1. Johnson P, Vinoth A: Product and factorization of hypo-EP operators. Special Matrices . 2018; 6 (1): 376-382 Publisher Full Text 2. Johnson P: Closed EP and hypo-EP operators on Hilbert spaces. The Journal of Analysis . 2022; 30 (4): 1377-1390 Publisher Full Text Competing Interests No competing interests were disclosed. Reviewer Expertise Functional Analysis I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard. reply Respond to this report Responses (2) Author Response 04 Apr 2024 Divya Shenoy, Department of Mathematics, Manipal Institute of Technology, Manipal, Manipal Academy of Higher Education, Udupi, 576104, India I thank reviewer 1 for the critical comments. The suggested corrections (typo errors) and the inclusion of latest references in the manuscript and their corresponding information in the body of the manuscript will be incorporated in version 1, which will be uploaded after receiving comments from the second reviewer. View more View less Competing Interests No competing interests. reply Respond Report a concern Author Response 11 Sep 2024 Divya Shenoy, Department of Mathematics, Manipal Institute of Technology, Manipal, Manipal Academy of Higher Education, Udupi, 576104, India Comments and Responses A. Response to Minor points : Comment (i): First line of abstract should be "is" introduced. Response : The correction has been incorporated. Comment (ii): No uniformity of symbol "s" in many places: s-symmetric, s-transpose; capital letter or a small letter. Response: Uniformity has been maintained in the new version. Capital letter is used for all instances, S – symmetric, S – transpose etc. Comment (iii): Corollary 1 in page 6 should be rephrased as: Let A be an nxn secondary range symmetric matrix. Response: The suggested correction has been incorporated. Major point: Comment (iv): Regarding the addition of recent references on a) product and factorization of hypo-EP operators and b) Closed EP and hypo-EP operators on Hilbert spaces. Response: The latest references have been added. The relevant text is added in the article, with appropriate citation. View more View less Competing Interests There are no competing interest to declare. reply Respond Report a concern Johnson PS. Peer Review Report For: Secondary range symmetric matrices [version 2; peer review: 3 approved] . F1000Research 2024, 13 :112 ( https://doi.org/10.5256/f1000research.157925.r252908) NOTE: it is important to ensure the information in square brackets after the title is included in this citation. The direct URL for this report is: https://f1000research.com/articles/13-112/v1#referee-response-252908 Alongside their report, reviewers assign a status to the article: Approved - the paper is scientifically sound in its current form and only minor, if any, improvements are suggested Approved with reservations - A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit. Not approved - fundamental flaws in the paper seriously undermine the findings and conclusions Adjust parameters to alter display View on desktop for interactive features Includes Interactive Elements View on desktop for interactive features Competing Interests Policy Provide sufficient details of any financial or non-financial competing interests to enable users to assess whether your comments might lead a reasonable person to question your impartiality. Consider the following examples, but note that this is not an exhaustive list: Examples of 'Non-Financial Competing Interests' Within the past 4 years, you have held joint grants, published or collaborated with any of the authors of the selected paper. You have a close personal relationship (e.g. parent, spouse, sibling, or domestic partner) with any of the authors. You are a close professional associate of any of the authors (e.g. scientific mentor, recent student). You work at the same institute as any of the authors. You hope/expect to benefit (e.g. favour or employment) as a result of your submission. You are an Editor for the journal in which the article is published. Examples of 'Financial Competing Interests' You expect to receive, or in the past 4 years have received, any of the following from any commercial organisation that may gain financially from your submission: a salary, fees, funding, reimbursements. You expect to receive, or in the past 4 years have received, shared grant support or other funding with any of the authors. You hold, or are currently applying for, any patents or significant stocks/shares relating to the subject matter of the paper you are commenting on. Stay Updated Sign up for content alerts and receive a weekly or monthly email with all newly published articles Register with F1000Research Already registered? Sign in Not now, thanks close PLEASE NOTE If you are an AUTHOR of this article, please check that you signed in with the account associated with this article otherwise we cannot automatically identify your role as an author and your comment will be labelled as a “User Comment”. If you are a REVIEWER of this article, please check that you have signed in with the account associated with this article and then go to your account to submit your report, please do not post your review here. If you do not have access to your original account, please contact us . All commenters must hold a formal affiliation as per our Policies . The information that you give us will be displayed next to your comment. User comments must be in English, comprehensible and relevant to the article under discussion. We reserve the right to remove any comments that we consider to be inappropriate, offensive or otherwise in breach of the User Comment Terms and Conditions . Commenters must not use a comment for personal attacks. When criticisms of the article are based on unpublished data, the data should be made available. I accept the User Comment Terms and Conditions Please confirm that you accept the User Comment Terms and Conditions. Affiliation ✕ refresh Please enter your institution. Note: To add your institution or organisation, start typing the name and then select the correct name from the list. Where applicable, the name will appear in both the original language and in English. Do not paste in the name. If the name does not appear in the drop-down list, we will display the information you have entered. ✕ refresh Country/Region * USA UK Canada China France Germany Afghanistan Aland Islands Albania Algeria American Samoa Andorra Angola Anguilla Antarctica Antigua and Barbuda Argentina Armenia Aruba Australia Austria Azerbaijan Bahamas Bahrain Bangladesh Barbados Belarus Belgium Belize Benin Bermuda Bhutan Bolivia Bosnia and Herzegovina Botswana Bouvet Island Brazil British Indian Ocean Territory British Virgin Islands Brunei Bulgaria Burkina Faso Burundi Cambodia Cameroon Canada Cape Verde Cayman Islands Central African Republic Chad Chile China Christmas Island Cocos (Keeling) Islands Colombia Comoros Congo Cook Islands Costa Rica Cote d'Ivoire Croatia Cuba Cyprus Czech Republic Democratic Republic of the Congo Denmark Djibouti Dominica Dominican Republic Ecuador Egypt El Salvador Equatorial Guinea Eritrea Estonia Ethiopia Falkland Islands Faroe Islands Federated States of Micronesia Fiji Finland France French Guiana French Polynesia French Southern Territories Gabon Georgia Germany Ghana Gibraltar Greece Greenland Grenada Guadeloupe Guam Guatemala Guernsey Guinea Guinea-Bissau Guyana Haiti Heard Island and Mcdonald Islands Holy See (Vatican City State) Honduras Hong Kong Hungary Iceland India Indonesia Iran Iraq Ireland Israel Italy Jamaica Japan Jersey Jordan Kazakhstan Kenya Kiribati Kosovo (Serbia and Montenegro) Kuwait Kyrgyzstan Lao People's Democratic Republic Latvia Lebanon Lesotho Liberia Libya Liechtenstein Lithuania Luxembourg Macao Madagascar Malawi Malaysia Maldives Mali Malta Marshall Islands Martinique Mauritania Mauritius Mayotte Mexico Minor Outlying Islands of the United States Moldova Monaco Mongolia Montenegro Montserrat Morocco Mozambique Myanmar Namibia Nauru Nepal Netherlands Antilles New Caledonia New Zealand Nicaragua Niger Nigeria Niue Norfolk Island North Korea North Macedonia Northern Mariana Islands Norway Oman Pakistan Palau Palestinian Territory Panama Papua New Guinea Paraguay Peru Philippines Pitcairn Poland Portugal Puerto Rico Qatar Reunion Romania Russian Federation Rwanda Saint Helena Saint Kitts and Nevis Saint Lucia Saint Pierre and Miquelon Saint Vincent and the Grenadines Samoa San Marino Sao Tome and Principe Saudi Arabia Senegal Serbia Seychelles Sierra Leone Singapore Slovakia Slovenia Solomon Islands Somalia South Africa South Georgia and the South Sandwich Is South Korea South Sudan Spain Sri Lanka Sudan Suriname Svalbard and Jan Mayen Swaziland Sweden Switzerland Syria Taiwan Tajikistan Tanzania Thailand The Gambia The Netherlands Timor-Leste Togo Tokelau Tonga Trinidad and Tobago Tunisia Turkey Turkmenistan Turks and Caicos Islands Tuvalu UK USA Uganda Ukraine United Arab Emirates United States Virgin Islands Uruguay Uzbekistan Vanuatu Venezuela Vietnam Wallis and Futuna West Bank and Gaza Strip Western Sahara Yemen Zambia Zimbabwe Please select your country/region. You must enter a comment. Competing Interests Please disclose any competing interests that might be construed to influence your judgment of the article's or peer review report's validity or importance. Competing Interests Policy Provide sufficient details of any financial or non-financial competing interests to enable users to assess whether your comments might lead a reasonable person to question your impartiality. Consider the following examples, but note that this is not an exhaustive list: Examples of 'Non-Financial Competing Interests' Within the past 4 years, you have held joint grants, published or collaborated with any of the authors of the selected paper. You have a close personal relationship (e.g. parent, spouse, sibling, or domestic partner) with any of the authors. You are a close professional associate of any of the authors (e.g. scientific mentor, recent student). You work at the same institute as any of the authors. You hope/expect to benefit (e.g. favour or employment) as a result of your submission. You are an Editor for the journal in which the article is published. Examples of 'Financial Competing Interests' You expect to receive, or in the past 4 years have received, any of the following from any commercial organisation that may gain financially from your submission: a salary, fees, funding, reimbursements. You expect to receive, or in the past 4 years have received, shared grant support or other funding with any of the authors. You hold, or are currently applying for, any patents or significant stocks/shares relating to the subject matter of the paper you are commenting on. Please state your competing interests The comment has been saved. An error has occurred. Please try again. Cancel Post var lTitle = "Secondary range symmetric matrices".replace("'", ''); var linkedInUrl = "http://www.linkedin.com/shareArticle?url=https://f1000research.com/articles/13-112/v2" + "&title=" + encodeURIComponent(lTitle) + "&summary=" + encodeURIComponent('Read the article by '); var deliciousUrl = "https://del.icio.us/post?url=https://f1000research.com/articles/13-112/v2&title=" + encodeURIComponent(lTitle); var redditUrl = "http://reddit.com/submit?url=https://f1000research.com/articles/13-112/v2" + "&title=" + encodeURIComponent(lTitle); linkedInUrl += encodeURIComponent('Shenoy D'); var offsetTop = /chrome/i.test( navigator.userAgent ) ? 4 : -10; var addthis_config = { ui_offset_top: offsetTop, services_compact : "facebook,twitter,www.linkedin.com,www.mendeley.com,reddit.com", services_expanded : "facebook,twitter,www.linkedin.com,www.mendeley.com,reddit.com", services_custom : [ { name: "LinkedIn", url: linkedInUrl, icon:"/img/icon/at_linkedin.svg" }, { name: "Mendeley", url: "http://www.mendeley.com/import/?url=https://f1000research.com/articles/13-112/v2/mendeley", icon:"/img/icon/at_mendeley.svg" }, { name: "Reddit", url: redditUrl, icon:"/img/icon/at_reddit.svg" }, ] }; var addthis_share = { url: "https://f1000research.com/articles/13-112", templates : { twitter : "Secondary range symmetric matrices. Shenoy D, published by " + "@F1000Research" + ", https://f1000research.com/articles/13-112/v2" } }; if (typeof(addthis) != "undefined"){ addthis.addEventListener('addthis.ready', checkCount); addthis.addEventListener('addthis.menu.share', checkCount); } $(".f1r-shares-twitter").attr("href", "https://twitter.com/intent/tweet?text=" + addthis_share.templates.twitter); $(".f1r-shares-facebook").attr("href", "https://www.facebook.com/sharer/sharer.php?u=" + addthis_share.url); $(".f1r-shares-linkedin").attr("href", addthis_config.services_custom[0].url); $(".f1r-shares-reddit").attr("href", addthis_config.services_custom[2].url); $(".f1r-shares-mendelay").attr("href", addthis_config.services_custom[1].url); function checkCount(){ setTimeout(function(){ $(".addthis_button_expanded").each(function(){ var count = $(this).text(); if (count !== "" && count != "0") $(this).removeClass("is-hidden"); else $(this).addClass("is-hidden"); }); }, 1000); } close How to cite this report {{reportCitation}} Cancel Copy Citation Details $(function(){R.ui.buttonDropdowns('.dropdown-for-downloads');}); $(function(){R.ui.toolbarDropdowns('.toolbar-dropdown-for-downloads');}); $.get("/articles/acj/144171/168149") new F1000.Clipboard(); new F1000.ThesaurusTermsDisplay("articles", "article", "168149"); $(document).ready(function() { $( "#frame1" ).on('load', function() { var mydiv = $(this).contents().find("div"); var h = mydiv.height(); console.log(h) }); var tooltipLivingFigure = jQuery(".interactive-living-figure-label .icon-more-info"), titleLivingFigure = tooltipLivingFigure.attr("title"); tooltipLivingFigure.simpletip({ fixed: true, position: ["-115", "30"], baseClass: 'small-tooltip', content:titleLivingFigure + " " }); tooltipLivingFigure.removeAttr("title"); $("body").on("click", ".cite-living-figure", function(e) { e.preventDefault(); var ref = $(this).attr("data-ref"); $(this).closest(".living-figure-list-container").find("#" + ref).fadeIn(200); }); $("body").on("click", ".close-cite-living-figure", function(e) { e.preventDefault(); $(this).closest(".popup-window-wrapper").fadeOut(200); }); $(document).on("mouseup", function(e) { var metricsContainer = $(".article-metrics-popover-wrapper"); if (!metricsContainer.is(e.target) && metricsContainer.has(e.target).length === 0) { $(".article-metrics-close-button").click(); } }); var articleId = $('#articleId').val(); if($("#main-article-count-box").attachArticleMetrics) { $("#main-article-count-box").attachArticleMetrics(articleId, { articleMetricsView: true }); } }); var figshareWidget = $(".new_figshare_widget"); if (figshareWidget.length > 0) { window.figshare.load("f1000", function(Widget) { // Select a tag/tags defined in your page. In this tag we will place the widget. _.map(figshareWidget, function(el){ var widget = new Widget({ articleId: $(el).attr("figshare_articleId") //height:300 // this is the height of the viewer part. [Default: 550] }); widget.initialize(); // initialize the widget widget.mount(el); // mount it in a tag that's on your page // this will save the widget on the global scope for later use from // your JS scripts. This line is optional. //window.widget = widget; }); }); } close Error Close Add Reset F1000.MICROSERVICES.AFFILIATION = ''; $(document).ready(function () { $('.js-affiliations-form').each((index, form) => { new AffiliationForm({ formId: form.id, institutionErrorSelector: '.comment-enter-institution', departmentErrorSelector: '.comment-enter-department', placeSelector: '.js-add-comment-place', stateSelector: '.js-add-comment-state', zipCodeSelector: '.js-add-comment-zipcode', countrySelector: '.js-add-comment-country', countryErrorSelector: '.comment-enter-country', }); }); }); $(document).ready(function () { var reportIds = { "322688": 4, "322689": 0, "256262": 0, "252932": 0, "252937": 0, "252943": 0, "252946": 0, "252944": 0, "261026": 0, "261030": 0, "262945": 0, "256293": 0, "256299": 0, "256298": 0, "256297": 0, "261033": 0, "256303": 0, "256302": 0, "256301": 0, "256300": 0, "261036": 0, "266420": 0, "261042": 0, "266421": 0, "261041": 0, "266422": 0, "256304": 0, "261040": 0, "266423": 0, "261045": 0, "261051": 0, "266428": 0, "266429": 0, "261048": 17, "266424": 0, "266425": 0, "266426": 0, "266427": 0, "287701": 0, "287702": 0, "287703": 0, "287708": 0, "287709": 0, "287710": 0, "287704": 0, "287705": 0, "287706": 0, "287707": 0, "274406": 16, "274407": 0, "274412": 0, "274413": 0, "274414": 0, "274415": 0, "252911": 0, "274408": 0, "274409": 0, "274410": 0, "252908": 29, "274411": 0, "274416": 0, "252917": 0, "252921": 0, "322687": 0, "252926": 0, }; $(".referee-response-container,.js-referee-report").each(function(index, el) { var reportId = $(el).attr("data-reportid"), reportCount = reportIds[reportId] || 0; $(el).find(".comments-count-container,.js-referee-report-views").html(reportCount); }); var uuidInput = $("#article_uuid"), oldUUId = uuidInput.val(), newUUId = "5a33a17c-62b5-4706-8467-872c3b855c24"; uuidInput.val(newUUId); $("a[href*='article_uuid=']").each(function(index, el) { var newHref = $(el).attr("href").replace(oldUUId, newUUId); $(el).attr("href", newHref); }); }); An innovative open access publishing platform offering rapid publication and open peer review, whilst supporting data deposition and sharing. Browse Gateways Collections How it Works Contact For Developers Cookie Notice Privacy Notice RSS Submit Your Research Follow us © 2012-2026 F1000 Research Ltd. ISSN 2046-1402 | Legal | Partner of Research4Life • CrossRef • ORCID • FAIRSharing R.templateTests.simpleTemplate = R.template(' $text $text $text $text $text '); R.templateTests.runTests(); var F1000platform = new F1000.Platform({ name: "f1000research", displayName: "F1000Research", hostName: "f1000research.com", id: "1", editorialEmail: "[email protected]", infoEmail: "[email protected]", usePmcStats: true }); $(function(){R.ui.dropdowns('.dropdown-for-authors, .dropdown-for-about, .dropdown-for-myresearch');}); // $(function(){R.ui.dropdowns('.dropdown-for-referees');}); $(document).ready(function () { if ($(".cookie-warning").is(":visible")) { $(".sticky").css("margin-bottom", "35px"); $(".devices").addClass("devices-and-cookie-warning"); } $(".cookie-warning .close-button").click(function (e) { $(".devices").removeClass("devices-and-cookie-warning"); $(".sticky").css("margin-bottom", "0"); }); $("#tweeter-feed .tweet-message").each(function (i, message) { var self = $(message); self.html(linkify(self.html())); }); $(".partner").on("mouseenter mouseleave", function() { $(this).find(".gray-scale, .colour").toggleClass("is-hidden"); }); }); Sign In Remember me Forgotten your password? Sign In Cancel Email or password not correct. Please try again Please wait... $(function(){ // Note: All the setup needs to run against a name attribute and *not* the id due the clonish // nature of facebox... $("a[id=googleSignInButton]").click(function(event){ event.preventDefault(); $("input[id=oAuthSystem]").val("GOOGLE"); $("form[id=oAuthForm]").submit(); }); $("a[id=facebookSignInButton]").click(function(event){ event.preventDefault(); $("input[id=oAuthSystem]").val("FACEBOOK"); $("form[id=oAuthForm]").submit(); }); $("a[id=orcidSignInButton]").click(function(event){ event.preventDefault(); $("input[id=oAuthSystem]").val("ORCID"); $("form[id=oAuthForm]").submit(); }); }); If you've forgotten your password, please enter your email address below and we'll send you instructions on how to reset your password. The email address should be the one you originally registered with F1000. Email address not valid, please try again You registered with F1000 via Google, so we cannot reset your password. To sign in, please click here . If you still need help with your Google account password, please click here . You registered with F1000 via Facebook, so we cannot reset your password. To sign in, please click here . If you still need help with your Facebook account password, please click here . Code not correct, please try again Reset password Cancel Email us for further assistance. Server error, please try again. If your email address is registered with us, we will email you instructions to reset your password. If you think you should have received this email but it has not arrived, please check your spam filters and/or contact for further assistance. Please wait... Register $(document).ready(function () { signIn.createSignInAsRow($("#sign-in-form-gfb-popup")); $(".target-field").each(function () { var uris = $(this).val().split("/"); if (uris.pop() === "login") { $(this).val(uris.toString().replace(",","/")); } }); });