arXiv subjects

Fu Liu

Publications and source records attributed to Fu Liu.

72 records · Page 4Linked to original sources

arXiv2014

Severi degrees on toric surfaces

Ardila and Block used tropical results of Brugalle and Mikhalkin to count nodal curves on a certain family of toric surfaces. Building on a linearity result of the first author, we revisit their work in the context of the Goettsche-Yau-Zaslow formula for counting nodal curves on arbitrary smooth surfaces, addressing several questions they raised by proving stronger versions of their main theorems. In the process, we give new combinatorial formulas for the coefficients arising in the Goettsche-Yau-Zaslow formulas, and give correction terms arising from rational double points in the relevant family of toric surfaces.

math.AG↗

arXiv2014

A combinatorial analysis of Severi degrees

Based on results by Brugallé and Mikhalkin, Fomin and Mikhalkin give formulas for computing classical Severi degrees $N^{d, δ}$ using long-edge graphs. In 2012, Block, Colley and Kennedy considered the logarithmic version of a special function associated to long-edge graphs appeared in Fomin-Mikhalkin's formula, and conjectured it to be linear. They have since proved their conjecture. At the same time, motivated by their conjecture, we consider a special multivariate function associated to long-edge graphs that generalizes their function. The main result of this paper is that the multivariate function we define is always linear. A special case of our result gives an independent proof of Block-Colley-Kennedy's conjecture. The first application of our linearity result is that by applying it to classical Severi degrees, we recover quadraticity of $Q^{d, δ}$ and a bound $δ$ for the threshold of polynomiality of $N^{d, δ}.$ Next, in joint work with Osserman, we apply the linearity result to a special family of toric surfaces and obtain universal polynomial results having connections to the Göttsche-Yau-Zaslow formula. As a result, we provide combinatorial formulas for the two unidentified power series $B_1(q)$ and $B_2(q)$ appearing in the Göttsche-Yau-Zaslow formula. The proof of our linearity result is completely combinatorial. We define $τ$-graphs which generalize long-edge graphs, and a closely related family of combinatorial objects we call $(τ, n)$-words. By introducing height functions and a concept of irreducibility, we describe ways to decompose certain families of $(τ, n)$-words into irreducible words, which leads to the desired results.

math.CO↗

arXiv2013

Factorizations of cycles and multi-noded rooted trees

In this paper, we study factorizations of cycles. The main result is that under certain condition, the number of ways to factor a $d$-cycle into a product of cycles of prescribed lengths is $d^{r-2}.$ To prove our result, we first define a new class of combinatorial objects, multi-noded rooted trees, which generalize rooted trees. We find the cardinality of this new class which with proper parameters is exactly $d^{r-2}.$ The main part of this paper is the proof that there is a bijection from factorizations of a $d$-cycle to multi-noded rooted trees via factorization graphs. This implies the desired formula. The factorization problem we consider has its origin in geometry, and is related to the study of a special family of Hurwitz numbers: pure-cycle Hurwitz numbers. Via the standard translation of Hurwitz numbers into group theory, our main result is equivalent to the following: when the genus is $0$ and one of the ramification indices is $d,$ the degree of the covers, the pure-cycle Hurwitz number is $d^{r-3},$ where $r$ is the number of branch points.

math.CO↗

arXiv2013

The Lecture Hall Parallelepiped

The s-lecture hall polytopes P_s are a class of integer polytopes defined by Savage and Schuster which are closely related to the lecture hall partitions of Eriksson and Bousquet-Mélou. We define a half-open parallelopiped Par_s associated with P_s and give a simple description of its integer points. We use this description to recover earlier results of Savage et al. on the δ-vector (or h^*-vector) and to obtain the connections to s-ascents and s-descents, as well as some generalizations of these results.

math.CO↗

arXiv2013

Interference Induced Asymmetric Transmission Through A Monolayer of Anisotropic Chiral Metamolecules

We show that asymmetric transmission for linear polarizations can be easily achieved by a monolayer of anisotropic chiral metamolecules through the constructive and destructive interferences between the contributions from anisotropy and chirality. Our analysis is based on the interaction of electromagnetic waves with the constituent electric and magnetic dipoles of the metamaterials, and an effective medium formulation. In addition, asymmetric transmission in amplitude can be effectively controlled by the interference between spectrally detuned resonances. Our findings shed light on the design of metamaterials for achieving strong asymmetric transmission.

physics.optics↗

arXiv2013

Perturbation of transportation polytopes

We describe a perturbation method that can be used to reduce the problem of finding the multivariate generating function (MGF) of a non-simple polytope to computing the MGF of simple polytopes. We then construct a perturbation that works for any transportation polytope. We apply this perturbation to the family of central transportation polytopes of order kn x n, and obtain formulas for the MGFs of the feasible cone of each vertex of the polytope and the MGF of the polytope. The formulas we obtain are enumerated by combinatorial objects. A special case of the formulas recovers the results on Birkhoff polytopes given by the author and De Loera and Yoshida. We also recover the formula for the number of maximum vertices of transportation polytopes of order kn x n.

math.CO↗

arXiv2013

Effective spontaneous PT-symmetry breaking in hybridized metamaterials

We show that metamaterials can be used as a testing ground to investigate spontaneous symmetry breaking associated with non-Hermitian quantum systems. By exploring the interplay between near-field dipolar coupling and material absorption or gain, we demonstrate various spontaneous breaking processes of the $\mathcal{PT}$-symmetry for a series of effective Hamiltonians associated to the scattering matrix. By tuning the coupling parameter, coherent perfect absorption, laser action and gain-induced complete reflection ($π$ reflector) by using an ultra-thin metamaterial can be obtained. Moreover, an ideal $\mathcal{PT}$-symmetry can be established effectively in a passive system by exploring the balance between scattering and absorption loss using metamaterials.

physics.optics↗

arXiv2012

Space-coiling metamaterials with double negativity and conical dispersion

Metamaterials are effectively homogeneous materials that display extraordinary dispersion. Negative index metamaterials, zero index metamaterials and extremely anisotropic metamaterials are just a few examples. Instead of using locally resonating elements that may cause undesirable absorption, there are huge efforts to seek alternative routes to obtain these unusual properties. Here, we experimentally demonstrate an alternative approach for constructing metamaterials with extreme dispersion by simply coiling up space with curled channels. Such a geometric approach has the advantage that the ratio between the wavelength and the lattice constant in achieving a negative or zero index is easily tunable. It allows us to construct for the first time an acoustic metamaterial with conical dispersion, leading to a clear demonstration of negative refraction from an acoustic metamaterial with airborne sound. We also design and realize a double-negative metamaterial for microwaves under the same principle.

cond-mat.mtrl-sci↗

arXiv2009

Higher integrality conditions, volumes and Ehrhart polynomials

A polytope is integral if all of its vertices are lattice points. The constant term of the Ehrhart polynomial of an integral polytope is known to be 1. In previous work, we showed that the coefficients of the Ehrhart polynomial of a lattice-face polytope are volumes of projections of the polytope. We generalize both results by introducing a notion of $k$-integral polytopes, where 0-integral is equivalent to integral. We show that the Ehrhart polynomial of a $k$-integral polytope $P$ has the properties that the coefficients in degrees less than or equal to $k$ are determined by a projection of $P$, and the coefficients in higher degrees are determined by slices of $P$. A key step of the proof is that under certain generality conditions, the volume of a polytope is equal to the sum of volumes of slices of the polytope.

math.CO↗

arXiv2009

Moduli of Crude Limit Linear Series

Eisenbud and Harris introduced the theory of limit linear series, and constructed a space parametrizing their limit linear series. Recently, Osserman introduced a new space which compactifies the Eisenbud-Harris construction. In the Eisenbud-Harris space, the set of refined limit linear series is always dense on a general reducible curve. Osserman asks when the same is true for his space. In this paper, we answer his question by characterizing the situations when the crude limit linear series contain an open subset of his space.

math.AG↗

arXiv2008

A note on lattice-face polytopes and their Ehrhart polynomials

We give a new definition of lattice-face polytopes by removing an unnecessary restriction in the paper "Ehrhart polynomials of lattice-face polytopes", and show that with the new definition, the Ehrhart polynomial of a lattice-face polytope still has the property that each coefficient is the normalized volume of a projection of the original polytope. Furthermore, we show that the new family of lattice-face polytopes contains all possible combinatorial types of rational polytopes.

math.CO↗

arXiv2008

A Generating Function for all Semi-Magic Squares and the Volume of the Birkhoff Polytope

We present a multivariate generating function for all n x n nonnegative integral matrices with all row and column sums equal to a positive integer t, the so called semi-magic squares. As a consequence we obtain formulas for all coefficients of the Ehrhart polynomial of the polytope B_n of n x n doubly-stochastic matrices, also known as the Birkhoff polytope. In particular we derive formulas for the volumes of B_n and any of its faces.

math.CO↗

arXiv2008

Combinatorial bases for multilinear parts of free algebras with double compatible brackets

Let X be an ordered alphabet. Lie_2(n) (and P_2(n) respectively) are the multilinear parts of the free Lie algebra (and the free Poisson algebra respectively) on X with a pair of compatible Lie brackets. In this paper, we prove the dimension formulas for these two algebras conjectured by B. Feigin by constructing bases for Lie_2(n) (and P_2(n)) from combinatorial objects. We also define a complementary space Eil_2(n) to Lie_2(n), give a pairing between Lie_2(n) and Eil_2(n), and show that the pairing is perfect.

math.CO↗

arXiv2006

The irreducibility of certain pure-cycle Hurwitz spaces

We study "pure-cycle" Hurwitz spaces, parametrizing covers of the projective line having only one ramified point over each branch point. We start with the case of genus-0 covers, using a combination of limit linear series theory and group theory to show that these spaces are always irreducible. In the case of four branch points, we also compute the associated Hurwitz numbers. Finally, we give a conditional result in the higher-genus case, requiring at least 3g simply branched points. These results have equivalent formulations in group theory, and in this setting complement results of Conway-Fried-Parker-Volklein.

math.AG↗

arXiv2005

Ehrhart polynomials of lattice-face polytopes

There is a simple formula for the Ehrhart polynomial of a cyclic polytope. The purpose of this paper is to show that the same formula holds for a more general class of polytopes, lattice-face polytopes. We develop a way of decomposing any d-dimensional simplex in general position into d! signed sets, each of which corresponds to a permutation in the symmetric group, and reduce the problem of counting lattice points in a polytope in general position to that of counting lattice points in these special signed sets. Applying this decomposition to a lattice-face simplex, we obtain signed sets with special properties that allow us to count the number of lattice points inside them. We are thus able to conclude the desired formula for the Ehrhart polynomials of lattice-face polytopes.

math.CO↗

arXiv2005

Hook length polynomials for plane forests of a certain type

The original motivation for study for hook length polynomials was to find a combinatorial proof for a hook length formula for binary trees given by Postnikov, as well as a proof for a hook length polynomial formula conjectured by Lascoux. In this paper, we define the hook length polynomial for plane forests of a given degree sequence type and show it can be factored into a product of linear forms. Some other enumerative results on forests are also given.

math.CO↗

arXiv2005

(k,m)-Catalan Numbers and Hook Length Polynomials for Plane Trees

Motivated by a formula of A. Postnikov relating binary trees, we define the hook length polynomials for m-ary trees and plane forests, and show that these polynomials have a simple binomial expression. An integer value of this expression is C_{k,m}(n)=\frac{1}{mn+1}{(mn+1)k \choose n}, which we call the (k,m)-Catalan number. For proving the hook length formulas, we also introduce a combinatorial family, (k,m)-ary trees, which are counted by the (k,m)-Catalan numbers.

math.CO↗

arXiv2004

Ehrhart polynomials of cyclic polytopes

The Ehrhart polynomial of an integral convex polytope counts the number of lattice points in dilates of the polytope. In math.CO/0402148, the authors conjectured that for any cyclic polytope with integral parameters, the Ehrhart polynomial of it is equal to its volume plus the Ehrhart polynomial of its lower envelope and proved the case when the dimension d = 2. In our article, we prove the conjecture for any dimension.

math.CO↗