| \n", " | abstract | \n", "cat | \n", "
|---|---|---|
| 109618 | \n", "Let $f: \\mathbb{C} \\to X$ be a transcendental holomorphic curve into a complex projective manifold $X$. Let $L$ be a very ample line bundle on $X$. Let $s$ be a very generic holomorphic section of $L$ and $D$ the zero divisor given by $s$. We prove that the \\emph{geometric} defect of $D$ (defect of truncation $1$) with respect to $f$ is zero. We also prove that $f$ almost misses general enough analytic subsets on $X$ of codimension $2$. | \n", "[math.CV, math.AG, math.DS] | \n", "
| 98189 | \n", "In this paper we prove two approximation results for divergence free vector fields. The first is a form of an assertion of J. Bourgain and H. Brezis concerning the approximation of solenoidal charges in the strict topology: Given $F \\in M_b(\\mathbb{R}^d;\\mathbb{R}^d)$ such that $\\operatorname*{div} F=0$ in the sense of distributions, there exist $C^1$ closed curves $\\{\\Gamma_{i,l}\\}_{\\{1,\\ldots,n_l\\}\\times \\mathbb{N}}$, with parameterization by arclength $\\gamma_{i,l} \\in C^1([0,L_{i,l}];\\mathbb{R}^d)$, $l \\leq L_{i,l} \\leq 2l$, for which \\[ F= \\lim_{l \\to \\infty} \\frac{\\|F\\|_{M_b(\\mathbb{R}^d;\\mathbb{R}^d)}}{n_l \\cdot l} \\sum_{i=1}^{n_l} \\dot{\\gamma}_{i,l} \\left.\\mathcal{H}^1\\right\\vert_{\\Gamma_{i,l}} \\] weakly-star as measures and \\begin{align*} \\lim_{l \\to \\infty} \\frac{1}{n_l \\cdot l} \\sum_{i=1}^{n_l} |\\Gamma_{i,l}| = 1. \\end{align*} The second, which is an almost immediate consequence of the first, is that smooth compactly supported functions are dense in \\[ \\left\\{ F \\in M_b(\\mathbb{R}^d;\\mathbb{R}^d): \\operatorname*{div}F=0 \\right\\} \\] with respect to the strict topology. | \n", "[math.AP, math.FA] | \n", "
| 79941 | \n", "Ion transport in biological tissues is crucial in the study of many biological and pathological problems. Some multi-cellular structures, like smooth muscles on the vessel walls, could be treated as periodic bi-domain structures, which consist of intracellular space and extracellular space with semipermeable membranes in between. With the aid of two-scale homogenization theory, macro-scale models are proposed based on an electro-neutral (EN) microscale model with nonlinear interface conditions, where membranes are treated as combinations of capacitors and resistors. The connectivity of intracellular space is also taken into consideration. If the intracellular space is fully connected and forms a syncytium, then the macroscale model is a bidomain nonlinear coupled partial differential equations system. Otherwise, when the intracellular cells are not connected, the macroscale model for intracellular space is an ordinary differential system with source/sink terms from the connected extracellular space. | \n", "[math.AP, math.DS] | \n", "
| 57526 | \n", "Quantum error-correcting codes are used to protect qubits involved in quantum computation. This process requires logical operators, acting on protected qubits, to be translated into physical operators (circuits) acting on physical quantum states. We propose a mathematical framework for synthesizing physical circuits that implement logical Clifford operators for stabilizer codes. Circuit synthesis is enabled by representing the desired physical Clifford operator in $\\mathbb{C}^{N \\times N}$ as a partial $2m \\times 2m$ binary symplectic matrix, where $N = 2^m$. We state and prove two theorems that use symplectic transvections to efficiently enumerate all binary symplectic matrices that satisfy a system of linear equations. As a corollary of these results, we prove that for an $[\\![ m,k ]\\!]$ stabilizer code every logical Clifford operator has $2^{r(r+1)/2}$ symplectic solutions, where $r = m-k$, up to stabilizer degeneracy. The desired physical circuits are then obtained by decomposing each solution into a product of elementary symplectic matrices, that correspond to elementary circuits. This enumeration of all physical realizations enables optimization over the ensemble with respect to a suitable metric. Furthermore, we show that any circuit that normalizes the stabilizer of the code can be transformed into a circuit that centralizes the stabilizer, while realizing the same logical operation. Our method of circuit synthesis can be applied to any stabilizer code, and this paper discusses a proof of concept synthesis for the $[\\![ 6,4,2 ]\\!]$ CSS code. Programs implementing the algorithms in this paper, which includes routines to solve for binary symplectic solutions of general linear systems and our overall LCS (logical circuit synthesis) algorithm, can be found at: https://github.com/nrenga/symplectic-arxiv18a | \n", "[quant-ph, cs.IT, math.IT] | \n", "
| 122545 | \n", "We study the properties of a leave-node-out jackknife procedure for network data. Under the sparse graphon model, we prove an Efron-Stein-type inequality, showing that the network jackknife leads to conservative estimates of the variance (in expectation) for any network functional that is invariant to node permutation. For a general class of count functionals, we also establish consistency of the network jackknife. We complement our theoretical analysis with a range of simulated and real-data examples and show that the network jackknife offers competitive performance in cases where other resampling methods are known to be valid. In fact, for several network statistics, we see that the jackknife provides more accurate inferences compared to related methods such as subsampling. | \n", "[math.ST, stat.ME, stat.ML, stat.TH] | \n", "
| 41275 | \n", "There has been a lot of effort to construct good quantum codes from the classical error correcting codes. Constructing new quantum codes, using Hermitian self-orthogonal codes, seems to be a difficult problem in general. In this paper, Hermitian self-orthogonal codes are studied from algebraic function fields. Sufficient conditions for the Hermitian self-orthogonality of an algebraic geometry code are presented. New Hermitian self-orthogonal codes are constructed from projective lines, elliptic curves, hyper-elliptic curves, Hermitian curves, and Artin-Schreier curves. In addition, over the projective lines, we construct new families of MDS quantum codes with parameters $[[N,N-2K,K+1]]_q$ under the following conditions: i) $N=t(q-1)+1$ or $t(q-1)+2$ with $t|(q+1)$ and $K=\\lfloor\\frac{t(q-1)+1}{2t}\\rfloor+1$; ii) $(n-1)|(q^2-1)$, $N=n$ or $N=n+1$, $K_0=\\lfloor\\frac{n+q-1}{q+1}\\rfloor$, and $K\\ge K_0+1$; iii) $N=tq+1$, $\\forall~1\\le t\\le q$ and $K=\\lfloor\\frac{tq+q-1}{q+1}\\rfloor+1$; iv) $n|(q^2-1)$, $n_2=\\frac{n}{\\gcd (n,q+1)}$, $\\forall~ 1\\le t\\le \\frac{q-1}{n_2}-1$, $N=(t+1)n+2$ and $K=\\lfloor \\frac{(t+1)n+1+q-1}{q+1}\\rfloor+1$. | \n", "[cs.IT, math.IT] | \n", "
| 69961 | \n", "With G=GL(n,C), let $\\mathcal{X}_{\\Gamma}G$ be the G-character variety of a given finitely presented group $\\Gamma$, and let $\\mathcal{X}^{irr}_{\\Gamma}G \\subset \\mathcal{X}_{\\Gamma}G$ be the locus of irreducible representation conjugacy classes. We provide a concrete relation, in terms of plethystic functions, between the generating series for E- polynomials of $\\mathcal{X}_{\\Gamma}G$ and the one for $\\mathcal{X}^{irr}_{\\Gamma}G$, generalizing a formula of Mozgovoy-Reineke [MR]. The proof uses a natural stratification of $\\mathcal{X}_{\\Gamma}G$ coming from affine GIT, the combinatorics of partitions, and the formula of MacDonald-Cheah for symmetric products; we also adapt it to the so-called Cartan brane in the moduli space of Higgs bundles. Combining our methods with arithmetic ones yields explicit expressions for the E-polynomials of the irreducible stratum of GL(n,C)-character varieties of some groups $\\Gamma$, including surface groups, free groups, and torus knot groups, for low values of $n$. | \n", "[math.AG, math.RT] | \n", "
| 127482 | \n", "Let $m, n$ be positive integers such that $m>1$ divides $n$. In this paper, we introduce a special class of piecewise-affine permutations of the finite set $[1, n]:=\\{1, \\ldots, n\\}$ with the property that the reduction $\\pmod m$ of $m$ consecutive elements in any of its cycles is, up to a cyclic shift, a fixed permutation of $[1, m]$. Our main result provides the cycle decomposition of such permutations. We further show that such permutations give rise to permutations of finite fields. In particular, we explicitly obtain classes of permutation polynomials of finite fields whose cycle decomposition and its inverse are explicitly given. | \n", "[math.NT, math.CO] | \n", "
| 13100 | \n", "We study one-parameter deformations of Calabi-Yau type Fermat polynomial singularities along degree-one directions. We show that twisted sectors in the vanishing cohomology are components of automorphic forms for certain triangular groups. We prove consequentially that genus zero Gromov-Witten generating series of the corresponding Fermat Calabi-Yau varieties are components of automorphic forms. The main tools we use are mixed Hodge structures for quasi-homogeneous polynomial singularities, Riemann-Hilbert correspondence, and genus zero mirror symmetry. | \n", "[math.AG, math-ph, math.CA, math.MP] | \n", "
| 56062 | \n", "We consider the \\textit{phase retrieval} problem of recovering a sparse signal $\\mathbf{x}$ in $\\mathbb{R}^d$ from intensity-only measurements in dimension $d \\geq 2$. Phase retrieval can be equivalently formulated as the problem of recovering a signal from its autocorrelation, which is in turn directly related to the combinatorial problem of recovering a set from its pairwise differences. In one spatial dimension, this problem is well studied and known as the \\textit{turnpike problem}. In this work, we present MISTR (Multidimensional Intersection Sparse supporT Recovery), an algorithm which exploits this formulation to recover the support of a multidimensional signal from magnitude-only measurements. MISTR takes advantage of the structure of multiple dimensions to provably achieve the same accuracy as the best one-dimensional algorithms in dramatically less time. We prove theoretically that MISTR correctly recovers the support of signals distributed as a Gaussian point process with high probability as long as sparsity is at most $\\mathcal{O}\\left(n^{d\\theta}\\right)$ for any $\\theta < 1/2$, where $n^d$ represents pixel size in a fixed image window. In the case that magnitude measurements are corrupted by noise, we provide a thresholding scheme with theoretical guarantees for sparsity at most $\\mathcal{O}\\left(n^{d\\theta}\\right)$ for $\\theta < 1/4$ that obviates the need for MISTR to explicitly handle noisy autocorrelation data. Detailed and reproducible numerical experiments demonstrate the effectiveness of our algorithm, showing that in practice MISTR enjoys time complexity which is nearly linear in the size of the input. | \n", "[math.CO, cs.NA, eess.SP, math.NA, math.PR] | \n", "
| \n", " | title | \n", "abstract | \n", "cat | \n", "authors_parsed | \n", "update_date | \n", "id | \n", "
|---|---|---|---|---|---|---|
| 139098 | \n", "Telgarsky's conjecture may fail | \n", "Telg\\'arsky's conjecture states that for each $k \\in \\mathbb N$, there is a\\ntopological space $X_k$ such that in the Banach-Mazur game on $X_k$, the player\\n{\\scriptsize NONEMPTY} has a winning $(k+1)$-tactic but no winning $k$-tactic.\\nWe prove that this statement is consistently false.\\n More specifically, we prove, assuming $\\mathsf{GCH}+\\square$, that if\\n{\\scriptsize NONEMPTY} has a winning strategy for the Banach-Mazur game on a\\n$T_3$ space $X$, then she has a winning $2$-tactic. The proof uses a coding\\nargument due to Galvin, whereby if $X$ has a $\\pi$-base with certain nice\\nproperties, then {\\scriptsize NONEMPTY} is able to encode, in each consecutive\\npair of her opponent's moves, all essential information about the play of the\\ngame before the current move. Our proof shows that under\\n$\\mathsf{GCH}+\\square$, every $T_3$ space has a sufficiently nice $\\pi$-base\\nthat enables this coding strategy.\\n Translated into the language of partially ordered sets, what we really show\\nis that $\\mathsf{GCH}+\\square$ implies the following statement, which is\\nequivalent to the existence of the \"nice'' $\\pi$-bases mentioned above:\\n\\emph{Every separative poset $\\mathbb P$ with the $\\kappa$-cc contains a dense\\nsub-poset $\\mathbb D$ such that $|\\{ q \\in \\mathbb D \\,:\\, p \\text{ extends } q\\n\\}| < \\kappa$ for every $p \\in \\mathbb P$.} We prove that this statement is\\nindependent of $\\mathsf{ZFC}$: while it holds under $\\mathsf{GCH}+\\square$, it\\nis false even for ccc posets if $\\mathfrak{b} > \\aleph_1$. We also show that if\\n$|\\mathbb P| < \\aleph_\\omega$, then \\axiom-for-$\\mathbb P$ is a consequence of\\n$\\mathsf{GCH}$ holding below $|\\mathbb P|$.\\n | \n", "[math.LO, math.GN] | \n", "[['Brian', 'Will', ''], ['Dow', 'Alan', ''], ['Milovich', 'David', ''], ['Yengulalp', 'Lynne', '']] | \n", "2019-12-10 | \n", "1912.03327 | \n", "
| 50283 | \n", "Large Deviation Principle for the Greedy Exploration Algorithm over\\n Erd\\\"os-R\\'enyi Graphs | \n", "We prove a large deviation principle for a greedy exploration process on an\\nErd\\\"os-R\\'enyi (ER) graph when the number of nodes goes to infinity. To prove\\nour main result, we use the general strategy to study large deviations of\\nprocesses proposed by Feng and Kurtz, based on the convergence of non-linear\\nsemigroups. The rate function can be expressed in a closed-form formula, and\\nassociated optimization problems can be solved explicitly, providing the large\\ndeviation trajectory. Also, we derive an LDP for the size of the maximum\\nindependent set discovered by such an algorithm and analyze the probability\\nthat it exceeds known bounds for the maximal independent set. We also analyze\\nthe link between these results and the landscape complexity of the independent\\nset and the exploration dynamic.\\n | \n", "[math.PR] | \n", "[['Bermolen', 'P.', ''], ['Goicoechea', 'V.', ''], ['Jonckheere', 'M.', ''], ['Mordecki', 'E.', '']] | \n", "2021-10-11 | \n", "2007.04753 | \n", "
| 169377 | \n", "Orthogonal expansions related to compact Gelfand pairs | \n", "Given a compact Gelfand pair (G,K) and a locally compact group L, we\\ncharacterize the class P_K^\\sharp(G,L) of continuous positive definite\\nfunctions f:G\\times L\\to \\C which are bi-invariant in the G-variable with\\nrespect to K. The functions of this class are the functions having a uniformly\\nconvergent expansion \\sum_{\\varphi\\in Z} B(\\varphi)(u)\\varphi(x) for x\\in\\nG,u\\in L, where the sum is over the space Z of positive definite spherical\\nfunctions \\varphi:G\\to\\C for the Gelfand pair, and (B(\\varphi))_{\\varphi\\in Z}\\nis a family of continuous positive definite functions on L such that\\n\\sum_{\\varphi\\in Z}B(\\varphi)(e_L)<\\infty. Here e_L is the neutral element of\\nthe group L. For a compact abelian group G considered as a Gelfand pair (G,K)\\nwith trivial K=\\{e_G\\}, we obtain a characterization of P(G\\times L) in terms\\nof Fourier expansions on the dual group \\widehat{G}.\\n The result is described in detail for the case of the Gelfand pairs\\n(O(d+1),O(d)) and (U(q),U(q-1)) as well as for the product of these Gelfand\\npairs.\\n The result generalizes recent theorems of Berg-Porcu (2016) and\\nGuella-Menegatto (2016)\\n | \n", "[math.CA] | \n", "[['Berg', 'Christian', '', 'University of Copenhagen'], ['Peron', 'Ana P.', '', 'ICMC-USP-São Carlos'], ['Porcu', 'Emilio', '', 'University Federico Santa Maria']] | \n", "2019-03-20 | \n", "1612.03718 | \n", "
| 32935 | \n", "Congruent numbers, elliptic curves, and the passage from the local to\\n the global: an update | \n", "This update to my article on Congruent numbers, elliptic curves, and the\\npassage from the local to the global, which appeared in Resonance, December\\n2009, pp. 1183--1205\\n(https://www.ias.ac.in/describe/article/reso/014/12/1183-1205) and was posted\\nhere as arXiv:0704.3783, covers a few recent advances in the arithmetic of\\nelliptic curves with special reference to the congruent number problem.\\n | \n", "[math.NT] | \n", "[['Dalawat', 'Chandan Singh', '']] | \n", "2022-02-09 | \n", "2201.11071 | \n", "
| 38604 | \n", "Around the nonlinear Ryll-Nardzewski theorem | \n", "Suppose that $Q$ is a weak$^{\\ast }$ compact convex subset of a dual Banach\\nspace with the Radon-Nikod\\'{y}m property. We show that if $(S,Q)$ is a\\nnonexpansive and norm-distal dynamical system, then there is a fixed point of\\n$S$ in $Q$ and the set of fixed points is a nonexpansive retract of $Q.$ As a\\nconsequence we obtain a nonlinear extension of the Bader-Gelander-Monod theorem\\nconcerning isometries in $L$-embedded Banach spaces. A similar statement is\\nproved for weakly compact convex subsets of a locally convex space, thus giving\\nthe nonlinear counterpart of the Ryll-Nardzewski theorem.\\n | \n", "[math.DS, math.FA, math.GR] | \n", "[['Wiśnicki', 'Andrzej', '']] | \n", "2022-01-03 | \n", "1903.12123 | \n", "
| 132354 | \n", "New upper bounds for the bondage number of a graph in terms of its\\n maximum degree and Euler characteristic | \n", "The bondage number $b(G)$ of a graph $G$ is the smallest number of edges\\nwhose removal from $G$ results in a graph with larger domination number. Let\\n$G$ be embeddable on a surface whose Euler characteristic $\\chi$ is as large as\\npossible, and assume $\\chi\\leq0$. Gagarin-Zverovich and Huang have recently\\nfound upper bounds of $b(G)$ in terms of the maximum degree $\\Delta(G)$ and the\\nEuler characteristic $\\chi(G)=\\chi$. In this paper we prove a better upper\\nbound $b(G)\\leq\\Delta(G)+\\lfloor t\\rfloor$ where $t$ is the largest real root\\nof the cubic equation $z^3 + z^2 + (3\\chi - 8)z + 9\\chi - 12=0$; this upper\\nbound is asymptotically equivalent to $b(G)\\leq\\Delta(G)+1+\\lfloor\\n\\sqrt{4-3\\chi} \\rfloor$. We also establish further improved upper bounds for\\n$b(G)$ when the girth, order, or size of the graph $G$ is large compared with\\nits Euler characteristic $\\chi$.\\n | \n", "[math.CO] | \n", "[['Huang', 'Jia', ''], ['Shen', 'Jian', '']] | \n", "2020-02-04 | \n", "2002.00765 | \n", "
| \n", " | title | \n", "abstract | \n", "cat | \n", "
|---|---|---|---|
| 0 | \n", "Vertex representations via finite groups and t... | \n", "Given a finite group $\\Gamma$ and a virtual ... | \n", "[math.QA, hep-th, math.RT] | \n", "
| 1 | \n", "Categoricity and amalgamation for AEC and $ \\k... | \n", "In the original version of this paper, we as... | \n", "[math.LO] | \n", "
| 2 | \n", "From Loop Groups to 2-Groups | \n", "We describe an interesting relation between ... | \n", "[math.QA, hep-th, math.DG] | \n", "
| 3 | \n", "Finite Supersymmetry Transformations | \n", "We investigate simple examples of supersymme... | \n", "[quant-ph, hep-th, math-ph, math.MP] | \n", "
| 4 | \n", "Super black box (formerly: Middle diamond) | \n", "This is a slightly corrected version of an o... | \n", "[math.LO] | \n", "
| \n", " | title | \n", "abstract | \n", "cat | \n", "authors_parsed | \n", "update_date | \n", "id | \n", "
|---|---|---|---|---|---|---|
| 0 | \n", "Vertex representations via finite groups and the McKay correspondence | \n", "Given a finite group $\\Gamma$ and a virtual character $\\wt$ on it, we construct a Fock space and associated vertex operators in terms of representation ring of wreath products $\\Gamma\\sim S_n$. We recover the character tables of wreath products $\\Gamma\\sim S_n$ by vertex operator calculus. When $\\Gamma$ is a finite subgroup of $SU_2$, our construction yields a group theoretic realization of the basic representations of the affine and toroidal Lie algebras of $ADE$ type, which can be regarded as a new form of McKay correspondence. | \n", "[Quantum Algebra, High Energy Physics - Theory, Representation Theory] | \n", "[['Frenkel', 'Igor', ''], ['Jing', 'Naihuan', ''], ['Wang', 'Weiqiang', '']] | \n", "2023-05-19 | \n", "math/9907166 | \n", "
| 1 | \n", "Categoricity and amalgamation for AEC and $ \\kappa $ measurable | \n", "In the original version of this paper, we assume a theory $T$ that the logic $\\mathbb L _{\\kappa, \\aleph_{0}}$ is categorical in a cardinal $\\lambda > \\kappa$, and $\\kappa$ is a measurable cardinal. There we prove that the class of model of $T$ of cardinality $<\\lambda$ (but $\\geq |T|+\\kappa$) has the amalgamation property; this is a step toward understanding the character of such classes of models. In this revised version we replaced the class of models of $T$ by $\\mathfrak k$, an AEC (abstract elementary class) which has LS-number ${<} \\, \\kappa,$ or at least which behave nicely for ultrapowers by $D$, a normal ultra-filter on $\\kappa$. Presently sub-section \\S1A deals with $T \\subseteq \\mathbb L_{\\kappa^{+}, \\aleph_{0}}$ (and so does a large part of the introduction and little in the rest of \\S1), but otherwise, all is done in the context of AEC. | \n", "[Logic] | \n", "[['Kolman', 'Oren', ''], ['Shelah', 'Saharon', '']] | \n", "2023-05-19 | \n", "math/9602216 | \n", "
| 2 | \n", "From Loop Groups to 2-Groups | \n", "We describe an interesting relation between Lie 2-algebras, the Kac-Moody central extensions of loop groups, and the group $\\mathrm{String}(n)$. A Lie 2-algebra is a categorified version of a Lie algebra where the Jacobi identity holds up to a natural isomorphism called the \"Jacobiator\". Similarly, a Lie 2-group is a categorified version of a Lie group. If $G$ is a simply-connected compact simple Lie group, there is a 1-parameter family of Lie 2-algebras $\\mathfrak{g}_k$ each having $\\mathrm{Lie}(G)$ as its Lie algebra of objects, but with a Jacobiator built from the canonical 3-form on $G$. There appears to be no Lie 2-group having $\\mathfrak{g}_k$ as its Lie 2-algebra, except when $k = 0$. Here, however, we construct for integral k an infinite-dimensional Lie 2-group whose Lie 2-algebra is equivalent to $\\mathfrak{g}_k$. The objects of this 2-group are based paths in $G$, while the automorphisms of any object form the level-$k$ Kac-Moody central extension of the loop group of $G$. This 2-group is closely related to the $k$th power of the canonical gerbe over $G$. Its nerve gives a topological group that is an extension of $G$ by $K(\\mathbb{Z},2)$. When $k = \\pm 1$, this topological group can also be obtained by killing the third homotopy group of $G$. Thus, when $G = \\mathrm{Spin}(n)$, it is none other than $\\mathrm{String}(n)$. | \n", "[Quantum Algebra, High Energy Physics - Theory, Differential Geometry] | \n", "[['Baez', 'John C.', ''], ['Crans', 'Alissa S.', ''], ['Stevenson', 'Danny', ''], ['Schreiber', 'Urs', '']] | \n", "2023-05-16 | \n", "math/0504123 | \n", "
| 3 | \n", "Finite Supersymmetry Transformations | \n", "We investigate simple examples of supersymmetry algebras with real and Grassmann parameters. Special attention is payed to the finite supertransformations and their probability interpretation. Furthermore we look for combinations of bosons and fermions which are invariant under supertransformations. These combinations correspond to states that are highly entangled. | \n", "[Quantum Physics, High Energy Physics - Theory, Mathematical Physics, Mathematical Physics] | \n", "[['Ilieva', 'Nevena', ''], ['Narnhofer', 'Heide', ''], ['Thirring', 'Walter', '']] | \n", "2023-05-09 | \n", "quant-ph/0401139 | \n", "
| 4 | \n", "Super black box (formerly: Middle diamond) | \n", "This is a slightly corrected version of an old work. Under certain cardinal arithmetic assumptions, we prove that for every large enough regular $\\lambda$ cardinal, for many regular $\\kappa < \\lambda$, many stationary subsets of $\\lambda$ concentrating on cofinality $\\kappa$ have super BB. In particular, we have the super BB on $\\{\\delta < \\lambda \\colon cf(\\delta) = \\kappa\\}$. This is a strong negation of uniformization. We have added some details. Works continuing it are [Sh:898] and [Sh:1028]. We thank Ari Brodski and Adi Jarden for their helpful comments. In this paper we had earlier used the notion ``middle diamond\" which is now replaced by ``super BB'', that is, ``super black box'', in order to be consistent with other papers (see [Sh:898]). | \n", "[Logic] | \n", "[['Shelah', 'Saharon', '']] | \n", "2023-05-04 | \n", "math/0212249 | \n", "
| \n", " | Accelerator Physics | \n", "Adaptation and Self-Organizing Systems | \n", "Algebraic Geometry | \n", "Algebraic Topology | \n", "Analysis of PDEs | \n", "Applications | \n", "Applied Physics | \n", "Artificial Intelligence | \n", "Astrophysics | \n", "Astrophysics of Galaxies | \n", "... | \n", "Strongly Correlated Electrons | \n", "Subcellular Processes | \n", "Superconductivity | \n", "Symbolic Computation | \n", "Symplectic Geometry | \n", "Systems and Control | \n", "Theoretical Economics | \n", "Tissues and Organs | \n", "Trading and Market Microstructure | \n", "UNK | \n", "
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "... | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "
| 1 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "... | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "
| 2 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "... | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "
| 3 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "... | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "
| 4 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "... | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "
5 rows × 150 columns
\n", "| \n", " | Accelerator Physics | \n", "Adaptation and Self-Organizing Systems | \n", "Algebraic Geometry | \n", "Algebraic Topology | \n", "Analysis of PDEs | \n", "Applications | \n", "Applied Physics | \n", "Artificial Intelligence | \n", "Astrophysics | \n", "Astrophysics of Galaxies | \n", "... | \n", "Strongly Correlated Electrons | \n", "Subcellular Processes | \n", "Superconductivity | \n", "Symbolic Computation | \n", "Symplectic Geometry | \n", "Systems and Control | \n", "Theoretical Economics | \n", "Tissues and Organs | \n", "Trading and Market Microstructure | \n", "UNK | \n", "
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 1 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 2 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 3 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 4 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
5 rows × 150 columns
\n", "| \n", " | Accelerator Physics | \n", "Adaptation and Self-Organizing Systems | \n", "Algebraic Geometry | \n", "Algebraic Topology | \n", "Analysis of PDEs | \n", "Applications | \n", "Applied Physics | \n", "Artificial Intelligence | \n", "Astrophysics | \n", "Astrophysics of Galaxies | \n", "... | \n", "Strongly Correlated Electrons | \n", "Subcellular Processes | \n", "Superconductivity | \n", "Symbolic Computation | \n", "Symplectic Geometry | \n", "Systems and Control | \n", "Theoretical Economics | \n", "Tissues and Organs | \n", "Trading and Market Microstructure | \n", "UNK | \n", "
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 79265 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 59743 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 94748 | \n", "False | \n", "False | \n", "False | \n", "True | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 36055 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "True | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 34908 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 125441 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 139894 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "True | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 17363 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 73015 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 121373 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "True | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 100029 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 158077 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 55299 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 106954 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "True | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 156511 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 38431 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "True | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 174699 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 158460 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 44682 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 134265 | \n", "False | \n", "False | \n", "False | \n", "True | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 157521 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 84402 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 149114 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 132594 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 34793 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 133942 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 81413 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 170547 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 77366 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 67126 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 15773 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 167140 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 134908 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 130866 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "True | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 124993 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 21799 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 55986 | \n", "False | \n", "False | \n", "False | \n", "True | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 133618 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 76319 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 55552 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 70969 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 42821 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 98648 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 99294 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 80464 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 126915 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 136317 | \n", "False | \n", "False | \n", "True | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 55150 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 139772 | \n", "False | \n", "False | \n", "True | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 25873 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
50 rows × 150 columns
\n", "| \n", " | title | \n", "abstract | \n", "authors_parsed | \n", "update_date | \n", "id | \n", "Accelerator Physics | \n", "Adaptation and Self-Organizing Systems | \n", "Algebraic Geometry | \n", "Algebraic Topology | \n", "Analysis of PDEs | \n", "... | \n", "Strongly Correlated Electrons | \n", "Subcellular Processes | \n", "Superconductivity | \n", "Symbolic Computation | \n", "Symplectic Geometry | \n", "Systems and Control | \n", "Theoretical Economics | \n", "Tissues and Organs | \n", "Trading and Market Microstructure | \n", "UNK | \n", "
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | \n", "Vertex representations via finite groups and the McKay correspondence | \n", "Given a finite group $\\Gamma$ and a virtual character $\\wt$ on it, we\\nconstruct a Fock space and associated vertex operators in terms of\\nrepresentation ring of wreath products $\\Gamma\\sim S_n$. We recover the\\ncharacter tables of wreath products $\\Gamma\\sim S_n$ by vertex operator\\ncalculus. When $\\Gamma$ is a finite subgroup of $SU_2$, our construction yields\\na group theoretic realization of the basic representations of the affine and\\ntoroidal Lie algebras of $ADE$ type, which can be regarded as a new form of\\nMcKay correspondence.\\n | \n", "[['Frenkel', 'Igor', ''], ['Jing', 'Naihuan', ''], ['Wang', 'Weiqiang', '']] | \n", "2023-05-19 | \n", "math/9907166 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 1 | \n", "Categoricity and amalgamation for AEC and $ \\kappa $ measurable | \n", "In the original version of this paper, we assume a theory $T$ that the logic\\n$\\mathbb L _{\\kappa, \\aleph_{0}}$ is categorical in a cardinal $\\lambda >\\n\\kappa$, and $\\kappa$ is a measurable cardinal. There we prove that the class\\nof model of $T$ of cardinality $<\\lambda$ (but $\\geq |T|+\\kappa$) has the\\namalgamation property; this is a step toward understanding the character of\\nsuch classes of models.\\n In this revised version we replaced the class of models of $T$ by $\\mathfrak\\nk$, an AEC (abstract elementary class) which has LS-number ${<} \\, \\kappa,$ or\\nat least which behave nicely for ultrapowers by $D$, a normal ultra-filter on\\n$\\kappa$.\\n Presently sub-section \\S1A deals with $T \\subseteq \\mathbb L_{\\kappa^{+},\\n\\aleph_{0}}$ (and so does a large part of the introduction and little in the\\nrest of \\S1), but otherwise, all is done in the context of AEC.\\n | \n", "[['Kolman', 'Oren', ''], ['Shelah', 'Saharon', '']] | \n", "2023-05-19 | \n", "math/9602216 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 2 | \n", "From Loop Groups to 2-Groups | \n", "We describe an interesting relation between Lie 2-algebras, the Kac-Moody\\ncentral extensions of loop groups, and the group $\\mathrm{String}(n)$. A Lie\\n2-algebra is a categorified version of a Lie algebra where the Jacobi identity\\nholds up to a natural isomorphism called the \"Jacobiator\". Similarly, a Lie\\n2-group is a categorified version of a Lie group. If $G$ is a simply-connected\\ncompact simple Lie group, there is a 1-parameter family of Lie 2-algebras\\n$\\mathfrak{g}_k$ each having $\\mathrm{Lie}(G)$ as its Lie algebra of objects,\\nbut with a Jacobiator built from the canonical 3-form on $G$. There appears to\\nbe no Lie 2-group having $\\mathfrak{g}_k$ as its Lie 2-algebra, except when $k\\n= 0$. Here, however, we construct for integral k an infinite-dimensional Lie\\n2-group whose Lie 2-algebra is equivalent to $\\mathfrak{g}_k$. The objects of\\nthis 2-group are based paths in $G$, while the automorphisms of any object form\\nthe level-$k$ Kac-Moody central extension of the loop group of $G$. This\\n2-group is closely related to the $k$th power of the canonical gerbe over $G$.\\nIts nerve gives a topological group that is an extension of $G$ by\\n$K(\\mathbb{Z},2)$. When $k = \\pm 1$, this topological group can also be\\nobtained by killing the third homotopy group of $G$. Thus, when $G =\\n\\mathrm{Spin}(n)$, it is none other than $\\mathrm{String}(n)$.\\n | \n", "[['Baez', 'John C.', ''], ['Crans', 'Alissa S.', ''], ['Stevenson', 'Danny', ''], ['Schreiber', 'Urs', '']] | \n", "2023-05-16 | \n", "math/0504123 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 3 | \n", "Finite Supersymmetry Transformations | \n", "We investigate simple examples of supersymmetry algebras with real and\\nGrassmann parameters. Special attention is payed to the finite\\nsupertransformations and their probability interpretation. Furthermore we look\\nfor combinations of bosons and fermions which are invariant under\\nsupertransformations. These combinations correspond to states that are highly\\nentangled.\\n | \n", "[['Ilieva', 'Nevena', ''], ['Narnhofer', 'Heide', ''], ['Thirring', 'Walter', '']] | \n", "2023-05-09 | \n", "quant-ph/0401139 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
| 4 | \n", "Super black box (formerly: Middle diamond) | \n", "This is a slightly corrected version of an old work.\\n Under certain cardinal arithmetic assumptions, we prove that for every large\\nenough regular $\\lambda$ cardinal, for many regular $\\kappa < \\lambda$, many\\nstationary subsets of $\\lambda$ concentrating on cofinality $\\kappa$ have super\\nBB. In particular, we have the super BB on $\\{\\delta < \\lambda \\colon\\ncf(\\delta) = \\kappa\\}$. This is a strong negation of uniformization.\\n We have added some details. Works continuing it are [Sh:898] and [Sh:1028].\\nWe thank Ari Brodski and Adi Jarden for their helpful comments.\\n In this paper we had earlier used the notion ``middle diamond\" which is now\\nreplaced by ``super BB'', that is, ``super black box'', in order to be\\nconsistent with other papers (see [Sh:898]).\\n | \n", "[['Shelah', 'Saharon', '']] | \n", "2023-05-04 | \n", "math/0212249 | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "... | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "False | \n", "
5 rows × 155 columns
\n", "| \n", " | title | \n", "abstract | \n", "cat | \n", "authors_parsed | \n", "update_date | \n", "id | \n", "
|---|---|---|---|---|---|---|
| 0 | \n", "Vertex representations via finite groups and the McKay correspondence | \n", "Given a finite group $\\Gamma$ and a virtual character $\\wt$ on it, we construct a Fock space and associated vertex operators in terms of representation ring of wreath products $\\Gamma\\sim S_n$. We recover the character tables of wreath products $\\Gamma\\sim S_n$ by vertex operator calculus. When $\\Gamma$ is a finite subgroup of $SU_2$, our construction yields a group theoretic realization of the basic representations of the affine and toroidal Lie algebras of $ADE$ type, which can be regarded as a new form of McKay correspondence. | \n", "[math.QA, hep-th, math.RT] | \n", "[['Frenkel', 'Igor', ''], ['Jing', 'Naihuan', ''], ['Wang', 'Weiqiang', '']] | \n", "2023-05-19 | \n", "math/9907166 | \n", "
| 1 | \n", "Categoricity and amalgamation for AEC and $ \\kappa $ measurable | \n", "In the original version of this paper, we assume a theory $T$ that the logic $\\mathbb L _{\\kappa, \\aleph_{0}}$ is categorical in a cardinal $\\lambda > \\kappa$, and $\\kappa$ is a measurable cardinal. There we prove that the class of model of $T$ of cardinality $<\\lambda$ (but $\\geq |T|+\\kappa$) has the amalgamation property; this is a step toward understanding the character of such classes of models. In this revised version we replaced the class of models of $T$ by $\\mathfrak k$, an AEC (abstract elementary class) which has LS-number ${<} \\, \\kappa,$ or at least which behave nicely for ultrapowers by $D$, a normal ultra-filter on $\\kappa$. Presently sub-section \\S1A deals with $T \\subseteq \\mathbb L_{\\kappa^{+}, \\aleph_{0}}$ (and so does a large part of the introduction and little in the rest of \\S1), but otherwise, all is done in the context of AEC. | \n", "[math.LO] | \n", "[['Kolman', 'Oren', ''], ['Shelah', 'Saharon', '']] | \n", "2023-05-19 | \n", "math/9602216 | \n", "
| 2 | \n", "From Loop Groups to 2-Groups | \n", "We describe an interesting relation between Lie 2-algebras, the Kac-Moody central extensions of loop groups, and the group $\\mathrm{String}(n)$. A Lie 2-algebra is a categorified version of a Lie algebra where the Jacobi identity holds up to a natural isomorphism called the \"Jacobiator\". Similarly, a Lie 2-group is a categorified version of a Lie group. If $G$ is a simply-connected compact simple Lie group, there is a 1-parameter family of Lie 2-algebras $\\mathfrak{g}_k$ each having $\\mathrm{Lie}(G)$ as its Lie algebra of objects, but with a Jacobiator built from the canonical 3-form on $G$. There appears to be no Lie 2-group having $\\mathfrak{g}_k$ as its Lie 2-algebra, except when $k = 0$. Here, however, we construct for integral k an infinite-dimensional Lie 2-group whose Lie 2-algebra is equivalent to $\\mathfrak{g}_k$. The objects of this 2-group are based paths in $G$, while the automorphisms of any object form the level-$k$ Kac-Moody central extension of the loop group of $G$. This 2-group is closely related to the $k$th power of the canonical gerbe over $G$. Its nerve gives a topological group that is an extension of $G$ by $K(\\mathbb{Z},2)$. When $k = \\pm 1$, this topological group can also be obtained by killing the third homotopy group of $G$. Thus, when $G = \\mathrm{Spin}(n)$, it is none other than $\\mathrm{String}(n)$. | \n", "[math.QA, hep-th, math.DG] | \n", "[['Baez', 'John C.', ''], ['Crans', 'Alissa S.', ''], ['Stevenson', 'Danny', ''], ['Schreiber', 'Urs', '']] | \n", "2023-05-16 | \n", "math/0504123 | \n", "
| 3 | \n", "Finite Supersymmetry Transformations | \n", "We investigate simple examples of supersymmetry algebras with real and Grassmann parameters. Special attention is payed to the finite supertransformations and their probability interpretation. Furthermore we look for combinations of bosons and fermions which are invariant under supertransformations. These combinations correspond to states that are highly entangled. | \n", "[quant-ph, hep-th, math-ph, math.MP] | \n", "[['Ilieva', 'Nevena', ''], ['Narnhofer', 'Heide', ''], ['Thirring', 'Walter', '']] | \n", "2023-05-09 | \n", "quant-ph/0401139 | \n", "
| 4 | \n", "Super black box (formerly: Middle diamond) | \n", "This is a slightly corrected version of an old work. Under certain cardinal arithmetic assumptions, we prove that for every large enough regular $\\lambda$ cardinal, for many regular $\\kappa < \\lambda$, many stationary subsets of $\\lambda$ concentrating on cofinality $\\kappa$ have super BB. In particular, we have the super BB on $\\{\\delta < \\lambda \\colon cf(\\delta) = \\kappa\\}$. This is a strong negation of uniformization. We have added some details. Works continuing it are [Sh:898] and [Sh:1028]. We thank Ari Brodski and Adi Jarden for their helpful comments. In this paper we had earlier used the notion ``middle diamond\" which is now replaced by ``super BB'', that is, ``super black box'', in order to be consistent with other papers (see [Sh:898]). | \n", "[math.LO] | \n", "[['Shelah', 'Saharon', '']] | \n", "2023-05-04 | \n", "math/0212249 | \n", "
| \n", " | title | \n", "abstract | \n", "
|---|---|---|
| 139098 | \n", "Telgarsky's conjecture may fail | \n", "Telg\\'arsky's conjecture states that for each $k \\in \\mathbb N$, there is a topological space $X_k$ such that in the Banach-Mazur game on $X_k$, the player {\\scriptsize NONEMPTY} has a winning $(k+1)$-tactic but no winning $k$-tactic. We prove that this statement is consistently false. More specifically, we prove, assuming $\\mathsf{GCH}+\\square$, that if {\\scriptsize NONEMPTY} has a winning strategy for the Banach-Mazur game on a $T_3$ space $X$, then she has a winning $2$-tactic. The proof uses a coding argument due to Galvin, whereby if $X$ has a $\\pi$-base with certain nice properties, then {\\scriptsize NONEMPTY} is able to encode, in each consecutive pair of her opponent's moves, all essential information about the play of the game before the current move. Our proof shows that under $\\mathsf{GCH}+\\square$, every $T_3$ space has a sufficiently nice $\\pi$-base that enables this coding strategy. Translated into the language of partially ordered sets, what we really show is that $\\mathsf{GCH}+\\square$ implies the following statement, which is equivalent to the existence of the \"nice'' $\\pi$-bases mentioned above: \\emph{Every separative poset $\\mathbb P$ with the $\\kappa$-cc contains a dense sub-poset $\\mathbb D$ such that $|\\{ q \\in \\mathbb D \\,:\\, p \\text{ extends } q \\}| < \\kappa$ for every $p \\in \\mathbb P$.} We prove that this statement is independent of $\\mathsf{ZFC}$: while it holds under $\\mathsf{GCH}+\\square$, it is false even for ccc posets if $\\mathfrak{b} > \\aleph_1$. We also show that if $|\\mathbb P| < \\aleph_\\omega$, then \\axiom-for-$\\mathbb P$ is a consequence of $\\mathsf{GCH}$ holding below $|\\mathbb P|$. | \n", "
| 50283 | \n", "Large Deviation Principle for the Greedy Exploration Algorithm over\\n Erd\\\"os-R\\'enyi Graphs | \n", "We prove a large deviation principle for a greedy exploration process on an Erd\\\"os-R\\'enyi (ER) graph when the number of nodes goes to infinity. To prove our main result, we use the general strategy to study large deviations of processes proposed by Feng and Kurtz, based on the convergence of non-linear semigroups. The rate function can be expressed in a closed-form formula, and associated optimization problems can be solved explicitly, providing the large deviation trajectory. Also, we derive an LDP for the size of the maximum independent set discovered by such an algorithm and analyze the probability that it exceeds known bounds for the maximal independent set. We also analyze the link between these results and the landscape complexity of the independent set and the exploration dynamic. | \n", "
| 169377 | \n", "Orthogonal expansions related to compact Gelfand pairs | \n", "Given a compact Gelfand pair (G,K) and a locally compact group L, we characterize the class P_K^\\sharp(G,L) of continuous positive definite functions f:G\\times L\\to \\C which are bi-invariant in the G-variable with respect to K. The functions of this class are the functions having a uniformly convergent expansion \\sum_{\\varphi\\in Z} B(\\varphi)(u)\\varphi(x) for x\\in G,u\\in L, where the sum is over the space Z of positive definite spherical functions \\varphi:G\\to\\C for the Gelfand pair, and (B(\\varphi))_{\\varphi\\in Z} is a family of continuous positive definite functions on L such that \\sum_{\\varphi\\in Z}B(\\varphi)(e_L)<\\infty. Here e_L is the neutral element of the group L. For a compact abelian group G considered as a Gelfand pair (G,K) with trivial K=\\{e_G\\}, we obtain a characterization of P(G\\times L) in terms of Fourier expansions on the dual group \\widehat{G}. The result is described in detail for the case of the Gelfand pairs (O(d+1),O(d)) and (U(q),U(q-1)) as well as for the product of these Gelfand pairs. The result generalizes recent theorems of Berg-Porcu (2016) and Guella-Menegatto (2016) | \n", "
| 32935 | \n", "Congruent numbers, elliptic curves, and the passage from the local to\\n the global: an update | \n", "This update to my article on Congruent numbers, elliptic curves, and the passage from the local to the global, which appeared in Resonance, December 2009, pp. 1183--1205 (https://www.ias.ac.in/describe/article/reso/014/12/1183-1205) and was posted here as arXiv:0704.3783, covers a few recent advances in the arithmetic of elliptic curves with special reference to the congruent number problem. | \n", "
| 38604 | \n", "Around the nonlinear Ryll-Nardzewski theorem | \n", "Suppose that $Q$ is a weak$^{\\ast }$ compact convex subset of a dual Banach space with the Radon-Nikod\\'{y}m property. We show that if $(S,Q)$ is a nonexpansive and norm-distal dynamical system, then there is a fixed point of $S$ in $Q$ and the set of fixed points is a nonexpansive retract of $Q.$ As a consequence we obtain a nonlinear extension of the Bader-Gelander-Monod theorem concerning isometries in $L$-embedded Banach spaces. A similar statement is proved for weakly compact convex subsets of a locally convex space, thus giving the nonlinear counterpart of the Ryll-Nardzewski theorem. | \n", "
| 132354 | \n", "New upper bounds for the bondage number of a graph in terms of its\\n maximum degree and Euler characteristic | \n", "The bondage number $b(G)$ of a graph $G$ is the smallest number of edges whose removal from $G$ results in a graph with larger domination number. Let $G$ be embeddable on a surface whose Euler characteristic $\\chi$ is as large as possible, and assume $\\chi\\leq0$. Gagarin-Zverovich and Huang have recently found upper bounds of $b(G)$ in terms of the maximum degree $\\Delta(G)$ and the Euler characteristic $\\chi(G)=\\chi$. In this paper we prove a better upper bound $b(G)\\leq\\Delta(G)+\\lfloor t\\rfloor$ where $t$ is the largest real root of the cubic equation $z^3 + z^2 + (3\\chi - 8)z + 9\\chi - 12=0$; this upper bound is asymptotically equivalent to $b(G)\\leq\\Delta(G)+1+\\lfloor \\sqrt{4-3\\chi} \\rfloor$. We also establish further improved upper bounds for $b(G)$ when the girth, order, or size of the graph $G$ is large compared with its Euler characteristic $\\chi$. | \n", "
| \n", " | abstract | \n", "inline_removed | \n", "
|---|---|---|
| 139098 | \n", "Telg\\'arsky's conjecture states that for each $k \\in \\mathbb N$, there is a topological space $X_k$ such that in the Banach-Mazur game on $X_k$, the player {\\scriptsize NONEMPTY} has a winning $(k+1)$-tactic but no winning $k$-tactic. We prove that this statement is consistently false. More specifically, we prove, assuming $\\mathsf{GCH}+\\square$, that if {\\scriptsize NONEMPTY} has a winning strategy for the Banach-Mazur game on a $T_3$ space $X$, then she has a winning $2$-tactic. The proof uses a coding argument due to Galvin, whereby if $X$ has a $\\pi$-base with certain nice properties, then {\\scriptsize NONEMPTY} is able to encode, in each consecutive pair of her opponent's moves, all essential information about the play of the game before the current move. Our proof shows that under $\\mathsf{GCH}+\\square$, every $T_3$ space has a sufficiently nice $\\pi$-base that enables this coding strategy. Translated into the language of partially ordered sets, what we really show is that $\\mathsf{GCH}+\\square$ implies the following statement, which is equivalent to the existence of the \"nice'' $\\pi$-bases mentioned above: \\emph{Every separative poset $\\mathbb P$ with the $\\kappa$-cc contains a dense sub-poset $\\mathbb D$ such that $|\\{ q \\in \\mathbb D \\,:\\, p \\text{ extends } q \\}| < \\kappa$ for every $p \\in \\mathbb P$.} We prove that this statement is independent of $\\mathsf{ZFC}$: while it holds under $\\mathsf{GCH}+\\square$, it is false even for ccc posets if $\\mathfrak{b} > \\aleph_1$. We also show that if $|\\mathbb P| < \\aleph_\\omega$, then \\axiom-for-$\\mathbb P$ is a consequence of $\\mathsf{GCH}$ holding below $|\\mathbb P|$. | \n", "Telg\\'arsky's conjecture states that for each MATH, there is a topological space MATH such that in the Banach-Mazur game on MATH, the player {\\scriptsize NONEMPTY} has a winning MATH-tactic but no winning MATH-tactic. We prove that this statement is consistently false. More specifically, we prove, assuming MATH, that if {\\scriptsize NONEMPTY} has a winning strategy for the Banach-Mazur game on a MATH space MATH, then she has a winning MATH-tactic. The proof uses a coding argument due to Galvin, whereby if MATH has a MATH-base with certain nice properties, then {\\scriptsize NONEMPTY} is able to encode, in each consecutive pair of her opponent's moves, all essential information about the play of the game before the current move. Our proof shows that under MATH, every MATH space has a sufficiently nice MATH-base that enables this coding strategy. Translated into the language of partially ordered sets, what we really show is that MATH implies the following statement, which is equivalent to the existence of the \"nice'' MATH-bases mentioned above: \\emph{Every separative poset MATH with the MATH-cc contains a dense sub-poset MATH such that MATH for every MATH.} We prove that this statement is independent of MATH: while it holds under MATH, it is false even for ccc posets if MATH. We also show that if MATH, then \\axiom-for-MATH is a consequence of MATH holding below MATH. | \n", "
| 50283 | \n", "We prove a large deviation principle for a greedy exploration process on an Erd\\\"os-R\\'enyi (ER) graph when the number of nodes goes to infinity. To prove our main result, we use the general strategy to study large deviations of processes proposed by Feng and Kurtz, based on the convergence of non-linear semigroups. The rate function can be expressed in a closed-form formula, and associated optimization problems can be solved explicitly, providing the large deviation trajectory. Also, we derive an LDP for the size of the maximum independent set discovered by such an algorithm and analyze the probability that it exceeds known bounds for the maximal independent set. We also analyze the link between these results and the landscape complexity of the independent set and the exploration dynamic. | \n", "We prove a large deviation principle for a greedy exploration process on an Erd\\\"os-R\\'enyi (ER) graph when the number of nodes goes to infinity. To prove our main result, we use the general strategy to study large deviations of processes proposed by Feng and Kurtz, based on the convergence of non-linear semigroups. The rate function can be expressed in a closed-form formula, and associated optimization problems can be solved explicitly, providing the large deviation trajectory. Also, we derive an LDP for the size of the maximum independent set discovered by such an algorithm and analyze the probability that it exceeds known bounds for the maximal independent set. We also analyze the link between these results and the landscape complexity of the independent set and the exploration dynamic. | \n", "
| 169377 | \n", "Given a compact Gelfand pair (G,K) and a locally compact group L, we characterize the class P_K^\\sharp(G,L) of continuous positive definite functions f:G\\times L\\to \\C which are bi-invariant in the G-variable with respect to K. The functions of this class are the functions having a uniformly convergent expansion \\sum_{\\varphi\\in Z} B(\\varphi)(u)\\varphi(x) for x\\in G,u\\in L, where the sum is over the space Z of positive definite spherical functions \\varphi:G\\to\\C for the Gelfand pair, and (B(\\varphi))_{\\varphi\\in Z} is a family of continuous positive definite functions on L such that \\sum_{\\varphi\\in Z}B(\\varphi)(e_L)<\\infty. Here e_L is the neutral element of the group L. For a compact abelian group G considered as a Gelfand pair (G,K) with trivial K=\\{e_G\\}, we obtain a characterization of P(G\\times L) in terms of Fourier expansions on the dual group \\widehat{G}. The result is described in detail for the case of the Gelfand pairs (O(d+1),O(d)) and (U(q),U(q-1)) as well as for the product of these Gelfand pairs. The result generalizes recent theorems of Berg-Porcu (2016) and Guella-Menegatto (2016) | \n", "Given a compact Gelfand pair (G,K) and a locally compact group L, we characterize the class P_K^\\sharp(G,L) of continuous positive definite functions f:G\\times L\\to \\C which are bi-invariant in the G-variable with respect to K. The functions of this class are the functions having a uniformly convergent expansion \\sum_{\\varphi\\in Z} B(\\varphi)(u)\\varphi(x) for x\\in G,u\\in L, where the sum is over the space Z of positive definite spherical functions \\varphi:G\\to\\C for the Gelfand pair, and (B(\\varphi))_{\\varphi\\in Z} is a family of continuous positive definite functions on L such that \\sum_{\\varphi\\in Z}B(\\varphi)(e_L)<\\infty. Here e_L is the neutral element of the group L. For a compact abelian group G considered as a Gelfand pair (G,K) with trivial K=\\{e_G\\}, we obtain a characterization of P(G\\times L) in terms of Fourier expansions on the dual group \\widehat{G}. The result is described in detail for the case of the Gelfand pairs (O(d+1),O(d)) and (U(q),U(q-1)) as well as for the product of these Gelfand pairs. The result generalizes recent theorems of Berg-Porcu (2016) and Guella-Menegatto (2016) | \n", "
| 32935 | \n", "This update to my article on Congruent numbers, elliptic curves, and the passage from the local to the global, which appeared in Resonance, December 2009, pp. 1183--1205 (https://www.ias.ac.in/describe/article/reso/014/12/1183-1205) and was posted here as arXiv:0704.3783, covers a few recent advances in the arithmetic of elliptic curves with special reference to the congruent number problem. | \n", "This update to my article on Congruent numbers, elliptic curves, and the passage from the local to the global, which appeared in Resonance, December 2009, pp. 1183--1205 (https://www.ias.ac.in/describe/article/reso/014/12/1183-1205) and was posted here as arXiv:0704.3783, covers a few recent advances in the arithmetic of elliptic curves with special reference to the congruent number problem. | \n", "
| 38604 | \n", "Suppose that $Q$ is a weak$^{\\ast }$ compact convex subset of a dual Banach space with the Radon-Nikod\\'{y}m property. We show that if $(S,Q)$ is a nonexpansive and norm-distal dynamical system, then there is a fixed point of $S$ in $Q$ and the set of fixed points is a nonexpansive retract of $Q.$ As a consequence we obtain a nonlinear extension of the Bader-Gelander-Monod theorem concerning isometries in $L$-embedded Banach spaces. A similar statement is proved for weakly compact convex subsets of a locally convex space, thus giving the nonlinear counterpart of the Ryll-Nardzewski theorem. | \n", "Suppose that MATH is a weakMATH compact convex subset of a dual Banach space with the Radon-Nikod\\'{y}m property. We show that if MATH is a nonexpansive and norm-distal dynamical system, then there is a fixed point of MATH in MATH and the set of fixed points is a nonexpansive retract of MATH As a consequence we obtain a nonlinear extension of the Bader-Gelander-Monod theorem concerning isometries in MATH-embedded Banach spaces. A similar statement is proved for weakly compact convex subsets of a locally convex space, thus giving the nonlinear counterpart of the Ryll-Nardzewski theorem. | \n", "
| 132354 | \n", "The bondage number $b(G)$ of a graph $G$ is the smallest number of edges whose removal from $G$ results in a graph with larger domination number. Let $G$ be embeddable on a surface whose Euler characteristic $\\chi$ is as large as possible, and assume $\\chi\\leq0$. Gagarin-Zverovich and Huang have recently found upper bounds of $b(G)$ in terms of the maximum degree $\\Delta(G)$ and the Euler characteristic $\\chi(G)=\\chi$. In this paper we prove a better upper bound $b(G)\\leq\\Delta(G)+\\lfloor t\\rfloor$ where $t$ is the largest real root of the cubic equation $z^3 + z^2 + (3\\chi - 8)z + 9\\chi - 12=0$; this upper bound is asymptotically equivalent to $b(G)\\leq\\Delta(G)+1+\\lfloor \\sqrt{4-3\\chi} \\rfloor$. We also establish further improved upper bounds for $b(G)$ when the girth, order, or size of the graph $G$ is large compared with its Euler characteristic $\\chi$. | \n", "The bondage number MATH of a graph MATH is the smallest number of edges whose removal from MATH results in a graph with larger domination number. Let MATH be embeddable on a surface whose Euler characteristic MATH is as large as possible, and assume MATH. Gagarin-Zverovich and Huang have recently found upper bounds of MATH in terms of the maximum degree MATH and the Euler characteristic MATH. In this paper we prove a better upper bound MATH where MATH is the largest real root of the cubic equation MATH; this upper bound is asymptotically equivalent to MATH. We also establish further improved upper bounds for MATH when the girth, order, or size of the graph MATH is large compared with its Euler characteristic MATH. | \n", "
| \n", " | title | \n", "abstract | \n", "
|---|---|---|
| 90755 | \n", "Symmetric Ideal Magnetofluidostatic Equilibria with Non-Vanishing\\n Pressure Gradients in Asymmetric Confinement Vessels | \n", "We study the possibility of constructing steady magnetic fields satisfying the force balance equation of ideal magnetohydrodynamics with tangential boundary conditions in asymmetric confinement vessels, i.e. bounded regions that are not invariant under continuous Euclidean isometries (translations, rotations, or their combination). This problem is often encountered in the design of next-generation fusion reactors. We show that such configurations are possible if one relaxes the standard assumption that the vessel boundary corresponds to a pressure isosurface. We exhibit a smooth solution that possesses an Euclidean symmetry and yet solves the boundary value problem in an asymmetric ellipsoidal domain while sustaining a non-vanishing pressure gradient. This result provides a definitive answer to the problem of existence of regular ideal magnetofluidostatic equilibria in asymmetric bounded domains. The question remains open whether regular asymmetric solutions of the boundary value problem exist. | \n", "
| 18805 | \n", "Improved Sample Complexity Bounds for Branch-and-Cut | \n", "Branch-and-cut is the most widely used algorithm for solving integer programs, employed by commercial solvers like CPLEX and Gurobi. Branch-and-cut has a wide variety of tunable parameters that have a huge impact on the size of the search tree that it builds, but are challenging to tune by hand. An increasingly popular approach is to use machine learning to tune these parameters: using a training set of integer programs from the application domain at hand, the goal is to find a configuration with strong predicted performance on future, unseen integer programs from the same domain. If the training set is too small, a configuration may have good performance over the training set but poor performance on future integer programs. In this paper, we prove sample complexity guarantees for this procedure, which bound how large the training set should be to ensure that for any configuration, its average performance over the training set is close to its expected future performance. Our guarantees apply to parameters that control the most important aspects of branch-and-cut: node selection, branching constraint selection, and cutting plane selection, and are sharper and more general than those found in prior research. | \n", "
| 165414 | \n", "Yorioka's characterization of the cofinality of the strong measure zero\\n ideal and its independency from the continuum | \n", "In this paper we present a simpler proof of the fact that no inequality between LATEX and LATEX can be decided in ZFC by using well-known tecniques and results. | \n", "
| 139352 | \n", "The Janson inequalities for general up-sets | \n", "Janson and Janson, Luczak and Rucinski proved several inequalities for the lower tail of the distribution of the number of events that hold, when all the events are up-sets (increasing events) of a special form - each event is the intersection of some subset of a single set of independent events (i.e., a principal up-set). We show that these inequalities in fact hold for arbitrary up-sets, by modifying existing proofs to use only positive correlation, avoiding the need to assume positive correlation conditioned on one of the events. | \n", "
| 168337 | \n", "Priority Maps for Surveillance and Intervention of Wildfires and other\\n Spreading Processes | \n", "Unmanned Aerial Vehicle (UAV) path planning algorithms often assume a knowledge reward function or priority map, indicating the most important areas to visit. In this paper we propose a method to create priority maps for monitoring or intervention of dynamic spreading processes such as wildfires. The presented optimization framework utilizes the properties of positive systems, in particular the separable structure of value (cost-to-go) functions, to provide scalable algorithms for surveillance and intervention. We present results obtained for a 16 and 1000 node example and convey how the priority map responds to changes in the dynamics of the system. The larger example of 1000 nodes, representing a fictional landscape, shows how the method can integrate bushfire spreading dynamics, landscape and wind conditions. Finally, we give an example of combining the proposed method with a travelling salesman problem for UAV path planning for wildfire intervention. | \n", "
| ... | \n", "... | \n", "... | \n", "
| 85379 | \n", "The Hart-Shelah example, in stronger logics | \n", "We generalize the Hart-Shelah example to higher infinitary logics. We build, for each natural number LATEX and for each infinite cardinal LATEX a sentence LATEX of the logic LATEX that (modulo mild set theoretical hypotheses around LATEX and assuming LATEX is categorical in LATEX but not in LATEX (or beyond); we study the dimensional encoding of combinatorics involved in the construction of this sentence and study various model-theoretic properties of the resulting abstract elementary class LATEX in the finite interval of cardinals LATEX | \n", "
| 122358 | \n", "Relative non-pluripolar products of currents | \n", "Given a closed positive current T on a compact Kahler manifold X, we introduce the notion of non-pluripolar product relative to T of closed positive (1,1)-currents. We recover the well-known non-pluripolar product when T is the current of integration along X. Our main results are a monotonicity property of relative non-pluripolar products, a necessary condition for currents to be of relative full mass intersection in terms of Lelong numbers, and the convexity of weighted classes of currents of relative full mass intersection. The former two results are new even when T is the current of integration along X. | \n", "
| 153436 | \n", "Schemes supported on the singular locus of a hyperplane arrangement in\\n $\\mathbb P^n$ | \n", "We introduce the use of liaison addition to the study of hyperplane arrangements. For an arrangement, LATEX of hyperplanes in LATEX LATEX is free if LATEX is Cohen-Macaulay, where LATEX is the Jacobian ideal of LATEX Terao's conjecture says that freeness of LATEX is determined by the combinatorics of the intersection lattice of LATEX We study the Cohen-Macaulayness of three other ideals, all unmixed, that are closely related to LATEX Let LATEX be the intersection of height two primary components of LATEX and LATEX be the radical of LATEX Our third ideal is LATEX for suitable LATEX With a mild hypothesis we use liaison addition to show that all of these ideals are Cohen-Macaulay. When our hypothesis does not hold, we show that these ideals are not necessarily Cohen-Macaulay, and that Cohen-Macaulayness of any of these ideals does not imply Cohen-Macaulayness of any of the others. While we do not study the freeness of LATEX we show by example that the Betti diagrams can vary even for arrangements with the same combinatorics. We then study the situation when the hypothesis does not hold. For equidimensional curves in LATEX the Hartshorne-Rao module from liaison theory measures the failure of an ideal to be Cohen-Macaulay, degree by degree, and also determines the even liaison class of such a curve. We show that for any positive integer LATEX there is an arrangement LATEX for which LATEX fails to be Cohen-Macaulay in only one degree, and this failure is by LATEX we also give an analogous result for LATEX | \n", "
| 62339 | \n", "Clifford deformations of Koszul Frobenius algebras and noncommutative\\n quadrics | \n", "Let LATEX be a Koszul Frobenius algebra. A Clifford deformation of LATEX is a finite dimensional LATEX algebra LATEX which corresponds to a noncommutative quadric hypersurface LATEX for some central regular element LATEX It turns out that the bounded derived category LATEX is equivalent to the stable category of the maximal Cohen-Macaulay modules over LATEX provided that LATEX is noetherian. As a consequence, LATEX is a noncommutative isolated singularity if and only if the corresponding Clifford deformation LATEX is a semisimple LATEX algebra. The preceding equivalence of triangulated categories also indicates that Clifford deformations of trivial extensions of a Koszul Frobenius algebra are related to the Knorrer Periodicity Theorem for quadric hypersurfaces. As an application, we recover Knorrer Periodicity Theorem without using of matrix factorizations. | \n", "
| 117210 | \n", "Causal Factorization and Linear Feedback | \n", "An algebraic framework for the investigation of linear dynamic output feedback is introduced. Pivotal in the present theory is the problem of causal factorization, i.e. the problem of factoring two systems over each other through a causal factor. The basic issues are resolved with the aid of the new concept of latency kernels. | \n", "
100 rows × 2 columns
\n", "| \n", " | title | \n", "abstract | \n", "
|---|---|---|
| 172804 | \n", "First order convergence and roots | \n", "Nesetril and Ossona de Mendez introduced the notion of first order convergence, which unifies the notions of convergence for sparse and dense graphs. They asked whether if G_i is a sequence of graphs with M being their first order limit and v is a vertex of M, then there exists a sequence v_i of vertices such that the graphs G_i rooted at v_i converge to M rooted at v. We show that this holds for almost all vertices v of M and we give an example showing that the statement need not hold for all vertices. | \n", "
| 117253 | \n", "Uniqueness for contagious McKean--Vlasov systems in the weak feedback\\n regime | \n", "We present a simple uniqueness argument for a collection of McKean-Vlasov problems that have seen recent interest. Our first result shows that, in the weak feedback regime, there is global uniqueness for a very general class of random drivers. By weak feedback we mean the case where the contagion parameters are small enough to prevent blow-ups in solutions. Next, we specialise to a Brownian driver and show how the same techniques can be extended to give short-time uniqueness after blow-ups, regardless of the feedback strength. The heart of our approach is a surprisingly simple probabilistic comparison argument that is robust in the sense that it does not ask for any regularity of the solutions. | \n", "
| 23755 | \n", "$n$-Kazhdan groups and higher spectral expanders | \n", "Let LATEX be a group of type LATEX and let LATEX be the LATEX skeleton of the universal cover of a LATEX simplicial complex with finite LATEX skeleton. We show that if LATEX is strongly LATEX then for any family of finite index subgroups LATEX the family of simplicial complexes LATEX are bounded degree LATEX spectral expanders. Using this we construct new examples of LATEX dimensional spectral expanders. | \n", "
| 2822 | \n", "A 1-dimensional formal group over the prismatization of Spf Z_p | \n", "Let Sigma denote the prismatization of Spf (Z_p). The multiplicative group over Sigma maps to the prismatization of the multiplicative group over Spf (Z_p). We prove that the kernel of this map is the Cartier dual of some 1-dimensional formal group over Sigma. We obtain some results about this formal group (e.g., we describe its Lie algebra). We give a very explicit description of the pullback of the formal group to the quotient of the q-de Rham prism by the action of the multiplicative group of Z_p. | \n", "
| 8528 | \n", "Strong replica symmetry in high-dimensional optimal Bayesian inference | \n", "We consider generic optimal Bayesian inference, namely, models of signal reconstruction where the posterior distribution and all hyperparameters are known. Under a standard assumption on the concentration of the free energy, we show how replica symmetry in the strong sense of concentration of all multioverlaps can be established as a consequence of the Franz-de Sanctis identities; the identities themselves in the current setting are obtained via a novel perturbation coming from exponentially distributed \"side-observations\" of the signal. Concentration of multioverlaps means that asymptotically the posterior distribution has a particularly simple structure encoded by a random probability measure (or, in the case of binary signal, a non-random probability measure). We believe that such strong control of the model should be key in the study of inference problems with underlying sparse graphical structure (error correcting codes, block models, etc) and, in particular, in the rigorous derivation of replica symmetric formulas for the free energy and mutual information in this context. | \n", "
| 142660 | \n", "Infinite dimensional systems of particles with interactions given by\\n Dunkl operators | \n", "Firstly we consider a finite dimensional Markov semigroup generated by Dunkl laplacian with drift terms. Using gradient bounds we show that for small coefficients this semigroup has an invariant measure. We then extend this analysis to an infinite dimensional semigroup on LATEX which we construct using gradient bounds, and finally we study the existence of invariant measures and ergodicity properties. | \n", "
| 106924 | \n", "The Erd\\H{o}s-Ko-Rado theorem for $2$-intersecting families of perfect\\n matchings | \n", "A perfect matching in the complete graph on LATEX vertices is a set of edges such that no two edges have a vertex in common and every vertex is covered exactly once. Two perfect matchings are said to be LATEX if they have at least LATEX edges in common. The main result in this paper is an extension of the famous Erdos-Ko-Rado (EKR) theorem to 2-intersecting families of perfect matchings for all values of LATEX Specifically, for LATEX a set of 2-intersecting perfect matchings in LATEX of maximum size has LATEX perfect matchings. | \n", "
| 99296 | \n", "On the Yau-Tian-Donaldson conjecture for generalized K\\\"ahler-Ricci\\n soliton equations | \n", "Let LATEX be a log variety with an effective holomorphic torus action, and LATEX be a closed positive LATEX For any smooth positive function LATEX defined on the moment polytope of the torus action, we study the Monge-Ampere equations that correspond to generalized and twisted Kahler-Ricci LATEX We prove a version of Yau-Tian-Donaldson (YTD) conjecture for these general equations, showing that the existence of solutions is always equivalent to an equivariantly uniform LATEX LATEX When LATEX is a current associated to a torus invariant linear system, we further show that equivariant special test configurations suffice for testing the stability. Our results allow arbitrary klt singularities and generalize most of previous results on (uniform) YTD conjecture for (twisted) Kahler-Ricci/Mabuchi solitons or Kahler-Einstein metrics. | \n", "
| 18873 | \n", "Equivariant log-concavity and equivariant K\\\"ahler packages | \n", "We show that the exterior algebra LATEX which is the cohomology of the torus LATEX and the polynomial ring LATEX which is the cohomology of the classifying space LATEX are LATEX log-concave. We do so by explicitly giving the LATEX maps on the appropriate sequences of tensor products of polynomials or exterior powers and proving that these maps satisfy the hard Lefschetz theorem. Furthermore, we prove that the whole Kahler package, including algebraic analogies of the Poincare duality, hard Lefschetz, and Hodge-Riemann bilinear relations, holds on the corresponding sequences in an equivariant setting. | \n", "
| 70252 | \n", "Nullstellensatz for relative existentially closed groups | \n", "We prove that in every variety of LATEX every LATEX closed element satisfies nullstellensatz for finite consistent systems of equations. This will generalize {f Theorem G} of . As a result we see that every pair of LATEX closed elements in an arbitrary variety of LATEX generate the same quasi-variety and if both of them are LATEX they are geometrically equivalent. | \n", "
| \n", " | 70252 | \n", "
|---|---|
| title | \n", "Nullstellensatz for relative existentially closed groups | \n", "
| abstract | \n", "We prove that in every variety of $G$-groups, every $G$-existentially closed element satisfies nullstellensatz for finite consistent systems of equations. This will generalize {\\bf Theorem G} of \\cite{BMR1}. As a result we see that every pair of $G$-existentially closed elements in an arbitrary variety of $G$-groups generate the same quasi-variety and if both of them are $q_{\\omega}$-compact, they are geometrically equivalent. | \n", "
| \n", " | title | \n", "abstract | \n", "
|---|---|---|
| 40538 | \n", "Online Coloring of Short Intervals | \n", "We study the online graph coloring problem restricted to the intersection graphs of intervals with lengths in LATEX For LATEX it is the class of unit interval graphs, and for LATEX the class of all interval graphs. Our focus is on intermediary classes. We present a LATEX algorithm, which beats the state of the art for LATEX and proves that the problem we study can be strictly easier than online coloring of general interval graphs. On the lower bound side, we prove that no algorithm is better than LATEX for any LATEX nor better than LATEX for any LATEX and that no algorithm beats the LATEX asymptotic competitive ratio for all, arbitrarily large, values of LATEX That last result shows that the problem we study can be strictly harder than unit interval coloring. Our main technical contribution is a recursive composition of strategies, which seems essential to prove any lower bound higher than LATEX | \n", "
| 47680 | \n", "How Data Augmentation affects Optimization for Linear Regression | \n", "Though data augmentation has rapidly emerged as a key tool for optimization in modern machine learning, a clear picture of how augmentation schedules affect optimization and interact with optimization hyperparameters such as learning rate is nascent. In the spirit of classical convex optimization and recent work on implicit bias, the present work analyzes the effect of augmentation on optimization in the simple convex setting of linear regression with MSE loss. We find joint schedules for learning rate and data augmentation scheme under which augmented gradient descent provably converges and characterize the resulting minimum. Our results apply to arbitrary augmentation schemes, revealing complex interactions between learning rates and augmentations even in the convex setting. Our approach interprets augmented (S)GD as a stochastic optimization method for a time-varying sequence of proxy losses. This gives a unified way to analyze learning rate, batch size, and augmentations ranging from additive noise to random projections. From this perspective, our results, which also give rates of convergence, can be viewed as Monro-Robbins type conditions for augmented (S)GD. | \n", "
| 81002 | \n", "Rationally weighted Hurwitz numbers, Meijer $G$-functions and matrix\\n integrals | \n", "The quantum spectral curve equation associated to KP LATEX of hypergeometric type serving as generating functions for rationally weighted Hurwitz numbers is solved by generalized hypergeometric series. The basis elements spanning the corresponding Sato Grassmannian element are shown to be Meijer LATEX or their asymptotic series. Using their Mellin integral representation the LATEX evaluated at the trace invariants of an externally coupled matrix, is expressed as a matrix integral. | \n", "
| 137982 | \n", "Global well-posedness of the energy critical Nonlinear Schr\\\"odinger\\n equation with small initial data in H^1(T^3) | \n", "A refined trilinear Strichartz estimate for solutions to the Schrodinger equation on the flat rational torus T^3 is derived. By a suitable modification of critical function space theory this is applied to prove a small data global well-posedness result for the quintic Nonlinear Schrodinger Equation in H^s(T^3) for all s \\geq 1. This is the first energy-critical global well-posedness result in the setting of compact manifolds. | \n", "
| 40719 | \n", "A complete answer to the Gaveau--Brockett problem | \n", "The note is dedicated to provide a satisfying and complete answer to the long-standing Gaveau--Brockett open problem. More precisely, we determine the exact formula of the Carnot--Caratheodory distance on arbitrary step-two groups. The basic idea of the proof is combining Varadhan's formulas with the explicit expression for the associated heat kernel LATEX and the method of stationary phase. However, we have to introduce a number of original new methods, especially the usage of the concept of \"Operator convexity\". Next, new integral expressions for LATEX by means of properties of Bessel functions will be presented. An unexpected direct proof for the well-known positivity of LATEX via its original integral formula, will play an important role. Furthermore, all normal geodesics joining the identity element LATEX to any given LATEX as well as the cut locus can be characterized on every step-two groups. Finally, the corresponding results in Riemannian geometry on step-two groups will be briefly presented as well. | \n", "
| 77056 | \n", "An analog of perfect numbers involving the unitary totient function | \n", "We shall give some results for an integer divisible by its unitary totient. | \n", "
| 1355 | \n", "$\\mathbb{Z}_p\\mathbb{Z}_{p^2}\\dots\\mathbb{Z}_{p^s}$-Additive Generalized\\n Hadamard Codes | \n", "The LATEX codes are subgroups of LATEX and can be seen as linear codes over LATEX when LATEX for all LATEX a LATEX code when LATEX for all LATEX , or a LATEX code when LATEX or LATEX codes when LATEX and LATEX A LATEX generalized Hadamard (GH) code is a GH code over LATEX which is the Gray map image of a LATEX code. In this paper, we generalize some known results for LATEX GH codes with LATEX prime and LATEX First, we give a recursive construction of LATEX GH codes of type LATEX with LATEX and LATEX Then, we show for which types the corresponding LATEX GH codes are nonlinear over LATEX We also compute the kernel and its dimension whenever they are nonlinear. | \n", "
| 146820 | \n", "Momentum and Position Representations for the q-deformed Euclidean\\n Quantum Space | \n", "We summarize some basics about mathematical tools of analysis for the q-deformed Euclidean space. We use the new tools to examine q-deformed eigenfunctions of the momentum or position operator within the framework of the star product formalism. We show that these two systems of functions are complete and orthonormal. With the q-deformed momentum or position eigenfunctions, we calculate matrix elements of the momentum or position operator. Considerations about expectation values and probability densities conclude the studies. | \n", "
| 17050 | \n", "Gacs-Korner Common Information Variational Autoencoder | \n", "We propose a notion of common information that allows one to quantify and separate the information that is shared between two random variables from the information that is unique to each. Our notion of common information is a variational relaxation of the Gacs-Korner common information, which we recover as a special case, but is more amenable to optimization and can be approximated empirically using samples from the underlying distribution. We then provide a method to partition and quantify the common and unique information using a simple modification of a traditional variational auto-encoder. Empirically, we demonstrate that our formulation allows us to learn semantically meaningful common and unique factors of variation even on high-dimensional data such as images and videos. Moreover, on datasets where ground-truth latent factors are known, we show that we can accurately quantify the common information between the random variables. Additionally, we show that the auto-encoder that we learn recovers semantically meaningful disentangled factors of variation, even though we do not explicitly optimize for it. | \n", "
| 13817 | \n", "Filtrations and torsion pairs in Abramovich Polishchuk's heart | \n", "We study some abelian subcategories and torsion pairs in Abramovich Polishchuk's heart. And we construct stability conditions on a full triangulated subcategory LATEX in LATEX for an arbitrary smooth projective variety S. We also define a notion of LATEX level stability, which is a generalization of the slope stability and the Gieseker stability. We show that for any object E in Abramovich Polishchuk's heart, there is a unique filtration whose factors are LATEX level semistable, and the phase vectors are decreasing in a lexicographic order. | \n", "
| \n", " | title | \n", "abstract | \n", "cat | \n", "authors_parsed | \n", "update_date | \n", "id | \n", "clean_abstract | \n", "keywords | \n", "
|---|---|---|---|---|---|---|---|---|
| 125174 | \n", "Decentralized Charging Control of Electric Vehicles in Residential\\n Distribution Networks | \n", "Electric vehicle (EV) charging can negatively impact electric distribution networks by exceeding equipment thermal ratings and causing voltages to drop below standard ranges. In this paper, we develop a decentralized EV charging control scheme to achieve \"valley-filling\" (i.e., flattening demand profile during overnight charging), meanwhile meeting heterogeneous individual charging requirements and satisfying distribution network constraints. The formulated problem is an optimization problem with a non-separable objective function and strongly coupled inequality constraints. We propose a novel shrunken primal-dual subgradient (SPDS) algorithm to support the decentralized control scheme, derive conditions guaranteeing its convergence, and verify its efficacy and convergence with a representative distribution network model. | \n", "[math.OC] | \n", "[['Liu', 'Mingxi', ''], ['Phanivong', 'Phillippe K.', ''], ['Shi', 'Yang', ''], ['Callaway', 'Duncan S.', '']] | \n", "2020-04-02 | \n", "1710.05533 | \n", "Electric vehicle (EV) charging can negatively impact electric distribution networks by exceeding equipment thermal ratings and causing voltages to drop below standard ranges. In this paper, we develop a decentralized EV charging control scheme to achieve \"valley-filling\" (i.e., flattening demand profile during overnight charging), meanwhile meeting heterogeneous individual charging requirements and satisfying distribution network constraints. The formulated problem is an optimization problem with a non-separable objective function and strongly coupled inequality constraints. We propose a novel shrunken primal-dual subgradient (SPDS) algorithm to support the decentralized control scheme, derive conditions guaranteeing its convergence, and verify its efficacy and convergence with a representative distribution network model. | \n", "[non-separable, primal-dual, valley-filling] | \n", "
| 91765 | \n", "Geodesic orbit metrics on homogeneous spaces constructed by strongly\\n isotropy irreducible spaces | \n", "In this paper, we focus on homogeneous spaces which are constructed from two strongly isotropy irreducible spaces, and prove that any geodesic orbit metric on these spaces is naturally reductive. | \n", "[math.DG] | \n", "[['Chen', 'Huibin', ''], ['Chen', 'Zhiqi', ''], ['Zhu', 'Fuhai', '']] | \n", "2020-12-15 | \n", "2012.07015 | \n", "In this paper, we focus on homogeneous spaces which are constructed from two strongly isotropy irreducible spaces, and prove that any geodesic orbit metric on these spaces is naturally reductive. | \n", "None | \n", "
| 154012 | \n", "ISS Property with Respect to Boundary Disturbances for a Class of\\n Riesz-Spectral Boundary Control Systems | \n", "This paper deals with the establishment of Input-to-State Stability (ISS) estimates for infinite dimensional systems with respect to both boundary and distributed disturbances. First, a new approach is developed for the establishment of ISS estimates for a class of Riesz-spectral boundary control systems satisfying certain eigenvalue constraints. Second, a concept of weak solutions is introduced in order to relax the disturbances regularity assumptions required to ensure the existence of classical solutions. The proposed concept of weak solutions, that applies to a large class of boundary control systems which is not limited to the Riesz-spectral ones, provides a natural extension of the concept of both classical and mild solutions. Assuming that an ISS estimate holds true for classical solutions, we show the existence, the uniqueness, and the ISS property of the weak solutions. | \n", "[math.OC, cs.SY] | \n", "[['Lhachemi', 'Hugo', ''], ['Shorten', 'Robert', '']] | \n", "2019-08-07 | \n", "1810.03553 | \n", "This paper deals with the establishment of Input-to-State Stability (ISS) estimates for infinite dimensional systems with respect to both boundary and distributed disturbances. First, a new approach is developed for the establishment of ISS estimates for a class of Riesz-spectral boundary control systems satisfying certain eigenvalue constraints. Second, a concept of weak solutions is introduced in order to relax the disturbances regularity assumptions required to ensure the existence of classical solutions. The proposed concept of weak solutions, that applies to a large class of boundary control systems which is not limited to the Riesz-spectral ones, provides a natural extension of the concept of both classical and mild solutions. Assuming that an ISS estimate holds true for classical solutions, we show the existence, the uniqueness, and the ISS property of the weak solutions. | \n", "[Input-to-State, Riesz-spectral] | \n", "
| 11152 | \n", "A new class of higher-ordered/extended Boussinesq system for efficient\\n numerical simulations by splitting operators | \n", "In this work, we numerically study the higher-ordered/extended Boussinesq system describing the propagation of water-waves over flat topography. A reformulation of the same order of precision that avoids the calculation of high order derivatives on the surface deformation is proposed. We show that this formulation enjoys an extended range of applicability while remaining stable. Moreover, a significant improvement in terms of linear dispersive properties in high frequency regime is made due to the suitable adjustment of a dispersion correction parameter. We develop a second order splitting scheme where the hyperbolic part of the system is treated with a high-order finite volume scheme and the dispersive part is treated with a finite difference approach. Numerical simulations are then performed under two main goals: validating the model and the numerical methods and assessing the potential need of such higher-order model. \\red{The applicability of the proposed model and numerical method in practical problems is illustrated by a comparison with experimental data.} | \n", "[math.AP] | \n", "[['Lteif', 'Ralph', '', 'LAMA'], ['Gerbi', 'Stéphane', '', 'LAMA']] | \n", "2022-07-04 | \n", "2102.09849 | \n", "In this work, we numerically study the higher-ordered/extended Boussinesq system describing the propagation of water-waves over flat topography. A reformulation of the same order of precision that avoids the calculation of high order derivatives on the surface deformation is proposed. We show that this formulation enjoys an extended range of applicability while remaining stable. Moreover, a significant improvement in terms of linear dispersive properties in high frequency regime is made due to the suitable adjustment of a dispersion correction parameter. We develop a second order splitting scheme where the hyperbolic part of the system is treated with a high-order finite volume scheme and the dispersive part is treated with a finite difference approach. Numerical simulations are then performed under two main goals: validating the model and the numerical methods and assessing the potential need of such higher-order model. | \n", "[higher-order, high-order, water-waves, higher-ordered] | \n", "
| 67426 | \n", "Localized Reduced Basis Additive Schwarz Methods | \n", "Reduced basis methods build low-rank approximation spaces for the solution sets of parameterized PDEs by computing solutions of the given PDE for appropriately selected snapshot parameters. Localized reduced basis methods reduce the offline cost of computing these snapshot solutions by instead constructing a global space from spatially localized less expensive problems. In the case of online enrichment, these local problems are iteratively solved in regions of high residual and correspond to subdomain solves in domain decomposition methods. We show in this note that indeed there is a close relationship between online-enriched localized reduced basis and domain decomposition methods by introducing a Localized Reduced Basis Additive Schwarz method (LRBAS), which can be interpreted as a locally adaptive multi-preconditioning scheme for the CG method. | \n", "[math.NA, cs.NA] | \n", "[['Gander', 'Martin J.', ''], ['Rave', 'Stephan', '']] | \n", "2021-06-09 | \n", "2103.10884 | \n", "Reduced basis methods build low-rank approximation spaces for the solution sets of parameterized PDEs by computing solutions of the given PDE for appropriately selected snapshot parameters. Localized reduced basis methods reduce the offline cost of computing these snapshot solutions by instead constructing a global space from spatially localized less expensive problems. In the case of online enrichment, these local problems are iteratively solved in regions of high residual and correspond to subdomain solves in domain decomposition methods. We show in this note that indeed there is a close relationship between online-enriched localized reduced basis and domain decomposition methods by introducing a Localized Reduced Basis Additive Schwarz method (LRBAS), which can be interpreted as a locally adaptive multi-preconditioning scheme for the CG method. | \n", "[low-rank, multi-preconditioning, online-enriched] | \n", "
| 113435 | \n", "Some connections of complex dynamics | \n", "We survey some of the connections linking complex dynamics to other fields of mathematics and science. We hope to show that complex dynamics is not just interesting on its own but also has value as an applicable theory. | \n", "[math.DS, math.CV] | \n", "[['DeZotti', 'Alexandre', '']] | \n", "2020-07-01 | \n", "2006.16386 | \n", "We survey some of the connections linking complex dynamics to other fields of mathematics and science. We hope to show that complex dynamics is not just interesting on its own but also has value as an applicable theory. | \n", "None | \n", "
| 101715 | \n", "$L^2$ decay for the linearized Landau equation with the specular\\n boundary condition | \n", "In this paper, we develop an alternative approach to establish the $L^2$ decay estimate for the linearized Landau equation in a bounded domain with specular boundary condition. The proof is based on the methodology of proof by contradiction motivated by [Guo, Comm. Pure Appl. Math., 55(9):1104-1135, 2002] and [Guo, Arch. Ration. Mech. Anal., 197(3):713-809, 2010]. | \n", "[math.AP] | \n", "[['Guo', 'Yan', ''], ['Hwang', 'Hyung Ju', ''], ['Jang', 'Jin Woo', ''], ['Ouyang', 'Zhimeng', '']] | \n", "2020-09-30 | \n", "2009.01391 | \n", "In this paper, we develop an alternative approach to establish the LATEX decay estimate for the linearized Landau equation in a bounded domain with specular boundary condition. The proof is based on the methodology of proof by contradiction motivated by [Guo, Comm. Pure Appl. Math., 55(9):1104-1135, 2002] and [Guo, Arch. Ration. Mech. Anal., 197(3):713-809, 2010]. | \n", "[713-809, 1104-1135] | \n", "
| 21170 | \n", "Information in probability: Another information-theoretic proof of a\\n finite de Finetti theorem | \n", "We recall some of the history of the information-theoretic approach to deriving core results in probability theory and indicate parts of the recent resurgence of interest in this area with current progress along several interesting directions. Then we give a new information-theoretic proof of a finite version of de Finetti's classical representation theorem for finite-valued random variables. We derive an upper bound on the relative entropy between the distribution of the first $k$ in a sequence of $n$ exchangeable random variables, and an appropriate mixture over product distributions. The mixing measure is characterised as the law of the empirical measure of the original sequence, and de Finetti's result is recovered as a corollary. The proof is nicely motivated by the Gibbs conditioning principle in connection with statistical mechanics, and it follows along an appealing sequence of steps. The technical estimates required for these steps are obtained via the use of a collection of combinatorial tools known within information theory as `the method of types.' | \n", "[math.PR, cs.IT, math.IT] | \n", "[['Gavalakis', 'Lampros', ''], ['Kontoyiannis', 'Ioannis', '']] | \n", "2022-04-28 | \n", "2204.05033 | \n", "We recall some of the history of the information-theoretic approach to deriving core results in probability theory and indicate parts of the recent resurgence of interest in this area with current progress along several interesting directions. Then we give a new information-theoretic proof of a finite version of de Finetti's classical representation theorem for finite-valued random variables. We derive an upper bound on the relative entropy between the distribution of the first LATEX in a sequence of LATEX exchangeable random variables, and an appropriate mixture over product distributions. The mixing measure is characterised as the law of the empirical measure of the original sequence, and de Finetti's result is recovered as a corollary. The proof is nicely motivated by the Gibbs conditioning principle in connection with statistical mechanics, and it follows along an appealing sequence of steps. The technical estimates required for these steps are obtained via the use of a collection of combinatorial tools known within information theory as `the method of types.' | \n", "[information-theoretic, finite-valued] | \n", "
| 70247 | \n", "Stated skein algebras and their representations | \n", "This is a survey on stated skein algebras and their representations. | \n", "[math.GT, math.QA] | \n", "[['Korinman', 'Julien', '']] | \n", "2021-05-21 | \n", "2105.09563 | \n", "This is a survey on stated skein algebras and their representations. | \n", "None | \n", "
| 157070 | \n", "On mixture representations for the generalized Linnik distribution and\\n their applications in limit theorems | \n", "We present new mixture representations for the generalized Linnik distribution in terms of normal, Laplace, exponential and stable laws and establish the relationship between the mixing distributions in these representations. Based on these representations, we prove some limit theorems for a wide class of rather simple statistics constructed from samples with random sized including, e. g., random sums of independent random variables with finite variances and maximum random sums, in which the generalized Linnik distribution plays the role of the limit law. Thus we demonstrate that the scheme of geometric (or, in general, negative binomial) summation is far not the only asymptotic setting (even for sums of independent random variables) in which the generalized Linnik law appears as the limit distribution. | \n", "[math.PR] | \n", "[['Korolev', 'V. Yu.', ''], ['Gorshenin', 'A. K.', ''], ['Zeifman', 'A. I.', '']] | \n", "2019-07-10 | \n", "1810.06389 | \n", "We present new mixture representations for the generalized Linnik distribution in terms of normal, Laplace, exponential and stable laws and establish the relationship between the mixing distributions in these representations. Based on these representations, we prove some limit theorems for a wide class of rather simple statistics constructed from samples with random sized including, e. g., random sums of independent random variables with finite variances and maximum random sums, in which the generalized Linnik distribution plays the role of the limit law. Thus we demonstrate that the scheme of geometric (or, in general, negative binomial) summation is far not the only asymptotic setting (even for sums of independent random variables) in which the generalized Linnik law appears as the limit distribution. | \n", "None | \n", "
| 25237 | \n", "Shifted Witten classes and topological recursion | \n", "The Witten $r$-spin class defines a non-semisimple cohomological field theory. Pandharipande, Pixton and Zvonkine studied two special shifts of the Witten class along two semisimple directions of the associated Dubrovin--Frobenius manifold using the Givental--Teleman reconstruction theorem. We show that the $R$-matrix and the translation of these two specific shifts can be constructed from the solutions of two differential equations that generalise the classical Airy differential equation. Using this, we prove that the descendant intersection theory of the shifted Witten classes satisfies topological recursion on two $1$-parameter families of spectral curves. By taking the limit as the parameter goes to zero for these families of spectral curves, we prove that the descendant intersection theory of the Witten $r$-spin class can be computed by topological recursion on the $r$-Airy spectral curve. We finally show that this proof suffices to deduce Witten's $r$-spin conjecture, already proved by Faber, Shadrin and Zvonkine, which claims that the generating series of $r$-spin intersection numbers is the tau function of the $r$-KdV hierarchy that satisfies the string equation. | \n", "[math.AG, math-ph, math.CA, math.MP] | \n", "[['Charbonnier', 'Séverin', ''], ['Chidambaram', 'Nitin Kumar', ''], ['Garcia-Failde', 'Elba', ''], ['Giacchetto', 'Alessandro', '']] | \n", "2022-03-31 | \n", "2203.16523 | \n", "The Witten LATEX class defines a non-semisimple cohomological field theory. Pandharipande, Pixton and Zvonkine studied two special shifts of the Witten class along two semisimple directions of the associated Dubrovin--Frobenius manifold using the Givental--Teleman reconstruction theorem. We show that the LATEX and the translation of these two specific shifts can be constructed from the solutions of two differential equations that generalise the classical Airy differential equation. Using this, we prove that the descendant intersection theory of the shifted Witten classes satisfies topological recursion on two LATEX families of spectral curves. By taking the limit as the parameter goes to zero for these families of spectral curves, we prove that the descendant intersection theory of the Witten LATEX class can be computed by topological recursion on the LATEX spectral curve. We finally show that this proof suffices to deduce Witten's LATEX conjecture, already proved by Faber, Shadrin and Zvonkine, which claims that the generating series of LATEX intersection numbers is the tau function of the LATEX hierarchy that satisfies the string equation. | \n", "[non-semisimple] | \n", "
| 36435 | \n", "Weighted $L^2$-contractivity of Langevin dynamics with singular\\n potentials | \n", "Convergence to equilibrium of underdamped Langevin dynamics is studied under general assumptions on the potential $U$ allowing for singularities. By modifying the direct approach to convergence in $L^2$ pioneered by F. H\\'erau and developped by Dolbeault, Mouhot and Schmeiser, we show that the dynamics converges exponentially fast to equilibrium in the topologies $L^2(d\\mu)$ and $L^2(W^* d\\mu)$, where $\\mu$ denotes the invariant probability measure and $W^*$ is a suitable Lyapunov weight. In both norms, we make precise how the exponential convergence rate depends on the friction parameter $\\gamma$ in Langevin dynamics, by providing a lower bound scaling as $\\min(\\gamma, \\gamma^{-1})$. The results hold for usual polynomial-type potentials as well as potentials with singularities such as those arising from pairwise Lennard-Jones interactions between particles. | \n", "[math.PR, math-ph, math.AP, math.MP] | \n", "[['Camrud', 'Evan', ''], ['Herzog', 'David P.', ''], ['Stoltz', 'Gabriel', ''], ['Gordina', 'Maria', '']] | \n", "2022-01-19 | \n", "2104.10574 | \n", "Convergence to equilibrium of underdamped Langevin dynamics is studied under general assumptions on the potential LATEX allowing for singularities. By modifying the direct approach to convergence in LATEX pioneered by F. Herau and developped by Dolbeault, Mouhot and Schmeiser, we show that the dynamics converges exponentially fast to equilibrium in the topologies LATEX and LATEX where LATEX denotes the invariant probability measure and LATEX is a suitable Lyapunov weight. In both norms, we make precise how the exponential convergence rate depends on the friction parameter LATEX in Langevin dynamics, by providing a lower bound scaling as LATEX The results hold for usual polynomial-type potentials as well as potentials with singularities such as those arising from pairwise Lennard-Jones interactions between particles. | \n", "[polynomial-type, Lennard-Jones] | \n", "
| 105352 | \n", "A note on extremely primitive affine groups | \n", "Let $G$ be a finite primitive permutation group on a set $\\Omega$ with nontrivial point stabilizer $G_{\\alpha}$. We say that $G$ is extremely primitive if $G_{\\alpha}$ acts primitively on each of its orbits in $\\Omega \\setminus \\{\\alpha\\}$. In earlier work, Mann, Praeger and Seress have proved that every extremely primitive group is either almost simple or of affine type and they have classified the affine groups up to the possibility of at most finitely many exceptions. More recently, the almost simple extremely primitive groups have been completely determined. If one assumes Wall's conjecture on the number of maximal subgroups of almost simple groups, then the results of Mann et al. show that it just remains to eliminate an explicit list of affine groups in order to complete the classification of the extremely primitive groups. Mann et al. have conjectured that none of these affine candidates are extremely primitive and our main result confirms this conjecture. | \n", "[math.GR] | \n", "[['Burness', 'Timothy C.', ''], ['Thomas', 'Adam R.', '']] | \n", "2020-09-01 | \n", "2005.11554 | \n", "Let LATEX be a finite primitive permutation group on a set LATEX with nontrivial point stabilizer LATEX We say that LATEX is extremely primitive if LATEX acts primitively on each of its orbits in LATEX In earlier work, Mann, Praeger and Seress have proved that every extremely primitive group is either almost simple or of affine type and they have classified the affine groups up to the possibility of at most finitely many exceptions. More recently, the almost simple extremely primitive groups have been completely determined. If one assumes Wall's conjecture on the number of maximal subgroups of almost simple groups, then the results of Mann et al. show that it just remains to eliminate an explicit list of affine groups in order to complete the classification of the extremely primitive groups. Mann et al. have conjectured that none of these affine candidates are extremely primitive and our main result confirms this conjecture. | \n", "None | \n", "
| 92397 | \n", "Inexact Derivative-Free Optimization for Bilevel Learning | \n", "Variational regularization techniques are dominant in the field of mathematical imaging. A drawback of these techniques is that they are dependent on a number of parameters which have to be set by the user. A by now common strategy to resolve this issue is to learn these parameters from data. While mathematically appealing this strategy leads to a nested optimization problem (known as bilevel optimization) which is computationally very difficult to handle. It is common when solving the upper-level problem to assume access to exact solutions of the lower-level problem, which is practically infeasible. In this work we propose to solve these problems using inexact derivative-free optimization algorithms which never require exact lower-level problem solutions, but instead assume access to approximate solutions with controllable accuracy, which is achievable in practice. We prove global convergence and a worstcase complexity bound for our approach. We test our proposed framework on ROFdenoising and learning MRI sampling patterns. Dynamically adjusting the lower-level accuracy yields learned parameters with similar reconstruction quality as highaccuracy evaluations but with dramatic reductions in computational work (up to 100 times faster in some cases). | \n", "[math.OC, cs.CV, cs.LG, cs.NA, math.NA, stat.ML] | \n", "[['Ehrhardt', 'Matthias J.', ''], ['Roberts', 'Lindon', '']] | \n", "2020-12-10 | \n", "2006.12674 | \n", "Variational regularization techniques are dominant in the field of mathematical imaging. A drawback of these techniques is that they are dependent on a number of parameters which have to be set by the user. A by now common strategy to resolve this issue is to learn these parameters from data. While mathematically appealing this strategy leads to a nested optimization problem (known as bilevel optimization) which is computationally very difficult to handle. It is common when solving the upper-level problem to assume access to exact solutions of the lower-level problem, which is practically infeasible. In this work we propose to solve these problems using inexact derivative-free optimization algorithms which never require exact lower-level problem solutions, but instead assume access to approximate solutions with controllable accuracy, which is achievable in practice. We prove global convergence and a worstcase complexity bound for our approach. We test our proposed framework on ROFdenoising and learning MRI sampling patterns. Dynamically adjusting the lower-level accuracy yields learned parameters with similar reconstruction quality as highaccuracy evaluations but with dramatic reductions in computational work (up to 100 times faster in some cases). | \n", "[lower-level, derivative-free, upper-level] | \n", "
| 36360 | \n", "Interpolation for analytic families of multilinear operators on metric\\n measure spaces | \n", "Let (X j , d j , $\\mu$ j), j = 0, 1,. .. , m be metric measure spaces. Given 0 < p $\\kappa$ $\\le$ $\\infty$ for $\\kappa$ = 1,. .. , m and an analytic family of multilinear operators T z : L p 1 (X 1) x $\\bullet$ $\\bullet$ $\\bullet$ L p m (X m) $\\rightarrow$ L 1 loc (X 0), for z in the complex unit strip, we prove a theorem in the spirit of Stein's complex interpolation for analytic families. Analyticity and our admissibility condition are defined in the weak (integral) sense and relax the pointwise definitions given in [9]. Continuous functions with compact support are natural dense subspaces of Lebesgue spaces over metric measure spaces and we assume the operators T z are initially defined on them. Our main lemma concerns the approximation of continuous functions with compact support by similar functions that depend analytically in an auxiliary parameter z. An application of the main theorem concerning bilinear estimates for Schr{\\\"o}dinger operators on L p is included. | \n", "[math.AP, math.FA] | \n", "[['Grafakos', 'Loukas', '', 'IMB'], ['Ouhabaz', 'El Maati', '', 'IMB']] | \n", "2022-01-19 | \n", "2107.00290 | \n", "Let (X j , d j , LATEX j), j = 0, 1,. .. , m be metric measure spaces. Given 0 < p LATEX LATEX LATEX for LATEX = 1,. .. , m and an analytic family of multilinear operators T z : L p 1 (X 1) x LATEX LATEX LATEX L p m (X m) LATEX L 1 loc (X 0), for z in the complex unit strip, we prove a theorem in the spirit of Stein's complex interpolation for analytic families. Analyticity and our admissibility condition are defined in the weak (integral) sense and relax the pointwise definitions given in [9]. Continuous functions with compact support are natural dense subspaces of Lebesgue spaces over metric measure spaces and we assume the operators T z are initially defined on them. Our main lemma concerns the approximation of continuous functions with compact support by similar functions that depend analytically in an auxiliary parameter z. An application of the main theorem concerning bilinear estimates for Schr{o}dinger operators on L p is included. | \n", "None | \n", "
| 37936 | \n", "Matrix versions of real and quaternionic nullstellensatz | \n", "Real Nullstellensatz is a classical result from Real Algebraic Geometry. It has recently been extended to quaternionic polynomials by Alon and Paran. The aim of this paper is to extend their Quaternionic Nullstellensatz to matrix polynomials. We also obtain an improvement of the Real Nullstellensatz for matrix polynomials in the sense that we simplify the definition of a real left ideal. We use the methods from the proof of the matrix version of Hilbert's Nullstellensatz and we obtain their extensions to a mildly non-commutative case and to the real case. | \n", "[math.RA] | \n", "[['Cimprič', 'J.', '']] | \n", "2022-01-06 | \n", "2201.01345 | \n", "Real Nullstellensatz is a classical result from Real Algebraic Geometry. It has recently been extended to quaternionic polynomials by Alon and Paran. The aim of this paper is to extend their Quaternionic Nullstellensatz to matrix polynomials. We also obtain an improvement of the Real Nullstellensatz for matrix polynomials in the sense that we simplify the definition of a real left ideal. We use the methods from the proof of the matrix version of Hilbert's Nullstellensatz and we obtain their extensions to a mildly non-commutative case and to the real case. | \n", "[non-commutative] | \n", "
| 29384 | \n", "On the mathematics of beauty: beautiful music | \n", "In this paper, we will study the simplest kind of beauty that can be found in a simple piece of music and can be appreciated universally. The proposed approach shows that aesthetically appealing patterns deliver higher amount of information over multiple levels in comparison with less aesthetically appealing patterns when the same amount of energy is used. The proposed model is tested on a set of beautiful music pieces. | \n", "[cs.IT, math.IT] | \n", "[['Khalili', 'A. M.', '']] | \n", "2022-03-04 | \n", "1707.06510 | \n", "In this paper, we will study the simplest kind of beauty that can be found in a simple piece of music and can be appreciated universally. The proposed approach shows that aesthetically appealing patterns deliver higher amount of information over multiple levels in comparison with less aesthetically appealing patterns when the same amount of energy is used. The proposed model is tested on a set of beautiful music pieces. | \n", "None | \n", "
| 63951 | \n", "Interplay between opers, quantum curves, WKB analysis, and Higgs bundles | \n", "Quantum curves were introduced in the physics literature. We develop a mathematical framework for the case associated with Hitchin spectral curves. In this context, a quantum curve is a Rees $\\mathcal{D}$-module on a smooth projective algebraic curve, whose semi-classical limit produces the Hitchin spectral curve of a Higgs bundle. We give a method of quantization of Hitchin spectral curves by concretely constructing one-parameter deformation families of opers. We propose a variant of the topological recursion of Eynard--Orantin and Mirzakhani for the context of singular Hitchin spectral curves. We show that a PDE version of topological recursion provides all-order WKB analysis for the Rees $\\mathcal{D}$-modules, defined as the quantization of Hitchin spectral curves associated with meromorphic $SL(2,\\mathbb{C})$-Higgs bundles. Topological recursion can be considered as a process of quantization of Hitchin spectral curves. We prove that these two quantizations, one via the construction of families of opers, and the other via the PDE recursion of topological type, agree for holomorphic and meromorphic $SL(2,\\mathbb{C})$-Higgs bundles. Classical differential equations such as the Airy differential equation provides a typical example. Through these classical examples, we see that quantum curves relate Higgs bundles, opers, a conjecture of Gaiotto, and quantum invariants, such as Gromov--Witten invariants | \n", "[math.AG, math-ph, math.MP] | \n", "[['Dumitrescu', 'Olivia', ''], ['Mulase', 'Motohico', '']] | \n", "2021-07-05 | \n", "1702.00511 | \n", "Quantum curves were introduced in the physics literature. We develop a mathematical framework for the case associated with Hitchin spectral curves. In this context, a quantum curve is a Rees LATEX defined as the quantization of Hitchin spectral curves associated with meromorphic LATEX bundles. Topological recursion can be considered as a process of quantization of Hitchin spectral curves. We prove that these two quantizations, one via the construction of families of opers, and the other via the PDE recursion of topological type, agree for holomorphic and meromorphic LATEX bundles. Classical differential equations such as the Airy differential equation provides a typical example. Through these classical examples, we see that quantum curves relate Higgs bundles, opers, a conjecture of Gaiotto, and quantum invariants, such as Gromov--Witten invariants | \n", "None | \n", "
| 60746 | \n", "Computation of generalized matrix functions with rational Krylov methods | \n", "We present a class of algorithms based on rational Krylov methods to compute the action of a generalized matrix function on a vector. These algorithms incorporate existing methods based on the Golub-Kahan bidiagonalization as a special case. By exploiting the quasiseparable structure of the projected matrices, we show that the basis vectors can be updated using a short recurrence, which can be seen as a generalization to the rational case of the Golub-Kahan bidiagonalization. We also prove error bounds that relate the error of these methods to uniform rational approximation. The effectiveness of the algorithms and the accuracy of the bounds is illustrated with numerical experiments. | \n", "[math.NA, cs.NA] | \n", "[['Casulli', 'Angelo Alberto', ''], ['Simunec', 'Igor', '']] | \n", "2021-07-27 | \n", "2107.12074 | \n", "We present a class of algorithms based on rational Krylov methods to compute the action of a generalized matrix function on a vector. These algorithms incorporate existing methods based on the Golub-Kahan bidiagonalization as a special case. By exploiting the quasiseparable structure of the projected matrices, we show that the basis vectors can be updated using a short recurrence, which can be seen as a generalization to the rational case of the Golub-Kahan bidiagonalization. We also prove error bounds that relate the error of these methods to uniform rational approximation. The effectiveness of the algorithms and the accuracy of the bounds is illustrated with numerical experiments. | \n", "[Golub-Kahan] | \n", "
| 26478 | \n", "Spatial ecology, optimal control and game theoretical fishing problems | \n", "Of paramount importance in both ecological systems and economic policies are the problems of harvesting of natural resources. A paradigmatic situation where this question is raised is that of fishing strategies. Indeed, overfishing is a well-known problem in the management of live-stocks, as being too greedy may lead to an overall dramatic depletion of the population we are harvesting. A closely related topic is that of Nash equilibria in the context of fishing policies. Namely, two players being in competition for the same pool of resources, is it possible for them to find an equilibrium situation? The goal of this paper is to provide a detailed analysis of these two queries (\\emph{i.e} optimal fishing strategies for single-player models and study of Nash equilibria for multiple players games) by using a basic yet instructive mathematical model, the logistic-diffusive equation. In this framework, the underlying model simply reads $-\\mu\\Delta \\theta=\\theta(K(x)-\\alpha(x)-\\theta)$ where $K$ accounts for natural resources, $\\theta$ for the density of the population that is being harvested and $\\alpha=\\alpha(x)$ encodes either the single player fishing strategy or, when dealing with Nash equilibria, a combination of the fishing strategies of both players. This article consists of two main parts. The first one gives a very fine characterisation of the optimisers for the single-player game. In the case where two players are involved, we aim at finding a Nash equilibrium. We prove the existence of Nash equilibria in several different regimes \\textcolor{black}{and investigate several related qualitative queries}.Our study is completed by a variety of numerical simulations that illustrate our results and allow us to formulate open questions and conjectures. | \n", "[math.OC, math.AP] | \n", "[['Mazari', 'Idriss', ''], ['Ruiz-Balet', 'Domènec', '']] | \n", "2022-03-23 | \n", "2203.11844 | \n", "Of paramount importance in both ecological systems and economic policies are the problems of harvesting of natural resources. A paradigmatic situation where this question is raised is that of fishing strategies. Indeed, overfishing is a well-known problem in the management of live-stocks, as being too greedy may lead to an overall dramatic depletion of the population we are harvesting. A closely related topic is that of Nash equilibria in the context of fishing policies. Namely, two players being in competition for the same pool of resources, is it possible for them to find an equilibrium situation? The goal of this paper is to provide a detailed analysis of these two queries ( optimal fishing strategies for single-player models and study of Nash equilibria for multiple players games) by using a basic yet instructive mathematical model, the logistic-diffusive equation. In this framework, the underlying model simply reads LATEX where LATEX accounts for natural resources, LATEX for the density of the population that is being harvested and LATEX encodes either the single player fishing strategy or, when dealing with Nash equilibria, a combination of the fishing strategies of both players. This article consists of two main parts. The first one gives a very fine characterisation of the optimisers for the single-player game. In the case where two players are involved, we aim at finding a Nash equilibrium. We prove the existence of Nash equilibria in several different regimes {and investigate several related qualitative queries}.Our study is completed by a variety of numerical simulations that illustrate our results and allow us to formulate open questions and conjectures. | \n", "[logistic-diffusive, live-stocks, single-player, well-known] | \n", "
| \n", " | title | \n", "abstract | \n", "cat | \n", "authors_parsed | \n", "update_date | \n", "id | \n", "clean_abstract | \n", "keywords | \n", "
|---|---|---|---|---|---|---|---|---|
| 30101 | \n", "Coexistence of D2D Communications and Cell-Free Massive MIMO Systems\\n With Low Resolution ADC for Improved Throughput in Beyond-5G Networks | \n", "In this paper, uplink transmission of a cell-free massive multiple-input multiple-output (CF-mMIMO) system coexisting with device-to-device (D2D) communication links is investigated, under the assumption that access points (APs) are equipped with low-resolution analog-to-digital converters (ADCs). Lower bounds of achievable rates for both D2D users (DUEs) and CF-mMIMO users (CFUEs) are derived in closed-form, with perfect and imperfect channel state information. Next, in order to reduce pilot contamination, greedy and graph coloring-based pilot allocation algorithms are proposed and analyzed for the considered scenario. Furthermore, to control interference and improve the performance, two power control strategies are designed and their complexity and convergence are also discussed. The first power control strategy aims at maximizing CFUEs' sum spectral efficiency (SE) subject to quality of service constraints on DUEs, while the second one maximizes the weighted product of CFUEs' and DUEs' signal-to-interference-plus-noise-ratios (SINRs). Numerical results show that the proposed pilot and power allocations bring a considerable improvement to the network SE. Also, it is revealed that the activation of D2D links has a positive effect on the system throughput, i.e. the network offloading ensured by the D2D links overcomes the increased interference brought by D2D communications. | \n", "[cs.IT, math.IT] | \n", "[['Masoumi', 'Hamed', ''], ['Emadi', 'Mohammad Javad', ''], ['Buzzi', 'Stefano', '']] | \n", "2022-03-01 | \n", "2005.10068 | \n", "In this paper, uplink transmission of a cell-free massive multiple-input multiple-output (CF-mMIMO) system coexisting with device-to-device (D2D) communication links is investigated, under the assumption that access points (APs) are equipped with low-resolution analog-to-digital converters (ADCs). Lower bounds of achievable rates for both D2D users (DUEs) and CF-mMIMO users (CFUEs) are derived in closed-form, with perfect and imperfect channel state information. Next, in order to reduce pilot contamination, greedy and graph coloring-based pilot allocation algorithms are proposed and analyzed for the considered scenario. Furthermore, to control interference and improve the performance, two power control strategies are designed and their complexity and convergence are also discussed. The first power control strategy aims at maximizing CFUEs' sum spectral efficiency (SE) subject to quality of service constraints on DUEs, while the second one maximizes the weighted product of CFUEs' and DUEs' signal-to-interference-plus-noise-ratios (SINRs). Numerical results show that the proposed pilot and power allocations bring a considerable improvement to the network SE. Also, it is revealed that the activation of D2D links has a positive effect on the system throughput, i.e. the network offloading ensured by the D2D links overcomes the increased interference brought by D2D communications. | \n", "[CF-mMIMO, coloring-based, multiple-input, multiple-output, analog-to-digital, cell-free, closed-form, signal-to-interference-plus-noise-ratios, low-resolution, device-to-device] | \n", "
| 44092 | \n", "Non-asymptotic Identification of Linear Dynamical Systems Using Multiple\\n Trajectories | \n", "This paper considers the problem of linear time-invariant (LTI) system identification using input/output data. Recent work has provided non-asymptotic results on partially observed LTI system identification using a single trajectory but is only suitable for stable systems. We provide finite-time analysis for learning Markov parameters based on the ordinary least-squares (OLS) estimator using multiple trajectories, which covers both stable and unstable systems. For unstable systems, our results suggest that the Markov parameters are harder to estimate in the presence of process noise. Without process noise, our upper bound on the estimation error is independent of the spectral radius of system dynamics with high probability. These two features are different from fully observed LTI systems for which recent work has shown that unstable systems with a bigger spectral radius are easier to estimate. Extensive numerical experiments demonstrate the performance of our OLS estimator. | \n", "[math.OC, cs.SY, eess.SY, math.DS] | \n", "[['Zheng', 'Yang', ''], ['Li', 'Na', '']] | \n", "2021-11-23 | \n", "2009.00739 | \n", "This paper considers the problem of linear time-invariant (LTI) system identification using input/output data. Recent work has provided non-asymptotic results on partially observed LTI system identification using a single trajectory but is only suitable for stable systems. We provide finite-time analysis for learning Markov parameters based on the ordinary least-squares (OLS) estimator using multiple trajectories, which covers both stable and unstable systems. For unstable systems, our results suggest that the Markov parameters are harder to estimate in the presence of process noise. Without process noise, our upper bound on the estimation error is independent of the spectral radius of system dynamics with high probability. These two features are different from fully observed LTI systems for which recent work has shown that unstable systems with a bigger spectral radius are easier to estimate. Extensive numerical experiments demonstrate the performance of our OLS estimator. | \n", "[finite-time, non-asymptotic, time-invariant, least-squares] | \n", "
| 95950 | \n", "On the first non-trivial strand of syzygies of projective schemes and\\n Condition ${\\mathrm ND}(l)$ | \n", "Let $X\\subset\\mathbb{P}^{n+e}$ be any $n$-dimensional closed subscheme. In this paper, we are mainly interested in two notions related to syzygies: one is the property $\\mathbf{N}_{d,p}~(d\\ge 2, ~p\\geq 1)$, which means that $X$ is $d$-regular up to $p$-th step in the minimal free resolution and the other is a new notion $\\mathrm{ND}(l)$ which generalizes the classical \"being nondegenerate\" to the condition that requires a general finite linear section not to be contained in any hypersurface of degree $l$. First, we introduce condition $\\mathrm{ND}(l)$ and consider examples and basic properties deduced from the notion. Next we prove sharp upper bounds on the graded Betti numbers of the first non-trivial strand of syzygies, which generalize results in the quadratic case to higher degree case, and provide characterizations for the extremal cases. Further, after regarding some consequences of property $\\mathbf{N}_{d,p}$, we characterize the resolution of $X$ to be $d$-linear arithemetically Cohen-Macaulay as having property $\\mathbf{N}_{d,e}$ and condition $\\mathrm{ND}(d-1)$ at the same time. From this result, we obtain a syzygetic rigidity theorem which suggests a natural generalization of syzygetic rigidity on $2$-regularity due to Eisenbud-Green-Hulek-Popescu to a general $d$-regularity. | \n", "[math.AG, math.AC] | \n", "[['Ahn', 'Jeaman', ''], ['Han', 'Kangjin', ''], ['Kwak', 'Sijong', '']] | \n", "2020-11-16 | \n", "2011.06785 | \n", "Let LATEX be any LATEX closed subscheme. In this paper, we are mainly interested in two notions related to syzygies: one is the property LATEX which means that LATEX is LATEX up to LATEX step in the minimal free resolution and the other is a new notion LATEX which generalizes the classical \"being nondegenerate\" to the condition that requires a general finite linear section not to be contained in any hypersurface of degree LATEX First, we introduce condition LATEX and consider examples and basic properties deduced from the notion. Next we prove sharp upper bounds on the graded Betti numbers of the first non-trivial strand of syzygies, which generalize results in the quadratic case to higher degree case, and provide characterizations for the extremal cases. Further, after regarding some consequences of property LATEX we characterize the resolution of LATEX to be LATEX arithemetically Cohen-Macaulay as having property LATEX and condition LATEX at the same time. From this result, we obtain a syzygetic rigidity theorem which suggests a natural generalization of syzygetic rigidity on LATEX due to Eisenbud-Green-Hulek-Popescu to a general LATEX | \n", "[Eisenbud-Green-Hulek-Popescu, non-trivial, Cohen-Macaulay] | \n", "
| 87091 | \n", "Frobenius test exponent for ideals generated by filter regular sequences | \n", "Let $(R,\\frak m)$ be a Noetherian local ring of prime characteristic $p>0$, and $t$ an integer such that $H_{\\frak m}^j(R)/0^F_{H^j_{\\frak m}(R)}$ has finite length for all $j<t$. The aim of this paper is to show that there exists an uniform bound for Frobenius test exponents of ideals generated by filter regular sequences of length at most $t$. | \n", "[math.AC] | \n", "[['Huong', 'Duong Thi', ''], ['Quy', 'Pham Hung', '']] | \n", "2021-01-21 | \n", "2101.00475 | \n", "Let LATEX be a Noetherian local ring of prime characteristic LATEX and LATEX an integer such that LATEX has finite length for all LATEX The aim of this paper is to show that there exists an uniform bound for Frobenius test exponents of ideals generated by filter regular sequences of length at most LATEX | \n", "None | \n", "
| 86195 | \n", "XXL type Artin groups are CAT(0) and acylindrically hyperbolic | \n", "We describe a simple locally CAT(0) classifying space for extra extra large type Artin groups (with all labels at least 5). Furthermore, when the Artin group is not dihedral, we describe a rank 1 periodic geodesic, thus proving that extra large type Artin groups are acylindrically hyperbolic. Together with Property RD proved by Ciabonu, Holt and Rees, the CAT(0) property implies the Baum-Connes conjecture for all XXL type Artin groups. | \n", "[math.MG, math.GT] | \n", "[['Haettel', 'Thomas', '']] | \n", "2021-01-27 | \n", "1905.11032 | \n", "We describe a simple locally CAT(0) classifying space for extra extra large type Artin groups (with all labels at least 5). Furthermore, when the Artin group is not dihedral, we describe a rank 1 periodic geodesic, thus proving that extra large type Artin groups are acylindrically hyperbolic. Together with Property RD proved by Ciabonu, Holt and Rees, the CAT(0) property implies the Baum-Connes conjecture for all XXL type Artin groups. | \n", "[Baum-Connes] | \n", "
| 74105 | \n", "Robust Model Predictive Control for Nonlinear Systems Using Convex\\n Restriction | \n", "We present an algorithm for robust model predictive control with consideration of uncertainty and safety constraints. Our framework considers a nonlinear dynamical system subject to disturbances from an unknown but bounded uncertainty set. By viewing the system as a fixed point of an operator acting over trajectories, we propose a convex condition on control actions that guarantee safety against the uncertainty set. The proposed condition guarantees that all realizations of the state trajectories satisfy safety constraints. Our algorithm solves a sequence of convex quadratic constrained optimization problems of size n*N, where n is the number of states, and N is the prediction horizon in the model predictive control problem. Compared to existing methods, our approach solves convex problems while guaranteeing that all realizations of uncertainty set do not violate safety constraints. Moreover, we consider the implicit time-discretization of system dynamics to increase the prediction horizon and enhance computational accuracy. Numerical simulations for vehicle navigation demonstrate the effectiveness of our approach. | \n", "[math.OC] | \n", "[['Lee', 'Dongchan', ''], ['Turitsyn', 'Konstantin', ''], ['Slotine', 'Jean-Jacques', '']] | \n", "2021-04-23 | \n", "2003.00345 | \n", "We present an algorithm for robust model predictive control with consideration of uncertainty and safety constraints. Our framework considers a nonlinear dynamical system subject to disturbances from an unknown but bounded uncertainty set. By viewing the system as a fixed point of an operator acting over trajectories, we propose a convex condition on control actions that guarantee safety against the uncertainty set. The proposed condition guarantees that all realizations of the state trajectories satisfy safety constraints. Our algorithm solves a sequence of convex quadratic constrained optimization problems of size n*N, where n is the number of states, and N is the prediction horizon in the model predictive control problem. Compared to existing methods, our approach solves convex problems while guaranteeing that all realizations of uncertainty set do not violate safety constraints. Moreover, we consider the implicit time-discretization of system dynamics to increase the prediction horizon and enhance computational accuracy. Numerical simulations for vehicle navigation demonstrate the effectiveness of our approach. | \n", "[time-discretization] | \n", "
| 155131 | \n", "An Achievement Game on a Cycle | \n", "Consider the following game played by Maker and Breaker on the vertices of the cycle $C_{n}$, with first move given to Breaker. The aim of Maker is to maximise the number of adjacent pairs of vertices that are both claimed by her, and the aim of Breaker is to minimise this number. The aim of this paper is to find this number exactly for all $n$ when both players play optimally, answering a related question of Dowden, Kang, Mikala\\v{c}ki and Stojakovi\\'{c}. | \n", "[math.CO] | \n", "[['Raty', 'Eero', '']] | \n", "2019-07-26 | \n", "1907.11152 | \n", "Consider the following game played by Maker and Breaker on the vertices of the cycle LATEX with first move given to Breaker. The aim of Maker is to maximise the number of adjacent pairs of vertices that are both claimed by her, and the aim of Breaker is to minimise this number. The aim of this paper is to find this number exactly for all LATEX when both players play optimally, answering a related question of Dowden, Kang, Mikalacki and Stojakovic. | \n", "None | \n", "
| 20183 | \n", "Mismatched Disturbance Rejection Control for Second-Order Discrete-Time\\n Systems | \n", "This paper is concerned with mismatched disturbance rejection control for the second-order discrete-time systems.Different from previous work, the controllability of the system is applied to design the disturbance compensation gain, which does not require any coordinate transformations. Via this new idea, it is shown that disturbance in the regulated output is immediately and directly compensated in the case that the disturbance is known. When the disturbance is unknown, an extra generalized extended state observer is applied to design the controller. Two examples are given to show the effectiveness of the proposed methods. Numerical simulation shows that the designed controller has excellent disturbance rejection effect when the disturbance is known. The example with respect to the permanent-magnet direct current motor illustrates that the proposed control method for unknown disturbance rejection is effective. | \n", "[math.OC] | \n", "[['Lv', 'Shichao', ''], ['Peng', 'Kai', ''], ['Wang', 'Hongxia', ''], ['Zhang', 'Huanshui', '']] | \n", "2022-05-04 | \n", "2205.01261 | \n", "This paper is concerned with mismatched disturbance rejection control for the second-order discrete-time systems.Different from previous work, the controllability of the system is applied to design the disturbance compensation gain, which does not require any coordinate transformations. Via this new idea, it is shown that disturbance in the regulated output is immediately and directly compensated in the case that the disturbance is known. When the disturbance is unknown, an extra generalized extended state observer is applied to design the controller. Two examples are given to show the effectiveness of the proposed methods. Numerical simulation shows that the designed controller has excellent disturbance rejection effect when the disturbance is known. The example with respect to the permanent-magnet direct current motor illustrates that the proposed control method for unknown disturbance rejection is effective. | \n", "[discrete-time, second-order, permanent-magnet] | \n", "
| 140472 | \n", "Generalized shift operator of certain encodings of real numbers | \n", "The present article is devoted to the investigation of some properties of the generalized shift operator of numbers represented in terms of numeral systems with a variable alphabet. | \n", "[math.GM] | \n", "[['Serbenyuk', 'Symon', '']] | \n", "2019-11-28 | \n", "1911.12140 | \n", "The present article is devoted to the investigation of some properties of the generalized shift operator of numbers represented in terms of numeral systems with a variable alphabet. | \n", "None | \n", "
| 167763 | \n", "Properly-weighted graph Laplacian for semi-supervised learning | \n", "The performance of traditional graph Laplacian methods for semi-supervised learning degrades substantially as the ratio of labeled to unlabeled data decreases, due to a degeneracy in the graph Laplacian. Several approaches have been proposed recently to address this, however we show that some of them remain ill-posed in the large-data limit. In this paper, we show a way to correctly set the weights in Laplacian regularization so that the estimator remains well posed and stable in the large-sample limit. We prove that our semi-supervised learning algorithm converges, in the infinite sample size limit, to the smooth solution of a continuum variational problem that attains the labeled values continuously. Our method is fast and easy to implement. | \n", "[math.AP, cs.LG, math.NA, math.PR] | \n", "[['Calder', 'Jeff', ''], ['Slepcev', 'Dejan', '']] | \n", "2019-04-03 | \n", "1810.04351 | \n", "The performance of traditional graph Laplacian methods for semi-supervised learning degrades substantially as the ratio of labeled to unlabeled data decreases, due to a degeneracy in the graph Laplacian. Several approaches have been proposed recently to address this, however we show that some of them remain ill-posed in the large-data limit. In this paper, we show a way to correctly set the weights in Laplacian regularization so that the estimator remains well posed and stable in the large-sample limit. We prove that our semi-supervised learning algorithm converges, in the infinite sample size limit, to the smooth solution of a continuum variational problem that attains the labeled values continuously. Our method is fast and easy to implement. | \n", "[semi-supervised, ill-posed, large-sample, large-data] | \n", "
| 167061 | \n", "Topological Bijections for Oriented Matroids | \n", "In previous work by the first and third author with Matthew Baker, a family of bijections between bases of a regular matroid and the Jacobian group of the matroid was given. The core of the work is a geometric construction using zonotopal tilings that produces bijections between the bases of a realizable oriented matroid and the set of $(\\sigma,\\sigma^*)$-compatible orientations with respect to some acyclic circuit (respectively, cocircuit) signature $\\sigma$ (respectively, $\\sigma^*$). In this work, we extend this construction to general oriented matroids and circuit (respectively, cocircuit) signatures coming from generic single-element liftings (respectively, extensions). As a corollary, when both signatures are induced by the same lexicographic data, we give a new (bijective) proof of the interpretation of $T_M(1,1)$ using orientation activity due to Gioan and Las Vergnas. Here $T_M(x,y)$ is the Tutte polynomial of the matroid. | \n", "[math.CO] | \n", "[['Backman', 'Spencer', ''], ['Santos', 'Francisco', ''], ['Yuen', 'Chi Ho', '']] | \n", "2019-04-09 | \n", "1904.03562 | \n", "In previous work by the first and third author with Matthew Baker, a family of bijections between bases of a regular matroid and the Jacobian group of the matroid was given. The core of the work is a geometric construction using zonotopal tilings that produces bijections between the bases of a realizable oriented matroid and the set of LATEX orientations with respect to some acyclic circuit (respectively, cocircuit) signature LATEX (respectively, LATEX In this work, we extend this construction to general oriented matroids and circuit (respectively, cocircuit) signatures coming from generic single-element liftings (respectively, extensions). As a corollary, when both signatures are induced by the same lexicographic data, we give a new (bijective) proof of the interpretation of LATEX using orientation activity due to Gioan and Las Vergnas. Here LATEX is the Tutte polynomial of the matroid. | \n", "[single-element] | \n", "
| 109755 | \n", "Carleson measure estimates and $\\epsilon$-approximation of bounded\\n harmonic functions, without Ahlfors regularity assumptions | \n", "Let $\\Omega$ be a domain in $\\mathbb{R}^{d+1}$, $d \\geq 1$. In the paper's references [HMM2] and [GMT] it was proved that if $\\Omega$ satisfies a corkscrew condition and if $\\partial \\Omega$ is $d$-Ahlfors regular, i.e. Hausdorff measure $\\mathcal{H}^d(B(x,r) \\cap \\partial \\Omega) \\sim r^d$ for all $x \\in \\partial \\Omega$ and $0 < r < {\\rm diam}(\\partial \\Omega)$, then $\\partial \\Omega$ is uniformly rectifiable if and only if (a) a square function Carleson measure estimate holds for every bounded harmonic function on $\\Omega$ or (b) an $\\varepsilon$-approximation property for all $0 < \\varepsilon <1$ for every such function. Here we explore (a) and (b) when $\\partial \\Omega$ is not required to be Ahlfors regular. We first prove that (a) and (b) hold for any domain $\\Omega$ for which there exists a domain $\\widetilde \\Omega \\subset \\Omega$ such that $\\partial \\Omega \\subset \\partial \\widetilde \\Omega$ and $\\partial \\widetilde \\Omega$ is uniformly rectifiable. We next assume $\\Omega$ satisfies a corkscrew condition and $\\partial \\Omega$ satisfies a capacity density condition. Under these assumptions we prove conversely that the existence of such $\\widetilde \\Omega$ implies (a) and (b) hold on $\\Omega$ and give further characterizations of domains for which (a) or (b) holds. One is that harmonic measure satisfies a Carleson packing condition for diameters similar to the corona decompositionm proved equivalent to uniform rectifiability in [GMT]. The second characterization is reminiscent of the Carleson measure description of $H^{\\infty}$ interpolating sequences in the unit disc. | \n", "[math.CA] | \n", "[['Garnett', 'John', '']] | \n", "2020-07-28 | \n", "2006.10682 | \n", "Let LATEX be a domain in LATEX LATEX In the paper's references [HMM2] and [GMT] it was proved that if LATEX satisfies a corkscrew condition and if LATEX is LATEX regular, i.e. Hausdorff measure LATEX for all LATEX and LATEX then LATEX is uniformly rectifiable if and only if (a) a square function Carleson measure estimate holds for every bounded harmonic function on LATEX or (b) an LATEX property for all LATEX for every such function. Here we explore (a) and (b) when LATEX is not required to be Ahlfors regular. We first prove that (a) and (b) hold for any domain LATEX for which there exists a domain LATEX such that LATEX and LATEX is uniformly rectifiable. We next assume LATEX satisfies a corkscrew condition and LATEX satisfies a capacity density condition. Under these assumptions we prove conversely that the existence of such LATEX implies (a) and (b) hold on LATEX and give further characterizations of domains for which (a) or (b) holds. One is that harmonic measure satisfies a Carleson packing condition for diameters similar to the corona decompositionm proved equivalent to uniform rectifiability in [GMT]. The second characterization is reminiscent of the Carleson measure description of LATEX interpolating sequences in the unit disc. | \n", "None | \n", "
| 17024 | \n", "On skew partial derivatives and a Hermite-type interpolation problem | \n", "Let $\\mathcal{R}:=\\mathbb{F}[{\\bf x};\\sigma,\\delta]$ be a multivariate skew polynomial ring over a division ring $\\mathbb{F}$. In this paper, we introduce the notion of right and left $(\\sigma,\\delta)$-partial derivatives of polynomials in $\\mathcal{R}$ and we prove some of their main properties. As an application of these results, we solve in $\\mathcal{R}$ a Hermite-type multivariate skew polynomial interpolation problem. The main technical tools and results used here are of constructive type, showing methods and algorithms to construct a polynomial in $\\mathcal{R}$ which satisfies the above Hermite-type interpolation problem and its relative Lagrange-type version. | \n", "[math.RA] | \n", "[['Donoso', 'Jonathan Armando Briones', ''], ['Tironi', 'Andrea Luigi', '']] | \n", "2022-05-25 | \n", "2205.12222 | \n", "Let LATEX be a multivariate skew polynomial ring over a division ring LATEX In this paper, we introduce the notion of right and left LATEX derivatives of polynomials in LATEX a Hermite-type multivariate skew polynomial interpolation problem. The main technical tools and results used here are of constructive type, showing methods and algorithms to construct a polynomial in LATEX which satisfies the above Hermite-type interpolation problem and its relative Lagrange-type version. | \n", "[Hermite-type, Lagrange-type] | \n", "
| 131098 | \n", "Geometric Rescaling Algorithms for Submodular Function Minimization | \n", "We present a new class of polynomial-time algorithms for submodular function minimization (SFM), as well as a unified framework to obtain strongly polynomial SFM algorithms. Our algorithms are based on simple iterative methods for the minimum-norm problem, such as the conditional gradient and Fujishige-Wolfe algorithms. We exhibit two techniques to turn simple iterative methods into polynomial-time algorithms. Firstly, we adapt the geometric rescaling technique, which has recently gained attention in linear programming, to SFM and obtain a weakly polynomial bound $O(({n}^4\\cdot \\textrm{EO} + {n}^5)\\log ({n} L))$. Secondly, we exhibit a general combinatorial black-box approach to turn $\\varepsilon L$-approximate SFM oracles into strongly polynomial exact SFM algorithms. This framework can be applied to a wide range of combinatorial and continuous algorithms, including pseudo-polynomial ones. In particular, we can obtain strongly polynomial algorithms by a repeated application of the conditional gradient or of the Fujishige-Wolfe algorithm. Combined with the geometric rescaling technique, the black-box approach provides an $O(({n}^5\\cdot \\textrm{EO} +{n}^6)\\log^2{n})$ algorithm. Finally, we show that one of the techniques we develop in the paper can also be combined with the cutting-plane method of Lee, Sidford, and Wong \\cite{LSW}, yielding a simplified variant of their $O(n^3 \\log^2 n \\cdot \\textrm{EO} + n^4\\log^{O(1)} n)$ algorithm. | \n", "[math.OC, cs.DS] | \n", "[['Dadush', 'Daniel', ''], ['Végh', 'László A.', ''], ['Zambelli', 'Giacomo', '']] | \n", "2020-02-14 | \n", "1707.05065 | \n", "We present a new class of polynomial-time algorithms for submodular function minimization (SFM), as well as a unified framework to obtain strongly polynomial SFM algorithms. Our algorithms are based on simple iterative methods for the minimum-norm problem, such as the conditional gradient and Fujishige-Wolfe algorithms. We exhibit two techniques to turn simple iterative methods into polynomial-time algorithms. Firstly, we adapt the geometric rescaling technique, which has recently gained attention in linear programming, to SFM and obtain a weakly polynomial bound LATEX Secondly, we exhibit a general combinatorial black-box approach to turn LATEX SFM oracles into strongly polynomial exact SFM algorithms. This framework can be applied to a wide range of combinatorial and continuous algorithms, including pseudo-polynomial ones. In particular, we can obtain strongly polynomial algorithms by a repeated application of the conditional gradient or of the Fujishige-Wolfe algorithm. Combined with the geometric rescaling technique, the black-box approach provides an LATEX algorithm. Finally, we show that one of the techniques we develop in the paper can also be combined with the cutting-plane method of Lee, Sidford, and Wong , yielding a simplified variant of their LATEX algorithm. | \n", "[black-box, pseudo-polynomial, minimum-norm, Fujishige-Wolfe, polynomial-time, cutting-plane] | \n", "
| 17981 | \n", "Reducing Linear Hadwiger's Conjecture to Coloring Small Graphs | \n", "In 1943, Hadwiger conjectured that every graph with no $K_t$ minor is $(t-1)$-colorable for every $t\\ge 1$. In the 1980s, Kostochka and Thomason independently proved that every graph with no $K_t$ minor has average degree $O(t\\sqrt{\\log t})$ and hence is $O(t\\sqrt{\\log t})$-colorable. Recently, Norin, Song and the second author showed that every graph with no $K_t$ minor is $O(t(\\log t)^{\\beta})$-colorable for every $\\beta > 1/4$, making the first improvement on the order of magnitude of the $O(t\\sqrt{\\log t})$ bound. The first main result of this paper is that every graph with no $K_t$ minor is $O(t\\log\\log t)$-colorable. This is a corollary of our main technical result that the chromatic number of a $K_t$-minor-free graph is bounded by $O(t(1+f(G,t)))$ where $f(G,t)$ is the maximum of $\\frac{\\chi(H)}{a}$ over all $a\\ge \\frac{t}{\\sqrt{\\log t}}$ and $K_a$-minor-free subgraphs $H$ of $G$ that are small (i.e. $O(a\\log^4 a)$ vertices). This has a number of interesting corollaries. First as mentioned, using the current best-known bounds on coloring small $K_t$-minor-free graphs, we show that $K_t$-minor-free graphs are $O(t\\log\\log t)$-colorable. Second, it shows that proving Linear Hadwiger's Conjecture (that $K_t$-minor-free graphs are $O(t)$-colorable) reduces to proving it for small graphs. Third, we prove that $K_t$-minor-free graphs with clique number at most $\\sqrt{\\log t}/ (\\log \\log t)^2$ are $O(t)$-colorable. This implies our final corollary that Linear Hadwiger's Conjecture holds for $K_r$-free graphs for every fixed $r$. One key to proving the main theorem is a new standalone result that every $K_t$-minor-free graph of average degree $d=\\Omega(t)$ has a subgraph on $O(t \\log^3 t)$ vertices with average degree $\\Omega(d)$. | \n", "[math.CO, cs.DM] | \n", "[['Delcourt', 'Michelle', ''], ['Postle', 'Luke', '']] | \n", "2022-05-19 | \n", "2108.01633 | \n", "In 1943, Hadwiger conjectured that every graph with no LATEX minor is LATEX for every LATEX In the 1980s, Kostochka and Thomason independently proved that every graph with no LATEX minor has average degree LATEX and hence is LATEX Recently, Norin, Song and the second author showed that every graph with no LATEX minor is LATEX for every LATEX making the first improvement on the order of magnitude of the LATEX bound. The first main result of this paper is that every graph with no LATEX minor is LATEX This is a corollary of our main technical result that the chromatic number of a LATEX graph is bounded by LATEX where LATEX is the maximum of LATEX over all LATEX and LATEX subgraphs LATEX of LATEX that are small (i.e. LATEX vertices). This has a number of interesting corollaries. First as mentioned, using the current best-known bounds on coloring small LATEX graphs, we show that LATEX graphs are LATEX Second, it shows that proving Linear Hadwiger's Conjecture (that LATEX graphs are LATEX reduces to proving it for small graphs. Third, we prove that LATEX graphs with clique number at most LATEX are LATEX This implies our final corollary that Linear Hadwiger's Conjecture holds for LATEX graphs for every fixed LATEX One key to proving the main theorem is a new standalone result that every LATEX graph of average degree LATEX has a subgraph on LATEX vertices with average degree LATEX | \n", "[best-known] | \n", "
| 54604 | \n", "Entropy as a Topological Operad Derivation | \n", "We share a small connection between information theory, algebra, and topology - namely, a correspondence between Shannon entropy and derivations of the operad of topological simplices. We begin with a brief review of operads and their representations with topological simplices and the real line as the main example. We then give a general definition for a derivation of an operad in any category with values in an abelian bimodule over the operad. The main result is that Shannon entropy defines a derivation of the operad of topological simplices, and that for every derivation of this operad there exists a point at which it is given by a constant multiple of Shannon entropy. We show this is compatible with, and relies heavily on, a well-known characterization of entropy given by Faddeev in 1956 and a recent variation given by Leinster. | \n", "[math.AT, cs.IT, math.CT, math.IT] | \n", "[['Bradley', 'Tai-Danae', '']] | \n", "2021-09-13 | \n", "2107.09581 | \n", "We share a small connection between information theory, algebra, and topology - namely, a correspondence between Shannon entropy and derivations of the operad of topological simplices. We begin with a brief review of operads and their representations with topological simplices and the real line as the main example. We then give a general definition for a derivation of an operad in any category with values in an abelian bimodule over the operad. The main result is that Shannon entropy defines a derivation of the operad of topological simplices, and that for every derivation of this operad there exists a point at which it is given by a constant multiple of Shannon entropy. We show this is compatible with, and relies heavily on, a well-known characterization of entropy given by Faddeev in 1956 and a recent variation given by Leinster. | \n", "[well-known] | \n", "
| 19308 | \n", "Learning to Continuously Optimize Wireless Resource in a Dynamic\\n Environment: A Bilevel Optimization Perspective | \n", "There has been a growing interest in developing data-driven, and in particular deep neural network (DNN) based methods for modern communication tasks. For a few popular tasks such as power control, beamforming, and MIMO detection, these methods achieve state-of-the-art performance while requiring less computational efforts, less resources for acquiring channel state information (CSI), etc. However, it is often challenging for these approaches to learn in a dynamic environment. This work develops a new approach that enables data-driven methods to continuously learn and optimize resource allocation strategies in a dynamic environment. Specifically, we consider an ``episodically dynamic\" setting where the environment statistics change in ``episodes\", and in each episode the environment is stationary. We propose to build the notion of continual learning (CL) into wireless system design, so that the learning model can incrementally adapt to the new episodes, {\\it without forgetting} knowledge learned from the previous episodes. Our design is based on a novel bilevel optimization formulation which ensures certain ``fairness\" across different data samples. We demonstrate the effectiveness of the CL approach by integrating it with two popular DNN based models for power control and beamforming, respectively, and testing using both synthetic and ray-tracing based data sets. These numerical results show that the proposed CL approach is not only able to adapt to the new scenarios quickly and seamlessly, but importantly, it also maintains high performance over the previously encountered scenarios as well. | \n", "[eess.SP, cs.IT, cs.LG, math.IT] | \n", "[['Sun', 'Haoran', ''], ['Pu', 'Wenqiang', ''], ['Fu', 'Xiao', ''], ['Chang', 'Tsung-Hui', ''], ['Hong', 'Mingyi', '']] | \n", "2022-05-11 | \n", "2105.01696 | \n", "There has been a growing interest in developing data-driven, and in particular deep neural network (DNN) based methods for modern communication tasks. For a few popular tasks such as power control, beamforming, and MIMO detection, these methods achieve state-of-the-art performance while requiring less computational efforts, less resources for acquiring channel state information (CSI), etc. However, it is often challenging for these approaches to learn in a dynamic environment. This work develops a new approach that enables data-driven methods to continuously learn and optimize resource allocation strategies in a dynamic environment. Specifically, we consider an ``episodically dynamic\" setting where the environment statistics change in ``episodes\", and in each episode the environment is stationary. We propose to build the notion of continual learning (CL) into wireless system design, so that the learning model can incrementally adapt to the new episodes, {t without forgetting} knowledge learned from the previous episodes. Our design is based on a novel bilevel optimization formulation which ensures certain ``fairness\" across different data samples. We demonstrate the effectiveness of the CL approach by integrating it with two popular DNN based models for power control and beamforming, respectively, and testing using both synthetic and ray-tracing based data sets. These numerical results show that the proposed CL approach is not only able to adapt to the new scenarios quickly and seamlessly, but importantly, it also maintains high performance over the previously encountered scenarios as well. | \n", "[data-driven, state-of-the-art, ray-tracing] | \n", "
| 44864 | \n", "Analysis of finite-volume discrete adjoint fields for two-dimensional\\n compressible Euler flows | \n", "This work deals with a number of questions relative to the discrete and continuous adjoint fields associated with the compressible Euler equations and classical aerodynamic functions. The consistency of the discrete adjoint equations with the corresponding continuous adjoint partial differential equation is one of them. It is has been established or at least discussed only for a handful of numerical schemes and a contribution of this article is to give the adjoint consistency conditions for the 2D Jameson-Schmidt-Turkel scheme in cell-centred finite-volume formulation. The consistency issue is also studied here from a new heuristic point of view by discretizing the continuous adjoint equation for the discrete flow and adjoint fields. Both points of view prove to provide useful information. Besides, it has been often noted that discrete or continuous inviscid lift and drag adjoint exhibit numerical divergence close to the wall and stagnation streamline for a wide range of subsonic and transonic flow conditions. This is analyzed here using the physical source term perturbation method introduced in reference [Giles and Pierce, AIAA Paper 97-1850, 1997]. With this point of view, the fourth physical source term of appears to be the only one responsible for this behavior. It is also demonstrated that the numerical divergence of the adjoint variables corresponds to the response of the flow to the convected increment of stagnation pressure and diminution of entropy created at the source and the resulting change in lift and drag. | \n", "[physics.comp-ph, cs.NA, math.NA] | \n", "[['Peter', 'Jacques', ''], ['Renac', 'Florent', ''], ['Labbé', 'Clément', '']] | \n", "2021-11-17 | \n", "2009.07096 | \n", "This work deals with a number of questions relative to the discrete and continuous adjoint fields associated with the compressible Euler equations and classical aerodynamic functions. The consistency of the discrete adjoint equations with the corresponding continuous adjoint partial differential equation is one of them. It is has been established or at least discussed only for a handful of numerical schemes and a contribution of this article is to give the adjoint consistency conditions for the 2D Jameson-Schmidt-Turkel scheme in cell-centred finite-volume formulation. The consistency issue is also studied here from a new heuristic point of view by discretizing the continuous adjoint equation for the discrete flow and adjoint fields. Both points of view prove to provide useful information. Besides, it has been often noted that discrete or continuous inviscid lift and drag adjoint exhibit numerical divergence close to the wall and stagnation streamline for a wide range of subsonic and transonic flow conditions. This is analyzed here using the physical source term perturbation method introduced in reference [Giles and Pierce, AIAA Paper 97-1850, 1997]. With this point of view, the fourth physical source term of appears to be the only one responsible for this behavior. It is also demonstrated that the numerical divergence of the adjoint variables corresponds to the response of the flow to the convected increment of stagnation pressure and diminution of entropy created at the source and the resulting change in lift and drag. | \n", "[Jameson-Schmidt-Turkel, cell-centred, finite-volume, 97-1850] | \n", "
| 26270 | \n", "Towards constructivising the Freyd-Mitchell embedding theorem | \n", "The aim of the paper is to first point out that the classical proof of the Freyd-Mitchell Embedding Theorem does not work in CZF; then, to propose an alternative embedding of a small abelian category into the category of sheaves of modules over a ringed space, which works constructively. It is necessary to mention that this work has been initially inspired by Erik Palmgren, who unexpectedly passed away in November 2019: I'm very grateful to him for having shared with me his intuitions, and for having supervised the realization of the first half of the paper. | \n", "[math.CT, math.LO] | \n", "[['Montaruli', 'Anna Giulia', '']] | \n", "2022-03-24 | \n", "2203.12490 | \n", "The aim of the paper is to first point out that the classical proof of the Freyd-Mitchell Embedding Theorem does not work in CZF; then, to propose an alternative embedding of a small abelian category into the category of sheaves of modules over a ringed space, which works constructively. It is necessary to mention that this work has been initially inspired by Erik Palmgren, who unexpectedly passed away in November 2019: I'm very grateful to him for having shared with me his intuitions, and for having supervised the realization of the first half of the paper. | \n", "[Freyd-Mitchell] | \n", "
| 78234 | \n", "Selectors and orderings of coarse spaces | \n", "Given a coarse space $(X, \\mathcal{E})$, we consider linear orders on $X$ compatible with the coarse structure $\\mathcal E$ and explore interplays between these orders and macro-uniform selectors of $(X, \\mathcal{E})$. | \n", "[math.GN] | \n", "[['Protasov', 'Igor', '']] | \n", "2021-03-24 | \n", "2102.02053 | \n", "Given a coarse space LATEX we consider linear orders on LATEX compatible with the coarse structure LATEX and explore interplays between these orders and macro-uniform selectors of LATEX | \n", "[macro-uniform] | \n", "
| \n", " | title | \n", "abstract | \n", "cat | \n", "authors_parsed | \n", "update_date | \n", "id | \n", "
|---|---|---|---|---|---|---|
| 83715 | \n", "Existence and uniqueness for the mild solution of the stochastic heat\\n equation with non-Lipschitz drift on an unbounded spatial domain | \n", "We prove the existence and uniqueness of the mild solution for a nonlinear stochastic heat equation defined on an unbounded spatial domain. The nonlinearity is not assumed to be globally, or even locally, Lipschitz continuous. Instead the nonlinearity is assumed to satisfy a one-sided Lipschitz condition. First, a strengthened version of the Kolmogorov continuity theorem is introduced to prove that the stochastic convolutions of the fundamental solution of the heat equation and a spatially homogeneous noise grow no faster than polynomially. Second, a deterministic mapping that maps the stochastic convolution to the solution of the stochastic heat equation is proven to be Lipschitz continuous on polynomially weighted spaces of continuous functions. These two ingredients enable the formulation of a Picard iteration scheme to prove the existence and uniqueness of the mild solution. | \n", "[math.PR] | \n", "[['Salins', 'Michael', '']] | \n", "2021-02-12 | \n", "2002.02016 | \n", "
| 88667 | \n", "Subdivisional spaces and graph braid groups | \n", "We study the problem of computing the homology of the configuration spaces of a finite cell complex $X$. We proceed by viewing $X$, together with its subdivisions, as a subdivisional space--a kind of diagram object in a category of cell complexes. After developing a version of Morse theory for subdivisional spaces, we decompose $X$ and show that the homology of the configuration spaces of $X$ is computed by the derived tensor product of the Morse complexes of the pieces of the decomposition, an analogue of the monoidal excision property of factorization homology. Applying this theory to the configuration spaces of a graph, we recover a cellular chain model due to \\'{S}wi\\k{a}tkowski. Our method of deriving this model enhances it with various convenient functorialities, exact sequences, and module structures, which we exploit in numerous computations, old and new. | \n", "[math.AT, math.GT] | \n", "[['An', 'Byung Hee', ''], ['Drummond-Cole', 'Gabriel C.', ''], ['Knudsen', 'Ben', '']] | \n", "2021-01-11 | \n", "1708.02351 | \n", "
| 43949 | \n", "Fluctuations for linear eigenvalue statistics of sample covariance\\n matrices | \n", "We prove a central limit theorem for the difference of linear eigenvalue statistics of a sample covariance matrix $\\widetilde{W}$ and its minor $W$. We find that the fluctuation of this difference is much smaller than those of the individual linear statistics, as a consequence of the strong correlation between the eigenvalues of $\\widetilde{W}$ and $W$. Our result identifies the fluctuation of the spatial derivative of the approximate Gaussian field in the recent paper by Dumitru and Paquette. Unlike in a similar result for Wigner matrices, for sample covariance matrices the fluctuation may entirely vanish. | \n", "[math.PR, math-ph, math.MP] | \n", "[['Cipolloni', 'Giorgio', ''], ['Erdős', 'László', '']] | \n", "2021-11-23 | \n", "1806.08751 | \n", "
| 18718 | \n", "Existence of real algebraic hypersurfaces with many prescribed\\n components | \n", "Given a real algebraic variety $X$ of dimension $n$, a very ample divisor $D$ on $X$ and a smooth closed hypersurface $\\Sigma$ of $\\mathbf{R}^n$, we construct real algebraic hypersurfaces in the linear system $|mD|$ whose real locus contains many connected components diffeomorphic to $\\Sigma$. As a consequence, we show the existence of real algebraic hypersurfaces in the linear system $|mD|$ whose Betti numbers grow by the maximal order, as $m$ goes to infinity. As another application, we recover a result by D. Gayet on the existence of many disjoint lagrangians with prescribed topology in any smooth complex hypersurface of $\\mathbf{C}\\mathbf{P}^n$. The results in the paper are proved more generally for complete intersections. The proof of our main result uses probabilistic tools. | \n", "[math.AG] | \n", "[['Ancona', 'Michele', '']] | \n", "2022-05-16 | \n", "2205.06617 | \n", "
| 60483 | \n", "Two lives: Compositions of unimodular rows | \n", "The paper lays the foundation for the study of unimodular rows using Spin groups. We show that elementary orbits of unimodular rows (of any length $n\\geq 3$) are equivalent to elementary Spin orbits on the unit sphere. (This bijection is true over all commutative rings). In the special case $n=3$, we get an interpretation of the Vaserstein symbol using Spin groups. In addition, we introduce a new composition law that operates on certain subspaces of the underlying quadratic space (using the multiplication in composition algebras). In particular, the special case of split-quaternions leads to the composition of unimodular rows (discovered by L. Vaserstein and later generalized by W. van der Kallen). Strikingly, with this approach, we now see the possibility of new orbit structures not only for unimodular rows (using octonion multiplication) but also for more general quadratic spaces. | \n", "[math.RA, math.AC, math.RT] | \n", "[['Chintala', 'Vineeth', '']] | \n", "2021-07-28 | \n", "2101.03862 | \n", "
| \n", " | title | \n", "abstract | \n", "cat | \n", "authors_parsed | \n", "update_date | \n", "id | \n", "
|---|---|---|---|---|---|---|
| 165063 | \n", "Injectivity, crossed products, and amenable group actions | \n", "This paper is motivated primarily by the question of when the maximal and reduced crossed products of a $G$-$C^*$-algebra agree (particularly inspired by results of Matsumura and Suzuki), and the relationships with various notions of amenability and injectivity. We give new connections between these notions. Key tools in this include the natural equivariant analogues of injectivity, and of Lance's weak expectation property: we also give complete characterizations of these equivariant properties, and some connections with injective envelopes in the sense of Hamana. | \n", "[math.OA] | \n", "[['Buss', 'Alcides', ''], ['Echterhoff', 'Siegfried', ''], ['Willett', 'Rufus', '']] | \n", "2019-04-30 | \n", "1904.06771 | \n", "
| 47016 | \n", "Online Optimization with Feedback Delay and Nonlinear Switching Cost | \n", "We study a variant of online optimization in which the learner receives $k$-round $\\textit{delayed feedback}$ about hitting cost and there is a multi-step nonlinear switching cost, i.e., costs depend on multiple previous actions in a nonlinear manner. Our main result shows that a novel Iterative Regularized Online Balanced Descent (iROBD) algorithm has a constant, dimension-free competitive ratio that is $O(L^{2k})$, where $L$ is the Lipschitz constant of the switching cost. Additionally, we provide lower bounds that illustrate the Lipschitz condition is required and the dependencies on $k$ and $L$ are tight. Finally, via reductions, we show that this setting is closely related to online control problems with delay, nonlinear dynamics, and adversarial disturbances, where iROBD directly offers constant-competitive online policies. | \n", "[cs.LG, cs.SY, eess.SY, math.OC] | \n", "[['Pan', 'Weici', ''], ['Shi', 'Guanya', ''], ['Lin', 'Yiheng', ''], ['Wierman', 'Adam', '']] | \n", "2021-11-02 | \n", "2111.00095 | \n", "
| 146120 | \n", "Integrable systems and Special K\\\"ahler metrics | \n", "We describe the Special K\\\"ahler structure on the base of the so-called Hitchin system in terms of the geometry of the space of spectral curves. It yields a simple formula for the K\\\"ahler potential. This extends to the case of a singular spectral curve and we show that this defines the Special K\\\"ahler structure on certain natural integrable subsystems. Examples include the extreme case where the metric is flat. | \n", "[math.DG] | \n", "[['Hitchin', 'Nigel', '']] | \n", "2019-10-14 | \n", "1910.05170 | \n", "
| 75448 | \n", "Regularity theorem for totally nonnegative flag varieties | \n", "We show that the totally nonnegative part of a partial flag variety $G/P$ (in the sense of Lusztig) is a regular CW complex, confirming a conjecture of Williams. In particular, the closure of each positroid cell inside the totally nonnegative Grassmannian is homeomorphic to a ball, confirming a conjecture of Postnikov. | \n", "[math.CO, math.AG, math.GT, math.RT] | \n", "[['Galashin', 'Pavel', ''], ['Karp', 'Steven N.', ''], ['Lam', 'Thomas', '']] | \n", "2021-04-13 | \n", "1904.00527 | \n", "
| 98744 | \n", "Federated Principal Component Analysis | \n", "We present a federated, asynchronous, and $(\\varepsilon, \\delta)$-differentially private algorithm for PCA in the memory-limited setting. Our algorithm incrementally computes local model updates using a streaming procedure and adaptively estimates its $r$ leading principal components when only $\\mathcal{O}(dr)$ memory is available with $d$ being the dimensionality of the data. We guarantee differential privacy via an input-perturbation scheme in which the covariance matrix of a dataset $\\mathbf{X} \\in \\mathbb{R}^{d \\times n}$ is perturbed with a non-symmetric random Gaussian matrix with variance in $\\mathcal{O}\\left(\\left(\\frac{d}{n}\\right)^2 \\log d \\right)$, thus improving upon the state-of-the-art. Furthermore, contrary to previous federated or distributed algorithms for PCA, our algorithm is also invariant to permutations in the incoming data, which provides robustness against straggler or failed nodes. Numerical simulations show that, while using limited-memory, our algorithm exhibits performance that closely matches or outperforms traditional non-federated algorithms, and in the absence of communication latency, it exhibits attractive horizontal scalability. | \n", "[cs.LG, cs.IT, math.IT, stat.ML] | \n", "[['Grammenos', 'Andreas', ''], ['Mendoza-Smith', 'Rodrigo', ''], ['Crowcroft', 'Jon', ''], ['Mascolo', 'Cecilia', '']] | \n", "2020-10-26 | \n", "1907.08059 | \n", "
| 72148 | \n", "Approaching optimality in blow-up results for Keller-Segel systems with logistic-type dampening | \n", "Nonnegative solutions of the Neumann initial-boundary value problem for the chemotaxis system \\begin{align}\\label{prob:star}\\tag{$\\star$} \\begin{cases} u_t = \\Delta u - \\nabla \\cdot (u \\nabla v) + \\lambda u - \\mu u^\\kappa, \\\\\\\\ 0 = \\Delta v - \\overline m(t) + u, \\quad \\overline m(t) = \\frac1{|\\Omega|} \\int_\\Omega u(\\cdot, t) \\end{cases} \\end{align} in smooth bounded domains $\\Omega \\subset \\mathbb R^n$, $n \\ge 1$, are known to be global-in-time if $\\lambda \\geq 0$, $\\mu > 0$ and $\\kappa > 2$. In the present work, we show that the exponent $\\kappa = 2$ is actually critical in the four- and higher dimensional setting. More precisely, if \\begin{alignat*}{3} \\qquad n &\\geq 4, &&\\quad \\kappa \\in (1, 2) \\quad &&\\text{and} \\quad \\mu > 0 \\\\\\\\ \\text{or}\\qquad n &\\geq 5, &&\\quad \\kappa = 2 \\quad &&\\text{and} \\quad \\mu \\in \\left(0, \\frac{n-4}{n}\\right), \\end{alignat*} for balls $\\Omega \\subset \\mathbb R^n$ and parameters $\\lambda \\geq 0$, $m_0 > 0$, we construct a nonnegative initial datum $u_0 \\in C^0(\\overline \\Omega)$ with $\\int_\\Omega u_0 = m_0$ for which the corresponding solution $(u, v)$ of \\eqref{prob:star} blows up in finite time. Moreover, in 3D, we obtain finite-time blow-up for $\\kappa \\in (1, \\frac32)$ (and $\\lambda \\geq 0$, $\\mu > 0$). As the corner stone of our analysis, for certain initial data, we prove that the mass accumulation function $w(s, t) = \\int_0^{\\sqrt[n]{s}} \\rho^{n-1} u(\\rho, t) \\,\\mathrm d\\rho$ fulfills the estimate $w_s \\le \\frac{w}{s}$. Using this information, we then obtain finite-time blow-up of $u$ by showing that for suitably chosen initial data, $s_0$ and $\\gamma$, the function $\\phi(t) = \\int_0^{s_0} s^{-\\gamma} (s_0 - s) w(s, t)$ cannot exist globally. | \n", "[math.AP] | \n", "[['Fuest', 'Mario', '']] | \n", "2021-05-10 | \n", "2007.01184 | \n", "
| 95154 | \n", "A Whitney type theorem for surfaces: characterising graphs with locally planar embeddings | \n", "We prove that for any parameter r an r-locally 2-connected graph G embeds r-locally planarly in a surface if and only if a certain matroid associated to the graph G is co-graphic. This extends Whitney's abstract planar duality theorem from 1932. | \n", "[math.CO] | \n", "[['Carmesin', 'Johannes', '']] | \n", "2020-11-20 | \n", "2008.03027 | \n", "
| 130579 | \n", "Rigorous bounds on the heat transport of rotating convection with Ekman pumping | \n", "We establish rigorous upper bounds on the time-averaged heat transport for a model of rotating Rayleigh-Benard convection between no-slip boundaries at infinite Prandtl number and with Ekman pumping. The analysis is based on the asymptotically reduced equations derived for rotationally constrained dynamics with no-slip boundaries, and hence includes a lower order correction that accounts for the Ekman layer and corresponding Ekman pumping into the bulk. Using the auxiliary functional method we find that, to leading order, the temporally averaged heat transport is bounded above as a function of the Rayleigh and Ekman numbers Ra and Ek according to $Nu \\leq 0.3704 Ra^2 Ek^2$. Dependent on the relative values of the thermal forcing represented by $Ra$ and the effects of rotation represented by $Ek$, this bound is both an improvement on earlier rigorous upper bounds, and provides a partial explanation of recent numerical and experimental results that were consistent yet surprising relative to the previously derived upper bound of $Nu \\lesssim Ra^3 k^4$. | \n", "[math-ph, math.MP, physics.flu-dyn] | \n", "[['Pachev', 'B.', ''], ['Whitehead', 'J. P.', ''], ['Fantuzzi', 'G.', ''], ['Grooms', 'I.', '']] | \n", "2020-02-19 | \n", "1910.13588 | \n", "
| 115850 | \n", "Massey products in the homology of the loopspace of a p-completed classifying space: finite groups with cyclic Sylow p-subgroups | \n", "Let G be a finite group with cyclic Sylow p-subgroup, and let k be a field of characteristic p. Then H^*(BG;k) and H_*(\\Omega BG\\phat;k) are A_{\\infty} algebras whose structure we determine up to quasi-isomorphism. | \n", "[math.RT] | \n", "[['Greenlees', 'John', ''], ['Benson', 'Dave', '']] | \n", "2020-06-15 | \n", "2006.07160 | \n", "
| 95087 | \n", "List-Decodable Mean Estimation in Nearly-PCA Time | \n", "Traditionally, robust statistics has focused on designing estimators tolerant to a minority of contaminated data. Robust list-decodable learning focuses on the more challenging regime where only a minority $\\frac 1 k$ fraction of the dataset is drawn from the distribution of interest, and no assumptions are made on the remaining data. We study the fundamental task of list-decodable mean estimation in high dimensions. Our main result is a new list-decodable mean estimation algorithm for bounded covariance distributions with optimal sample complexity and error rate, running in nearly-PCA time. Assuming the ground truth distribution on $\\mathbb{R}^d$ has bounded covariance, our algorithm outputs a list of $O(k)$ candidate means, one of which is within distance $O(\\sqrt{k})$ from the truth. Our algorithm runs in time $\\widetilde{O}(ndk)$ for all $k = O(\\sqrt{d}) \\cup \\Omega(d)$, where $n$ is the size of the dataset. We also show that a variant of our algorithm has runtime $\\widetilde{O}(ndk)$ for all $k$, at the expense of an $O(\\sqrt{\\log k})$ factor in the recovery guarantee. This runtime matches up to logarithmic factors the cost of performing a single $k$-PCA on the data, which is a natural bottleneck of known algorithms for (very) special cases of our problem, such as clustering well-separated mixtures. Prior to our work, the fastest list-decodable mean estimation algorithms had runtimes $\\widetilde{O}(n^2 d k^2)$ and $\\widetilde{O}(nd k^{\\ge 6})$. Our approach builds on a novel soft downweighting method, $\\mathsf{SIFT}$, which is arguably the simplest known polynomial-time mean estimation technique in the list-decodable learning setting. To develop our fast algorithms, we boost the computational cost of $\\mathsf{SIFT}$ via a careful \"win-win-win\" analysis of an approximate Ky Fan matrix multiplicative weights procedure we develop, which we believe may be of independent interest. | \n", "[cs.DS, cs.LG, math.OC, stat.ML] | \n", "[['Diakonikolas', 'Ilias', ''], ['Kane', 'Daniel M.', ''], ['Kongsgaard', 'Daniel', ''], ['Li', 'Jerry', ''], ['Tian', 'Kevin', '']] | \n", "2020-11-20 | \n", "2011.09973 | \n", "
| \n", " | title | \n", "abstract | \n", "cat | \n", "authors_parsed | \n", "update_date | \n", "id | \n", "clean_title | \n", "clean_abstract | \n", "hyph_in_title | \n", "hyph_in_abstract | \n", "
|---|---|---|---|---|---|---|---|---|---|---|
| 109208 | \n", "Consistency of Variational Bayes Inference for Estimation and Model Selection in Mixtures | \n", "Mixture models are widely used in Bayesian statistics and machine learning, in particular in computational biology, natural language processing and many other fields. Variational inference, a technique for approximating intractable posteriors thanks to optimization algorithms, is extremely popular in practice when dealing with complex models such as mixtures. The contribution of this paper is two-fold. First, we study the concentration of variational approximations of posteriors, which is still an open problem for general mixtures, and we derive consistency and rates of convergence. We also tackle the problem of model selection for the number of components: we study the approach already used in practice, which consists in maximizing a numerical criterion (the Evidence Lower Bound). We prove that this strategy indeed leads to strong oracle inequalities. We illustrate our theoretical results by applications to Gaussian and multinomial mixtures. | \n", "[math.ST, stat.CO, stat.ME, stat.TH] | \n", "[['Chérief-Abdellatif', 'Badr-Eddine', ''], ['Alquier', 'Pierre', '']] | \n", "2020-08-03 | \n", "1805.05054 | \n", "Consistency of Variational Bayes Inference for Estimation and Model Selection in Mixtures | \n", "Mixture models are widely used in Bayesian statistics and machine learning, in particular in computational biology, natural language processing and many other fields. Variational inference, a technique for approximating intractable posteriors thanks to optimization algorithms, is extremely popular in practice when dealing with complex models such as mixtures. The contribution of this paper is two-fold. First, we study the concentration of variational approximations of posteriors, which is still an open problem for general mixtures, and we derive consistency and rates of convergence. We also tackle the problem of model selection for the number of components: we study the approach already used in practice, which consists in maximizing a numerical criterion (the Evidence Lower Bound). We prove that this strategy indeed leads to strong oracle inequalities. We illustrate our theoretical results by applications to Gaussian and multinomial mixtures. | \n", "None | \n", "[two-fold] | \n", "
| 167970 | \n", "Data Amplification: A Unified and Competitive Approach to Property Estimation | \n", "Estimating properties of discrete distributions is a fundamental problem in statistical learning. We design the first unified, linear-time, competitive, property estimator that for a wide class of properties and for all underlying distributions uses just $2n$ samples to achieve the performance attained by the empirical estimator with $n\\sqrt{\\log n}$ samples. This provides off-the-shelf, distribution-independent, \"amplification\" of the amount of data available relative to common-practice estimators. We illustrate the estimator's practical advantages by comparing it to existing estimators for a wide variety of properties and distributions. In most cases, its performance with $n$ samples is even as good as that of the empirical estimator with $n\\log n$ samples, and for essentially all properties, its performance is comparable to that of the best existing estimator designed specifically for that property. | \n", "[stat.ML, cs.LG, math.ST, stat.TH] | \n", "[['Hao', 'Yi', ''], ['Orlitsky', 'Alon', ''], ['Suresh', 'Ananda T.', ''], ['Wu', 'Yihong', '']] | \n", "2019-04-02 | \n", "1904.00070 | \n", "Data Amplification: A Unified and Competitive Approach to Property Estimation | \n", "Estimating properties of discrete distributions is a fundamental problem in statistical learning. We design the first unified, linear-time, competitive, property estimator that for a wide class of properties and for all underlying distributions uses just LATEX samples to achieve the performance attained by the empirical estimator with LATEX samples. This provides off-the-shelf, distribution-independent, \"amplification\" of the amount of data available relative to common-practice estimators. We illustrate the estimator's practical advantages by comparing it to existing estimators for a wide variety of properties and distributions. In most cases, its performance with LATEX samples is even as good as that of the empirical estimator with LATEX samples, and for essentially all properties, its performance is comparable to that of the best existing estimator designed specifically for that property. | \n", "None | \n", "[linear-time, off-the-shelf, distribution-independent, common-practice] | \n", "
| 83749 | \n", "A Novel Trick to Overcome the Phase Space Volume Change and the Use of Hamiltonian Trajectories with an emphasis on the Free Expansion | \n", "We extend and successfully apply a recently proposed microstate nonequilibrium thermodynamics to study expansion/contraction processes. Here, the numbers of initial and final microstates are different so they cannot be connected by unique Hamiltonian trajectories. This commonly happens when the phase space volume changes, and has not been studied so far using Hamiltonian trajectories that can be inverted to yield an identity mapping between initial and final microstates as the parameter in the Hamiltonian is changed. We propose a trick to overcome this hurdle with a focus on free expansion in an isolated system, where the concept of dissipated work is not clear. The trick is shown to be thermodynamically consistent and can be extremely useful in simulation. We justify that it is the thermodynamic average of the internal microwork done by a microstate that is dissipated; this microwork is different from the exchange microwork with the vacuum, which vanishes. We also establish that the microwork is nonnegative for free expansion, which is remarkable, since its sign is not fixed in a general process. | \n", "[cond-mat.stat-mech, cond-mat.mes-hall, math-ph, math.MP, physics.comp-ph] | \n", "[['Gujrati', 'P. D.', '']] | \n", "2021-02-12 | \n", "2102.06122 | \n", "A Novel Trick to Overcome the Phase Space Volume Change and the Use of Hamiltonian Trajectories with an emphasis on the Free Expansion | \n", "We extend and successfully apply a recently proposed microstate nonequilibrium thermodynamics to study expansion/contraction processes. Here, the numbers of initial and final microstates are different so they cannot be connected by unique Hamiltonian trajectories. This commonly happens when the phase space volume changes, and has not been studied so far using Hamiltonian trajectories that can be inverted to yield an identity mapping between initial and final microstates as the parameter in the Hamiltonian is changed. We propose a trick to overcome this hurdle with a focus on free expansion in an isolated system, where the concept of dissipated work is not clear. The trick is shown to be thermodynamically consistent and can be extremely useful in simulation. We justify that it is the thermodynamic average of the internal microwork done by a microstate that is dissipated; this microwork is different from the exchange microwork with the vacuum, which vanishes. We also establish that the microwork is nonnegative for free expansion, which is remarkable, since its sign is not fixed in a general process. | \n", "None | \n", "None | \n", "
| 127567 | \n", "2-Local derivations on the W-algebra W(2,2) | \n", "The present paper is devoted to study 2-local derivations on W-algebra $W(2,2)$ which is an infinite-dimensional Lie algebras with some out derivations. We prove that all 2-local derivations on the W-algebra $W(2,2)$ are derivation. We also give a complete classification of the 2-local derivation on the so called thin Lie algebra and prove that it admits a lots of 2-local derivations which are not derivations. | \n", "[math.RA] | \n", "[['Tang', 'Xiaomin', '']] | \n", "2020-03-13 | \n", "2003.05627 | \n", "2-Local derivations on the W-algebra W(2,2) | \n", "The present paper is devoted to study 2-local derivations on W-algebra LATEX which is an infinite-dimensional Lie algebras with some out derivations. We prove that all 2-local derivations on the W-algebra LATEX are derivation. We also give a complete classification of the 2-local derivation on the so called thin Lie algebra and prove that it admits a lots of 2-local derivations which are not derivations. | \n", "[2-Local, W-algebra] | \n", "[2-local, W-algebra, infinite-dimensional, 2-local, W-algebra, 2-local, 2-local] | \n", "
| 42123 | \n", "Rees algebra and special fiber ring of binomial edge ideals of closed graphs | \n", "In this article, we compute the regularity of Rees algebra of binomial edge ideals of closed graphs. We obtain a lower bound for the regularity of Rees algebra of binomial edge ideals. We also study some algebraic properties of the Rees algebra and special fiber ring of binomial edge ideals of closed graphs via algebraic properties of their initial algebra and Sagbi basis theory. We obtain an upper bound for the regularity of the special fiber ring of binomial edge ideals of closed graphs. | \n", "[math.AC] | \n", "[['Kumar', 'Arvind', '']] | \n", "2021-12-07 | \n", "2102.03348 | \n", "Rees algebra and special fiber ring of binomial edge ideals of closed graphs | \n", "In this article, we compute the regularity of Rees algebra of binomial edge ideals of closed graphs. We obtain a lower bound for the regularity of Rees algebra of binomial edge ideals. We also study some algebraic properties of the Rees algebra and special fiber ring of binomial edge ideals of closed graphs via algebraic properties of their initial algebra and Sagbi basis theory. We obtain an upper bound for the regularity of the special fiber ring of binomial edge ideals of closed graphs. | \n", "None | \n", "None | \n", "
| 45450 | \n", "Unbalanced spanning subgraphs in edge labeled complete graphs | \n", "Let $K$ be a complete graph of order $n$. For $d\\in (0,1)$, let $c$ be a $\\pm 1$-edge labeling of $K$ such that there are $d{n\\choose 2}$ edges with label $+1$, and let $G$ be a spanning subgraph of $K$ of maximum degree at most $\\Delta$. We prove the existence of an isomorphic copy $G'$ of $G$ in $K$ such that the number of edges with label $+1$ in $G'$ is at least $\\left(c_{d,\\Delta}-O\\left(\\frac{1}{n}\\right)\\right)m(G)$, where $c_{d,\\Delta}=d+\\Omega\\left(\\frac{1}{\\Delta}\\right)$ for fixed $d$, that is, this number visibly deviates from its expected value when considering a uniformly random copy of $G$ in $K$. For $d=\\frac{1}{2}$, and $\\Delta\\leq 2$, we present more detailed results. | \n", "[math.CO] | \n", "[['Bessy', 'Stéphane', ''], ['Pardey', 'Johannes', ''], ['Picasarri-Arrieta', 'Lucas', ''], ['Rautenbach', 'Dieter', '']] | \n", "2021-11-12 | \n", "2107.09290 | \n", "Unbalanced spanning subgraphs in edge labeled complete graphs | \n", "Let LATEX be a complete graph of order LATEX For LATEX let LATEX be a LATEX labeling of LATEX such that there are LATEX edges with label LATEX and let LATEX be a spanning subgraph of LATEX of maximum degree at most LATEX We prove the existence of an isomorphic copy LATEX of LATEX in LATEX such that the number of edges with label LATEX in LATEX is at least LATEX where LATEX for fixed LATEX that is, this number visibly deviates from its expected value when considering a uniformly random copy of LATEX in LATEX For LATEX and LATEX we present more detailed results. | \n", "None | \n", "None | \n", "
| 26834 | \n", "Monotone metric tensors in Quantum Information Geometry | \n", "We review some geometrical aspects pertaining to the world of monotone quantum metrics in finite dimensions. Particular emphasis is given to an unfolded perspective for quantum states that is built out of the spectral theorem and is naturally suited to investigate the comparison with the classical case of probability distributions. | \n", "[quant-ph, math-ph, math.MP] | \n", "[['Ciaglia', 'Florio M.', ''], ['Di Cosmo', 'Fabio', ''], ['Di Nocera', 'Fabio', ''], ['Vitale', 'Patrizia', '']] | \n", "2022-03-22 | \n", "2203.10857 | \n", "Monotone metric tensors in Quantum Information Geometry | \n", "We review some geometrical aspects pertaining to the world of monotone quantum metrics in finite dimensions. Particular emphasis is given to an unfolded perspective for quantum states that is built out of the spectral theorem and is naturally suited to investigate the comparison with the classical case of probability distributions. | \n", "None | \n", "None | \n", "
| 14369 | \n", "A new distance measurement and its application in K-Means Algorithm | \n", "K-Means clustering algorithm is one of the most commonly used clustering algorithms because of its simplicity and efficiency. K-Means clustering algorithm based on Euclidean distance only pays attention to the linear distance between samples, but ignores the overall distribution structure of the dataset (i.e. the fluid structure of dataset). Since it is difficult to describe the internal structure of two data points by Euclidean distance in high-dimensional data space, we propose a new distance measurement, namely, view-distance, and apply it to the K-Means algorithm. On the classical manifold learning datasets, S-curve and Swiss roll datasets, not only this new distance can cluster the data according to the structure of the data itself, but also the boundaries between categories are neat dividing lines. Moreover, we also tested the classification accuracy and clustering effect of the K-Means algorithm based on view-distance on some real-world datasets. The experimental results show that, on most datasets, the K-Means algorithm based on view-distance has a certain degree of improvement in classification accuracy and clustering effect. | \n", "[cs.LG, cs.NA, math.NA] | \n", "[['Zhang', 'Yiqun', ''], ['Li', 'Houbiao', '']] | \n", "2022-06-13 | \n", "2206.05215 | \n", "A new distance measurement and its application in K-Means Algorithm | \n", "K-Means clustering algorithm is one of the most commonly used clustering algorithms because of its simplicity and efficiency. K-Means clustering algorithm based on Euclidean distance only pays attention to the linear distance between samples, but ignores the overall distribution structure of the dataset (i.e. the fluid structure of dataset). Since it is difficult to describe the internal structure of two data points by Euclidean distance in high-dimensional data space, we propose a new distance measurement, namely, view-distance, and apply it to the K-Means algorithm. On the classical manifold learning datasets, S-curve and Swiss roll datasets, not only this new distance can cluster the data according to the structure of the data itself, but also the boundaries between categories are neat dividing lines. Moreover, we also tested the classification accuracy and clustering effect of the K-Means algorithm based on view-distance on some real-world datasets. The experimental results show that, on most datasets, the K-Means algorithm based on view-distance has a certain degree of improvement in classification accuracy and clustering effect. | \n", "[K-Means] | \n", "[K-Means, K-Means, high-dimensional, view-distance, K-Means, S-curve, K-Means, view-distance, real-world, K-Means, view-distance] | \n", "
| 174903 | \n", "A numerical model based on the curvilinear coordinate system for the MAC method simplified | \n", "In this paper we developed a numerical methodology to study some incompressible fluid flows without free surface, using the curvilinear coordinate system and whose edge geometry is constructed via parametrized spline. First, we discussed the representation of the Navier-Stokes and continuity equations on the curvilinear coordinate system, along with the auxiliary conditions. Then, we presented the numerical method -- a simplified version of MAC (\\textit{Marker and Cell}) method -- along with the discretization of the governing equations, which is carried out using the finite differences method and the implementation of the FOU (\\textit{First Order Upwind}) scheme. Finally, we applied the numerical methodology to the parallel plates problem, lid-driven cavity problem and atherosclerosis problem, and then we compare the results obtained with those presented in the literature. Keywords: finite differences, simplified MAC, curvilinear coordinates, parallel plates, did-driven cavity, atherosclerosis. | \n", "[math.NA, physics.flu-dyn] | \n", "[['Cirilo', 'Eliandro Rodrigues', ''], ['Barba', 'Alessandra Negrini Dalla', ''], ['Romeiro', 'Neyva Maria Lopes', ''], ['Natti', 'Paulo Laerte', '']] | \n", "2019-02-11 | \n", "1902.03032 | \n", "A numerical model based on the curvilinear coordinate system for the MAC method simplified | \n", "In this paper we developed a numerical methodology to study some incompressible fluid flows without free surface, using the curvilinear coordinate system and whose edge geometry is constructed via parametrized spline. First, we discussed the representation of the Navier-Stokes and continuity equations on the curvilinear coordinate system, along with the auxiliary conditions. Then, we presented the numerical method -- a simplified version of MAC () method -- along with the discretization of the governing equations, which is carried out using the finite differences method and the implementation of the FOU () scheme. Finally, we applied the numerical methodology to the parallel plates problem, lid-driven cavity problem and atherosclerosis problem, and then we compare the results obtained with those presented in the literature. Keywords: finite differences, simplified MAC, curvilinear coordinates, parallel plates, did-driven cavity, atherosclerosis. | \n", "None | \n", "[Navier-Stokes, lid-driven, did-driven] | \n", "
| 133557 | \n", "Weil-Petersson translation length and manifolds with many fibered fillings | \n", "We prove that any mapping torus of a pseudo-Anosov mapping class with bounded normalized Weil-Petersson translation length contains a finite set of transverse and level closed curves, and drilling out this set of curves results in one of a finite number of cusped hyperbolic 3-manifolds. The number of manifolds in the finite list depends only on the bound for normalized translation length. We also prove a complementary result that explains the necessity of removing level curves by producing new estimates for the Weil-Petersson translation length of compositions of pseudo-Anosov mapping classes and arbitrary powers of a Dehn twist. | \n", "[math.GT, math.CV, math.DG] | \n", "[['Leininger', 'Christopher J.', ''], ['Minsky', 'Yair N.', ''], ['Souto', 'Juan', ''], ['Taylor', 'Samuel J.', '']] | \n", "2020-01-27 | \n", "1910.01169 | \n", "Weil-Petersson translation length and manifolds with many fibered fillings | \n", "We prove that any mapping torus of a pseudo-Anosov mapping class with bounded normalized Weil-Petersson translation length contains a finite set of transverse and level closed curves, and drilling out this set of curves results in one of a finite number of cusped hyperbolic 3-manifolds. The number of manifolds in the finite list depends only on the bound for normalized translation length. We also prove a complementary result that explains the necessity of removing level curves by producing new estimates for the Weil-Petersson translation length of compositions of pseudo-Anosov mapping classes and arbitrary powers of a Dehn twist. | \n", "[Weil-Petersson] | \n", "[pseudo-Anosov, Weil-Petersson, 3-manifolds, Weil-Petersson, pseudo-Anosov] | \n", "
| 32750 | \n", "Invariant measures for large automorphism groups of projective surfaces | \n", "We classify invariant probability measures for non-elementary groups of automorphisms, on any compact K\\\"ahler surface X, under the assumption that the group contains a so-called \"parabolic automorphism\". We also prove that except in certain rigid situations known as Kummer examples, there are only finitely many invariant, ergodic, probability measures with a Zariski dense support. If X is a K3 or Enriques surface, and the group does not preserve any algebraic subset, this leads to a complete description of orbit closures. | \n", "[math.DS, math.AG] | \n", "[['Cantat', 'Serge', ''], ['Dujardin', 'Romain', '']] | \n", "2022-02-10 | \n", "2110.04213 | \n", "Invariant measures for large automorphism groups of projective surfaces | \n", "We classify invariant probability measures for non-elementary groups of automorphisms, on any compact Kahler surface X, under the assumption that the group contains a so-called \"parabolic automorphism\". We also prove that except in certain rigid situations known as Kummer examples, there are only finitely many invariant, ergodic, probability measures with a Zariski dense support. If X is a K3 or Enriques surface, and the group does not preserve any algebraic subset, this leads to a complete description of orbit closures. | \n", "None | \n", "[non-elementary, so-called] | \n", "
| 7442 | \n", "Sharp estimates, uniqueness and nondegeneracy of positive solutions of the Lane-Emden system in planar domains | \n", "We study the Lane-Emden system $$\\begin{cases} -\\Delta u=v^p,\\quad u>0,\\quad\\text{in}~\\Omega, -\\Delta v=u^q,\\quad v>0,\\quad\\text{in}~\\Omega, u=v=0,\\quad\\text{on}~\\partial\\Omega, \\end{cases}$$ where $\\Omega\\subset\\mathbb{R}^2$ is a smooth bounded domain. In a recent work, we studied the concentration phenomena of positive solutions as $p,q\\to+\\infty$ and $|q-p|\\leq \\Lambda$. In this paper, we obtain sharp estimates of such multi-bubble solutions, including sharp convergence rates of local maxima and scaling parameters, and accurate approximations of solutions. As an application of these sharp estimates, we show that when $\\Omega$ is convex, then the solution of this system is unique and nondegenerate for large $p, q$. | \n", "[math.AP] | \n", "[['Chen', 'Zhijie', ''], ['Li', 'Houwang', ''], ['Zou', 'Wenming', '']] | \n", "2022-07-26 | \n", "2205.15055 | \n", "Sharp estimates, uniqueness and nondegeneracy of positive solutions of the Lane-Emden system in planar domains | \n", "We study the Lane-Emden system LATEX where LATEX is a smooth bounded domain. In a recent work, we studied the concentration phenomena of positive solutions as LATEX and LATEX In this paper, we obtain sharp estimates of such multi-bubble solutions, including sharp convergence rates of local maxima and scaling parameters, and accurate approximations of solutions. As an application of these sharp estimates, we show that when LATEX is convex, then the solution of this system is unique and nondegenerate for large LATEX | \n", "[Lane-Emden] | \n", "[Lane-Emden, multi-bubble] | \n", "
| 162934 | \n", "The time evolution of permutations under random stirring | \n", "We consider permutations of $\\{1,...,n\\}$ obtained by $\\lfloor\\sqrt{n}t\\rfloor$ independent applications of random stirring. In each step the same marked stirring element is transposed with probability $1/n$ with any one of the $n$ elements. Normalizing by $\\sqrt{n}$ we describe the asymptotic distribution of the cycle structure of these permutations, for all $t\\ge 0$, as $n\\to\\infty$. | \n", "[math.PR] | \n", "[['Vető', 'Bálint', '']] | \n", "2019-05-20 | \n", "math/0603044 | \n", "The time evolution of permutations under random stirring | \n", "We consider permutations of LATEX obtained by LATEX independent applications of random stirring. In each step the same marked stirring element is transposed with probability LATEX with any one of the LATEX elements. Normalizing by LATEX we describe the asymptotic distribution of the cycle structure of these permutations, for all LATEX as LATEX | \n", "None | \n", "None | \n", "
| 1035 | \n", "Bridges of Markov counting processes. Reciprocal classes and duality formulas | \n", "Processes having the same bridges are said to belong to the same reciprocal class. In this article we analyze reciprocal classes of Markov counting processes by identifying their reciprocal invariants and we characterize them as the set of counting processes satisfying some duality formula. | \n", "[math.PR] | \n", "[['Conforti', 'Giovanni', '', \"MODAL'X\"], ['Léonard', 'Christian', '', \"MODAL'X\"], ['Murr', 'Rüdiger', ''], ['Roelly', 'Sylvie', '']] | \n", "2022-09-05 | \n", "1408.1332 | \n", "Bridges of Markov counting processes. Reciprocal classes and duality formulas | \n", "Processes having the same bridges are said to belong to the same reciprocal class. In this article we analyze reciprocal classes of Markov counting processes by identifying their reciprocal invariants and we characterize them as the set of counting processes satisfying some duality formula. | \n", "None | \n", "None | \n", "
| 29606 | \n", "Dynamic Compressed Sensing of Unsteady Flows with a Mobile Robot | \n", "Large-scale environmental sensing with a finite number of mobile sensors is a challenging task that requires a lot of resources and time. This is especially true when features in the environment are spatiotemporally changing with unknown or partially known dynamics. Fortunately, these dynamic features often evolve in a low-dimensional space, making it possible to capture their dynamics sufficiently well with only one or several properly planned mobile sensors. This paper investigates the problem of dynamic compressed sensing of an unsteady flow field, which takes advantage of the inherently low dimensionality of the underlying flow dynamics to reduce number of waypoints for a mobile sensing robot. The optimal sensing waypoints are identified by an iterative compressed sensing algorithm that optimizes the flow reconstruction based on the proper orthogonal decomposition modes. An optimal sampling trajectory is then found to traverse these waypoints while minimizing the energy consumption, time, and flow reconstruction error. Simulation results in an unsteady double gyre flow field is presented to demonstrate the efficacy of the proposed algorithms. Experimental results with an indoor quadcopter are presented to show the feasibility of the resulting trajectory. | \n", "[cs.RO, eess.SP, math.OC] | \n", "[['Shriwastav', 'Sachin', ''], ['Snyder', 'Gregory', ''], ['Song', 'Zhuoyuan', '']] | \n", "2022-03-03 | \n", "2110.08658 | \n", "Dynamic Compressed Sensing of Unsteady Flows with a Mobile Robot | \n", "Large-scale environmental sensing with a finite number of mobile sensors is a challenging task that requires a lot of resources and time. This is especially true when features in the environment are spatiotemporally changing with unknown or partially known dynamics. Fortunately, these dynamic features often evolve in a low-dimensional space, making it possible to capture their dynamics sufficiently well with only one or several properly planned mobile sensors. This paper investigates the problem of dynamic compressed sensing of an unsteady flow field, which takes advantage of the inherently low dimensionality of the underlying flow dynamics to reduce number of waypoints for a mobile sensing robot. The optimal sensing waypoints are identified by an iterative compressed sensing algorithm that optimizes the flow reconstruction based on the proper orthogonal decomposition modes. An optimal sampling trajectory is then found to traverse these waypoints while minimizing the energy consumption, time, and flow reconstruction error. Simulation results in an unsteady double gyre flow field is presented to demonstrate the efficacy of the proposed algorithms. Experimental results with an indoor quadcopter are presented to show the feasibility of the resulting trajectory. | \n", "None | \n", "[Large-scale, low-dimensional] | \n", "
| 7622 | \n", "Reconstructing anisotropic conductivities on two-dimensional Riemannian manifolds from power densities | \n", "We consider an electrically conductive compact two-dimensional Riemannian manifold with a smooth boundary. This setting defines a natural conductive Laplacian on the manifold and hence also voltage potentials, current fields and corresponding power densities arising from suitable boundary conditions. Motivated by Acousto-Electric Tomography we show that if the manifold has genus zero and the metric is known, then the conductivity can be recovered uniquely and constructively from knowledge of a few power densities. We illustrate the reconstruction procedure numerically by an example of a conductivity on a non-simply connected surface in three-space. | \n", "[math.AP] | \n", "[['Knudsen', 'Kim', ''], ['Markvorsen', 'Steen', ''], ['Schlüter', 'Hjørdis', '']] | \n", "2022-07-26 | \n", "2202.12056 | \n", "Reconstructing anisotropic conductivities on two-dimensional Riemannian manifolds from power densities | \n", "We consider an electrically conductive compact two-dimensional Riemannian manifold with a smooth boundary. This setting defines a natural conductive Laplacian on the manifold and hence also voltage potentials, current fields and corresponding power densities arising from suitable boundary conditions. Motivated by Acousto-Electric Tomography we show that if the manifold has genus zero and the metric is known, then the conductivity can be recovered uniquely and constructively from knowledge of a few power densities. We illustrate the reconstruction procedure numerically by an example of a conductivity on a non-simply connected surface in three-space. | \n", "[two-dimensional] | \n", "[two-dimensional, Acousto-Electric, non-simply, three-space] | \n", "
| 102914 | \n", "Multilevel Ensemble Kalman Filtering based on a sample average of independent EnKF estimators | \n", "We introduce a new multilevel ensemble Kalman filter method (MLEnKF) which consists of a hierarchy of independent samples of ensemble Kalman filters (EnKF). This new MLEnKF method is fundamentally different from the preexisting method introduced by Hoel, Law and Tempone in 2016, and it is suitable for extensions towards multi-index Monte Carlo based filtering methods. Robust theoretical analysis and supporting numerical examples show that under appropriate regularity assumptions, the MLEnKF method has better complexity than plain vanilla EnKF in the large-ensemble and fine-resolution limits, for weak approximations of quantities of interest. The method is developed for discrete-time filtering problems with finite-dimensional state space and linear observations polluted by additive Gaussian noise. | \n", "[math.NA, cs.NA] | \n", "[['Hoel', 'Håkon', ''], ['Shaimerdenova', 'Gaukhar', ''], ['Tempone', 'Raúl', '']] | \n", "2020-09-22 | \n", "2002.00480 | \n", "Multilevel Ensemble Kalman Filtering based on a sample average of independent EnKF estimators | \n", "We introduce a new multilevel ensemble Kalman filter method (MLEnKF) which consists of a hierarchy of independent samples of ensemble Kalman filters (EnKF). This new MLEnKF method is fundamentally different from the preexisting method introduced by Hoel, Law and Tempone in 2016, and it is suitable for extensions towards multi-index Monte Carlo based filtering methods. Robust theoretical analysis and supporting numerical examples show that under appropriate regularity assumptions, the MLEnKF method has better complexity than plain vanilla EnKF in the large-ensemble and fine-resolution limits, for weak approximations of quantities of interest. The method is developed for discrete-time filtering problems with finite-dimensional state space and linear observations polluted by additive Gaussian noise. | \n", "None | \n", "[multi-index, large-ensemble, fine-resolution, discrete-time, finite-dimensional] | \n", "
| 77326 | \n", "Minimum Feature Size Control in Level Set Topology Optimization via Density Fields | \n", "A level set topology optimization approach that uses an auxiliary density field to nucleate holes during the optimization process and achieves minimum feature size control in optimized designs is explored. The level set field determines the solid-void interface, and the density field describes the distribution of a fictitious porous material using the solid isotropic material with penalization. These fields are governed by two sets of independent optimization variables which are initially coupled using a penalty for hole nucleation. The strength of the density field penalization and projection are gradually increased through the optimization process to promote a 0-1 density distribution. This treatment of the density field combined with a second penalty that regulates the evolution of the density field in the void phase, mitigate the appearance of small design features. The minimum feature size of optimized designs is controlled by the radius of the linear filter applied to the density optimization variables. The structural response is predicted by the extended finite element method, the sensitivities by the adjoint method, and the optimization variables are updated by a gradient-based optimization algorithm. Numerical examples investigate the robustness of this approach with respect to algorithmic parameters and mesh refinement. The results show the applicability of the combined density level set topology optimization approach for both optimal hole nucleation and for minimum feature size control in 2D and 3D. This comes, however, at the cost of a more advanced problem formulation and additional computational cost due to an increased number of optimization variables. | \n", "[math.OC] | \n", "[['Barrera', 'Jorge L.', ''], ['Geiss', 'Markus J.', ''], ['Maute', 'Kurt', '']] | \n", "2021-03-30 | \n", "2103.14585 | \n", "Minimum Feature Size Control in Level Set Topology Optimization via Density Fields | \n", "A level set topology optimization approach that uses an auxiliary density field to nucleate holes during the optimization process and achieves minimum feature size control in optimized designs is explored. The level set field determines the solid-void interface, and the density field describes the distribution of a fictitious porous material using the solid isotropic material with penalization. These fields are governed by two sets of independent optimization variables which are initially coupled using a penalty for hole nucleation. The strength of the density field penalization and projection are gradually increased through the optimization process to promote a 0-1 density distribution. This treatment of the density field combined with a second penalty that regulates the evolution of the density field in the void phase, mitigate the appearance of small design features. The minimum feature size of optimized designs is controlled by the radius of the linear filter applied to the density optimization variables. The structural response is predicted by the extended finite element method, the sensitivities by the adjoint method, and the optimization variables are updated by a gradient-based optimization algorithm. Numerical examples investigate the robustness of this approach with respect to algorithmic parameters and mesh refinement. The results show the applicability of the combined density level set topology optimization approach for both optimal hole nucleation and for minimum feature size control in 2D and 3D. This comes, however, at the cost of a more advanced problem formulation and additional computational cost due to an increased number of optimization variables. | \n", "None | \n", "[solid-void, 0-1, gradient-based] | \n", "
| 71427 | \n", "Super quantum cohomology I: Super stable maps of genus zero with Neveu-Schwarz punctures | \n", "In this article we define stable supercurves and super stable maps of genus zero via labeled trees. We prove that the moduli space of stable supercurves and super stable maps of fixed tree type are quotient superorbifolds. To this end, we prove a slice theorem for the action of super Lie groups on Riemannian supermanifolds and discuss superorbifolds. Furthermore, we propose a Gromov topology on super stable maps such that the restriction to fixed tree type yields the quotient topology from the superorbifolds and the reduction is compact. This would, possibly, lead to the notions of super Gromov-Witten invariants and small super quantum cohomology to be discussed in sequels. | \n", "[math.DG, math-ph, math.AG, math.MP] | \n", "[['Keßler', 'Enno', ''], ['Sheshmani', 'Artan', ''], ['Yau', 'Shing-Tung', '']] | \n", "2021-05-13 | \n", "2010.15634 | \n", "Super quantum cohomology I: Super stable maps of genus zero with Neveu-Schwarz punctures | \n", "In this article we define stable supercurves and super stable maps of genus zero via labeled trees. We prove that the moduli space of stable supercurves and super stable maps of fixed tree type are quotient superorbifolds. To this end, we prove a slice theorem for the action of super Lie groups on Riemannian supermanifolds and discuss superorbifolds. Furthermore, we propose a Gromov topology on super stable maps such that the restriction to fixed tree type yields the quotient topology from the superorbifolds and the reduction is compact. This would, possibly, lead to the notions of super Gromov-Witten invariants and small super quantum cohomology to be discussed in sequels. | \n", "[Neveu-Schwarz] | \n", "[Gromov-Witten] | \n", "
| 89892 | \n", "The three types of normal sequential effect algebras | \n", "A sequential effect algebra (SEA) is an effect algebra equipped with a sequential product operation modeled after the L\\\"uders product $(a,b)\\mapsto \\sqrt{a}b\\sqrt{a}$ on C*-algebras. A SEA is called normal when it has all suprema of directed sets, and the sequential product interacts suitably with these suprema. The effects on a Hilbert space and the unit interval of a von Neumann or JBW algebra are examples of normal SEAs that are in addition convex, i.e. possess a suitable action of the real unit interval on the algebra. Complete Boolean algebras form normal SEAs too, which are convex only when $0=1$. We show that any normal SEA $E$ splits as a direct sum $E\\equiv E_b\\oplus E_c \\oplus E_{ac}$ of a complete Boolean algebra $E_b$, a convex normal SEA $E_c$, and a newly identified type of normal SEA $E_{ac}$ we dub purely almost-convex. Along the way we show, among other things, that a SEA which contains only idempotents must be a Boolean algebra; and we establish a spectral theorem using which we settle for the class of normal SEAs a problem of Gudder regarding the uniqueness of square roots. After establishing our main result, we propose a simple extra axiom for normal SEAs that excludes the seemingly pathological a-convex SEAs. We conclude the paper by a study of SEAs with an associative sequential product. We find that associativity forces normal SEAs satisfying our new axiom to be commutative, shedding light on the question of why the sequential product in quantum theory should be non-associative. | \n", "[quant-ph, math.OA] | \n", "[['Westerbaan', 'Abraham', ''], ['Westerbaan', 'Bas', ''], ['van de Wetering', 'John', '']] | \n", "2020-12-30 | \n", "2004.12749 | \n", "The three types of normal sequential effect algebras | \n", "A sequential effect algebra (SEA) is an effect algebra equipped with a sequential product operation modeled after the Luders product LATEX on C*-algebras. A SEA is called normal when it has all suprema of directed sets, and the sequential product interacts suitably with these suprema. The effects on a Hilbert space and the unit interval of a von Neumann or JBW algebra are examples of normal SEAs that are in addition convex, i.e. possess a suitable action of the real unit interval on the algebra. Complete Boolean algebras form normal SEAs too, which are convex only when LATEX We show that any normal SEA LATEX splits as a direct sum LATEX of a complete Boolean algebra LATEX a convex normal SEA LATEX and a newly identified type of normal SEA LATEX we dub purely almost-convex. Along the way we show, among other things, that a SEA which contains only idempotents must be a Boolean algebra; and we establish a spectral theorem using which we settle for the class of normal SEAs a problem of Gudder regarding the uniqueness of square roots. After establishing our main result, we propose a simple extra axiom for normal SEAs that excludes the seemingly pathological a-convex SEAs. We conclude the paper by a study of SEAs with an associative sequential product. We find that associativity forces normal SEAs satisfying our new axiom to be commutative, shedding light on the question of why the sequential product in quantum theory should be non-associative. | \n", "None | \n", "[almost-convex, a-convex, non-associative] | \n", "
| \n", " | raw_title | \n", "clean_title | \n", "hyph_in_title | \n", "raw_abstract | \n", "clean_abstract | \n", "hyph_in_abstract | \n", "authors_parsed | \n", "cat | \n", "update_date | \n", "id | \n", "
|---|---|---|---|---|---|---|---|---|---|---|
| 0 | \n", "Vertex representations via finite groups and the McKay correspondence | \n", "Vertex representations via finite groups and the McKay correspondence | \n", "None | \n", "Given a finite group $\\Gamma$ and a virtual character $\\wt$ on it, we construct a Fock space and associated vertex operators in terms of representation ring of wreath products $\\Gamma\\sim S_n$. We recover the character tables of wreath products $\\Gamma\\sim S_n$ by vertex operator calculus. When $\\Gamma$ is a finite subgroup of $SU_2$, our construction yields a group theoretic realization of the basic representations of the affine and toroidal Lie algebras of $ADE$ type, which can be regarded as a new form of McKay correspondence. | \n", "Given a finite group LATEX and a virtual character LATEX on it, we construct a Fock space and associated vertex operators in terms of representation ring of wreath products LATEX We recover the character tables of wreath products LATEX by vertex operator calculus. When LATEX is a finite subgroup of LATEX our construction yields a group theoretic realization of the basic representations of the affine and toroidal Lie algebras of LATEX type, which can be regarded as a new form of McKay correspondence. | \n", "None | \n", "[['Frenkel', 'Igor', ''], ['Jing', 'Naihuan', ''], ['Wang', 'Weiqiang', '']] | \n", "[math.QA, hep-th, math.RT] | \n", "2023-05-19 | \n", "math/9907166 | \n", "
| 1 | \n", "Categoricity and amalgamation for AEC and $ \\kappa $ measurable | \n", "Categoricity and amalgamation for AEC and LATEX measurable | \n", "None | \n", "In the original version of this paper, we assume a theory $T$ that the logic $\\mathbb L _{\\kappa, \\aleph_{0}}$ is categorical in a cardinal $\\lambda > \\kappa$, and $\\kappa$ is a measurable cardinal. There we prove that the class of model of $T$ of cardinality $<\\lambda$ (but $\\geq |T|+\\kappa$) has the amalgamation property; this is a step toward understanding the character of such classes of models. In this revised version we replaced the class of models of $T$ by $\\mathfrak k$, an AEC (abstract elementary class) which has LS-number ${<} \\, \\kappa,$ or at least which behave nicely for ultrapowers by $D$, a normal ultra-filter on $\\kappa$. Presently sub-section \\S1A deals with $T \\subseteq \\mathbb L_{\\kappa^{+}, \\aleph_{0}}$ (and so does a large part of the introduction and little in the rest of \\S1), but otherwise, all is done in the context of AEC. | \n", "In the original version of this paper, we assume a theory LATEX that the logic LATEX is categorical in a cardinal LATEX and LATEX is a measurable cardinal. There we prove that the class of model of LATEX of cardinality LATEX (but LATEX has the amalgamation property; this is a step toward understanding the character of such classes of models. In this revised version we replaced the class of models of LATEX by LATEX an AEC (abstract elementary class) which has LS-number LATEX or at least which behave nicely for ultrapowers by LATEX a normal ultra-filter on LATEX Presently sub-section \\S1A deals with LATEX (and so does a large part of the introduction and little in the rest of \\S1), but otherwise, all is done in the context of AEC. | \n", "[LS-number, ultra-filter, sub-section] | \n", "[['Kolman', 'Oren', ''], ['Shelah', 'Saharon', '']] | \n", "[math.LO] | \n", "2023-05-19 | \n", "math/9602216 | \n", "
| 2 | \n", "From Loop Groups to 2-Groups | \n", "From Loop Groups to 2-Groups | \n", "[2-Groups] | \n", "We describe an interesting relation between Lie 2-algebras, the Kac-Moody central extensions of loop groups, and the group $\\mathrm{String}(n)$. A Lie 2-algebra is a categorified version of a Lie algebra where the Jacobi identity holds up to a natural isomorphism called the \"Jacobiator\". Similarly, a Lie 2-group is a categorified version of a Lie group. If $G$ is a simply-connected compact simple Lie group, there is a 1-parameter family of Lie 2-algebras $\\mathfrak{g}_k$ each having $\\mathrm{Lie}(G)$ as its Lie algebra of objects, but with a Jacobiator built from the canonical 3-form on $G$. There appears to be no Lie 2-group having $\\mathfrak{g}_k$ as its Lie 2-algebra, except when $k = 0$. Here, however, we construct for integral k an infinite-dimensional Lie 2-group whose Lie 2-algebra is equivalent to $\\mathfrak{g}_k$. The objects of this 2-group are based paths in $G$, while the automorphisms of any object form the level-$k$ Kac-Moody central extension of the loop group of $G$. This 2-group is closely related to the $k$th power of the canonical gerbe over $G$. Its nerve gives a topological group that is an extension of $G$ by $K(\\mathbb{Z},2)$. When $k = \\pm 1$, this topological group can also be obtained by killing the third homotopy group of $G$. Thus, when $G = \\mathrm{Spin}(n)$, it is none other than $\\mathrm{String}(n)$. | \n", "We describe an interesting relation between Lie 2-algebras, the Kac-Moody central extensions of loop groups, and the group LATEX A Lie 2-algebra is a categorified version of a Lie algebra where the Jacobi identity holds up to a natural isomorphism called the \"Jacobiator\". Similarly, a Lie 2-group is a categorified version of a Lie group. If LATEX is a simply-connected compact simple Lie group, there is a 1-parameter family of Lie 2-algebras LATEX each having LATEX as its Lie algebra of objects, but with a Jacobiator built from the canonical 3-form on LATEX There appears to be no Lie 2-group having LATEX as its Lie 2-algebra, except when LATEX Here, however, we construct for integral k an infinite-dimensional Lie 2-group whose Lie 2-algebra is equivalent to LATEX The objects of this 2-group are based paths in LATEX while the automorphisms of any object form the level-$k$ Kac-Moody central extension of the loop group of LATEX This 2-group is closely related to the LATEX power of the canonical gerbe over LATEX Its nerve gives a topological group that is an extension of LATEX by LATEX When LATEX this topological group can also be obtained by killing the third homotopy group of LATEX Thus, when LATEX it is none other than LATEX | \n", "[2-algebras, Kac-Moody, 2-algebra, 2-group, simply-connected, 1-parameter, 2-algebras, 3-form, 2-group, 2-algebra, infinite-dimensional, 2-group, 2-algebra, 2-group, Kac-Moody, 2-group] | \n", "[['Baez', 'John C.', ''], ['Crans', 'Alissa S.', ''], ['Stevenson', 'Danny', ''], ['Schreiber', 'Urs', '']] | \n", "[math.QA, hep-th, math.DG] | \n", "2023-05-16 | \n", "math/0504123 | \n", "
| 3 | \n", "Finite Supersymmetry Transformations | \n", "Finite Supersymmetry Transformations | \n", "None | \n", "We investigate simple examples of supersymmetry algebras with real and Grassmann parameters. Special attention is payed to the finite supertransformations and their probability interpretation. Furthermore we look for combinations of bosons and fermions which are invariant under supertransformations. These combinations correspond to states that are highly entangled. | \n", "We investigate simple examples of supersymmetry algebras with real and Grassmann parameters. Special attention is payed to the finite supertransformations and their probability interpretation. Furthermore we look for combinations of bosons and fermions which are invariant under supertransformations. These combinations correspond to states that are highly entangled. | \n", "None | \n", "[['Ilieva', 'Nevena', ''], ['Narnhofer', 'Heide', ''], ['Thirring', 'Walter', '']] | \n", "[quant-ph, hep-th, math-ph, math.MP] | \n", "2023-05-09 | \n", "quant-ph/0401139 | \n", "
| 4 | \n", "Super black box (formerly: Middle diamond) | \n", "Super black box (formerly: Middle diamond) | \n", "None | \n", "This is a slightly corrected version of an old work. Under certain cardinal arithmetic assumptions, we prove that for every large enough regular $\\lambda$ cardinal, for many regular $\\kappa < \\lambda$, many stationary subsets of $\\lambda$ concentrating on cofinality $\\kappa$ have super BB. In particular, we have the super BB on $\\{\\delta < \\lambda \\colon cf(\\delta) = \\kappa\\}$. This is a strong negation of uniformization. We have added some details. Works continuing it are [Sh:898] and [Sh:1028]. We thank Ari Brodski and Adi Jarden for their helpful comments. In this paper we had earlier used the notion ``middle diamond\" which is now replaced by ``super BB'', that is, ``super black box'', in order to be consistent with other papers (see [Sh:898]). | \n", "This is a slightly corrected version of an old work. Under certain cardinal arithmetic assumptions, we prove that for every large enough regular LATEX cardinal, for many regular LATEX many stationary subsets of LATEX concentrating on cofinality LATEX have super BB. In particular, we have the super BB on LATEX This is a strong negation of uniformization. We have added some details. Works continuing it are [Sh:898] and [Sh:1028]. We thank Ari Brodski and Adi Jarden for their helpful comments. In this paper we had earlier used the notion ``middle diamond\" which is now replaced by ``super BB'', that is, ``super black box'', in order to be consistent with other papers (see [Sh:898]). | \n", "None | \n", "[['Shelah', 'Saharon', '']] | \n", "[math.LO] | \n", "2023-05-04 | \n", "math/0212249 | \n", "
| \n", " | 35K55, 35K65, 35Q74, 74A30, 35A01, 76S05, 35K51, 74B20 | \n", "35K58, 49K20, 90C46, 92D25 | \n", "35L05, 35L71, 35B44 | \n", "35P30, 35A15, 53C17 | \n", "35Q53, 93D15, 93D30, 93C20 | \n", "35R25 (Primary) 42B35 35B30 (Secondary) | \n", "39A12, 39A14, 39A22 | \n", "math.AP | \n", "math.DS | \n", "math.OC | \n", "
|---|---|---|---|---|---|---|---|---|---|---|
| 0 | \n", "0 | \n", "0 | \n", "0 | \n", "1 | \n", "0 | \n", "0 | \n", "0 | \n", "1 | \n", "0 | \n", "0 | \n", "
| 1 | \n", "0 | \n", "0 | \n", "1 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "1 | \n", "0 | \n", "0 | \n", "
| 2 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "1 | \n", "0 | \n", "0 | \n", "1 | \n", "0 | \n", "1 | \n", "
| 3 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "1 | \n", "0 | \n", "0 | \n", "
| 4 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "1 | \n", "1 | \n", "1 | \n", "0 | \n", "
| 5 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "1 | \n", "0 | \n", "0 | \n", "
| 6 | \n", "1 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "1 | \n", "0 | \n", "0 | \n", "
| 7 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "1 | \n", "0 | \n", "1 | \n", "
| 8 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "1 | \n", "0 | \n", "1 | \n", "0 | \n", "0 | \n", "
| 9 | \n", "0 | \n", "1 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "0 | \n", "1 | \n", "0 | \n", "1 | \n", "