In this paper we study class $\mathcal{S}^+$ of univalent functions $f$ such that $\frac{z}{f(z)}$ has real and positive coefficients. For such functions we give estimates of the Fekete-Szeg\H{o} functional and sharp estimates of their initial coefficients and logarithmic coefficients. Also, we present necessary and sufficient conditions for $f\in \mathcal{S}^+$ to be starlike of order $1/2$.

发表评论 查看更多 翻译此文

收起

In this note we provide some counterexamples for the conjectures of finite simple groups, one of the conjectures said "all finite simple groups $G$ can be determined using their orders $|G|$ and the number of elements of order $p$, where $p$ the largest prime divisor of $|G|$".

发表评论 查看更多 翻译此文

收起

Computation biology helps to understand all processes in organisms from interaction of molecules to complex functions of whole organs. Therefore, there is a need for mathematical methods and models that deliver logical explanations in a reasonable time. For the last few years there has been a growing interest in biological theory connected to finite fields: the algebraic modeling tools used up to now are based on Gr\"obner bases or Boolean group. Let $n$ variables representing gene products, changing over the time on $p$ values. A Polynomial dynamical system (PDS) is a function which has several components, each one is a polynom with $n$ variables and coefficient in the finite field $Z/pZ$ that model the evolution of gene products. We propose herein a method using algebraic separators, which are special polynomials abundantly studied in effective Galois theory. This approach avoids heavy calculations and provides a first Polynomial model in linear time.

发表评论 查看更多 翻译此文

收起

Linear Hamiltonian systems with time-dependent coefficients are of importance to nonlinear Hamiltonian systems, accelerator physics, plasma physics, and quantum physics. It is shown that the solution map of a linear Hamiltonian system with time-dependent coefficients can be parameterized by an envelope matrix $w(t)$, which has a clear physical meaning and satisfies a nonlinear envelope matrix equation. It is proved that a linear Hamiltonian system with periodic coefficients is stable iff the envelope matrix equation admits a solution with periodic $\sqrt{w^{\dagger}w}$ and a suitable initial condition. The mathematical devices utilized in this theoretical development with significant physical implications are time-dependent canonical transformations, normal forms for stable symplectic matrices, and horizontal polar decomposition of symplectic matrices. These tools systematically decompose the dynamics of linear Hamiltonian systems with time-dependent coefficients, and are expected to b

发表评论 查看更多 翻译此文

收起

We note a simple algebraic proof of Frolkina's result that $\mathbb R^3$ does not contain uncountably many pairwise disjoint copies of the M\"obius band, and of a similar result in higher dimensions.

发表评论 查看更多 翻译此文

收起

We express the Newton spectrum of a polynomial in terms of twisted degrees of cohomology groups of toric varieties. We also define the toric Newton spectrum, which has a natural orbifold flavor.

发表评论 查看更多 翻译此文

收起

While the definition of a fractional integral may be codified by Riemann and Liouville, an agreed-upon fractional derivative has eluded discovery for many years. This is likely a result of integral definitions including numerous constants of integration in their results. An elimination of constants of integration opens the door to an operator that reconciles all known fractional derivatives and shows surprising results in areas unobserved before, including the appearance of the Riemann Zeta Function and fractional Laplace and Fourier Transforms. A new class of functions, known as Zero Functions and closely related to the Dirac Delta Function, are necessary for one to perform elementary operations of functions without using constants. The operator also allows for a generalization of the Volterra integral equation, and provides a method of solving for Riemann's "complimentary" function introduced during his research on fractional derivatives.

发表评论 查看更多 翻译此文

收起

In The Delta Conjecture (arxiv:1509.07058), Haglund, Remmel and Wilson introduced a four variable $q,t,z,w$ Catalan polynomial, so named because the specialization of this polynomial at the values $(q,t,z,w) = (1,1,0,0)$ is equal to the Catalan number $\frac{1}{n+1}\binom{2n}{n}$. We prove the compositional version of this conjecture (which implies the non-compositional version) that states that the coefficient of $s_{r,1^{n-r}}$ in the expression $\Delta_{h_\ell} \nabla C_\alpha$ is equal to a weighted sum over decorated Dyck paths.

发表评论 查看更多 翻译此文

收起

In this paper we study a sub-Finsler geometric problem on the free-nilpotent group of rank 2 and step 3. Such a group is also called Cartan group and has a natural structure of Carnot group, which we metrize considering the $\ell_\infty$ norm on its first layer. We adopt the point of view of time-optimal control theory. We characterize extremal curves via Pontryagin maximum principle. We describe abnormal and singular arcs, and construct the bang-bang flow.

发表评论 查看更多 翻译此文

收起

We consider the dynamic multichannel access problem, which can be formulated as a partially observable Markov decision process (POMDP). We first propose a model-free actor-critic deep reinforcement learning based framework to explore the sensing policy. To evaluate the performance of the proposed sensing policy and the framework's tolerance against uncertainty, we test the framework in scenarios with different channel switching patterns and consider different switching probabilities. Then, we consider a time-varying environment to identify the adaptive ability of the proposed framework. Additionally, we provide comparisons with the Deep-Q network (DQN) based framework proposed in [1], in terms of both average reward and the time efficiency.

发表评论 查看更多 翻译此文

收起

Given a large ensemble of interacting particles, driven by nonlocal interactions and localized repulsion, the mean-field limit leads to a class of nonlocal, nonlinear partial differential equations known as aggregation-diffusion equations. Over the past fifteen years, aggregation-diffusion equations have become widespread in biological applications and have also attracted significant mathematical interest, due to their competing forces at different length scales. These competing forces lead to rich dynamics, including symmetrization, stabilization, and metastability, as well as sharp dichotomies separating well-posedness from finite time blowup. In the present work, we review known analytical results for aggregation-diffusion equations and consider singular limits of these equations, including the slow diffusion limit, which leads to the constrained aggregation equation, as well as localized aggregation and vanishing diffusion limits, which lead to metastability behavior. We also revie

发表评论 查看更多 翻译此文

收起

In this paper we focus on a certain self-distributive multiplication on coalgebras, which leads to so-called rack bialgebra. We construct canon-ical rack bialgebras (some kind of enveloping algebras) for any Leibniz algebra. Our motivation is deformation quantization of Leibniz algebras in the sense of [6]. Namely, the canonical rack bialgebras we have constructed for any Leibniz algebra lead to a simple explicit formula of the rack-star-product on the dual of a Leibniz algebra recently constructed by Dherin and Wagemann in [6]. We clarify this framework setting up a general deformation theory for rack bialgebras and show that the rack-star-product turns out to be a deformation of the trivial rack bialgebra product.

发表评论 查看更多 翻译此文

收起

The dominant theme of this thesis is the construction of matrix representations of finite solvable groups using a suitable system of generators. For a finite solvable group $G$ of order $N = p_{1}p_{2}\dots p_{n}$, where $p_{i}$'s are primes, there always exists a subnormal series: $\langle {e} \rangle = G_{o} < G_{1} < \dots < G_{n} = G$ such that $G_{i}/G_{i-1}$ is isomorphic to a cyclic group of order $p_{i}$, $i = 1,2,\dots,n$. Associated with this series, there exists a system of generators consisting $n$ elements $x_{1}, x_{2}, \dots, x_{n}$ (say), such that $G_{i} = \langle x_{1}, x_{2}, \dots, x_{i} \rangle$, $i = 1,2,\dots,n$, which is called a "long system of generators". In terms of this system of generators and conjugacy class sum of $x_{i}$ in $G_{i}$, $i = 1,2, \dots, n$, we present an algorithm for constructing the irreducible matrix representations of $G$ over $\mathbb{C}$ within the group algebra $\mathbb{C}[G]$. This algorithmic construction needs the knowled

发表评论 查看更多 翻译此文

收起

An Elm compiler for the Erlang Virtual Machine

发表评论 查看更多 翻译此文

收起

Equipping a non-equivariant topological $E_\infty$-operad with the trivial $G$-action gives an operad in $G$-spaces. For a $G$-spectrum, being an algebra over this operad does not provide any multiplicative norm maps on homotopy groups. Algebras over this operad are called na\"{i}ve-commutative ring $G$-spectra. In this paper we take $G=SO(2)$ and we show that commutative algebras in the algebraic model for rational $SO(2)$-spectra model rational na\"{i}ve-commutative ring $SO(2)$-spectra. In particular, this applies to show that the $SO(2)$-equivariant cohomology associated to an elliptic curve $C$ from previous work of the second author is represented by an $E_\infty$-ring spectrum. Moreover, the category of modules over that $E_\infty$-ring spectrum is equivalent to the derived category of sheaves over the elliptic curve $C$ with the Zariski torsion point topology.

发表评论 查看更多 翻译此文

收起

We prove a second main theorem for elliptic projective planes.

发表评论 查看更多 翻译此文

收起

We consider the inverse problem of recovering the magnetic and potential term of a magnetic Schr\"{o}dinger operator on certain compact Riemannian manifolds with boundary from partial Dirichlet and Neumann data on suitable subsets of the boundary. The uniqueness proof relies on proving a suitable Carleman estimate for functions which vanish only on a part of boundary and constructing complex geometric optics solutions which vanish on a part of the boundary.

发表评论 查看更多 翻译此文

收起

We study the relation between the vanishing of Andr\'{e}-Quillen homology and complete intersection flat dimension and we extend some of the existing results in the literature.

发表评论 查看更多 翻译此文

收起

We review and apply Cheeger-Gromov theory on $l^2$-cohomology of infinite coverings of complete manifolds with bounded curvature and finite volume. Applications focus on $l^2$-cohomology of (pullback of) harmonic Higgs bundles on some covering of Zariski open sets of K\"ahler manifolds. The $l^2-$Dolbeault to DeRham spectral sequence of these Higgs bundles is seen to degenerate at $E_2$.

发表评论 查看更多 翻译此文

收起

We introduce approximation schemes for a type of countably-infinite-dimensional linear programs (CILPs) whose feasible points are unsigned measures and whose optimal values are bounds on the averages of these measures. In particular, we explain how to approximate the program's optimal value, optimal points, and minimal point (should one exist) by solving finite-dimensional linear programs. We show that the approximations converge to the CILP's optimal value, optimal points, and minimal point as the size of the finite-dimensional program approaches that of the CILP. Inbuilt in our schemes is a degree of error control: they yield lower and upper bounds on the optimal values and we give a simple bound on the approximation error of the minimal point. To motivate our work, we discuss applications of our schemes taken from the Markov chain literature: stationary distributions, occupation measures, and exit distributions.

发表评论 查看更多 翻译此文

收起

We provide an atomic decomposition of the product Hardy spaces $H^p(\widetilde{X})$ which were recently developed by Han, Li, and Ward in the setting of product spaces of homogeneous type $\widetilde{X} = X_1 \times X_2$. Here each factor $(X_i,d_i,\mu_i)$, for $i = 1$, $2$, is a space of homogeneous type in the sense of Coifman and Weiss. These Hardy spaces make use of the orthogonal wavelet bases of Auscher and Hyt\"onen and their underlying reference dyadic grids. However, no additional assumptions on the quasi-metric or on the doubling measure for each factor space are made. To carry out this program, we introduce product $(p,q)$-atoms on $\widetilde{X}$ and product atomic Hardy spaces $H^{p,q}_{{\rm at}}(\widetilde{X})$. As consequences of the atomic decomposition of $H^p(\widetilde{X})$, we show that for all $q > 1$ the product atomic Hardy spaces coincide with the product Hardy spaces, and we show that the product Hardy spaces are independent of the particular choices of both

发表评论 查看更多 翻译此文

收起

Better bus predictions (a lot better)

发表评论 查看更多 翻译此文

收起

In this article, we study the enumeration by length of several walk models on the square lattice. We obtain bijections between walks in the upper half-plane returning to the $x$-axis and walks in the quarter plane. A recent work by Bostan, Chyzak, and Mahboubi has given a bijection for models using small north, west, and south-east steps. We adapt and generalize it to a bijection between half-plane walks using those three steps in two colours and a quarter-plane model over the symmetrized step set consisting of north, north-west, west, south, south-east, and east. We then generalize our bijections to certain models with large steps: for given $p\geq1$, a bijection is given between the half-plane and quarter-plane models obtained by keeping the small south-east step and replacing the two steps north and west of length 1 by the $p+1$ steps of length $p$ in directions between north and west. This model is close to, but distinct from, the model of generalized tandem walks studied by Bousqu

发表评论 查看更多 翻译此文

收起

We show that if $h(x,y)=ax^2+bxy+cy^2\in \mathbb{Z}[x,y]$ satisfies $b^2\neq 4ac$, then any subset of $\{1,2,\dots,N\}$ with no nonzero differences in the image of $h$ has size at most a constant depending on $h$ times $N\exp(-c\sqrt{\log N})$, where $c=c(h)>0$. We achieve this goal by adapting an $L^2$ density increment strategy previously used to establish analogous results for sums of one or more single-variable polynomials. Our exposition is thorough and self-contained, in order to serve as an accessible gateway for readers who are unfamiliar with previous implementations of these techniques.

发表评论 查看更多 翻译此文

收起

The cycle joining method and the cross-join pairing are two main construction techniques for de Bruijn sequences. This work shows how to combine Zech's logarithms and each of the two techniques to efficiently construct binary de Bruijn sequences of large orders. A basic implementation is supplied as a proof-of-concept. In the cycle joining method, the cycles are generated by an LFSR with a chosen period. We prove that determining Zech's logarithms is equivalent to identifying conjugate pairs shared by any pair of cycles. The approach quickly finds enough number of conjugate pairs between any two cycles to ensure the existence of trees containing all vertices in the adjacency graph of the LFSR. When the characteristic polynomial of the LFSR is a product of distinct irreducible polynomials, the approach via Zech's logarithms combines nicely with a recently proposed method to determine the conjugate pairs. This allows us to efficiently generate de Bruijn sequences with larger orders. Alon

发表评论 查看更多 翻译此文

收起

We show that fixed dimensional klt weak Fano pairs with alpha-invariants and volumes bounded away from $0$ and the coefficients of the boundaries belong to the set of hyperstandard multiplicities $\Phi(\mathscr{R})$ associated to a fixed finite set $\mathscr{R}$ form a bounded family. We also show $\alpha(X,B)^{d-1}\mathrm{vol}(-(K_X+B))$ are bounded from above for all klt weak Fano pairs $(X,B)$ of a fixed dimension $d$.

发表评论 查看更多 翻译此文

收起

A paper of U. First & Z. Reichstein proves that if $R$ is a commutative ring of dimension $d$, then any Azumaya algebra $A$ over $R$ can be generated as an algebra by $d+2$ elements, by constructing such a generating set, but they do not prove that this number of generators is required, or even that for an arbitrarily large $r$ that there exists an Azumaya algebra requiring $r$ generators. In this paper, for any given fixed $n\ge 2$, we produce examples of a base ring $R$ of dimension $d$ and an Azumaya algebra of degree $n$ over $R$ that requires $r(d,n) = \lfloor \frac{d}{2n-2} \rfloor + 2$ generators. While $r(d,n) < d+2$ in general, we at least show that there is no uniform upper bound on the number of generators required for Azumaya algebras. The method of proof is to consider certain varieties $B^r_n$ that are universal varieties for degree-$n$ Azumaya algebras equipped with a set of $r$ generators, and specifically we show that a natural map on Chow group $CH^{(r-1)(n-1)}

发表评论 查看更多 翻译此文

收起

We give necessary and sufficient conditions for a 4-manifold to be a branched covering of $CP^2$, $S^2\times S^2$, $S^2 \mathbin{\tilde\times} S^2$ and $S^3 \times S^1$, which are expressed in terms of the Betti numbers and the intersection form of the 4-manifold.

发表评论 查看更多 翻译此文

收起

In 1968, H. Brezis introduced a notion of operator pseudomonotonicity which provides a unified approach to monotone and nonmonotone variational inequalities (VIs). A closely related notion is that of Ky-Fan hemicontinuity, a continuity property which arises if the famous Ky-Fan minimax inequality is applied to the VI framework. It is clear from the corresponding definitions that Ky-Fan hemicontinuity implies Brezis pseudomonotonicity, but quite surprisingly, a recent publication by Sadeqi and Paydar (J. Optim. Theory Appl., 165(2):344-358, 2015) claims the equivalence of the two properties. The purpose of the present note is to show that this equivalence is false; this is achieved by providing a concrete example of a nonlinear operator which is Brezis pseudomonotone but not Ky--Fan hemicontinuous.

发表评论 查看更多 翻译此文

收起

We study Stochastic Gradient Descent (SGD) with diminishing step sizes for convex objective functions. We introduce a definitional framework and theory that defines and characterizes a core property, called curvature, of convex objective functions. In terms of curvature we can derive a new inequality that can be used to compute an optimal sequence of diminishing step sizes by solving a differential equation. Our exact solutions confirm known results in literature and allows us to fully characterize a new regularizer with its corresponding expected convergence rates.

发表评论 查看更多 翻译此文

收起

Millimeter-wave communications rely on narrow-beam transmissions to cope with the strong signal attenuation at these frequencies, thus demanding precise alignment between transmitter and receiver. However, the beam-alignment procedure may entail a huge overhead and its performance may be degraded by detection errors. This paper proposes a coded energy-efficient beam-alignment scheme, robust against detection errors. Specifically, the beam-alignment sequence is designed such that the error-free feedback sequences are generated from a codebook with the desired error correction capabilities. Therefore, in the presence of detection errors, the error-free feedback sequences can be recovered with high probability. The assignment of beams to codewords is designed to optimize energy efficiency, and a water-filling solution is proved. The numerical results with analog beams depict up to 4dB and 8dB gains over exhaustive and uncoded beam-alignment schemes, respectively.

发表评论 查看更多 翻译此文

收起

We derive a nonlinear integro-differential transport equation describing collective evolution of weights under gradient descent in large-width neural-network-like models. We characterize stationary points of the evolution and analyze several scenarios where the transport equation can be solved approximately. We test our general method in the special case of linear free-knot splines, and find good agreement between theory and experiment in observations of global optima, stability of stationary points, and convergence rates.

发表评论 查看更多 翻译此文

收起

In discrete time, \ell-blocks of red lights are separated by \ell-blocks of green lights. Cars arrive at random. The maximum line length of idle cars is fully understood for \ell = 1, but only partially for 2 <= \ell <=3.

发表评论 查看更多 翻译此文

收起

Recently, Kawarabayashi and Thorup presented the first deterministic edge-connectivity recognition algorithm in near-linear time. A crucial step in their algorithm uses the existence of vertex subsets of a simple graph $G$ on $n$ vertices whose contractions leave a multigraph with $\tilde{O}(n/\delta)$ vertices and $\tilde{O}(n)$ edges that preserves all non-trivial min-cuts of $G$. We show a very simple argument that improves this contraction-based sparsifier by eliminating the poly-logarithmic factors, that is, we show a contraction-based sparsification that leaves $O(n/\delta)$ vertices and $O(n)$ edges, preserves all non-trivial min-cuts and can be computed in near-linear time $\tilde{O}(|E(G)|)$. As consequence, every simple graph has $O((n/\delta)^2)$ non-trivial min-cuts. Our approach allows to represent all non-trivial min-cuts of a graph by a cactus representation, whose cactus graph has $O(n/\delta)$ vertices. Moreover, this cactus representation can be derived directly from

发表评论 查看更多 翻译此文

收起

Full Approximation Scheme (FAS) is a widely used multigrid method for nonlinear problems. In this paper, a new framework to analyze FAS for convex optimization problems is developed. FAS can be recast as an inexact version of nonlinear multigrid methods based on space decomposition and subspace correction. The local problem in each subspace can be simplified to be linear and one gradient decent iteration is enough to ensure a linear convergence of FAS.

发表评论 查看更多 翻译此文

收起

In classical information theory, the information bottleneck method (IBM) can be regarded as a method of lossy data compression which focusses on preserving meaningful (or relevant) information. As such it has recently gained a lot of attention, primarily for its applications in machine learning and neural networks. A quantum analogue of the IBM has recently been defined, and an attempt at providing an operational interpretation of the so-called quantum IB function as an optimal rate of an information-theoretic task, has recently been made by Salek et al. However, the interpretation given in that paper has a couple of drawbacks; firstly its proof is based on a conjecture that the quantum IB function is convex, and secondly, the expression for the rate function involves certain entropic quantities which occur explicitly in the very definition of the underlying information-theoretic task, thus making the latter somewhat contrived. We overcome both of these drawbacks by first proving the c

发表评论 查看更多 翻译此文

收起

We establish that for every function $u \in L^1_\mathrm{loc}(\Omega)$ whose distributional Laplacian $\Delta u$ is a signed Borel measure in an open set $\Omega$ in $\mathbb{R}^{N}$, the distributional gradient $\nabla u$ is differentiable almost everywhere in $\Omega$ with respect to the weak-$L^{\frac{N}{N-1}}$ Marcinkiewicz norm. We show in addition that the absolutely continuous part of $\Delta u$ with respect to the Lebesgue measure equals zero almost everywhere on the level sets $\{u = \alpha\}$ and $\{\nabla u = e\}$, for every $\alpha \in \mathbb{R}$ and $e \in \mathbb{R}^N$. Our proofs rely on an adaptation of Calder\'on and Zygmund's singular-integral estimates inspired by subsequent work by Haj\l asz.

发表评论 查看更多 翻译此文

收起

Momentum is a popular technique to accelerate the convergence in practical training, and its impact on convergence guarantee has been well-studied for first-order algorithms. However, such a successful acceleration technique has not yet been proposed for second-order algorithms in nonconvex optimization.In this paper, we apply the momentum scheme to cubic regularized (CR) Newton's method and explore the potential for acceleration. Our numerical experiments on various nonconvex optimization problems demonstrate that the momentum scheme can substantially facilitate the convergence of cubic regularization, and perform even better than the Nesterov's acceleration scheme for CR. Theoretically, we prove that CR under momentum achieves the best possible convergence rate to a second-order stationary point for nonconvex optimization. Moreover, we study the proposed algorithm for solving problems satisfying an error bound condition and establish a local quadratic convergence rate. Then, particul

发表评论 查看更多 翻译此文

收起

We examine a class of Calabi-Yau varieties of the determinantal type in Grassmannians and clarify what kind of examples can be constructed explicitly. We also demonstrate how to compute their genus-0 Gromov-Witten invariants from the analysis of the Givental $I$-functions. By constructing $I$-functions from the supersymmetric localization formula for the two dimensional gauged linear sigma models, we describe an algorithm to evaluate the genus-0 A-model correlation functions appropriately. We also check that our results for the Gromov-Witten invariants are consistent with previous results for known examples included in our construction.

发表评论 查看更多 翻译此文

收起

Call a colouring of a graph distinguishing, if the only colour preserving automorphism is the identity. A conjecture of Tucker states that if every automorphism of a graph $G$ moves infinitely many vertices, then there is a distinguishing $2$-colouring. We confirm this conjecture for graphs with maximum degree $\Delta \leq 5$. Furthermore, using similar techniques we show that if an infinite graph has maximum degree $\Delta \geq 3$, then it admits a distinguishing colouring with $\Delta - 1$ colours. This bound is sharp.

发表评论 查看更多 翻译此文

收起

The distributionally robust Markov Decision Process (MDP) approach asks for a distributionally robust policy that achieves the maximal expected total reward under the most adversarial distribution of uncertain parameters. In this paper, we study distributionally robust MDPs where ambiguity sets for the uncertain parameters are of a format that can easily incorporate in its description the uncertainty's generalized moment as well as statistical distance information. In this way, we generalize existing works on distributionally robust MDP with generalized-moment-based and statistical-distance-based ambiguity sets to incorporate information from the former class such as moments and dispersions to the latter class that critically depends on empirical observations of the uncertain parameters. We show that, under this format of ambiguity sets, the resulting distributionally robust MDP remains tractable under mild technical conditions. To be more specific, a distributionally robust policy can

发表评论 查看更多 翻译此文

收起

We present a novel direct transcription method to solve optimization problems subject to nonlinear differential and inequality constraints. In order to provide numerical convergence guarantees, it is sufficient for the functions that define the problem to satisfy boundedness and Lipschitz conditions. Our assumptions are the most general to date; we do not require uniqueness, differentiability or constraint qualifications to hold and we avoid the use of Lagrange multipliers. Our approach differs fundamentally from state-of-the-art methods based on collocation. We follow a least-squares approach to finding approximate solutions to the differential equations. The objective is augmented with the integral of a quadratic penalty on the differential equation residual and a logarithmic barrier for the inequality constraints, as well as a quadratic penalty on the point constraint residual. The resulting unconstrained infinite-dimensional optimization problem is discretized using finite elements

发表评论 查看更多 翻译此文

收起

\'Elie Cartan's "g\'en\'eralisation de la notion de courbure" (1922) arose from a creative evaluation of the geometrical structures underlying both, Einstein's theory of gravity and the Cosserat brothers generalized theory of elasticity. In both theories groups operating in the infinitesimal played a crucial role. To judge from his publications in 1922--24, Cartan developed his concept of generalized spaces with the dual context of general relativity and non-standard elasticity in mind. In this context it seemed natural to express the translational curvature of his new spaces by a rotational quantity (via a kind of Grassmann dualization). So Cartan called his translational curvature "torsion" and coupled it to a hypothetical rotational momentum of matter several years before spin was encountered in quantum mechanics.

发表评论 查看更多 翻译此文

收起

Recently it was obtained in [Tarzia, Thermal Sci. 21A (2017) 1-11] for the classical two-phase Lam\'e-Clapeyron-Stefan problem an equivalence between the temperature and convective boundary conditions at the fixed face under a certain restriction. Motivated by this article we study the two-phase Stefan problem for a semi-infinite material with a latent heat defined as a power function of the position and a convective boundary condition at the fixed face. An exact solution is constructed using Kummer functions in case that an inequality for the convective transfer coefficient is satisfied generalizing recent works for the corresponding one-phase free boundary problem. We also consider the limit to our problem when that coefficient goes to infinity obtaining a new free boundary problem, which has been recently studied in [Zhou-Shi-Zhou, J. Engng. Math. (2017) DOI 10.1007/s10665-017-9921-y].

发表评论 查看更多 翻译此文

收起

In this paper, the p-generalized modified error function is defined as the solution to a non-linear ordinary differential problem of second order with a Robin type condition at $x=0$. Existence and uniqueness of a non-negative analytic solution is proved by using a fixed point strategy. It is shown that the p-generalized modified error function converges to the p-modified error function defined as the solution to a similar problem with a Dirichlet condition at x=0. In both problems, for p=1, the generalized modified error function and the modified error function, studied recently in literature, are recovered

发表评论 查看更多 翻译此文

收起

In this paper we study the Cauchy problem for the generalized Boussinesq equation with initial data in modulation spaces $M^{s}_{p^\prime,q}(\mathbb{R}^n),$ $n\geq 1.$ After a decomposition of the Boussinesq equation in a $2\times 2$-nonlinear system, we obtain the existence of global and local solutions in several classes of functions with values in $ M^s_{p,q}\times D^{-1}JM^s_{p,q}$ spaces for suitable $p,q$ and $s,$ including the special case $p=2,q=1$ and $s=0.$ Finally, we prove some results of scattering and asymptotic stability in the framework of modulation spaces.

发表评论 查看更多 翻译此文

收起

We study the geometry and topology of exotic Springer fibers for orbits corresponding to one-row bipartitions from an explicit, combinatorial point of view. This includes a detailed analysis of the structure of the irreducible components and their intersections as well as the construction of an explicit affine paving. Moreover, we compute the ring structure of cohomology by constructing a CW-complex homotopy equivalent to the exotic Springer fiber. This homotopy equivalent space admits an action of the type C Weyl group inducing Kato's original exotic Springer representation on cohomology. Our results are described in terms of the diagrammatics of the two-boundary Temperley-Lieb algebra. This provides a first step in generalizing the geometric versions of Khovanov's arc algebra to the exotic setting.

发表评论 查看更多 翻译此文

收起

Locally repairable codes (LRCs) have received significant recent attention as a method of designing data storage systems robust to server failure. Optimal LRCs offer the ideal trade-off between minimum distance and locality, a measure of the cost of repairing a single codeword symbol. For optimal LRCs with minimum distance greater than or equal to 5, block length is bounded by a polynomial function of alphabet size. In this paper, we give explicit constructions of optimal-length (in terms of alphabet size), optimal LRCs with minimum distance equal to 5.

发表评论 查看更多 翻译此文

收起

In this article, we introduce a notion of an exponential matrix, which is a polynomial matrix with exponential properties, and a notion of an equivalence relation of two exponential matrices, and then we initiate to study classifying exponential matrices in positive characteristic, up to equivalence. We classify exponential matrices of Heisenberg groups in positive characteristic, up to equivalence. We also classify exponential matrices of size four-by-four in positive characteristic, up to equivalence. From these classifications, we obtain a classification of modular representations of elementary abelian $p$-groups into Heisenberg groups, up to equivalence, and a classification of four-dimensional modular representations of elementary abelian $p$-groups, up to equivalence.

发表评论 查看更多 翻译此文

收起

We use genus zero free energy functions of Hermitian matrix models to define spectral curves and their special deformations. They are special plane curves defined by formal power series with integral coefficients generalizing the Catalan numbers. This is done in two different versions, depending on two different genus expansions, and these two versions are in some sense dual to each other.

发表评论 查看更多 翻译此文

收起

We introduce the tools of intersection theory to the study of Feynman integrals, which allows for a new way of projecting integrals onto a basis. In order to illustrate this technique, we consider Baikov representation of maximal cuts in arbitrary space-time dimension. We introduce a minimal basis of differential forms with logarithmic singularities on the boundaries of the corresponding integration cycles. We give an algorithm for computing a basis decomposition of an arbitrary maximal cut using the so-called intersection numbers and describe two alternative ways of computing them. Furthermore, we show how to obtain Pfaffian systems of differential equations for the basis integrals using the same technique. All the steps are illustrated on the example of a two-loop non-planar triangle diagram with a massive loop.

发表评论 查看更多 翻译此文

收起

High dimensional data and systems with many degrees of freedom are often characterized by covariance matrices. In this paper, we consider the problem of simultaneously estimating the dimension of the principal (dominant) subspace of these covariance matrices and obtaining an approximation to the subspace. This problem arises in the popular principal component analysis (PCA), and in many applications of machine learning, data analysis, signal and image processing, and others. We first present a novel method for estimating the dimension of the principal subspace. We then show how this method can be coupled with a Krylov subspace method to simultaneously estimate the dimension and obtain an approximation to the subspace. The dimension estimation is achieved at no additional cost. The proposed method operates on a model selection framework, where the novel selection criterion is derived based on random matrix perturbation theory ideas. We present theoretical analyses which (a) show that th

发表评论 查看更多 翻译此文

收起

For a prime number $q\neq 2$ and $r>0$ we study, whether there exists an isometry of order $q^r$ acting on a free $\mathbb{Z}_{p^k}$-module equipped with a scalar product. We investigate, whether there exists such an isometry with no non-zero fixed points. Both questions are completely answered in this paper if $p\neq 2,q$. As an application we refine Naik's criterion for periodicity of links in $S^3$. The periodicity criterion we obtain is effectively computable and gives concrete restrictions for periodicity of low-crossing knots.

发表评论 查看更多 翻译此文

收起

The finite volume correction for a mean-field monomer-dimer system with an attractive interaction are computed for the pressure density, the monomer density and the susceptibility. The results are obtained by introducing a two-dimensional integral representation for the partition function decoupling both the hard-core interaction and the attractive one. The next-to-leading terms for each of the mentioned quantities is explicitly derived as well as the value of their sign that is related to their monotonic convergence in the thermodynamic limit.

发表评论 查看更多 翻译此文

收起

We prove $\sqrt{\log n}$ lower bounds on the order of growth fluctuations in three planar growth models (first-passage percolation, last-passage percolation, and directed polymers) under no assumptions on distribution of vertex or edge weights other than the minimum conditions required for avoiding pathologies. Such bounds were previously known only for certain restrictive classes of distributions. In addition, the first-passage shape fluctuation exponent is shown to be at least $1/8$, extending previous results to more general distributions.

发表评论 查看更多 翻译此文

收起

In locally compact, separable metric measure spaces, heat kernels can be classified as either local (having exponential decay) or nonlocal (having polynomial decay). This dichotomy of heat kernels gives rise to operators that include (but are not restricted to) the generators of the classical Laplacian associated to Brownian processes as well as the fractional Laplacian associated with $\beta$-stable L\'evy processes. Given embedded data that lie on or close to a compact Riemannian manifold, there is a practical difficulty in realizing this theory directly since these kernels are defined as functions of geodesic distance which is not directly accessible unless if the manifold (i.e., the embedding function or the Riemannian metric) is completely specified. This paper develops numerical methods to estimate the semigroups and generators corresponding to these heat kernels using embedded data that lie on or close to a compact Riemannian manifold (the estimators of the local kernels are res

发表评论 查看更多 翻译此文

收起

We consider unitary simple vertex operator algebras whose vertex operators satisfy certain energy bounds and a strong form of locality and call them strongly local. We present a general procedure which associates to every strongly local vertex operator algebra V a conformal net A_V acting on the Hilbert space completion of V and prove that the isomorphism class of A_V does not depend on the choice of the scalar product on V. We show that the class of strongly local vertex operator algebras is closed under taking tensor products and unitary subalgebras and that, for every strongly local vertex operator algebra V, the map W\mapsto A_W gives a one-to-one correspondence between the unitary subalgebras W of V and the covariant subnets of A_V. Many known examples of vertex operator algebras such as the unitary Virasoro vertex operator algebras, the unitary affine Lie algebras vertex operator algebras, the known c=1 unitary vertex operator algebras, the moonshine vertex operator algebra, toge

发表评论 查看更多 翻译此文

收起

The global structure of the minimal spanning tree (MST) is expected to be universal for a large class of underlying random discrete structures. But very little is known about the intrinsic geometry of MSTs of most standard models, and so far the scaling limit of the MST viewed as a metric measure space has only been identified in the case of the complete graph [4]. In this work, we show that the MST constructed by assigning i.i.d. continuous edge-weights to either the random (simple) $3$-regular graph or the $3$-regular configuration model on $n$ vertices, endowed with the tree distance scaled by $n^{-1/3}$ and the uniform probability measure on the vertices, converges in distribution with respect to Gromov-Hausdorff-Prokhorov topology to a random compact metric measure space. Further, this limiting space has the same law as the scaling limit of the MST of the complete graph identified in [4] up to a scaling factor of $6^{1/3}$. Our proof relies on a novel argument that uses a coupling

发表评论 查看更多 翻译此文

收起

In this paper we consider rough differential equations on a smooth manifold $\left( M\right) .$ The main result of this paper gives sufficient conditions on the driving vector-fields so that the rough ODE's have global (in time) solutions. The sufficient conditions involve the existence of a complete Riemannian metric $\left( g\right) $ on $M$ such that the covariant derivatives of the driving fields and their commutators to a certain order (depending on the roughness of the driving path) are bounded. Many of the results of this paper are generalizations to manifolds of the fundamental results in \cite{Bailleul2015a}.

发表评论 查看更多 翻译此文

收起

We study the Cauchy problem for fractional Schr\"odinger equation with cubic convolution nonlinearity ($i\partial_t u - (-\Delta)^{\frac{\alpha}{2}}u\pm (K\ast |u|^2) u =0$) with Cauchy data in the modulation spaces $M^{p,q}(\mathbb R^{d}).$ For $K(x)= |x|^{-\gamma}$ $ (0< \gamma< \text{min} \{\alpha, d/2\})$, we establish global well-posedness results in $M^{p,q}(\mathbb R^{d}) (1\leq p \leq 2, 1\leq q < 2d/ (d+\gamma))$ when $\alpha =2, d\geq 1$, and with radial Cauchy data when $d\geq 2, \frac{2d}{2d-1}< \alpha < 2. $ Similar results are proven in Fourier algebra $\mathcal{F}L^1(\mathbb R^d) \cap L^2(\mathbb R^d).$

发表评论 查看更多 翻译此文

收起

Dotsenko and Vallette discovered an extension to nonsymmetric operads of Buchberger's algorithm for Gr\"obner bases of polynomial ideals. In the free nonsymmetric operad with one ternary operation $({\ast}{\ast}{\ast})$, we compute a Gr\"obner basis for the ideal generated by partial associativity $((abc)de) + (a(bcd)e) + (ab(cde)$. In the category of $\mathbb{Z}$-graded vector spaces with Koszul signs, the (homological) degree of $({\ast}{\ast}{\ast})$ may be even or odd. We use the Gr\"obner bases to calculate the dimension formulas for these operads.

发表评论 查看更多 翻译此文

收起

This is the first of a series of papers devoted to a thorough analysis of the class of gradient flows in a metric space $(X,\mathsf{d})$ that can be characterized by Evolution Variational Inequalities. We present new results concerning the structural properties of solutions to the $\mathrm{EVI}$ formulation, such as contraction, regularity, asymptotic expansion, precise energy identity, stability, asymptotic behaviour and their link with the geodesic convexity of the driving functional. Under the crucial assumption of the existence of an $\mathrm{EVI}$ gradient flow, we will also prove two main results: the equivalence with the De Giorgi variational characterization of curves of maximal slope and the convergence of the Minimizing Movement-JKO scheme to the $\mathrm{EVI}$ gradient flow, with an explicit and uniform error estimate of order $1/2$ with respect to the step size, independent of any geometric hypothesis (such as upper or lower curvature bounds) on $\mathsf{d}$. In order to av

发表评论 查看更多 翻译此文

收起

We describe the effect of ramified morphisms on Harbourne constants of reduced effective divisors. With this goal, we introduce the pullback of a weighted cluster of infinitely near points under a dominant morphism between surfaces, and describe some of its basic properties. As an application, we describe configurations of curves with transversal intersections and $H$-index arbitarily close to \(-25/7\simeq -3.571\), smaller than any previously known result.

发表评论 查看更多 翻译此文

收起

Hardy's inequality for Laguerre expansions of Hermite type with the index $\al\in(\{-1/2\}\cup[1/2,\infty))^d$ is proved in the multi-dimensional setting with the exponent $3d/4$. We also obtain the sharp analogue of Hardy's inequality with $L^1$ norm replacing $H^1$ norm at the expense of increasing the exponent by an arbitrarily small value.

发表评论 查看更多 翻译此文

收起

In this paper we study arithmetic properties of a one-parameter family ${\mathbf H}$ of H\'enon maps over the affine line. Given a family of initial points ${\mathbf P}$ satisfying a natural condition, we show the height function $h_{{\mathbf P}}$ associated to ${\mathbf H}$ and ${\mathbf P}$ is the restriction of the height function associated to a semipositive adelically metrized line bundle on projective line. We then show various local properties of $h_{{\mathbf P}}$. Next we consider the set $\Sigma({\mathbf P})$ consisting of periodic parameter values, and study when $\Sigma({\mathbf P})$ is an infinite set or not. We also study unlikely intersections of periodic parameter values.

发表评论 查看更多 翻译此文

收起

We describe the Hochschild cohomology ring for a family of self-injective algebras of tree class $E_6$ in terms of generators and relations. Together with the results of the previous paper, this gives a complete description of the Hochschild cohomology ring for a self-injective algebras of tree class $E_6$.

发表评论 查看更多 翻译此文

收起

How I Transitioned from Physics Academia to the ML Industry

发表评论 查看更多 翻译此文

收起

In cloud computing management, the dynamic adaptation of computing resource allocations under time-varying workload is an active domain of investigation. Several control strategies were already proposed. Here the model-free control setting and the corresponding "intelligent" controllers, which are most successful in many concrete engineering situations, are employed for the "horizontal elasticity." When compared to the commercial "Auto-Scaling" algorithms, our easily implementable approach, behaves better even with sharp workload fluctuations. This is confirmed by experiments on Amazon Web Services (AWS).

发表评论 查看更多 翻译此文

收起

To study the question of whether every two-dimensional Pr\"ufer domain possesses the stacked bases property, we consider the particular case of the Pr\"ufer domains formed by integer-valued polynomials. The description of the spectrum of the rings of integer-valued polynomials on a subset of a rank-one valuation domain enables us to prove that they all possess the stacked bases property. We also consider integer-valued polynomials on rings of integers of number fields and we reduce in this case the study of the stacked bases property to questions concerning $2\times 2$-matrices.

发表评论 查看更多 翻译此文

收起

With increasing engineering demands, there need high order accurate schemes embedded with precise physical information in order to capture delicate small scale structures and strong waves with correct "physics". There are two families of high order methods: One is the method of line, relying on the Runge-Kutta (R-K) time-stepping. The building block is the Riemann solution labeled as the solution element "1". Each step in R-K just has first order accuracy. In order to derive a fourth order accuracy scheme in time, one needs four stages labeled as "$1\odot 1\odot 1\odot 1=4$". The other is the one-stage Lax-Wendroff (L-W) type method, which is more compact but is complicated to design numerical fluxes and hard to use when applied to highly nonlinear problems. In recent years, the pair of solution element and dynamics, labeled as "$2$", are taken as the building black. The direct adoption of the dynamics implies the inherent temporal-spatial coupling. With this type of building blocks, a

发表评论 查看更多 翻译此文

收起

We consider a branching-selection particle system on the real line, introduced by Brunet and Derrida. In this model the size of the population is fixed to a constant $N$. At each step individuals in the population reproduce independently, making children around their current position. Only the $N$ rightmost children survive to reproduce at the next step. B\'erard and Gou\'er\'e studied the speed at which the cloud of individuals drifts, assuming the tails of the displacement decays at exponential rate; B\'erard and Maillard took interest in the case of heavy tail displacements. We take interest in an intermediate model, considering branching random walks in which the critical spine behaves as an $\alpha$-stable random walk.

发表评论 查看更多 翻译此文

收起

We answer the last question left open in [Z.~Ko\v{c}an, \emph{Chaos on one-dimensional compact metric spaces}, Internat. J. Bifur. Chaos Appl. Sci. Engrg. \textbf{22}, article id: 1250259 (2012)] which asks whether there is a relation between an infinite LY-scrambled set and $\omega$-chaos for dendrite maps. We construct a continuous self-map of a dendrite without an infinite LY-scrambled set but containing an uncountable $\omega$-scrambled set.

发表评论 查看更多 翻译此文

收起

Nielsen, Plotkin, and Winskel (1981) proved that every 1-safe Petri net $N$ unfolds into an event structure $\mathcal{E}_N$. By a result of Thiagarajan (1996 and 2002), these unfoldings are exactly the trace regular event structures. Thiagarajan (1996 and 2002) conjectured that regular event structures correspond exactly to trace regular event structures. In a recent paper (Chalopin and Chepoi, 2017, 2018), we disproved this conjecture, based on the striking bijection between domains of event structures, median graphs, and CAT(0) cube complexes. On the other hand, in Chalopin and Chepoi (2018) we proved that Thiagarajan's conjecture is true for regular event structures whose domains are principal filters of universal covers of (virtually) finite special cube complexes. In the current paper, we prove the converse: to any finite 1-safe Petri net $N$ one can associate a finite special cube complex ${X}_N$ such that the domain of the event structure $\mathcal{E}_N$ (obtained as the unfoldi

发表评论 查看更多 翻译此文

收起

A Comparison of Functional Data Structures on the JVM

发表评论 查看更多 翻译此文

收起

We propose a coded distributed computing scheme based on Raptor codes to address the straggler problem. In particular, we consider a scheme where each server computes intermediate values, referred to as droplets, that are either stored locally or sent over the network. Once enough droplets are collected, the computation can be completed. Compared to previous schemes in the literature, our proposed scheme achieves lower computational delay when the decoding time is taken into account.

发表评论 查看更多 翻译此文

收起

The element splitting operation on a graphic matroid, in general may not yield a cographic matroid. In this paper, we give a necessary and sufficient condition for the graphic matroid to yield cographic matroid under the element splitting operation.

发表评论 查看更多 翻译此文

收起

Consider the following problem: A multi-antenna base station (BS) sends multiple symbol streams to multiple single-antenna users via precoding. However, unlike conventional multiuser precoding, the transmitted signals are subjected to binary, unit-modulus, or even discrete unit-modulus constraints. Such constraints arise in the one-bit and constant-envelope (CE) massive MIMO scenarios, wherein high-resolution digital-to-analog converters (DACs) are replaced by one-bit DACs and phase shifters, respectively, for cutting down hardware cost and energy consumption. Multiuser precoding under one-bit and CE restrictions poses significant design difficulty. In this paper we establish a framework for designing multiuser precoding under the one-bit, continuous CE and discrete CE scenarios---all within one theme. We first formulate a precoding design that focuses on minimizations of symbol-error probabilities (SEPs), assuming quadrature amplitude modulation (QAM) constellations. We then devise an

发表评论 查看更多 翻译此文

收起

It is well-known that demand response can improve the system efficiency as well as lower consumers' (prosumers') electricity bills. However, it is not clear how we can either qualitatively identify the prosumer with the most impact potential or quantitatively estimate each prosumer's contribution to the total social welfare improvement when additional resource capacity/flexibility is introduced to the system with demand response, such as allowing net-selling behavior. In this work, we build upon existing literature on the electricity market, which consists of price-taking prosumers each with various appliances, an electric utility company and a social welfare optimizing distribution system operator, to design a general sensitivity analysis approach (GSAA) that can estimate the potential of each consumer's contribution to the social welfare when given more resource capacity. GSAA is based on existence of an efficient competitive equilibrium, which we establish in the paper. When prosume

发表评论 查看更多 翻译此文

收起

The aim of this short note is to communicate an example of a finite-dimensional Hopf algebra that does not admit a modular pair in involution in the sense of Connes and Moscovici.

发表评论 查看更多 翻译此文

收起

A novel framework is presented that combines Mean Field Game (MFG) theory and Hybrid Optimal Control (HOC) theory to obtain a unique $\epsilon$-Nash equilibrium for a non-cooperative game with stopping times. We consider the case where there exists one major agent with a significant influence on the system together with a large number of minor agents constituting two subpopulations, each with individually asymptotically negligible effect on the whole system. Each agent has stochastic linear dynamics with quadratic costs, and the agents are coupled in their dynamics by the average state of minor agents (i.e. the empirical mean field). The hybrid feature enters via the indexing by discrete states: (i) the switching of the major agent between alternative dynamics or (ii) the termination of the agents' trajectories in one or both of the subpopulations of minor agents. Optimal switchings and stopping time strategies together with best response control actions for, respectively, the major ag

发表评论 查看更多 翻译此文

收起