arXiv subjects

Nan Li

Publications and source records attributed to Nan Li.

At least 397 records · Page 22Linked to original sources

arXiv2011

AIG Rewriting Using 5-Input Cuts

Rewriting is a common approach to logic optimization based on local transformations. Most commercially available logic synthesis tools include a rewriting engine that may be used multiple times on the same netlist during optimization. This paper presents an And-Inverter graph based rewriting algorithm using 5-input cuts. The best circuits are pre-computed for a subset of NPN classes of 5-variable functions. Cut enumeration and Boolean matching are used to identify replacement candidates. The presented approach is expected to complement existing rewriting approaches which are usually based on 4-input cuts. The experimental results show that, by adding the new rewriting algorithm to ABC synthesis tool, we can further reduce the area of heavily optimized large circuits by 5.57% on average.

cs.LO↗

arXiv2011

Hermite normal forms and $δ$-vector

Let $δ(\Pc) = (δ_0, δ_1,..., δ_d)$ be the $δ$-vector of an integral polytope $\Pc \subset \RR^N$ of dimension $d$. Following the previous work of characterizing the $δ$-vectors with $\sum_{i=0}^d δ_i \leq 3$, the possible $δ$-vectors with $\sum_{i=0}^d δ_i = 4$ will be classified. And each possible $δ$-vectors can be obtained by simplices. We get this result by studying the problem of classifying the possible integral simplices with a given $δ$-vector $(δ_0, δ_1,..., δ_d)$, where $\sum_{i=0}^d δ_i \leq 4$, by means of Hermite normal forms of square matrices.

math.CO↗

arXiv2011

External zonotopal algebra

We provide a general, unified, framework for external zonotopal algebra. The approach is critically based on employing simultaneously the two dual algebraic constructs and invokes the underlying matroidal and geometric structures in an essential way. This general theory makes zonotopal algebra an applicable tool for a larger class of polytopes.

math.AC↗

arXiv2011

Computing Isolated Singular Solutions of Polynomial Systems: Case of Breadth One

We present a symbolic-numeric method to refine an approximate isolated singular solution $\hat{\mathbf{x}}=(\hat{x}_{1}, ..., \hat{x}_{n})$ of a polynomial system $F=\{f_1, ..., f_n\}$ when the Jacobian matrix of $F$ evaluated at $\hat{\mathbf{x}}$ has corank one approximately. Our new approach is based on the regularized Newton iteration and the computation of approximate Max Noether conditions satisfied at the approximate singular solution. The size of matrices involved in our algorithm is bounded by $n \times n$. The algorithm converges quadratically if $\hat{\xx}$ is close to the isolated exact singular solution.

math.NA↗

arXiv2010

Relative information entropy of an inhomogeneous universe

In the context of averaging an inhomogeneous cosmological model, we propose a natural measure identical to the Kullback-Leibler relative information entropy, which expresses the distinguishability of the local inhomogeneous density field from its spatial average on arbitrary compact domains. This measure is expected to be an increasing function in time and thus to play a significant role in studying gravitational entropy. To verify this conjecture, we explore the time evolution of the measure using the linear perturbation theory of a spatially flat FLRW model and a spherically symmetric nonlinear solution. We discuss the generality and conditions for the time-increasing nature of the measure, and also the connection to the backreaction effect caused by inhomogeneities.

gr-qc↗

arXiv2010

Generalized Ehrhart polynomials

Let $P$ be a polytope with rational vertices. A classical theorem of Ehrhart states that the number of lattice points in the dilations $P(n) = nP$ is a quasi-polynomial in $n$. We generalize this theorem by allowing the vertices of P(n) to be arbitrary rational functions in $n$. In this case we prove that the number of lattice points in P(n) is a quasi-polynomial for $n$ sufficiently large. Our work was motivated by a conjecture of Ehrhart on the number of solutions to parametrized linear Diophantine equations whose coefficients are polynomials in $n$, and we explain how these two problems are related.

math.CO↗

arXiv2010

Learning Probabilistic Hierarchical Task Networks to Capture User Preferences

We propose automatically learning probabilistic Hierarchical Task Networks (pHTNs) in order to capture a user's preferences on plans, by observing only the user's behavior. HTNs are a common choice of representation for a variety of purposes in planning, including work on learning in planning. Our contributions are (a) learning structure and (b) representing preferences. In contrast, prior work employing HTNs considers learning method preconditions (instead of structure) and representing domain physics or search control knowledge (rather than preferences). Initially we will assume that the observed distribution of plans is an accurate representation of user preference, and then generalize to the situation where feasibility constraints frequently prevent the execution of preferred plans. In order to learn a distribution on plans we adapt an Expectation-Maximization (EM) technique from the discipline of (probabilistic) grammar induction, taking the perspective of task reductions as productions in a context-free grammar over primitive actions. To account for the difference between the distributions of possible and preferred plans we subsequently modify this core EM technique, in short, by rescaling its input.

cs.AI↗

arXiv2009

Cusp-core problem and strong gravitational lensing

Cosmological numerical simulations of galaxy formation have led to the cuspy density profile of a pure cold dark matter halo toward the center, which is in sharp contradiction with the observations of the rotation curves of cold dark matter-dominated dwarf and low surface brightness disk galaxies, with the latter tending to favor mass profiles with a flat central core. Many efforts have been devoted to resolve this cusp-core problem in recent years, among them, baryon-cold dark matter interactions are considered to be the main physical mechanisms erasing the cold dark matter (CDM) cusp into a flat core in the centers of all CDM halos. Clearly, baryon-cold dark matter interactions are not customized only for CDM-dominated disk galaxies, but for all types, including giant ellipticals. We first fit the most recent high resolution observations of rotation curves with the Burkert profile, then use the constrained core size-halo mass relation to calculate the lensing frequency, and compare the predicted results with strong lensing observations. Unfortunately, it turns out that the core size constrained from rotation curves of disk galaxies cannot be extrapolated to giant ellipticals. We conclude that, in the standard cosmological paradigm, baryon-cold dark matter interactions are not universal mechanisms for galaxy formation, and therefore, they cannot be true solutions to the cusp-core problem.

astro-ph.CO↗

arXiv2008

Scale dependence of cosmological backreaction

Due to the non-commutation of spatial averaging and temporal evolution, inhomogeneities and anisotropies (cosmic structures) influence the evolution of the averaged Universe via the cosmological backreaction mechanism. We study the backreaction effect as a function of averaging scale in a perturbative approach up to higher orders. We calculate the hierarchy of the critical scales, at which 10% effects show up from averaging at different orders. The dominant contribution comes from the averaged spatial curvature, observable up to scales of 200 Mpc. The cosmic variance of the local Hubble rate is 10% (5%) for spherical regions of radius 40 (60) Mpc. We compare our result to the one from Newtonian cosmology and Hubble Space Telescope Key Project data.

astro-ph↗

arXiv2008

Is dark energy an effect of averaging?

The present standard model of cosmology states that the known particles carry only a tiny fraction of total mass and energy of the Universe. Rather, unknown dark matter and dark energy are the dominant contributions to the cosmic energy budget. We review the logic that leads to the postulated dark energy and present an alternative point of view, in which the puzzle may be solved by properly taking into account the influence of cosmic structures on global observables. We illustrate the effect of averaging on the measurement of the Hubble constant.

astro-ph↗

arXiv2007

On a Conjecture about the Number of Solutions to Linear Diophantine Equations with a Positive Integer Parameter

Let A(n) be a $k\times s$ matrix and $m(n)$ be a $k$ dimensional vector, where all entries of A(n) and $m(n)$ are integer-valued polynomials in $n$. Suppose that $$t(m(n)|A(n))=#\{x\in\mathbb{Z}_{+}^{s}\mid A(n)x=m(n)\}$$ is finite for each $n\in \mathbb{N}$, where $Z_+$ is the set of nonnegative integers. This paper conjectures that $t(m(n)|A(n))$ is an integer-valued quasi-polynomial in $n$ for $n$ sufficiently large and verifies the conjecture in several cases.

math.CO↗

arXiv2007

On Popoviciu type tormulas for generalized restricted partition function

Suppose that $a_1(n),a_2(n),...,a_s(n),m(n)$ are integer-valued polynomials in $n$ with positive leading coefficients. This paper presents Popoviciu type formulas for the generalized restricted partition function $$p_{A(n)}(m(n)):=#\{(x_1,...,x_s)\in \mathbb{Z}^{s}: all x_j\geqslant 0, x_1a_1(n)+...+x_sa_s(n)=m(n) \}$$ when $s=2$ or 3. In either case, the formula implies that the function is an integer-valued quasi-polynomial. The main result is proved by a reciprocity law for a class of fractional part sums and the theory of generalized Euclidean division.

math.NT↗

arXiv2007

On the Ring of Integer-valued Quasi-polynomials

The paper studies some properties of the ring of integer-valued quasi-polynomials. On this ring, theory of generalized Euclidean division and generalized GCD are presented. Applications to finite simple continued fraction expansion and Smith normal form of integral matrices with integer parameters are also given.

math.NT↗

arXiv2007

On the onset of cosmological backreaction

Cosmological backreaction has been suggested as an explanation of dark energy and is heavily disputed since. We combine cosmological perturbation theory with Buchert's non-perturbative framework, calculate the relevant averaged observables up to second order in the comoving synchronous gauge, and discuss their gauge dependence. With the help of an integrability condition the leading second order contributions follow from the first order calculation. We focus on the onset of cosmological backreaction, as a perturbative treatment is necessarily restricted to the era when the effect is still small. We demonstrate that the leading contributions to all averaged physical observables are completely specified on the boundary of the averaged domain. For any finite domain these surface terms are nonzero in general and thus backreaction is for real. We map the backreaction effect on an effectively homogeneous and isotropic fluid. The generic effective equation of state is not only time dependent, but also depends on scale.

gr-qc↗

arXiv2006

Energy scale independence of Koide's relation for quark and lepton masses

Koide's mass relation of charged leptons has been extended to quarks and neutrinos, and we prove here that this relation is independent of energy scale in a huge energy range from $1 {GeV}$ to $2\times10^{16} {GeV}$. By using the parameters $k_u$, $k_d$ and $k_ν$ to describe the deviations of quarks and neutrinos from the exact Koide's relation, we also check the quark-lepton complementarity of masses such as $k_{l}+k_{d} \approx k_ν+k_{u} \approx 2$, and show that it is also independent (or insensitive) of energy scale.

hep-ph↗

arXiv2005

Relations between quark and lepton mixing angles and matrices

We discuss the relations between the mixing angles and the mixing matrices of quarks and leptons. With Raidal's numerical relations, we parametrize the lepton mixing (PMNS) matrix with the parameters of the quark mixing (CKM) matrix, and calculate the products of $V_{\mathrm{CKM}}U_{\mathrm{PMNS}}$ and $U_{\mathrm{PMNS}}V_{\mathrm{CKM}}$. Also, under the conjectures $V_{\mathrm{CKM}}U_{\mathrm{PMNS}}=U_{\mathrm{bimax}}$ or $U_{\mathrm{PMNS}}V_{\mathrm{CKM}}=U_{\mathrm{bimax}}$, we get the PMNS matrix naturally, and test Raidal's relations in these two different versions. The similarities and the differences between the different versions are discussed in detail.

hep-ph↗

arXiv2005

Estimate of neutrino masses from Koide's relation

We apply Koide's mass relation of charged leptons to neutrinos and quarks, with both the normal and inverted mass schemes of neutrinos discussed. We introduce the parameters $k_ν$, $k_u$ and $k_d$ to describe the deviations of neutrinos and quarks from Koide's relation, and suggest a quark-lepton complementarity of masses such as $ k_{l}+k_{d} \approx k_ν+k_{u} \approx 2$. The masses of neutrinos are determined from the improved relation, and they are strongly hierarchical (with the different orders of magnitude of $10^{-5} eV$, $10^{-3} eV$, and $10^{-2} eV$).

hep-ph↗

arXiv2005

Unified Parametrization of Quark and Lepton Mixing Matrices

We present a unified parametrization of quark and lepton mixing matrices. By using some simple relations between the mixing angles of quarks and leptons, i.e., the quark-lepton complementarity, we parametrize the lepton mixing matrix with the Wolfenstein parameters $λ$ and $A$ of the quark mixing matrix. It is shown that the Wolfenstein parameter $λ$ can measure both the deviation of the quark mixing matrix from the unit matrix, and the deviation of the lepton mixing matrix from the exactly bimaximal mixing pattern.

hep-ph↗