English
Related papers

Related papers: On Using Expansions to the Base of -2

200 papers

Lipschitz extensions were recently proposed as a tool for designing node differentially private algorithms. However, efficiently computable Lipschitz extensions were known only for 1-dimensional functions (that is, functions that output a…

Cryptography and Security · Computer Science 2015-04-30 Sofya Raskhodnikova , Adam Smith

By the early 1960's advances in statistical physics had established the existence of universality classes for systems with second-order phase transitions and characterized these by critical exponents which are different to the classical…

Statistical Mechanics · Physics 2017-08-23 Ralph Kenna

Recently, there has been great interest in the application of composition laws to problems in enumerative geometry. Using the moduli space of stable maps, we compute the number of irreducible, reduced, nodal, degree-$d$ genus-$2$ plane…

alg-geom · Mathematics 2008-02-03 Sheldon Katz , Zhenbo Qin , Yongbin Ruan

The probabilistic learning on manifolds (PLoM) introduced in 2016 has solved difficult supervised problems for the ``small data'' limit where the number N of points in the training set is small. Many extensions have since been proposed,…

Methodology · Statistics 2021-02-23 Christian Soize , Roger Ghanem

This paper is concerned with difference equations on elliptic curves. We establish some general properties of the difference Galois groups of equations of order two, and give applications to the calculation of some difference Galois groups.…

Complex Variables · Mathematics 2015-01-14 Thomas Dreyfus , Julien Roques

The efficacy of using complex numbers for understanding geometric questions related to polar equations and general cycloids is demonstrated.

History and Overview · Mathematics 2012-11-02 H. Azad , A. Laradji , M. T. Mustafa

In the past 20 years, compactifications of the families of curves in algebraic varieties X have been studied via stable maps, Hilbert schemes, stable pairs, unramified maps, and stable quotients. Each path leads to a different enumeration…

Algebraic Geometry · Mathematics 2016-05-10 R. Pandharipande , R. P. Thomas

Convexification techniques have gained increasing interest over the past decades. In this work, we apply a recently developed convexification technique for fractional programs by He, Liu and Tawarmalani (2024) to the problem of determining…

Optimization and Control · Mathematics 2024-10-04 Timotej Hrga , Melanie Siebenhofer , Angelika Wiegele

We introduce a new concept, which we call partition expanders. The basic idea is to study quantitative properties of graphs in a slightly different way than it is in the standard definition of expanders. While in the definition of expanders…

Computational Complexity · Computer Science 2022-03-30 Dmytro Gavinsky , Pavel Pudlák

We consider the problem of testing small set expansion for general graphs. A graph $G$ is a $(k,\phi)$-expander if every subset of volume at most $k$ has conductance at least $\phi$. Small set expansion has recently received significant…

Data Structures and Algorithms · Computer Science 2015-01-06 Angsheng Li , Pan Peng

Recently, a number of variants of the notion of cut-preserving hypergraph sparsification have been studied in the literature. These variants include directed hypergraph sparsification, submodular hypergraph sparsification, general notions…

Data Structures and Algorithms · Computer Science 2024-02-21 Sanjeev Khanna , Aaron L. Putterman , Madhu Sudan

The general method of graph coarsening or graph reduction has been a remarkably useful and ubiquitous tool in scientific computing and it is now just starting to have a similar impact in machine learning. The goal of this paper is to take a…

Machine Learning · Computer Science 2021-06-23 Jie Chen , Yousef Saad , Zechen Zhang

The development of cubical type theory inspired the idea of "extension types" which has been found to have applications in other type theories that are unrelated to homotopy type theory or cubical type theory. This article describes these…

Programming Languages · Computer Science 2024-02-08 Tesla Zhang

Let $\gamma_0$ be a curve on a surface $\Sigma$ of genus $g$ and with $r$ boundary components and let $\pi_1(\Sigma)\curvearrowright X$ be a discrete and cocompact action on some metric space. We study the asymptotic behavior of the number…

Geometric Topology · Mathematics 2016-12-23 Viveka Erlandsson , Hugo Parlier , Juan Souto

Parallel addition, i.e., addition with limited carry propagation, has been so far studied for complex bases and integer alphabets. We focus on alphabets consisting of integer combinations of powers of the base. We give necessary conditions…

Number Theory · Mathematics 2018-11-27 Jan Legerský

The elliptic curve method (ECM) is one of the best factorization methods available. It is possible to use hyperelliptic curves instead of elliptic curves but it is in theory slower. We use special hyperelliptic curves and Kummer surfaces to…

Number Theory · Mathematics 2015-05-13 Romain Cosset

This paper deals with the problem of increasing the minimum distance of a linear code by adding one or more columns to the generator matrix. Several methods to compute extensions of linear codes are presented. Many codes improving the…

Information Theory · Computer Science 2011-03-31 Markus Grassl

Adaptive dimensionality reduction in high-dimensional problems is a key topic in statistics. The multiplicative gamma process takes a relevant step in this direction, but improved studies on its properties are required to ease…

Methodology · Statistics 2018-09-11 Daniele Durante

Since 1870s, scientists have been taking deep insight into Lie groups and Lie algebras. With the development of Lie theory, Lie groups have got profound significance in many branches of mathematics and physics. In Lie theory, exponential…

Cryptography and Security · Computer Science 2016-06-13 Haibo Hong , Licheng Wang , Jun Shao , Haseeb Ahmad , Yixian Yang

We introduce grading on certain finite dimensional simple Lie superalgebras of type $P(t)$ by elementary abelian 2-group. This grading gives rise to Pauli matrices and is a far generalization of $(\mathbb Z_2\times \mathbb Z_2)$-grading on…

Rings and Algebras · Mathematics 2017-01-25 Dušan D. Repovš , Mikhail V. Zaicev
‹ Prev 1 8 9 10 Next ›